%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SEU361+2 : 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 : n003.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:51 PM UTC 2026
% Result : Theorem 13.35s 2.53s
% Output : CNFRefutation 13.35s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 8
% Syntax : Number of formulae : 38 ( 11 unt; 0 def)
% Number of atoms : 165 ( 10 equ)
% Maximal formula atoms : 30 ( 4 avg)
% Number of connectives : 207 ( 80 ~; 74 |; 32 &)
% ( 2 <=>; 19 =>; 0 <=; 0 <~>)
% Maximal formula depth : 15 ( 5 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 13 ( 11 usr; 1 prp; 0-3 aty)
% Number of functors : 8 ( 8 usr; 3 con; 0-3 aty)
% Number of variables : 54 ( 2 sgn 35 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(t44_yellow_0,conjecture,
! [X1] :
( ( rel_str(X1)
& lower_bounded_relstr(X1)
& antisymmetric_relstr(X1)
& ~ empty_carrier(X1) )
=> ! [X2] :
( element(X2,the_carrier(X1))
=> related(X1,bottom_of_relstr(X1),X2) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t44_yellow_0) ).
fof(t42_yellow_0,lemma,
! [X1] :
( ( rel_str(X1)
& lower_bounded_relstr(X1)
& antisymmetric_relstr(X1)
& ~ empty_carrier(X1) )
=> ( ex_inf_of_relstr_set(X1,the_carrier(X1))
& ex_sup_of_relstr_set(X1,empty_set) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t42_yellow_0) ).
fof(d9_yellow_0,axiom,
! [X1] :
( rel_str(X1)
=> ! [X2,X3] :
( element(X3,the_carrier(X1))
=> ( ex_sup_of_relstr_set(X1,X2)
=> ( X3 = join_on_relstr(X1,X2)
<=> ( ! [X4] :
( element(X4,the_carrier(X1))
=> ( relstr_set_smaller(X1,X2,X4)
=> related(X1,X3,X4) ) )
& relstr_set_smaller(X1,X2,X3) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d9_yellow_0) ).
fof(dt_k1_yellow_0,axiom,
! [X1,X2] :
( rel_str(X1)
=> element(join_on_relstr(X1,X2),the_carrier(X1)) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',dt_k1_yellow_0) ).
fof(d9_lattice3,axiom,
! [X1] :
( rel_str(X1)
=> ! [X2,X3] :
( element(X3,the_carrier(X1))
=> ( relstr_set_smaller(X1,X2,X3)
<=> ! [X4] :
( element(X4,the_carrier(X1))
=> ( in(X4,X2)
=> related(X1,X4,X3) ) ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d9_lattice3) ).
fof(t7_boole,axiom,
! [X1,X2] :
~ ( empty(X2)
& in(X1,X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',t7_boole) ).
fof(d11_yellow_0,axiom,
! [X1] :
( rel_str(X1)
=> bottom_of_relstr(X1) = join_on_relstr(X1,empty_set) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d11_yellow_0) ).
fof(fc1_xboole_0,axiom,
empty(empty_set),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',fc1_xboole_0) ).
fof(c_0_8,negated_conjecture,
~ ! [X1] :
( ( rel_str(X1)
& lower_bounded_relstr(X1)
& antisymmetric_relstr(X1)
& ~ empty_carrier(X1) )
=> ! [X2] :
( element(X2,the_carrier(X1))
=> related(X1,bottom_of_relstr(X1),X2) ) ),
inference(assume_negation,[status(cth)],[t44_yellow_0]) ).
fof(c_0_9,lemma,
! [X1] :
( ( rel_str(X1)
& lower_bounded_relstr(X1)
& antisymmetric_relstr(X1)
& ~ empty_carrier(X1) )
=> ( ex_inf_of_relstr_set(X1,the_carrier(X1))
& ex_sup_of_relstr_set(X1,empty_set) ) ),
inference(fof_simplification,[status(thm)],[t42_yellow_0]) ).
fof(c_0_10,negated_conjecture,
~ ! [X1] :
( ( rel_str(X1)
& lower_bounded_relstr(X1)
& antisymmetric_relstr(X1)
& ~ empty_carrier(X1) )
=> ! [X2] :
( element(X2,the_carrier(X1))
=> related(X1,bottom_of_relstr(X1),X2) ) ),
inference(fof_simplification,[status(thm)],[c_0_8]) ).
fof(c_0_11,plain,
! [X38,X39,X40,X41] :
( ( ~ rel_str(X38)
| ~ element(X40,the_carrier(X38))
| ~ ex_sup_of_relstr_set(X38,X39)
| X40 = join_on_relstr(X38,X39)
| ~ relstr_set_smaller(X38,X39,X40)
| ~ related(X38,X40,esk6_3(X38,X39,X40)) )
& ( ~ rel_str(X38)
| ~ element(X40,the_carrier(X38))
| ~ ex_sup_of_relstr_set(X38,X39)
| X40 = join_on_relstr(X38,X39)
| ~ relstr_set_smaller(X38,X39,X40)
| relstr_set_smaller(X38,X39,esk6_3(X38,X39,X40)) )
& ( ~ rel_str(X38)
| ~ element(X40,the_carrier(X38))
| ~ ex_sup_of_relstr_set(X38,X39)
| X40 = join_on_relstr(X38,X39)
| ~ relstr_set_smaller(X38,X39,X40)
| element(esk6_3(X38,X39,X40),the_carrier(X38)) )
& ( ~ rel_str(X38)
| ~ element(X40,the_carrier(X38))
| ~ ex_sup_of_relstr_set(X38,X39)
| X40 != join_on_relstr(X38,X39)
| related(X38,X40,X41)
| ~ relstr_set_smaller(X38,X39,X41)
| ~ element(X41,the_carrier(X38)) )
& ( ~ rel_str(X38)
| ~ element(X40,the_carrier(X38))
| ~ ex_sup_of_relstr_set(X38,X39)
| X40 != join_on_relstr(X38,X39)
| relstr_set_smaller(X38,X39,X40) ) ),
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)],[d9_yellow_0])])])])])]) ).
fof(c_0_12,plain,
! [X43,X44] :
( element(join_on_relstr(X43,X44),the_carrier(X43))
| ~ rel_str(X43) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_k1_yellow_0])])]) ).
fof(c_0_13,lemma,
! [X37] :
( ( ~ rel_str(X37)
| ~ lower_bounded_relstr(X37)
| ~ antisymmetric_relstr(X37)
| empty_carrier(X37)
| ex_inf_of_relstr_set(X37,the_carrier(X37)) )
& ( ~ rel_str(X37)
| ~ lower_bounded_relstr(X37)
| ~ antisymmetric_relstr(X37)
| empty_carrier(X37)
| ex_sup_of_relstr_set(X37,empty_set) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])])]) ).
fof(c_0_14,negated_conjecture,
( ~ related(esk1_0,bottom_of_relstr(esk1_0),esk2_0)
& element(esk2_0,the_carrier(esk1_0))
& rel_str(esk1_0)
& lower_bounded_relstr(esk1_0)
& antisymmetric_relstr(esk1_0)
& ~ empty_carrier(esk1_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])])]) ).
fof(c_0_15,plain,
! [X216,X217,X218,X219] :
( ( ~ rel_str(X216)
| ~ element(X218,the_carrier(X216))
| relstr_set_smaller(X216,X217,X218)
| ~ related(X216,esk64_3(X216,X217,X218),X218) )
& ( ~ rel_str(X216)
| ~ element(X218,the_carrier(X216))
| relstr_set_smaller(X216,X217,X218)
| in(esk64_3(X216,X217,X218),X217) )
& ( ~ rel_str(X216)
| ~ element(X218,the_carrier(X216))
| relstr_set_smaller(X216,X217,X218)
| element(esk64_3(X216,X217,X218),the_carrier(X216)) )
& ( ~ rel_str(X216)
| ~ element(X218,the_carrier(X216))
| related(X216,X219,X218)
| ~ in(X219,X217)
| ~ element(X219,the_carrier(X216))
| ~ relstr_set_smaller(X216,X217,X218) ) ),
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)],[d9_lattice3])])])])])]) ).
cnf(c_0_16,plain,
( ~ rel_str(X2)
| ~ element(X4,the_carrier(X2))
| ~ ex_sup_of_relstr_set(X2,X3)
| X4 != join_on_relstr(X2,X3)
| ~ relstr_set_smaller(X2,X3,X1)
| ~ element(X1,the_carrier(X2))
| related(X2,X4,X1) ),
inference(split_conjunct,[status(thm)],[c_0_11]) ).
cnf(c_0_17,plain,
( ~ rel_str(X1)
| element(join_on_relstr(X1,X2),the_carrier(X1)) ),
inference(split_conjunct,[status(thm)],[c_0_12]) ).
cnf(c_0_18,lemma,
( ~ rel_str(X1)
| ~ lower_bounded_relstr(X1)
| ~ antisymmetric_relstr(X1)
| empty_carrier(X1)
| ex_sup_of_relstr_set(X1,empty_set) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_19,negated_conjecture,
lower_bounded_relstr(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_20,negated_conjecture,
antisymmetric_relstr(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_21,negated_conjecture,
rel_str(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_22,negated_conjecture,
~ empty_carrier(esk1_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_23,plain,
! [X280,X281] :
( ~ empty(X281)
| ~ in(X280,X281) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t7_boole])])]) ).
cnf(c_0_24,plain,
( ~ rel_str(X1)
| ~ element(X3,the_carrier(X1))
| relstr_set_smaller(X1,X2,X3)
| in(esk64_3(X1,X2,X3),X2) ),
inference(split_conjunct,[status(thm)],[c_0_15]) ).
cnf(c_0_25,negated_conjecture,
element(esk2_0,the_carrier(esk1_0)),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_26,plain,
! [X26] :
( bottom_of_relstr(X26) = join_on_relstr(X26,empty_set)
| ~ rel_str(X26) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[d11_yellow_0])])]) ).
cnf(c_0_27,plain,
( ~ rel_str(X1)
| ~ element(X3,the_carrier(X1))
| ~ ex_sup_of_relstr_set(X1,X2)
| ~ relstr_set_smaller(X1,X2,X3)
| related(X1,join_on_relstr(X1,X2),X3) ),
inference(csr,[status(thm)],[inference(er,[status(thm)],[c_0_16]),c_0_17]) ).
cnf(c_0_28,negated_conjecture,
ex_sup_of_relstr_set(esk1_0,empty_set),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]),c_0_21])]),c_0_22]) ).
cnf(c_0_29,plain,
( ~ empty(X2)
| ~ in(X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_23]) ).
cnf(c_0_30,negated_conjecture,
( in(esk64_3(esk1_0,X1,esk2_0),X1)
| relstr_set_smaller(esk1_0,X1,esk2_0) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_21])]) ).
cnf(c_0_31,negated_conjecture,
~ related(esk1_0,bottom_of_relstr(esk1_0),esk2_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_32,plain,
( ~ rel_str(X1)
| bottom_of_relstr(X1) = join_on_relstr(X1,empty_set) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_33,negated_conjecture,
( ~ element(X1,the_carrier(esk1_0))
| ~ relstr_set_smaller(esk1_0,empty_set,X1)
| related(esk1_0,join_on_relstr(esk1_0,empty_set),X1) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_21])]) ).
cnf(c_0_34,negated_conjecture,
( ~ empty(X1)
| relstr_set_smaller(esk1_0,X1,esk2_0) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_35,plain,
empty(empty_set),
inference(split_conjunct,[status(thm)],[fc1_xboole_0]) ).
cnf(c_0_36,negated_conjecture,
~ related(esk1_0,join_on_relstr(esk1_0,empty_set),esk2_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_21])]) ).
cnf(c_0_37,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_25]),c_0_35])]),c_0_36]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SEU361+2 : TPTP v9.3.1. Released v3.3.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.37 % Computer : n003.cluster.edu
% 0.12/0.37 % Model : x86_64 x86_64
% 0.12/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.37 % Memory : 8046.5625MB
% 0.12/0.37 % OS : Linux 6.8.0-71-generic
% 0.12/0.37 % CPULimit : 300
% 0.12/0.38 % WCLimit : 300
% 0.12/0.38 % DateTime : Mon Sep 21 06:17:00 UTC 2026
% 0.12/0.38 % CPUTime :
% 0.12/0.38 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.16/0.42 Running first-order theorem proving
% 0.16/0.42 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
% 13.35/2.53 % Version: 3.5.1
% 13.35/2.53 % Preprocessing class: FSLMSMSSSSSNFFN.
% 13.35/2.53 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 13.35/2.53 % Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 13.35/2.53 % Starting new_bool_3 with 600s (2) cores
% 13.35/2.53 % Starting new_bool_1 with 600s (2) cores
% 13.35/2.53 % Starting sh5l with 300s (1) cores
% 13.35/2.53 % new_bool_1 with pid 3590529 completed with status 0
% 13.35/2.53 % Result found by new_bool_1
% 13.35/2.53 % Preprocessing class: FSLMSMSSSSSNFFN.
% 13.35/2.53 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 13.35/2.53 % Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 13.35/2.53 % Starting new_bool_3 with 600s (2) cores
% 13.35/2.53 % Starting new_bool_1 with 600s (2) cores
% 13.35/2.53 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 13.35/2.53 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 13.35/2.53 % Search class: FGHSM-FMLM32-MFFFFFNN
% 13.35/2.53 % partial match(1): FGHSM-SMLM32-MFFFFFNN
% 13.35/2.53 % Scheduled 13 strats onto 2 cores with 600 seconds (600 total)
% 13.35/2.53 % Starting SubtermCWHack with 55s (1) cores
% 13.35/2.53 % Starting new_bool_1 with 61s (1) cores
% 13.35/2.53 % new_bool_1 with pid 3590534 completed with status 0
% 13.35/2.53 % Result found by new_bool_1
% 13.35/2.53 % Preprocessing class: FSLMSMSSSSSNFFN.
% 13.35/2.53 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 13.35/2.53 % Starting G-E--_208_B07_F1_S5PRR_SE_CS_SP_PS_S0Y with 900s (3) cores
% 13.35/2.53 % Starting new_bool_3 with 600s (2) cores
% 13.35/2.53 % Starting new_bool_1 with 600s (2) cores
% 13.35/2.53 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 13.35/2.53 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 13.35/2.53 % Search class: FGHSM-FMLM32-MFFFFFNN
% 13.35/2.53 % partial match(1): FGHSM-SMLM32-MFFFFFNN
% 13.35/2.53 % Scheduled 13 strats onto 2 cores with 600 seconds (600 total)
% 13.35/2.53 % Starting SubtermCWHack with 55s (1) cores
% 13.35/2.53 % Starting new_bool_1 with 61s (1) cores
% 13.35/2.53 % Preprocessing time : 0.012 s
% 13.35/2.53 % Presaturation interreduction done
% 13.35/2.53
% 13.35/2.53 % Proof found!
% 13.35/2.53 % SZS status Theorem
% 13.35/2.53 % SZS output start CNFRefutation
% See solution above
% 13.35/2.53 % Parsed axioms : 687
% 13.35/2.53 % Removed by relevancy pruning/SinE : 571
% 13.35/2.53 % Initial clauses : 988
% 13.35/2.53 % Removed in clause preprocessing : 2
% 13.35/2.53 % Initial clauses in saturation : 986
% 13.35/2.53 % Processed clauses : 9508
% 13.35/2.53 % ...of these trivial : 40
% 13.35/2.53 % ...subsumed : 5762
% 13.35/2.53 % ...remaining for further processing : 3706
% 13.35/2.53 % Other redundant clauses eliminated : 1072
% 13.35/2.53 % Clauses deleted for lack of memory : 0
% 13.35/2.53 % Backward-subsumed : 116
% 13.35/2.53 % Backward-rewritten : 438
% 13.35/2.53 % Generated clauses : 58598
% 13.35/2.53 % ...of the previous two non-redundant : 55715
% 13.35/2.53 % ...aggressively subsumed : 0
% 13.35/2.53 % Contextual simplify-reflections : 241
% 13.35/2.53 % Paramodulations : 57649
% 13.35/2.53 % Factorizations : 4
% 13.35/2.53 % NegExts : 0
% 13.35/2.53 % Equation resolutions : 1074
% 13.35/2.53 % Disequality decompositions : 0
% 13.35/2.53 % Total rewrite steps : 9150
% 13.35/2.53 % ...of those cached : 8777
% 13.35/2.53 % Propositional unsat checks : 0
% 13.35/2.53 % Propositional check models : 0
% 13.35/2.53 % Propositional check unsatisfiable : 0
% 13.35/2.53 % Propositional clauses : 0
% 13.35/2.53 % Propositional clauses after purity: 0
% 13.35/2.53 % Propositional unsat core size : 0
% 13.35/2.53 % Propositional preprocessing time : 0.000
% 13.35/2.53 % Propositional encoding time : 0.000
% 13.35/2.53 % Propositional solver time : 0.000
% 13.35/2.53 % Success case prop preproc time : 0.000
% 13.35/2.53 % Success case prop encoding time : 0.000
% 13.35/2.53 % Success case prop solver time : 0.000
% 13.35/2.53 % Current number of processed clauses : 1891
% 13.35/2.53 % Positive orientable unit clauses : 122
% 13.35/2.53 % Positive unorientable unit clauses: 0
% 13.35/2.53 % Negative unit clauses : 154
% 13.35/2.53 % Non-unit-clauses : 1615
% 13.35/2.53 % Current number of unprocessed clauses: 47674
% 13.35/2.53 % ...number of literals in the above : 254485
% 13.35/2.53 % Current number of archived formulas : 0
% 13.35/2.53 % Current number of archived clauses : 1479
% 13.35/2.53 % Clause-clause subsumption calls (NU) : 1274408
% 13.35/2.53 % Rec. Clause-clause subsumption calls : 249441
% 13.35/2.53 % Non-unit clause-clause subsumptions : 3942
% 13.35/2.53 % Unit Clause-clause subsumption calls : 18791
% 13.35/2.53 % Rewrite failures with RHS unbound : 0
% 13.35/2.53 % BW rewrite match attempts : 547
% 13.35/2.53 % BW rewrite match successes : 43
% 13.35/2.53 % Condensation attempts : 0
% 13.35/2.53 % Condensation successes : 0
% 13.35/2.53 % Termbank termtop insertions : 1147681
% 13.35/2.53 % Search garbage collected termcells : 16524
% 13.35/2.53
% 13.35/2.53 % -------------------------------------------------
% 13.35/2.53 % User time : 1.820 s
% 13.35/2.53 % System time : 0.051 s
% 13.35/2.53 % Total time : 1.871 s
% 13.35/2.53 % Maximum resident set size: 6584 pages
% 13.35/2.53
% 13.35/2.53 % -------------------------------------------------
% 13.35/2.53 % User time : 3.502 s
% 13.35/2.53 % System time : 0.101 s
% 13.35/2.53 % Total time : 3.603 s
% 13.35/2.53 % Maximum resident set size: 5632 pages
% 13.35/2.53 % E exiting
%------------------------------------------------------------------------------