%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : GEO526+1 : TPTP v9.3.1. Released v7.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n016.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:30:19 PM UTC 2026
% Result : Theorem 7.02s 6.40s
% Output : CNFRefutation 7.02s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 10
% Syntax : Number of formulae : 55 ( 21 unt; 0 def)
% Number of atoms : 128 ( 18 equ)
% Maximal formula atoms : 7 ( 2 avg)
% Number of connectives : 139 ( 66 ~; 64 |; 9 &)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 14 ( 5 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-4 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 138 ( 0 sgn 104 !; 0 ?)
% Comments :
%------------------------------------------------------------------------------
fof(aSatz10_12c,conjecture,
! [X12,X15,X14,X20,X22] :
( X14 = X22
| X15 != midpoint(X14,X22)
| s_e(X12,X14,X20,X22)
| ~ s_e(X15,X14,X15,X22)
| ~ s_e(X12,X15,X20,X15)
| ~ s_r(X20,X15,X22)
| ~ s_r(X12,X15,X14) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',aSatz10_12c) ).
fof(aSatz7_6,axiom,
! [X13,X12,X16] :
( X16 = s(X12,X13)
| ~ s_m(X13,X12,X16) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',aSatz7_6) ).
fof(aSatz8_22,axiom,
! [X12,X15] : s_m(X12,midpoint(X12,X15),X15),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',aSatz8_22) ).
fof(aSatz8_4,axiom,
! [X12,X15,X14] :
( s_r(X12,X15,s(X15,X14))
| ~ s_r(X12,X15,X14) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',aSatz8_4) ).
fof(d_Defn8_1,axiom,
! [X12,X15,X14] :
( ( ~ s_e(X12,X14,X12,s(X15,X14))
| s_r(X12,X15,X14) )
& ( s_e(X12,X14,X12,s(X15,X14))
| ~ s_r(X12,X15,X14) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d_Defn8_1) ).
fof(aSatz7_7,axiom,
! [X12,X13] : s(X12,s(X12,X13)) = X13,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',aSatz7_7) ).
fof(aSatz10_12b,axiom,
! [X12,X15,X14,X20] :
( s_e(X12,X14,X20,X14)
| ~ s_e(X12,X15,X20,X15)
| ~ s_r(X20,X15,X14)
| ~ s_r(X12,X15,X14) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',aSatz10_12b) ).
fof(aSatz2_4,axiom,
! [X12,X15,X14,X17] :
( s_e(X15,X12,X14,X17)
| ~ s_e(X12,X15,X14,X17) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',aSatz2_4) ).
fof(aA2,axiom,
! [X1,X2,X3,X4,X5,X6] :
( s_e(X3,X4,X5,X6)
| ~ s_e(X1,X2,X5,X6)
| ~ s_e(X1,X2,X3,X4) ),
file('/export/starexec/sandbox/benchmark/Axioms/GEO011+0.ax',aA2) ).
fof(aSatz2_2,axiom,
! [X12,X15,X14,X17] :
( s_e(X14,X17,X12,X15)
| ~ s_e(X12,X15,X14,X17) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',aSatz2_2) ).
fof(c_0_10,negated_conjecture,
~ ! [X12,X15,X14,X20,X22] :
( X14 = X22
| X15 != midpoint(X14,X22)
| s_e(X12,X14,X20,X22)
| ~ s_e(X15,X14,X15,X22)
| ~ s_e(X12,X15,X20,X15)
| ~ s_r(X20,X15,X22)
| ~ s_r(X12,X15,X14) ),
inference(assume_negation,[status(cth)],[aSatz10_12c]) ).
fof(c_0_11,negated_conjecture,
~ ! [X12,X15,X14,X20,X22] :
( X14 = X22
| X15 != midpoint(X14,X22)
| s_e(X12,X14,X20,X22)
| ~ s_e(X15,X14,X15,X22)
| ~ s_e(X12,X15,X20,X15)
| ~ s_r(X20,X15,X22)
| ~ s_r(X12,X15,X14) ),
inference(fof_simplification,[status(thm)],[c_0_10]) ).
fof(c_0_12,plain,
! [X13,X12,X16] :
( X16 = s(X12,X13)
| ~ s_m(X13,X12,X16) ),
inference(fof_simplification,[status(thm)],[aSatz7_6]) ).
fof(c_0_13,plain,
! [X605,X606] : s_m(X605,midpoint(X605,X606),X606),
inference(variable_rename,[status(thm)],[aSatz8_22]) ).
fof(c_0_14,negated_conjecture,
( esk3_0 != esk5_0
& esk2_0 = midpoint(esk3_0,esk5_0)
& ~ s_e(esk1_0,esk3_0,esk4_0,esk5_0)
& s_e(esk2_0,esk3_0,esk2_0,esk5_0)
& s_e(esk1_0,esk2_0,esk4_0,esk2_0)
& s_r(esk4_0,esk2_0,esk5_0)
& s_r(esk1_0,esk2_0,esk3_0) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])]) ).
fof(c_0_15,plain,
! [X12,X15,X14] :
( s_r(X12,X15,s(X15,X14))
| ~ s_r(X12,X15,X14) ),
inference(fof_simplification,[status(thm)],[aSatz8_4]) ).
fof(c_0_16,plain,
! [X411,X412,X413] :
( X413 = s(X412,X411)
| ~ s_m(X411,X412,X413) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_12])]) ).
cnf(c_0_17,plain,
s_m(X1,midpoint(X1,X2),X2),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
cnf(c_0_18,negated_conjecture,
esk2_0 = midpoint(esk3_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_19,plain,
! [X12,X15,X14] :
( ( ~ s_e(X12,X14,X12,s(X15,X14))
| s_r(X12,X15,X14) )
& ( s_e(X12,X14,X12,s(X15,X14))
| ~ s_r(X12,X15,X14) ) ),
inference(fof_simplification,[status(thm)],[d_Defn8_1]) ).
fof(c_0_20,plain,
! [X497,X498,X499] :
( s_r(X497,X498,s(X498,X499))
| ~ s_r(X497,X498,X499) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_15])]) ).
cnf(c_0_21,plain,
( ~ s_m(X1,X2,X3)
| X3 = s(X2,X1) ),
inference(split_conjunct,[status(thm)],[c_0_16]) ).
cnf(c_0_22,negated_conjecture,
s_m(esk3_0,esk2_0,esk5_0),
inference(spm,[status(thm)],[c_0_17,c_0_18]) ).
fof(c_0_23,plain,
! [X414,X415] : s(X414,s(X414,X415)) = X415,
inference(variable_rename,[status(thm)],[aSatz7_7]) ).
fof(c_0_24,plain,
! [X12,X15,X14,X20] :
( s_e(X12,X14,X20,X14)
| ~ s_e(X12,X15,X20,X15)
| ~ s_r(X20,X15,X14)
| ~ s_r(X12,X15,X14) ),
inference(fof_simplification,[status(thm)],[aSatz10_12b]) ).
fof(c_0_25,plain,
! [X12,X15,X14,X17] :
( s_e(X15,X12,X14,X17)
| ~ s_e(X12,X15,X14,X17) ),
inference(fof_simplification,[status(thm)],[aSatz2_4]) ).
fof(c_0_26,plain,
! [X905,X906,X907] :
( ( ~ s_e(X905,X907,X905,s(X906,X907))
| s_r(X905,X906,X907) )
& ( s_e(X905,X907,X905,s(X906,X907))
| ~ s_r(X905,X906,X907) ) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_19])]) ).
cnf(c_0_27,plain,
( ~ s_r(X1,X2,X3)
| s_r(X1,X2,s(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_20]) ).
cnf(c_0_28,negated_conjecture,
s_r(esk1_0,esk2_0,esk3_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_29,negated_conjecture,
s(esk2_0,esk3_0) = esk5_0,
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_30,plain,
s(X1,s(X1,X2)) = X2,
inference(split_conjunct,[status(thm)],[c_0_23]) ).
fof(c_0_31,plain,
! [X841,X842,X843,X844] :
( s_e(X841,X843,X844,X843)
| ~ s_e(X841,X842,X844,X842)
| ~ s_r(X844,X842,X843)
| ~ s_r(X841,X842,X843) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_24])]) ).
fof(c_0_32,plain,
! [X1,X2,X3,X4,X5,X6] :
( s_e(X3,X4,X5,X6)
| ~ s_e(X1,X2,X5,X6)
| ~ s_e(X1,X2,X3,X4) ),
inference(fof_simplification,[status(thm)],[aA2]) ).
fof(c_0_33,plain,
! [X89,X90,X91,X92] :
( s_e(X90,X89,X91,X92)
| ~ s_e(X89,X90,X91,X92) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_25])]) ).
cnf(c_0_34,plain,
( ~ s_r(X1,X2,X3)
| s_e(X1,X3,X1,s(X2,X3)) ),
inference(split_conjunct,[status(thm)],[c_0_26]) ).
cnf(c_0_35,negated_conjecture,
s_r(esk1_0,esk2_0,esk5_0),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]) ).
cnf(c_0_36,negated_conjecture,
s(esk2_0,esk5_0) = esk3_0,
inference(spm,[status(thm)],[c_0_30,c_0_29]) ).
cnf(c_0_37,plain,
( ~ s_e(X1,X2,X4,X2)
| ~ s_r(X4,X2,X3)
| ~ s_r(X1,X2,X3)
| s_e(X1,X3,X4,X3) ),
inference(split_conjunct,[status(thm)],[c_0_31]) ).
cnf(c_0_38,negated_conjecture,
s_r(esk4_0,esk2_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_39,plain,
! [X49,X50,X51,X52,X53,X54] :
( s_e(X51,X52,X53,X54)
| ~ s_e(X49,X50,X53,X54)
| ~ s_e(X49,X50,X51,X52) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_32])]) ).
cnf(c_0_40,plain,
( ~ s_e(X1,X2,X3,X4)
| s_e(X2,X1,X3,X4) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
cnf(c_0_41,negated_conjecture,
s_e(esk1_0,esk5_0,esk1_0,esk3_0),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36]) ).
cnf(c_0_42,negated_conjecture,
( ~ s_e(X1,esk2_0,esk4_0,esk2_0)
| ~ s_r(X1,esk2_0,esk5_0)
| s_e(X1,esk5_0,esk4_0,esk5_0) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_43,negated_conjecture,
s_e(esk1_0,esk2_0,esk4_0,esk2_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
fof(c_0_44,plain,
! [X12,X15,X14,X17] :
( s_e(X14,X17,X12,X15)
| ~ s_e(X12,X15,X14,X17) ),
inference(fof_simplification,[status(thm)],[aSatz2_2]) ).
cnf(c_0_45,plain,
( ~ s_e(X1,X2,X5,X6)
| ~ s_e(X1,X2,X3,X4)
| s_e(X3,X4,X5,X6) ),
inference(split_conjunct,[status(thm)],[c_0_39]) ).
cnf(c_0_46,negated_conjecture,
s_e(esk5_0,esk1_0,esk1_0,esk3_0),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
cnf(c_0_47,negated_conjecture,
s_e(esk1_0,esk5_0,esk4_0,esk5_0),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_35]),c_0_43])]) ).
fof(c_0_48,plain,
! [X79,X80,X81,X82] :
( s_e(X81,X82,X79,X80)
| ~ s_e(X79,X80,X81,X82) ),
inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_44])]) ).
cnf(c_0_49,negated_conjecture,
( ~ s_e(esk5_0,esk1_0,X1,X2)
| s_e(X1,X2,esk1_0,esk3_0) ),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_50,negated_conjecture,
s_e(esk5_0,esk1_0,esk4_0,esk5_0),
inference(spm,[status(thm)],[c_0_40,c_0_47]) ).
cnf(c_0_51,plain,
( ~ s_e(X1,X2,X3,X4)
| s_e(X3,X4,X1,X2) ),
inference(split_conjunct,[status(thm)],[c_0_48]) ).
cnf(c_0_52,negated_conjecture,
s_e(esk4_0,esk5_0,esk1_0,esk3_0),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_53,negated_conjecture,
~ s_e(esk1_0,esk3_0,esk4_0,esk5_0),
inference(split_conjunct,[status(thm)],[c_0_14]) ).
cnf(c_0_54,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_51,c_0_52]),c_0_53]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GEO526+1 : TPTP v9.3.1. Released v7.0.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/5.40 % Computer : n016.cluster.edu
% 0.13/5.40 % Model : x86_64 x86_64
% 0.13/5.40 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/5.40 % Memory : 8046.5625MB
% 0.13/5.40 % OS : Linux 6.8.0-71-generic
% 0.13/5.40 % CPULimit : 300
% 0.13/5.40 % WCLimit : 300
% 0.13/5.40 % DateTime : Sun Sep 20 18:02:58 UTC 2026
% 0.13/5.40 % CPUTime :
% 0.13/5.40 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/5.45 Running first-order theorem proving
% 0.13/5.45 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
% 7.02/6.40 % Version: 3.5.1
% 7.02/6.40 % Preprocessing class: FSLSSMSMSSSNFFN.
% 7.02/6.40 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 7.02/6.40 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 7.02/6.40 % Starting new_bool_3 with 300s (1) cores
% 7.02/6.40 % Starting new_bool_1 with 300s (1) cores
% 7.02/6.40 % Starting sh5l with 300s (1) cores
% 7.02/6.40 % C07_19_nc_SOS_SAT001_MinMin_p005000_rr with pid 486414 completed with status 0
% 7.02/6.40 % Result found by C07_19_nc_SOS_SAT001_MinMin_p005000_rr
% 7.02/6.40 % Preprocessing class: FSLSSMSMSSSNFFN.
% 7.02/6.40 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 7.02/6.40 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 7.02/6.40 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 7.02/6.40 % No SInE strategy applied
% 7.02/6.40 % Search class: FGHSM-FSLS33-MFFFFFNN
% 7.02/6.40 % partial match(1): FGHSM-FSLM33-MFFFFFNN
% 7.02/6.40 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 7.02/6.40 % Starting SubtermCWHack with 136s (1) cores
% 7.02/6.40 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 7.02/6.40 % Starting new_bool_3 with 393s (1) cores
% 7.02/6.40 % Starting G-E--_303_C18_F1_URBAN_S0Y with 330s (1) cores
% 7.02/6.40 % Starting Y1006__C12_02_nc_F1_AE_CS_SP_S2S with 136s (1) cores
% 7.02/6.40 % new_bool_3 with pid 486423 completed with status 0
% 7.02/6.40 % Result found by new_bool_3
% 7.02/6.40 % Preprocessing class: FSLSSMSMSSSNFFN.
% 7.02/6.40 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 7.02/6.40 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 7.02/6.40 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 7.02/6.40 % No SInE strategy applied
% 7.02/6.40 % Search class: FGHSM-FSLS33-MFFFFFNN
% 7.02/6.40 % partial match(1): FGHSM-FSLM33-MFFFFFNN
% 7.02/6.40 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 7.02/6.40 % Starting SubtermCWHack with 136s (1) cores
% 7.02/6.40 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 151s (1) cores
% 7.02/6.40 % Starting new_bool_3 with 393s (1) cores
% 7.02/6.40 % Preprocessing time : 0.006 s
% 7.02/6.40 % Presaturation interreduction done
% 7.02/6.40
% 7.02/6.40 % Proof found!
% 7.02/6.40 % SZS status Theorem
% 7.02/6.40 % SZS output start CNFRefutation
% See solution above
% 7.02/6.40 % Parsed axioms : 210
% 7.02/6.40 % Removed by relevancy pruning/SinE : 0
% 7.02/6.40 % Initial clauses : 307
% 7.02/6.40 % Removed in clause preprocessing : 1
% 7.02/6.40 % Initial clauses in saturation : 306
% 7.02/6.40 % Processed clauses : 5419
% 7.02/6.40 % ...of these trivial : 974
% 7.02/6.40 % ...subsumed : 1017
% 7.02/6.40 % ...remaining for further processing : 3428
% 7.02/6.40 % Other redundant clauses eliminated : 65
% 7.02/6.40 % Clauses deleted for lack of memory : 0
% 7.02/6.40 % Backward-subsumed : 57
% 7.02/6.40 % Backward-rewritten : 134
% 7.02/6.40 % Generated clauses : 26254
% 7.02/6.40 % ...of the previous two non-redundant : 22438
% 7.02/6.40 % ...aggressively subsumed : 0
% 7.02/6.40 % Contextual simplify-reflections : 4
% 7.02/6.40 % Paramodulations : 26183
% 7.02/6.40 % Factorizations : 2
% 7.02/6.40 % NegExts : 0
% 7.02/6.40 % Equation resolutions : 69
% 7.02/6.40 % Disequality decompositions : 0
% 7.02/6.40 % Total rewrite steps : 6584
% 7.02/6.40 % ...of those cached : 5352
% 7.02/6.40 % Propositional unsat checks : 0
% 7.02/6.40 % Propositional check models : 0
% 7.02/6.40 % Propositional check unsatisfiable : 0
% 7.02/6.40 % Propositional clauses : 0
% 7.02/6.40 % Propositional clauses after purity: 0
% 7.02/6.40 % Propositional unsat core size : 0
% 7.02/6.40 % Propositional preprocessing time : 0.000
% 7.02/6.40 % Propositional encoding time : 0.000
% 7.02/6.40 % Propositional solver time : 0.000
% 7.02/6.40 % Success case prop preproc time : 0.000
% 7.02/6.40 % Success case prop encoding time : 0.000
% 7.02/6.40 % Success case prop solver time : 0.000
% 7.02/6.40 % Current number of processed clauses : 2941
% 7.02/6.40 % Positive orientable unit clauses : 794
% 7.02/6.40 % Positive unorientable unit clauses: 1
% 7.02/6.40 % Negative unit clauses : 114
% 7.02/6.40 % Non-unit-clauses : 2032
% 7.02/6.40 % Current number of unprocessed clauses: 17399
% 7.02/6.40 % ...number of literals in the above : 52921
% 7.02/6.40 % Current number of archived formulas : 0
% 7.02/6.40 % Current number of archived clauses : 469
% 7.02/6.40 % Clause-clause subsumption calls (NU) : 459363
% 7.02/6.40 % Rec. Clause-clause subsumption calls : 370361
% 7.02/6.40 % Non-unit clause-clause subsumptions : 968
% 7.02/6.40 % Unit Clause-clause subsumption calls : 46370
% 7.02/6.40 % Rewrite failures with RHS unbound : 0
% 7.02/6.40 % BW rewrite match attempts : 7106
% 7.02/6.40 % BW rewrite match successes : 47
% 7.02/6.40 % Condensation attempts : 0
% 7.02/6.40 % Condensation successes : 0
% 7.02/6.40 % Termbank termtop insertions : 471617
% 7.02/6.40 % Search garbage collected termcells : 2611
% 7.02/6.40
% 7.02/6.40 % -------------------------------------------------
% 7.02/6.40 % User time : 0.871 s
% 7.02/6.40 % System time : 0.036 s
% 7.02/6.40 % Total time : 0.907 s
% 7.02/6.40 % Maximum resident set size: 5300 pages
% 7.02/6.40
% 7.02/6.40 % -------------------------------------------------
% 7.02/6.40 % User time : 3.924 s
% 7.02/6.40 % System time : 0.154 s
% 7.02/6.40 % Total time : 4.078 s
% 7.02/6.40 % Maximum resident set size: 4864 pages
% 7.02/6.40 % E exiting
%------------------------------------------------------------------------------