%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : CSR105+4 : TPTP v9.3.1. Bugfixed v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n006.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 12:16:55 PM UTC 2026
% Result : Theorem 24.98s 5.02s
% Output : CNFRefutation 24.98s
% Verified :
% SZS Type : Refutation
% Derivation depth : 19
% Number of leaves : 7
% Syntax : Number of formulae : 43 ( 15 unt; 0 def)
% Number of atoms : 155 ( 25 equ)
% Maximal formula atoms : 45 ( 3 avg)
% Number of connectives : 179 ( 67 ~; 75 |; 26 &)
% ( 3 <=>; 8 =>; 0 <=; 0 <~>)
% Maximal formula depth : 24 ( 4 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 6 ( 4 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 6 con; 0-3 aty)
% Number of variables : 83 ( 26 sgn 33 !; 1 ?)
% Comments :
%------------------------------------------------------------------------------
fof(prove_from_SUMO,conjecture,
s__overlapsTemporally(s__TimeInterval36_1,s__TimeInterval36_2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_from_SUMO) ).
fof(kb_SUMO_3496,axiom,
! [X171,X172,X173] :
( X172 = s__UnionFn(X173,X171)
<=> ! [X174,X175,X176] :
( ( s__instance(X171,s__SetOrClass)
& s__instance(X172,s__SetOrClass)
& s__instance(X173,s__SetOrClass) )
=> ( ( s__instance(X176,X172)
& s__instance(X175,X171)
& s__instance(X174,X173) )
=> ( ( s__instance(X176,X171)
| s__instance(X176,X173) )
& s__instance(X175,X172)
& s__instance(X174,X172) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR003+0.ax',kb_SUMO_3496) ).
fof(kb_SUMO_982,axiom,
! [X48] :
( s__instance(X48,s__TimeInterval)
=> s__overlapsTemporally(X48,X48) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR003+0.ax',kb_SUMO_982) ).
fof(kb_SUMO_3533,axiom,
! [X168] :
( s__instance(X168,s__SetOrClass)
=> ( s__instance(X168,s__NullSet)
=> ~ ? [X48] : s__instance(X48,X168) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR003+0.ax',kb_SUMO_3533) ).
fof(local_1,axiom,
s__instance(s__TimeInterval36_1,s__TimeInterval),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',local_1) ).
fof(kb_SUMO_276,axiom,
! [X9,X10] :
( s__disjoint(X9,X10)
<=> ! [X48] :
( ( s__instance(X9,s__SetOrClass)
& s__instance(X10,s__SetOrClass) )
=> ~ ( s__instance(X48,X10)
& s__instance(X48,X9) ) ) ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR003+0.ax',kb_SUMO_276) ).
fof(kb_SUMO_3489,axiom,
! [X169,X170] :
( ! [X49] :
( ( s__instance(X169,s__Set)
& s__instance(X170,s__Set) )
=> ( s__element(X49,X170)
<=> s__element(X49,X169) ) )
=> X170 = X169 ),
file('/export/starexec/sandbox2/benchmark/Axioms/CSR003+0.ax',kb_SUMO_3489) ).
fof(c_0_7,negated_conjecture,
~ s__overlapsTemporally(s__TimeInterval36_1,s__TimeInterval36_2),
inference(assume_negation,[status(cth)],[prove_from_SUMO]) ).
fof(c_0_8,negated_conjecture,
~ s__overlapsTemporally(s__TimeInterval36_1,s__TimeInterval36_2),
inference(fof_simplification,[status(thm)],[c_0_7]) ).
fof(c_0_9,negated_conjecture,
~ s__overlapsTemporally(s__TimeInterval36_1,s__TimeInterval36_2),
inference(fof_nnf,[status(thm)],[c_0_8]) ).
fof(c_0_10,plain,
! [X6422,X6423,X6424,X6425,X6426,X6427,X6428,X6429,X6430] :
( ( X6429 = s__UnionFn(X6430,X6428)
| ~ s__instance(esk159_3(X6428,X6429,X6430),X6429)
| ~ s__instance(esk158_3(X6428,X6429,X6430),X6429)
| ~ s__instance(esk160_3(X6428,X6429,X6430),X6428) )
& ( X6429 = s__UnionFn(X6430,X6428)
| ~ s__instance(esk159_3(X6428,X6429,X6430),X6429)
| ~ s__instance(esk158_3(X6428,X6429,X6430),X6429)
| ~ s__instance(esk160_3(X6428,X6429,X6430),X6430) )
& ( X6429 = s__UnionFn(X6430,X6428)
| s__instance(esk160_3(X6428,X6429,X6430),X6429) )
& ( X6429 = s__UnionFn(X6430,X6428)
| s__instance(esk159_3(X6428,X6429,X6430),X6428) )
& ( X6429 = s__UnionFn(X6430,X6428)
| s__instance(esk158_3(X6428,X6429,X6430),X6430) )
& ( X6429 = s__UnionFn(X6430,X6428)
| s__instance(X6428,s__SetOrClass) )
& ( X6429 = s__UnionFn(X6430,X6428)
| s__instance(X6429,s__SetOrClass) )
& ( X6429 = s__UnionFn(X6430,X6428)
| s__instance(X6430,s__SetOrClass) )
& ( X6423 != s__UnionFn(X6424,X6422)
| ~ s__instance(X6422,s__SetOrClass)
| ~ s__instance(X6423,s__SetOrClass)
| ~ s__instance(X6424,s__SetOrClass)
| ~ s__instance(X6427,X6423)
| ~ s__instance(X6426,X6422)
| ~ s__instance(X6425,X6424)
| s__instance(X6427,X6422)
| s__instance(X6427,X6424) )
& ( X6423 != s__UnionFn(X6424,X6422)
| ~ s__instance(X6422,s__SetOrClass)
| ~ s__instance(X6423,s__SetOrClass)
| ~ s__instance(X6424,s__SetOrClass)
| ~ s__instance(X6427,X6423)
| ~ s__instance(X6426,X6422)
| ~ s__instance(X6425,X6424)
| s__instance(X6426,X6423) )
& ( X6423 != s__UnionFn(X6424,X6422)
| ~ s__instance(X6422,s__SetOrClass)
| ~ s__instance(X6423,s__SetOrClass)
| ~ s__instance(X6424,s__SetOrClass)
| ~ s__instance(X6427,X6423)
| ~ s__instance(X6426,X6422)
| ~ s__instance(X6425,X6424)
| s__instance(X6425,X6423) ) ),
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)],[kb_SUMO_3496])])])])])])]) ).
cnf(c_0_11,negated_conjecture,
~ s__overlapsTemporally(s__TimeInterval36_1,s__TimeInterval36_2),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
cnf(c_0_12,plain,
( X2 = s__UnionFn(X3,X1)
| s__instance(X1,s__SetOrClass) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_13,negated_conjecture,
( ~ s__overlapsTemporally(s__TimeInterval36_1,s__UnionFn(X2,X1))
| s__instance(X1,s__SetOrClass) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
fof(c_0_14,plain,
! [X2559] :
( s__overlapsTemporally(X2559,X2559)
| ~ s__instance(X2559,s__TimeInterval) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_982])])]) ).
fof(c_0_15,plain,
! [X6434,X6435] :
( ~ s__instance(X6435,X6434)
| ~ s__instance(X6434,s__NullSet)
| ~ s__instance(X6434,s__SetOrClass) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_3533])])])]) ).
cnf(c_0_16,negated_conjecture,
( ~ s__overlapsTemporally(s__TimeInterval36_1,X2)
| s__instance(X1,s__SetOrClass) ),
inference(spm,[status(thm)],[c_0_13,c_0_12]) ).
cnf(c_0_17,plain,
( ~ s__instance(X1,s__TimeInterval)
| s__overlapsTemporally(X1,X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_18,plain,
s__instance(s__TimeInterval36_1,s__TimeInterval),
inference(split_conjunct,[status(thm)],[local_1]) ).
cnf(c_0_19,plain,
( ~ s__instance(X2,X1)
| ~ s__instance(X1,s__NullSet)
| ~ s__instance(X1,s__SetOrClass) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_20,negated_conjecture,
s__instance(X1,s__SetOrClass),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_18])]) ).
fof(c_0_21,plain,
! [X1512,X1513,X1514,X1515,X1516] :
( ( s__disjoint(X1515,X1516)
| s__instance(esk1_2(X1515,X1516),X1516) )
& ( s__disjoint(X1515,X1516)
| s__instance(esk1_2(X1515,X1516),X1515) )
& ( s__disjoint(X1515,X1516)
| s__instance(X1515,s__SetOrClass) )
& ( s__disjoint(X1515,X1516)
| s__instance(X1516,s__SetOrClass) )
& ( ~ s__instance(X1514,X1513)
| ~ s__instance(X1514,X1512)
| ~ s__instance(X1512,s__SetOrClass)
| ~ s__instance(X1513,s__SetOrClass)
| ~ s__disjoint(X1512,X1513) ) ),
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)],[kb_SUMO_276])])])])])])]) ).
cnf(c_0_22,plain,
( ~ s__instance(X2,X1)
| ~ s__instance(X1,s__NullSet) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_19,c_0_20])]) ).
cnf(c_0_23,plain,
( s__disjoint(X1,X2)
| s__instance(esk1_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_24,plain,
( ~ s__instance(X2,esk1_2(s__NullSet,X1))
| s__disjoint(s__NullSet,X1) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_25,plain,
( X2 = s__UnionFn(X3,X1)
| s__instance(esk158_3(X1,X2,X3),X3) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
cnf(c_0_26,plain,
( s__disjoint(s__NullSet,X2)
| X1 = s__UnionFn(esk1_2(s__NullSet,X2),X3) ),
inference(spm,[status(thm)],[c_0_24,c_0_25]) ).
cnf(c_0_27,plain,
( s__disjoint(s__NullSet,X3)
| X1 = X2 ),
inference(spm,[status(thm)],[c_0_26,c_0_26]) ).
fof(c_0_28,plain,
! [X6419,X6420] :
( ( X6420 = X6419
| s__element(esk157_2(X6419,X6420),X6419)
| s__element(esk157_2(X6419,X6420),X6420) )
& ( X6420 = X6419
| ~ s__element(esk157_2(X6419,X6420),X6419)
| ~ s__element(esk157_2(X6419,X6420),X6420) )
& ( X6420 = X6419
| s__instance(X6419,s__Set) )
& ( X6420 = X6419
| s__instance(X6420,s__Set) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[kb_SUMO_3489])])])])])]) ).
cnf(c_0_29,plain,
( ~ s__instance(X3,X2)
| ~ s__instance(X3,X1)
| ~ s__instance(X1,s__SetOrClass)
| ~ s__instance(X2,s__SetOrClass)
| ~ s__disjoint(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_21]) ).
cnf(c_0_30,negated_conjecture,
( ~ s__overlapsTemporally(s__TimeInterval36_1,X2)
| s__disjoint(s__NullSet,X1) ),
inference(spm,[status(thm)],[c_0_11,c_0_27]) ).
cnf(c_0_31,plain,
( X2 = X1
| s__instance(X1,s__Set) ),
inference(split_conjunct,[status(thm)],[c_0_28]) ).
cnf(c_0_32,plain,
( ~ s__instance(X3,X1)
| ~ s__instance(X3,X2)
| ~ s__disjoint(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_20]),c_0_20])]) ).
cnf(c_0_33,negated_conjecture,
s__disjoint(s__NullSet,X1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_17]),c_0_18])]) ).
cnf(c_0_34,negated_conjecture,
( ~ s__overlapsTemporally(s__TimeInterval36_1,X1)
| s__instance(X1,s__Set) ),
inference(spm,[status(thm)],[c_0_11,c_0_31]) ).
cnf(c_0_35,negated_conjecture,
( ~ s__instance(X1,X2)
| ~ s__instance(X1,s__NullSet) ),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_36,negated_conjecture,
s__instance(s__TimeInterval36_1,s__Set),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_17]),c_0_18])]) ).
cnf(c_0_37,negated_conjecture,
( ~ s__instance(esk158_3(X2,X1,s__NullSet),X3)
| X1 = s__UnionFn(s__NullSet,X2) ),
inference(spm,[status(thm)],[c_0_35,c_0_25]) ).
cnf(c_0_38,negated_conjecture,
s__instance(X1,s__Set),
inference(spm,[status(thm)],[c_0_36,c_0_31]) ).
cnf(c_0_39,negated_conjecture,
X1 = s__UnionFn(s__NullSet,X2),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_40,negated_conjecture,
X1 = X2,
inference(spm,[status(thm)],[c_0_39,c_0_39]) ).
cnf(c_0_41,negated_conjecture,
~ s__overlapsTemporally(s__TimeInterval36_1,X1),
inference(spm,[status(thm)],[c_0_11,c_0_40]) ).
cnf(c_0_42,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_17]),c_0_18])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : CSR105+4 : TPTP v9.3.1. Bugfixed v7.3.0.
% 0.00/0.07 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.17/0.43 % Computer : n006.cluster.edu
% 0.17/0.43 % Model : x86_64 x86_64
% 0.17/0.43 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.17/0.43 % Memory : 8046.5625MB
% 0.17/0.43 % OS : Linux 6.8.0-71-generic
% 0.17/0.43 % CPULimit : 300
% 0.17/0.43 % WCLimit : 300
% 0.17/0.43 % DateTime : Mon Sep 21 15:00:27 UTC 2026
% 0.17/0.44 % CPUTime :
% 0.17/0.44 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.25/0.50 Running first-order theorem proving
% 0.25/0.50 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
% 24.98/5.02 % Version: 3.5.1
% 24.98/5.02 % Preprocessing class: FMLLSMSLSSSNFFN.
% 24.98/5.02 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 24.98/5.02 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 24.98/5.02 % Starting new_bool_3 with 300s (1) cores
% 24.98/5.02 % Starting new_bool_1 with 300s (1) cores
% 24.98/5.02 % Starting sh5l with 300s (1) cores
% 24.98/5.02 % G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with pid 3105675 completed with status 0
% 24.98/5.02 % Result found by G-E--_208_B07_F1_AE_CS_SP_PS_S0Y
% 24.98/5.02 % Preprocessing class: FMLLSMSLSSSNFFN.
% 24.98/5.02 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 24.98/5.02 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 24.98/5.02 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 24.98/5.02 % No SInE strategy applied
% 24.98/5.02 % Search class: FGHSM-SMLM31-MFFFFFNN
% 24.98/5.02 % Scheduled 7 strats onto 5 cores with 1499 seconds (1499 total)
% 24.98/5.02 % Starting SubtermCWHack with 135s (1) cores
% 24.98/5.02 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 150s (1) cores
% 24.98/5.02 % Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 135s (1) cores
% 24.98/5.02 % Starting new_bool_3 with 135s (1) cores
% 24.98/5.02 % Starting new_bool_1 with 135s (1) cores
% 24.98/5.02 % G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with pid 3105683 completed with status 0
% 24.98/5.02 % Result found by G-E--_208_B07_F1_AE_CS_SP_PS_S0Y
% 24.98/5.02 % Preprocessing class: FMLLSMSLSSSNFFN.
% 24.98/5.02 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 24.98/5.02 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 1500s (5) cores
% 24.98/5.02 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 24.98/5.02 % No SInE strategy applied
% 24.98/5.02 % Search class: FGHSM-SMLM31-MFFFFFNN
% 24.98/5.02 % Scheduled 7 strats onto 5 cores with 1499 seconds (1499 total)
% 24.98/5.02 % Starting SubtermCWHack with 135s (1) cores
% 24.98/5.02 % Starting G-E--_208_B07_F1_AE_CS_SP_PS_S0Y with 150s (1) cores
% 24.98/5.02 % Preprocessing time : 0.096 s
% 24.98/5.02 % Presaturation interreduction done
% 24.98/5.02
% 24.98/5.02 % Proof found!
% 24.98/5.02 % SZS status Theorem
% 24.98/5.02 % SZS output start CNFRefutation
% See solution above
% 24.98/5.02 % Parsed axioms : 7223
% 24.98/5.02 % Removed by relevancy pruning/SinE : 0
% 24.98/5.02 % Initial clauses : 8414
% 24.98/5.02 % Removed in clause preprocessing : 63
% 24.98/5.02 % Initial clauses in saturation : 8351
% 24.98/5.02 % Processed clauses : 17360
% 24.98/5.02 % ...of these trivial : 927
% 24.98/5.02 % ...subsumed : 250
% 24.98/5.02 % ...remaining for further processing : 16183
% 24.98/5.02 % Other redundant clauses eliminated : 35
% 24.98/5.02 % Clauses deleted for lack of memory : 0
% 24.98/5.02 % Backward-subsumed : 1113
% 24.98/5.02 % Backward-rewritten : 1411
% 24.98/5.02 % Generated clauses : 97804
% 24.98/5.02 % ...of the previous two non-redundant : 88163
% 24.98/5.02 % ...aggressively subsumed : 0
% 24.98/5.02 % Contextual simplify-reflections : 664
% 24.98/5.02 % Paramodulations : 97725
% 24.98/5.02 % Factorizations : 1
% 24.98/5.02 % NegExts : 0
% 24.98/5.02 % Equation resolutions : 50
% 24.98/5.02 % Disequality decompositions : 0
% 24.98/5.02 % Total rewrite steps : 12202
% 24.98/5.02 % ...of those cached : 7702
% 24.98/5.02 % Propositional unsat checks : 0
% 24.98/5.02 % Propositional check models : 0
% 24.98/5.02 % Propositional check unsatisfiable : 0
% 24.98/5.02 % Propositional clauses : 0
% 24.98/5.02 % Propositional clauses after purity: 0
% 24.98/5.02 % Propositional unsat core size : 0
% 24.98/5.02 % Propositional preprocessing time : 0.000
% 24.98/5.02 % Propositional encoding time : 0.000
% 24.98/5.02 % Propositional solver time : 0.000
% 24.98/5.02 % Success case prop preproc time : 0.000
% 24.98/5.02 % Success case prop encoding time : 0.000
% 24.98/5.02 % Success case prop solver time : 0.000
% 24.98/5.02 % Current number of processed clauses : 5468
% 24.98/5.02 % Positive orientable unit clauses : 3949
% 24.98/5.02 % Positive unorientable unit clauses: 1
% 24.98/5.02 % Negative unit clauses : 16
% 24.98/5.02 % Non-unit-clauses : 1502
% 24.98/5.02 % Current number of unprocessed clauses: 54525
% 24.98/5.02 % ...number of literals in the above : 105883
% 24.98/5.02 % Current number of archived formulas : 0
% 24.98/5.02 % Current number of archived clauses : 10707
% 24.98/5.02 % Clause-clause subsumption calls (NU) : 2810712
% 24.98/5.02 % Rec. Clause-clause subsumption calls : 817689
% 24.98/5.02 % Non-unit clause-clause subsumptions : 920
% 24.98/5.02 % Unit Clause-clause subsumption calls : 277072
% 24.98/5.02 % Rewrite failures with RHS unbound : 10063
% 24.98/5.02 % BW rewrite match attempts : 33365
% 24.98/5.02 % BW rewrite match successes : 11013
% 24.98/5.02 % Condensation attempts : 0
% 24.98/5.02 % Condensation successes : 0
% 24.98/5.02 % Termbank termtop insertions : 1161191
% 24.98/5.02 % Search garbage collected termcells : 89720
% 24.98/5.02
% 24.98/5.02 % -------------------------------------------------
% 24.98/5.02 % User time : 3.924 s
% 24.98/5.02 % System time : 0.160 s
% 24.98/5.02 % Total time : 4.084 s
% 24.98/5.02 % Maximum resident set size: 31792 pages
% 24.98/5.02
% 24.98/5.02 % -------------------------------------------------
% 24.98/5.02 % User time : 15.091 s
% 24.98/5.02 % System time : 0.772 s
% 24.98/5.02 % Total time : 15.863 s
% 24.98/5.02 % Maximum resident set size: 12288 pages
% 24.98/5.02 % E exiting
%------------------------------------------------------------------------------