%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU179+1 : 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 : n014.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:09 PM UTC 2026
% Result : Theorem 2.24s 0.89s
% Output : CNFRefutation 2.24s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 6
% Syntax : Number of formulae : 46 ( 12 unt; 0 def)
% Number of atoms : 150 ( 24 equ)
% Maximal formula atoms : 16 ( 3 avg)
% Number of connectives : 179 ( 75 ~; 77 |; 13 &)
% ( 5 <=>; 9 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 4 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 14 ( 14 usr; 2 con; 0-3 aty)
% Number of variables : 106 ( 6 sgn 40 !; 2 ?)
% Comments :
%------------------------------------------------------------------------------
fof(d5_relat_1,axiom,
! [X1] :
( relation(X1)
=> ! [X2] :
( X2 = relation_rng(X1)
<=> ! [X3] :
( in(X3,X2)
<=> ? [X4] : in(ordered_pair(X4,X3),X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d5_relat_1) ).
fof(d5_tarski,axiom,
! [X1,X2] : ordered_pair(X1,X2) = unordered_pair(unordered_pair(X1,X2),singleton(X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d5_tarski) ).
fof(t25_relat_1,conjecture,
! [X1] :
( relation(X1)
=> ! [X2] :
( relation(X2)
=> ( subset(X1,X2)
=> ( subset(relation_rng(X1),relation_rng(X2))
& subset(relation_dom(X1),relation_dom(X2)) ) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t25_relat_1) ).
fof(d4_relat_1,axiom,
! [X1] :
( relation(X1)
=> ! [X2] :
( X2 = relation_dom(X1)
<=> ! [X3] :
( in(X3,X2)
<=> ? [X4] : in(ordered_pair(X3,X4),X1) ) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d4_relat_1) ).
fof(commutativity_k2_tarski,axiom,
! [X1,X2] : unordered_pair(X1,X2) = unordered_pair(X2,X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',commutativity_k2_tarski) ).
fof(d3_tarski,axiom,
! [X1,X2] :
( subset(X1,X2)
<=> ! [X3] :
( in(X3,X1)
=> in(X3,X2) ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',d3_tarski) ).
fof(c_0_6,plain,
! [X25,X26,X27,X29,X30,X31,X33] :
( ( ~ relation(X25)
| X31 = relation_rng(X25)
| in(ordered_pair(esk7_2(X25,X31),esk6_2(X25,X31)),X25)
| in(esk6_2(X25,X31),X31) )
& ( ~ relation(X25)
| X31 = relation_rng(X25)
| ~ in(ordered_pair(X33,esk6_2(X25,X31)),X25)
| ~ in(esk6_2(X25,X31),X31) )
& ( ~ relation(X25)
| X26 != relation_rng(X25)
| in(X29,X26)
| ~ in(ordered_pair(X30,X29),X25) )
& ( ~ relation(X25)
| X26 != relation_rng(X25)
| in(ordered_pair(esk5_3(X25,X26,X27),X27),X25)
| ~ in(X27,X26) ) ),
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)],[d5_relat_1])])])])])])]) ).
fof(c_0_7,plain,
! [X35,X36] : ordered_pair(X35,X36) = unordered_pair(unordered_pair(X35,X36),singleton(X35)),
inference(variable_rename,[status(thm)],[d5_tarski]) ).
cnf(c_0_8,plain,
( ~ relation(X3)
| X4 != relation_rng(X3)
| ~ in(ordered_pair(X1,X2),X3)
| in(X2,X4) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_9,plain,
ordered_pair(X1,X2) = unordered_pair(unordered_pair(X1,X2),singleton(X1)),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
fof(c_0_10,negated_conjecture,
~ ! [X1] :
( relation(X1)
=> ! [X2] :
( relation(X2)
=> ( subset(X1,X2)
=> ( subset(relation_rng(X1),relation_rng(X2))
& subset(relation_dom(X1),relation_dom(X2)) ) ) ) ),
inference(assume_negation,[status(cth)],[t25_relat_1]) ).
fof(c_0_11,plain,
! [X15,X16,X17,X19,X20,X21,X23] :
( ( ~ relation(X15)
| X21 = relation_dom(X15)
| in(ordered_pair(esk3_2(X15,X21),esk4_2(X15,X21)),X15)
| in(esk3_2(X15,X21),X21) )
& ( ~ relation(X15)
| X21 = relation_dom(X15)
| ~ in(ordered_pair(esk3_2(X15,X21),X23),X15)
| ~ in(esk3_2(X15,X21),X21) )
& ( ~ relation(X15)
| X16 != relation_dom(X15)
| in(X19,X16)
| ~ in(ordered_pair(X19,X20),X15) )
& ( ~ relation(X15)
| X16 != relation_dom(X15)
| in(ordered_pair(X17,esk2_3(X15,X16,X17)),X15)
| ~ in(X17,X16) ) ),
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)],[d4_relat_1])])])])])])]) ).
cnf(c_0_12,plain,
( ~ in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),X3)
| ~ relation(X3)
| X4 != relation_rng(X3)
| in(X2,X4) ),
inference(rw,[status(thm)],[c_0_8,c_0_9]) ).
fof(c_0_13,plain,
! [X7,X8] : unordered_pair(X7,X8) = unordered_pair(X8,X7),
inference(variable_rename,[status(thm)],[commutativity_k2_tarski]) ).
fof(c_0_14,plain,
! [X9,X10,X11,X12,X13] :
( ( subset(X12,X13)
| ~ in(esk1_2(X12,X13),X13) )
& ( subset(X12,X13)
| in(esk1_2(X12,X13),X12) )
& ( in(X11,X10)
| ~ in(X11,X9)
| ~ subset(X9,X10) ) ),
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)],[d3_tarski])])])])])])]) ).
fof(c_0_15,negated_conjecture,
( ( ~ subset(relation_rng(esk14_0),relation_rng(esk15_0))
| ~ subset(relation_dom(esk14_0),relation_dom(esk15_0)) )
& subset(esk14_0,esk15_0)
& relation(esk15_0)
& relation(esk14_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])]) ).
cnf(c_0_16,plain,
( ~ relation(X3)
| X4 != relation_dom(X3)
| ~ in(ordered_pair(X1,X2),X3)
| in(X1,X4) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,plain,
( ~ in(unordered_pair(unordered_pair(X3,X1),singleton(X3)),X2)
| ~ relation(X2)
| in(X1,relation_rng(X2)) ),
inference(er,[status(thm)],[c_0_12]) ).
cnf(c_0_18,plain,
unordered_pair(X1,X2) = unordered_pair(X2,X1),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,plain,
( ~ in(X3,X1)
| ~ subset(X1,X2)
| in(X3,X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,negated_conjecture,
subset(esk14_0,esk15_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_21,plain,
( ~ relation(X3)
| X2 != relation_rng(X3)
| ~ in(X1,X2)
| in(ordered_pair(esk5_3(X3,X2,X1),X1),X3) ),
inference(split_conjunct,[status(thm)],[c_0_6]) ).
cnf(c_0_22,plain,
( ~ in(unordered_pair(unordered_pair(X1,X2),singleton(X1)),X3)
| ~ relation(X3)
| X4 != relation_dom(X3)
| in(X1,X4) ),
inference(rw,[status(thm)],[c_0_16,c_0_9]) ).
cnf(c_0_23,plain,
( ~ in(unordered_pair(unordered_pair(X1,X3),singleton(X3)),X2)
| ~ relation(X2)
| in(X1,relation_rng(X2)) ),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_24,negated_conjecture,
( ~ in(X1,esk14_0)
| in(X1,esk15_0) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_25,negated_conjecture,
relation(esk15_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_26,plain,
( ~ in(X1,X2)
| ~ relation(X3)
| X2 != relation_rng(X3)
| in(unordered_pair(unordered_pair(esk5_3(X3,X2,X1),X1),singleton(esk5_3(X3,X2,X1))),X3) ),
inference(rw,[status(thm)],[c_0_21,c_0_9]) ).
cnf(c_0_27,plain,
( ~ in(unordered_pair(unordered_pair(X1,X3),singleton(X1)),X2)
| ~ relation(X2)
| in(X1,relation_dom(X2)) ),
inference(er,[status(thm)],[c_0_22]) ).
cnf(c_0_28,plain,
( ~ relation(X3)
| X2 != relation_dom(X3)
| ~ in(X1,X2)
| in(ordered_pair(X1,esk2_3(X3,X2,X1)),X3) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_29,negated_conjecture,
( ~ in(unordered_pair(unordered_pair(X1,X2),singleton(X2)),esk14_0)
| in(X1,relation_rng(esk15_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25])]) ).
cnf(c_0_30,plain,
( ~ in(X1,relation_rng(X2))
| ~ relation(X2)
| in(unordered_pair(unordered_pair(X1,esk5_3(X2,relation_rng(X2),X1)),singleton(esk5_3(X2,relation_rng(X2),X1))),X2) ),
inference(er,[status(thm)],[inference(rw,[status(thm)],[c_0_26,c_0_18])]) ).
cnf(c_0_31,negated_conjecture,
relation(esk14_0),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_32,plain,
( ~ in(unordered_pair(singleton(X1),unordered_pair(X1,X3)),X2)
| ~ relation(X2)
| in(X1,relation_dom(X2)) ),
inference(spm,[status(thm)],[c_0_27,c_0_18]) ).
cnf(c_0_33,plain,
( ~ in(X1,X2)
| ~ relation(X3)
| X2 != relation_dom(X3)
| in(unordered_pair(unordered_pair(X1,esk2_3(X3,X2,X1)),singleton(X1)),X3) ),
inference(rw,[status(thm)],[c_0_28,c_0_9]) ).
cnf(c_0_34,plain,
( ~ in(esk1_2(X1,X2),X2)
| subset(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_35,negated_conjecture,
( ~ in(X1,relation_rng(esk14_0))
| in(X1,relation_rng(esk15_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31])]) ).
cnf(c_0_36,negated_conjecture,
( ~ in(unordered_pair(singleton(X1),unordered_pair(X1,X2)),esk14_0)
| in(X1,relation_dom(esk15_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_24]),c_0_25])]) ).
cnf(c_0_37,plain,
( ~ in(X1,relation_dom(X2))
| ~ relation(X2)
| in(unordered_pair(singleton(X1),unordered_pair(X1,esk2_3(X2,relation_dom(X2),X1))),X2) ),
inference(er,[status(thm)],[inference(rw,[status(thm)],[c_0_33,c_0_18])]) ).
cnf(c_0_38,negated_conjecture,
( ~ in(esk1_2(X1,relation_rng(esk15_0)),relation_rng(esk14_0))
| subset(X1,relation_rng(esk15_0)) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_39,plain,
( subset(X1,X2)
| in(esk1_2(X1,X2),X1) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_40,negated_conjecture,
( ~ in(X1,relation_dom(esk14_0))
| in(X1,relation_dom(esk15_0)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_31])]) ).
cnf(c_0_41,negated_conjecture,
( ~ subset(relation_rng(esk14_0),relation_rng(esk15_0))
| ~ subset(relation_dom(esk14_0),relation_dom(esk15_0)) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_42,negated_conjecture,
subset(relation_rng(esk14_0),relation_rng(esk15_0)),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_43,negated_conjecture,
( ~ in(esk1_2(X1,relation_dom(esk15_0)),relation_dom(esk14_0))
| subset(X1,relation_dom(esk15_0)) ),
inference(spm,[status(thm)],[c_0_34,c_0_40]) ).
cnf(c_0_44,negated_conjecture,
~ subset(relation_dom(esk14_0),relation_dom(esk15_0)),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_41,c_0_42])]) ).
cnf(c_0_45,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_39]),c_0_44]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.04 % Problem : SEU179+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.19/0.45 % Computer : n014.cluster.edu
% 0.19/0.45 % Model : x86_64 x86_64
% 0.19/0.45 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.19/0.45 % Memory : 8046.5625MB
% 0.19/0.45 % OS : Linux 6.8.0-71-generic
% 0.19/0.45 % CPULimit : 300
% 0.19/0.45 % WCLimit : 300
% 0.19/0.45 % DateTime : Mon Sep 21 05:55:04 UTC 2026
% 0.19/0.45 % CPUTime :
% 0.19/0.45 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.23/0.52 Running first-order theorem proving
% 0.23/0.52 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
% 2.24/0.89 % Version: 3.5.1
% 2.24/0.89 % Preprocessing class: FSMSSMSSSSSNFFN.
% 2.24/0.89 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.24/0.89 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.24/0.89 % Starting new_bool_3 with 300s (1) cores
% 2.24/0.89 % Starting new_bool_1 with 300s (1) cores
% 2.24/0.89 % Starting sh5l with 300s (1) cores
% 2.24/0.89 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3284371 completed with status 0
% 2.24/0.89 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 2.24/0.89 % Preprocessing class: FSMSSMSSSSSNFFN.
% 2.24/0.89 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.24/0.89 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.24/0.89 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 2.24/0.89 % No SInE strategy applied
% 2.24/0.89 % Search class: FGHSM-FFMM31-MFFFFFNN
% 2.24/0.89 % Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 2.24/0.89 % Starting SubtermCWHack with 136s (1) cores
% 2.24/0.89 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 2.24/0.89 % Starting G-E--_208_C12_02_nc_F1_SE_CS_SP_PS_S5PRR_RG_S070I with 113s (1) cores
% 2.24/0.89 % Starting G-N--_023_B07_F1_SP_PI_Q7_CS_SE_S0Y with 113s (1) cores
% 2.24/0.89 % Starting G-E--_103_C18_F1_PI_AE_Q4_CS_SP_S0Y with 113s (1) cores
% 2.24/0.89 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3284378 completed with status 0
% 2.24/0.89 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 2.24/0.89 % Preprocessing class: FSMSSMSSSSSNFFN.
% 2.24/0.89 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.24/0.89 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 2.24/0.89 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 2.24/0.89 % No SInE strategy applied
% 2.24/0.89 % Search class: FGHSM-FFMM31-MFFFFFNN
% 2.24/0.89 % Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 2.24/0.89 % Starting SubtermCWHack with 136s (1) cores
% 2.24/0.89 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 2.24/0.89 % Preprocessing time : 0.003 s
% 2.24/0.89 % Presaturation interreduction done
% 2.24/0.89
% 2.24/0.89 % Proof found!
% 2.24/0.89 % SZS status Theorem
% 2.24/0.89 % SZS output start CNFRefutation
% See solution above
% 2.24/0.89 % Parsed axioms : 35
% 2.24/0.89 % Removed by relevancy pruning/SinE : 0
% 2.24/0.89 % Initial clauses : 50
% 2.24/0.89 % Removed in clause preprocessing : 9
% 2.24/0.89 % Initial clauses in saturation : 41
% 2.24/0.89 % Processed clauses : 1668
% 2.24/0.89 % ...of these trivial : 2
% 2.24/0.89 % ...subsumed : 1155
% 2.24/0.89 % ...remaining for further processing : 511
% 2.24/0.89 % Other redundant clauses eliminated : 4
% 2.24/0.89 % Clauses deleted for lack of memory : 0
% 2.24/0.89 % Backward-subsumed : 90
% 2.24/0.89 % Backward-rewritten : 16
% 2.24/0.89 % Generated clauses : 8766
% 2.24/0.89 % ...of the previous two non-redundant : 7654
% 2.24/0.89 % ...aggressively subsumed : 0
% 2.24/0.89 % Contextual simplify-reflections : 1
% 2.24/0.89 % Paramodulations : 8762
% 2.24/0.89 % Factorizations : 0
% 2.24/0.89 % NegExts : 0
% 2.24/0.89 % Equation resolutions : 4
% 2.24/0.89 % Disequality decompositions : 0
% 2.24/0.89 % Total rewrite steps : 5530
% 2.24/0.89 % ...of those cached : 5475
% 2.24/0.89 % Propositional unsat checks : 0
% 2.24/0.89 % Propositional check models : 0
% 2.24/0.89 % Propositional check unsatisfiable : 0
% 2.24/0.89 % Propositional clauses : 0
% 2.24/0.89 % Propositional clauses after purity: 0
% 2.24/0.89 % Propositional unsat core size : 0
% 2.24/0.89 % Propositional preprocessing time : 0.000
% 2.24/0.89 % Propositional encoding time : 0.000
% 2.24/0.89 % Propositional solver time : 0.000
% 2.24/0.89 % Success case prop preproc time : 0.000
% 2.24/0.89 % Success case prop encoding time : 0.000
% 2.24/0.89 % Success case prop solver time : 0.000
% 2.24/0.89 % Current number of processed clauses : 361
% 2.24/0.89 % Positive orientable unit clauses : 26
% 2.24/0.89 % Positive unorientable unit clauses: 1
% 2.24/0.89 % Negative unit clauses : 17
% 2.24/0.89 % Non-unit-clauses : 317
% 2.24/0.89 % Current number of unprocessed clauses: 5583
% 2.24/0.89 % ...number of literals in the above : 34329
% 2.24/0.89 % Current number of archived formulas : 0
% 2.24/0.89 % Current number of archived clauses : 147
% 2.24/0.89 % Clause-clause subsumption calls (NU) : 27688
% 2.24/0.89 % Rec. Clause-clause subsumption calls : 14186
% 2.24/0.89 % Non-unit clause-clause subsumptions : 595
% 2.24/0.89 % Unit Clause-clause subsumption calls : 1647
% 2.24/0.89 % Rewrite failures with RHS unbound : 0
% 2.24/0.89 % BW rewrite match attempts : 22
% 2.24/0.89 % BW rewrite match successes : 13
% 2.24/0.89 % Condensation attempts : 0
% 2.24/0.89 % Condensation successes : 0
% 2.24/0.89 % Termbank termtop insertions : 153794
% 2.24/0.89 % Search garbage collected termcells : 650
% 2.24/0.89
% 2.24/0.89 % -------------------------------------------------
% 2.24/0.89 % User time : 0.327 s
% 2.24/0.89 % System time : 0.008 s
% 2.24/0.89 % Total time : 0.335 s
% 2.24/0.89 % Maximum resident set size: 3656 pages
% 2.24/0.89
% 2.24/0.89 % -------------------------------------------------
% 2.24/0.89 % User time : 1.596 s
% 2.24/0.89 % System time : 0.063 s
% 2.24/0.89 % Total time : 1.658 s
% 2.24/0.89 % Maximum resident set size: 4864 pages
% 2.24/0.89 % E exiting
%------------------------------------------------------------------------------