%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU253+1 : TPTP v9.3.1. Released v3.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/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 02:24:28 PM UTC 2026
% Result : Theorem 32.00s 5.21s
% Output : CNFRefutation 32.00s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 6
% Syntax : Number of formulae : 43 ( 5 unt; 0 def)
% Number of atoms : 174 ( 11 equ)
% Maximal formula atoms : 22 ( 4 avg)
% Number of connectives : 211 ( 80 ~; 94 |; 23 &)
% ( 4 <=>; 10 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 8 ( 8 usr; 2 con; 0-2 aty)
% Number of variables : 87 ( 2 sgn 37 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(l4_wellord1,axiom,
! [X1] :
( relation(X1)
=> ( connected(X1)
<=> ! [X2,X3] :
~ ( ~ in(ordered_pair(X3,X2),X1)
& ~ in(ordered_pair(X2,X3),X1)
& X2 != X3
& in(X3,relation_field(X1))
& in(X2,relation_field(X1)) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',l4_wellord1) ).
fof(t19_wellord1,axiom,
! [X1,X2,X3] :
( relation(X3)
=> ( in(X1,relation_field(relation_restriction(X3,X2)))
=> ( in(X1,X2)
& in(X1,relation_field(X3)) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t19_wellord1) ).
fof(dt_k2_wellord1,axiom,
! [X1,X2] :
( relation(X1)
=> relation(relation_restriction(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_k2_wellord1) ).
fof(t16_wellord1,axiom,
! [X1,X2,X3] :
( relation(X3)
=> ( in(X1,relation_restriction(X3,X2))
<=> ( in(X1,cartesian_product2(X2,X2))
& in(X1,X3) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t16_wellord1) ).
fof(t106_zfmisc_1,axiom,
! [X1,X2,X3,X4] :
( in(ordered_pair(X1,X2),cartesian_product2(X3,X4))
<=> ( in(X2,X4)
& in(X1,X3) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t106_zfmisc_1) ).
fof(t23_wellord1,conjecture,
! [X1,X2] :
( relation(X2)
=> ( connected(X2)
=> connected(relation_restriction(X2,X1)) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t23_wellord1) ).
fof(c_0_6,plain,
! [X1] :
( relation(X1)
=> ( connected(X1)
<=> ! [X2,X3] :
~ ( ~ in(ordered_pair(X3,X2),X1)
& ~ in(ordered_pair(X2,X3),X1)
& X2 != X3
& in(X3,relation_field(X1))
& in(X2,relation_field(X1)) ) ) ),
inference(fof_simplification,[status(thm)],[l4_wellord1]) ).
fof(c_0_7,plain,
! [X24,X25,X26] :
( ( ~ relation(X26)
| ~ in(X24,relation_field(relation_restriction(X26,X25)))
| in(X24,X25) )
& ( ~ relation(X26)
| ~ in(X24,relation_field(relation_restriction(X26,X25)))
| in(X24,relation_field(X26)) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t19_wellord1])])])]) ).
fof(c_0_8,plain,
! [X7,X8,X9] :
( ( ~ relation(X7)
| connected(X7)
| ~ in(ordered_pair(esk4_1(X7),esk3_1(X7)),X7) )
& ( ~ relation(X7)
| connected(X7)
| ~ in(ordered_pair(esk3_1(X7),esk4_1(X7)),X7) )
& ( ~ relation(X7)
| connected(X7)
| esk3_1(X7) != esk4_1(X7) )
& ( ~ relation(X7)
| connected(X7)
| in(esk4_1(X7),relation_field(X7)) )
& ( ~ relation(X7)
| connected(X7)
| in(esk3_1(X7),relation_field(X7)) )
& ( ~ relation(X7)
| in(ordered_pair(X9,X8),X7)
| in(ordered_pair(X8,X9),X7)
| X8 = X9
| ~ in(X9,relation_field(X7))
| ~ in(X8,relation_field(X7))
| ~ connected(X7) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])])])]) ).
fof(c_0_9,plain,
! [X12,X13] :
( relation(relation_restriction(X12,X13))
| ~ relation(X12) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k2_wellord1])])]) ).
cnf(c_0_10,plain,
( ~ relation(X2)
| ~ in(X1,relation_field(relation_restriction(X2,X3)))
| in(X1,relation_field(X2)) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_11,plain,
( ~ relation(X1)
| connected(X1)
| in(esk4_1(X1),relation_field(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_12,plain,
( ~ relation(X1)
| relation(relation_restriction(X1,X2)) ),
inference(split_conjunct,[status(thm)],[c_0_9]) ).
fof(c_0_13,plain,
! [X33,X34,X35] :
( ( ~ relation(X35)
| in(X33,relation_restriction(X35,X34))
| ~ in(X33,cartesian_product2(X34,X34))
| ~ in(X33,X35) )
& ( ~ relation(X35)
| ~ in(X33,relation_restriction(X35,X34))
| in(X33,cartesian_product2(X34,X34)) )
& ( ~ relation(X35)
| ~ in(X33,relation_restriction(X35,X34))
| in(X33,X35) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t16_wellord1])])])]) ).
fof(c_0_14,plain,
! [X20,X21,X22,X23] :
( ( in(ordered_pair(X20,X21),cartesian_product2(X22,X23))
| ~ in(X21,X23)
| ~ in(X20,X22) )
& ( ~ in(ordered_pair(X20,X21),cartesian_product2(X22,X23))
| in(X21,X23) )
& ( ~ in(ordered_pair(X20,X21),cartesian_product2(X22,X23))
| in(X20,X22) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t106_zfmisc_1])])])]) ).
cnf(c_0_15,plain,
( ~ relation(X1)
| ~ in(X3,relation_field(X1))
| ~ in(X2,relation_field(X1))
| ~ connected(X1)
| in(ordered_pair(X3,X2),X1)
| in(ordered_pair(X2,X3),X1)
| X2 = X3 ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_16,plain,
( ~ relation(X1)
| in(esk4_1(relation_restriction(X1,X2)),relation_field(X1))
| connected(relation_restriction(X1,X2)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_11]),c_0_12]) ).
cnf(c_0_17,plain,
( ~ relation(X1)
| connected(X1)
| in(esk3_1(X1),relation_field(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
fof(c_0_18,negated_conjecture,
~ ! [X1,X2] :
( relation(X2)
=> ( connected(X2)
=> connected(relation_restriction(X2,X1)) ) ),
inference(assume_negation,[status(cth)],[t23_wellord1]) ).
cnf(c_0_19,plain,
( ~ relation(X2)
| ~ in(X1,cartesian_product2(X3,X3))
| ~ in(X1,X2)
| in(X1,relation_restriction(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_20,plain,
( ~ in(X3,X4)
| ~ in(X1,X2)
| in(ordered_pair(X1,X3),cartesian_product2(X2,X4)) ),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,plain,
( ~ relation(X3)
| ~ in(X1,relation_field(relation_restriction(X3,X2)))
| in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_7]) ).
cnf(c_0_22,plain,
( ~ in(X1,relation_field(X2))
| ~ relation(X2)
| ~ connected(X2)
| in(ordered_pair(X1,esk4_1(relation_restriction(X2,X3))),X2)
| in(ordered_pair(esk4_1(relation_restriction(X2,X3)),X1),X2)
| connected(relation_restriction(X2,X3))
| X1 = esk4_1(relation_restriction(X2,X3)) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_23,plain,
( ~ relation(X1)
| in(esk3_1(relation_restriction(X1,X2)),relation_field(X1))
| connected(relation_restriction(X1,X2)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_10,c_0_17]),c_0_12]) ).
fof(c_0_24,negated_conjecture,
( ~ connected(relation_restriction(esk2_0,esk1_0))
& connected(esk2_0)
& relation(esk2_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_18])])])]) ).
cnf(c_0_25,plain,
( ~ relation(X1)
| ~ in(ordered_pair(esk4_1(X1),esk3_1(X1)),X1)
| connected(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_26,plain,
( ~ in(X1,X4)
| ~ in(X2,X4)
| ~ in(ordered_pair(X1,X2),X3)
| ~ relation(X3)
| in(ordered_pair(X1,X2),relation_restriction(X3,X4)) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_27,plain,
( ~ relation(X1)
| in(esk4_1(relation_restriction(X1,X2)),X2)
| connected(relation_restriction(X1,X2)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_11]),c_0_12]) ).
cnf(c_0_28,plain,
( ~ relation(X1)
| in(esk3_1(relation_restriction(X1,X2)),X2)
| connected(relation_restriction(X1,X2)) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_17]),c_0_12]) ).
cnf(c_0_29,plain,
( ~ relation(X1)
| ~ connected(X1)
| in(ordered_pair(esk4_1(relation_restriction(X1,X3)),esk3_1(relation_restriction(X1,X2))),X1)
| in(ordered_pair(esk3_1(relation_restriction(X1,X2)),esk4_1(relation_restriction(X1,X3))),X1)
| connected(relation_restriction(X1,X3))
| connected(relation_restriction(X1,X2))
| esk3_1(relation_restriction(X1,X2)) = esk4_1(relation_restriction(X1,X3)) ),
inference(spm,[status(thm)],[c_0_22,c_0_23]) ).
cnf(c_0_30,negated_conjecture,
relation(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_31,negated_conjecture,
connected(esk2_0),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_32,plain,
( ~ relation(X1)
| ~ in(ordered_pair(esk3_1(X1),esk4_1(X1)),X1)
| connected(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_33,plain,
( ~ in(ordered_pair(esk4_1(relation_restriction(X1,X2)),esk3_1(relation_restriction(X1,X2))),X1)
| ~ relation(X1)
| connected(relation_restriction(X1,X2)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27]),c_0_28]),c_0_12]) ).
cnf(c_0_34,negated_conjecture,
( in(ordered_pair(esk3_1(relation_restriction(esk2_0,X1)),esk4_1(relation_restriction(esk2_0,X2))),esk2_0)
| in(ordered_pair(esk4_1(relation_restriction(esk2_0,X2)),esk3_1(relation_restriction(esk2_0,X1))),esk2_0)
| connected(relation_restriction(esk2_0,X1))
| connected(relation_restriction(esk2_0,X2))
| esk3_1(relation_restriction(esk2_0,X1)) = esk4_1(relation_restriction(esk2_0,X2)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31])]) ).
cnf(c_0_35,plain,
( ~ in(ordered_pair(esk3_1(relation_restriction(X1,X2)),esk4_1(relation_restriction(X1,X2))),X1)
| ~ relation(X1)
| connected(relation_restriction(X1,X2)) ),
inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_26]),c_0_28]),c_0_27]),c_0_12]) ).
cnf(c_0_36,negated_conjecture,
( in(ordered_pair(esk3_1(relation_restriction(esk2_0,X1)),esk4_1(relation_restriction(esk2_0,X1))),esk2_0)
| connected(relation_restriction(esk2_0,X1))
| esk4_1(relation_restriction(esk2_0,X1)) = esk3_1(relation_restriction(esk2_0,X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_30])]) ).
cnf(c_0_37,plain,
( ~ relation(X1)
| esk3_1(X1) != esk4_1(X1)
| connected(X1) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
cnf(c_0_38,negated_conjecture,
( connected(relation_restriction(esk2_0,X1))
| esk4_1(relation_restriction(esk2_0,X1)) = esk3_1(relation_restriction(esk2_0,X1)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_30])]) ).
cnf(c_0_39,negated_conjecture,
~ connected(relation_restriction(esk2_0,esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_24]) ).
cnf(c_0_40,negated_conjecture,
( ~ relation(relation_restriction(esk2_0,X1))
| connected(relation_restriction(esk2_0,X1)) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_41,negated_conjecture,
~ relation(relation_restriction(esk2_0,esk1_0)),
inference(spm,[status(thm)],[c_0_39,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_12]),c_0_30])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU253+1 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.54 % Computer : n011.cluster.edu
% 0.11/0.54 % Model : x86_64 x86_64
% 0.11/0.54 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.54 % Memory : 8046.5625MB
% 0.11/0.54 % OS : Linux 6.8.0-71-generic
% 0.11/0.54 % CPULimit : 300
% 0.11/0.54 % WCLimit : 300
% 0.11/0.54 % DateTime : Mon Sep 21 06:03:55 UTC 2026
% 0.11/0.54 % CPUTime :
% 0.11/0.54 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/0.58 Running first-order theorem proving
% 0.15/0.58 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
% 32.00/5.21 % Version: 3.5.1
% 32.00/5.21 % Preprocessing class: FSMSSMSSSSSNFFN.
% 32.00/5.21 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 32.00/5.21 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 32.00/5.21 % Starting new_bool_3 with 300s (1) cores
% 32.00/5.21 % Starting new_bool_1 with 300s (1) cores
% 32.00/5.21 % Starting sh5l with 300s (1) cores
% 32.00/5.21 % new_bool_3 with pid 1132834 completed with status 0
% 32.00/5.21 % Result found by new_bool_3
% 32.00/5.21 % Preprocessing class: FSMSSMSSSSSNFFN.
% 32.00/5.21 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 32.00/5.21 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 32.00/5.21 % Starting new_bool_3 with 300s (1) cores
% 32.00/5.21 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 32.00/5.21 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 32.00/5.21 % Search class: FGHSF-FFMS21-SFFFFFNN
% 32.00/5.21 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 32.00/5.21 % Starting SubtermCWHack with 31s (1) cores
% 32.00/5.21 % SubtermCWHack with pid 1132838 completed with status 0
% 32.00/5.21 % Result found by SubtermCWHack
% 32.00/5.21 % Preprocessing class: FSMSSMSSSSSNFFN.
% 32.00/5.21 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 32.00/5.21 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 32.00/5.21 % Starting new_bool_3 with 300s (1) cores
% 32.00/5.21 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 32.00/5.21 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 32.00/5.21 % Search class: FGHSF-FFMS21-SFFFFFNN
% 32.00/5.21 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 32.00/5.21 % Starting SubtermCWHack with 31s (1) cores
% 32.00/5.21 % Preprocessing time : 0.001 s
% 32.00/5.21
% 32.00/5.21 % Proof found!
% 32.00/5.21 % SZS status Theorem
% 32.00/5.21 % SZS output start CNFRefutation
% See solution above
% 32.00/5.21 % Parsed axioms : 45
% 32.00/5.21 % Removed by relevancy pruning/SinE : 32
% 32.00/5.21 % Initial clauses : 25
% 32.00/5.21 % Removed in clause preprocessing : 0
% 32.00/5.21 % Initial clauses in saturation : 25
% 32.00/5.21 % Processed clauses : 9738
% 32.00/5.21 % ...of these trivial : 0
% 32.00/5.21 % ...subsumed : 3825
% 32.00/5.21 % ...remaining for further processing : 5913
% 32.00/5.21 % Other redundant clauses eliminated : 0
% 32.00/5.21 % Clauses deleted for lack of memory : 0
% 32.00/5.21 % Backward-subsumed : 44
% 32.00/5.21 % Backward-rewritten : 0
% 32.00/5.21 % Generated clauses : 58077
% 32.00/5.21 % ...of the previous two non-redundant : 57853
% 32.00/5.21 % ...aggressively subsumed : 0
% 32.00/5.21 % Contextual simplify-reflections : 1826
% 32.00/5.21 % Paramodulations : 58075
% 32.00/5.21 % Factorizations : 2
% 32.00/5.21 % NegExts : 0
% 32.00/5.21 % Equation resolutions : 0
% 32.00/5.21 % Disequality decompositions : 0
% 32.00/5.21 % Total rewrite steps : 3321
% 32.00/5.21 % ...of those cached : 3319
% 32.00/5.21 % Propositional unsat checks : 0
% 32.00/5.21 % Propositional check models : 0
% 32.00/5.21 % Propositional check unsatisfiable : 0
% 32.00/5.21 % Propositional clauses : 0
% 32.00/5.21 % Propositional clauses after purity: 0
% 32.00/5.21 % Propositional unsat core size : 0
% 32.00/5.21 % Propositional preprocessing time : 0.000
% 32.00/5.21 % Propositional encoding time : 0.000
% 32.00/5.21 % Propositional solver time : 0.000
% 32.00/5.21 % Success case prop preproc time : 0.000
% 32.00/5.21 % Success case prop encoding time : 0.000
% 32.00/5.21 % Success case prop solver time : 0.000
% 32.00/5.21 % Current number of processed clauses : 5869
% 32.00/5.21 % Positive orientable unit clauses : 3
% 32.00/5.21 % Positive unorientable unit clauses: 0
% 32.00/5.21 % Negative unit clauses : 5
% 32.00/5.21 % Non-unit-clauses : 5861
% 32.00/5.21 % Current number of unprocessed clauses: 48140
% 32.00/5.21 % ...number of literals in the above : 465546
% 32.00/5.21 % Current number of archived formulas : 0
% 32.00/5.21 % Current number of archived clauses : 44
% 32.00/5.21 % Clause-clause subsumption calls (NU) : 6499593
% 32.00/5.21 % Rec. Clause-clause subsumption calls : 306731
% 32.00/5.21 % Non-unit clause-clause subsumptions : 5695
% 32.00/5.21 % Unit Clause-clause subsumption calls : 3070
% 32.00/5.21 % Rewrite failures with RHS unbound : 0
% 32.00/5.21 % BW rewrite match attempts : 0
% 32.00/5.21 % BW rewrite match successes : 0
% 32.00/5.21 % Condensation attempts : 0
% 32.00/5.21 % Condensation successes : 0
% 32.00/5.21 % Termbank termtop insertions : 4412488
% 32.00/5.21 % Search garbage collected termcells : 466
% 32.00/5.21
% 32.00/5.21 % -------------------------------------------------
% 32.00/5.21 % User time : 4.436 s
% 32.00/5.21 % System time : 0.068 s
% 32.00/5.21 % Total time : 4.504 s
% 32.00/5.21 % Maximum resident set size: 3668 pages
% 32.00/5.21
% 32.00/5.21 % -------------------------------------------------
% 32.00/5.21 % User time : 4.438 s
% 32.00/5.21 % System time : 0.073 s
% 32.00/5.21 % Total time : 4.510 s
% 32.00/5.21 % Maximum resident set size: 4608 pages
% 32.00/5.21 % E exiting
%------------------------------------------------------------------------------