%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : FLD013-3 : TPTP v9.3.1. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n015.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:22:40 PM UTC 2026
% Result : Unsatisfiable 0.90s 0.56s
% Output : CNFRefutation 0.90s
% Verified :
% SZS Type : Refutation
% Derivation depth : 11
% Number of leaves : 17
% Syntax : Number of clauses : 69 ( 27 unt; 3 nHn; 69 RR)
% Number of literals : 156 ( 0 equ; 88 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-3 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 115 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(compatibility_of_order_relation_and_addition,axiom,
( ~ sum(X4,X5,X2)
| ~ sum(X3,X5,X1)
| ~ less_or_equal(X3,X4)
| less_or_equal(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',compatibility_of_order_relation_and_addition) ).
cnf(totality_of_order_relation,axiom,
( ~ defined(X2)
| ~ defined(X1)
| less_or_equal(X2,X1)
| less_or_equal(X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',totality_of_order_relation) ).
cnf(existence_of_identity_addition,axiom,
( ~ defined(X1)
| sum(additive_identity,X1,X1) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',existence_of_identity_addition) ).
cnf(sum_6,negated_conjecture,
sum(additive_identity,c,d),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sum_6) ).
cnf(sum_5,negated_conjecture,
sum(additive_identity,a,b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sum_5) ).
cnf(well_definedness_of_additive_identity,axiom,
defined(additive_identity),
file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',well_definedness_of_additive_identity) ).
cnf(antisymmetry_of_order_relation,axiom,
( ~ less_or_equal(X2,X1)
| ~ less_or_equal(X1,X2)
| sum(additive_identity,X1,X2) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',antisymmetry_of_order_relation) ).
cnf(c_is_defined,hypothesis,
defined(c),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',c_is_defined) ).
cnf(a_is_defined,hypothesis,
defined(a),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',a_is_defined) ).
cnf(commutativity_addition,axiom,
( ~ sum(X2,X1,X3)
| sum(X1,X2,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',commutativity_addition) ).
cnf(associativity_addition_2,axiom,
( ~ sum(X4,X6,X3)
| ~ sum(X5,X2,X6)
| ~ sum(X4,X5,X1)
| sum(X1,X2,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',associativity_addition_2) ).
cnf(associativity_addition_1,axiom,
( ~ sum(X5,X6,X3)
| ~ sum(X4,X6,X2)
| ~ sum(X1,X4,X5)
| sum(X1,X2,X3) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',associativity_addition_1) ).
cnf(totality_of_addition,axiom,
( ~ defined(X2)
| ~ defined(X1)
| sum(X1,X2,add(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',totality_of_addition) ).
cnf(b_is_defined,hypothesis,
defined(b),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',b_is_defined) ).
cnf(not_sum_7,negated_conjecture,
~ sum(a,c,add(d,b)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_sum_7) ).
cnf(d_is_defined,hypothesis,
defined(d),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',d_is_defined) ).
cnf(well_definedness_of_addition,axiom,
( ~ defined(X2)
| ~ defined(X1)
| defined(add(X1,X2)) ),
file('/export/starexec/sandbox/benchmark/Axioms/FLD002-0.ax',well_definedness_of_addition) ).
cnf(c_0_17,plain,
( ~ sum(X4,X5,X2)
| ~ sum(X3,X5,X1)
| ~ less_or_equal(X3,X4)
| less_or_equal(X1,X2) ),
inference(fof_simplification,[status(thm)],[compatibility_of_order_relation_and_addition]) ).
cnf(c_0_18,plain,
( ~ defined(X2)
| ~ defined(X1)
| less_or_equal(X2,X1)
| less_or_equal(X1,X2) ),
inference(fof_simplification,[status(thm)],[totality_of_order_relation]) ).
cnf(c_0_19,plain,
( ~ defined(X1)
| sum(additive_identity,X1,X1) ),
inference(fof_simplification,[status(thm)],[existence_of_identity_addition]) ).
cnf(c_0_20,plain,
( ~ sum(X4,X5,X2)
| ~ sum(X3,X5,X1)
| ~ less_or_equal(X3,X4)
| less_or_equal(X1,X2) ),
c_0_17 ).
cnf(c_0_21,negated_conjecture,
sum(additive_identity,c,d),
sum_6 ).
cnf(c_0_22,plain,
( ~ defined(X2)
| ~ defined(X1)
| less_or_equal(X2,X1)
| less_or_equal(X1,X2) ),
c_0_18 ).
cnf(c_0_23,negated_conjecture,
sum(additive_identity,a,b),
sum_5 ).
cnf(c_0_24,plain,
( ~ defined(X1)
| sum(additive_identity,X1,X1) ),
c_0_19 ).
cnf(c_0_25,negated_conjecture,
( ~ sum(X2,c,X1)
| ~ less_or_equal(X2,additive_identity)
| less_or_equal(X1,d) ),
inference(spm,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_26,plain,
( ~ defined(X1)
| less_or_equal(X1,X1) ),
inference(ef,[status(thm)],[c_0_22]) ).
cnf(c_0_27,axiom,
defined(additive_identity),
well_definedness_of_additive_identity ).
cnf(c_0_28,negated_conjecture,
( ~ sum(X2,a,X1)
| ~ less_or_equal(X2,additive_identity)
| less_or_equal(X1,b) ),
inference(spm,[status(thm)],[c_0_20,c_0_23]) ).
cnf(c_0_29,plain,
( ~ sum(X3,X2,X1)
| ~ defined(X2)
| ~ less_or_equal(X3,additive_identity)
| less_or_equal(X1,X2) ),
inference(spm,[status(thm)],[c_0_20,c_0_24]) ).
cnf(c_0_30,plain,
( ~ less_or_equal(X2,X1)
| ~ less_or_equal(X1,X2)
| sum(additive_identity,X1,X2) ),
inference(fof_simplification,[status(thm)],[antisymmetry_of_order_relation]) ).
cnf(c_0_31,negated_conjecture,
( ~ sum(additive_identity,c,X1)
| less_or_equal(X1,d) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_27])]) ).
cnf(c_0_32,hypothesis,
defined(c),
c_is_defined ).
cnf(c_0_33,negated_conjecture,
( ~ sum(additive_identity,a,X1)
| less_or_equal(X1,b) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_26]),c_0_27])]) ).
cnf(c_0_34,hypothesis,
defined(a),
a_is_defined ).
cnf(c_0_35,plain,
( ~ sum(additive_identity,X2,X1)
| ~ defined(X2)
| less_or_equal(X1,X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_26]),c_0_27])]) ).
cnf(c_0_36,plain,
( ~ sum(X2,X1,X3)
| sum(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[commutativity_addition]) ).
cnf(c_0_37,plain,
( ~ less_or_equal(X2,X1)
| ~ less_or_equal(X1,X2)
| sum(additive_identity,X1,X2) ),
c_0_30 ).
cnf(c_0_38,negated_conjecture,
less_or_equal(c,d),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_24]),c_0_32])]) ).
cnf(c_0_39,plain,
( ~ sum(X4,X6,X3)
| ~ sum(X5,X2,X6)
| ~ sum(X4,X5,X1)
| sum(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[associativity_addition_2]) ).
cnf(c_0_40,negated_conjecture,
less_or_equal(a,b),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_24]),c_0_34])]) ).
cnf(c_0_41,negated_conjecture,
less_or_equal(b,a),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_23]),c_0_34])]) ).
cnf(c_0_42,plain,
( ~ sum(X5,X6,X3)
| ~ sum(X4,X6,X2)
| ~ sum(X1,X4,X5)
| sum(X1,X2,X3) ),
inference(fof_simplification,[status(thm)],[associativity_addition_1]) ).
cnf(c_0_43,plain,
( ~ sum(X2,X1,X3)
| sum(X1,X2,X3) ),
c_0_36 ).
cnf(c_0_44,negated_conjecture,
( ~ less_or_equal(d,c)
| sum(additive_identity,d,c) ),
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_45,negated_conjecture,
less_or_equal(d,c),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_21]),c_0_32])]) ).
cnf(c_0_46,plain,
( ~ sum(X4,X6,X3)
| ~ sum(X5,X2,X6)
| ~ sum(X4,X5,X1)
| sum(X1,X2,X3) ),
c_0_39 ).
cnf(c_0_47,negated_conjecture,
sum(additive_identity,b,a),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_40]),c_0_41])]) ).
cnf(c_0_48,plain,
( ~ defined(X2)
| ~ defined(X1)
| sum(X1,X2,add(X1,X2)) ),
inference(fof_simplification,[status(thm)],[totality_of_addition]) ).
cnf(c_0_49,plain,
( ~ sum(X5,X6,X3)
| ~ sum(X4,X6,X2)
| ~ sum(X1,X4,X5)
| sum(X1,X2,X3) ),
c_0_42 ).
cnf(c_0_50,plain,
( ~ defined(X1)
| sum(X1,additive_identity,X1) ),
inference(spm,[status(thm)],[c_0_43,c_0_24]) ).
cnf(c_0_51,negated_conjecture,
sum(additive_identity,d,c),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_45])]) ).
cnf(c_0_52,plain,
( ~ sum(X4,X2,X3)
| ~ sum(X4,additive_identity,X1)
| ~ defined(X2)
| sum(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_46,c_0_24]) ).
cnf(c_0_53,negated_conjecture,
sum(b,additive_identity,a),
inference(spm,[status(thm)],[c_0_43,c_0_47]) ).
cnf(c_0_54,plain,
( ~ defined(X2)
| ~ defined(X1)
| sum(X1,X2,add(X1,X2)) ),
c_0_48 ).
cnf(c_0_55,plain,
( ~ sum(X1,X4,X3)
| ~ sum(X4,additive_identity,X2)
| ~ defined(X3)
| sum(X1,X2,X3) ),
inference(spm,[status(thm)],[c_0_49,c_0_50]) ).
cnf(c_0_56,negated_conjecture,
sum(d,additive_identity,c),
inference(spm,[status(thm)],[c_0_43,c_0_51]) ).
cnf(c_0_57,negated_conjecture,
( ~ sum(b,X1,X2)
| ~ defined(X1)
| sum(a,X1,X2) ),
inference(spm,[status(thm)],[c_0_52,c_0_53]) ).
cnf(c_0_58,plain,
( ~ defined(X2)
| ~ defined(X1)
| sum(X1,X2,add(X2,X1)) ),
inference(spm,[status(thm)],[c_0_43,c_0_54]) ).
cnf(c_0_59,hypothesis,
defined(b),
b_is_defined ).
cnf(c_0_60,negated_conjecture,
~ sum(a,c,add(d,b)),
inference(fof_simplification,[status(thm)],[not_sum_7]) ).
cnf(c_0_61,negated_conjecture,
( ~ sum(X1,d,X2)
| ~ defined(X2)
| sum(X1,c,X2) ),
inference(spm,[status(thm)],[c_0_55,c_0_56]) ).
cnf(c_0_62,negated_conjecture,
( ~ defined(X1)
| sum(a,X1,add(X1,b)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_59])]) ).
cnf(c_0_63,hypothesis,
defined(d),
d_is_defined ).
cnf(c_0_64,negated_conjecture,
~ sum(a,c,add(d,b)),
c_0_60 ).
cnf(c_0_65,plain,
( ~ defined(X2)
| ~ defined(X1)
| defined(add(X1,X2)) ),
inference(fof_simplification,[status(thm)],[well_definedness_of_addition]) ).
cnf(c_0_66,negated_conjecture,
~ defined(add(d,b)),
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_63])]),c_0_64]) ).
cnf(c_0_67,plain,
( ~ defined(X2)
| ~ defined(X1)
| defined(add(X1,X2)) ),
c_0_65 ).
cnf(c_0_68,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_67]),c_0_59]),c_0_63])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : FLD013-3 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.36 % Computer : n015.cluster.edu
% 0.12/0.36 % Model : x86_64 x86_64
% 0.12/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.36 % Memory : 8046.5625MB
% 0.12/0.36 % OS : Linux 6.8.0-71-generic
% 0.12/0.36 % CPULimit : 300
% 0.12/0.36 % WCLimit : 300
% 0.12/0.36 % DateTime : Mon Sep 21 15:40:36 UTC 2026
% 0.12/0.36 % CPUTime :
% 0.12/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/0.41 Running first-order theorem proving
% 0.15/0.41 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
% 0.90/0.56 % Version: 3.5.1
% 0.90/0.56 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.90/0.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.90/0.56 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.90/0.56 % Starting new_bool_3 with 300s (1) cores
% 0.90/0.56 % Starting new_bool_1 with 300s (1) cores
% 0.90/0.56 % Starting sh5l with 300s (1) cores
% 0.90/0.56 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1811198 completed with status 0
% 0.90/0.56 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.90/0.56 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.90/0.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.90/0.56 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.90/0.56 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.90/0.56 % No SInE strategy applied
% 0.90/0.56 % Search class: FGUNF-FFMM21-SFFFFFNN
% 0.90/0.56 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.90/0.56 % Starting SubtermCWHack with 136s (1) cores
% 0.90/0.56 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.90/0.56 % Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S2S with 296s (1) cores
% 0.90/0.56 % Starting new_bool_3 with 269s (1) cores
% 0.90/0.56 % Starting G-E--_107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S08BN with 136s (1) cores
% 0.90/0.56 % H----_102_C18_F1_PI_AE_CS_SP_PS_S2S with pid 1811206 completed with status 0
% 0.90/0.56 % Result found by H----_102_C18_F1_PI_AE_CS_SP_PS_S2S
% 0.90/0.56 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.90/0.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.90/0.56 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.90/0.56 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.90/0.56 % No SInE strategy applied
% 0.90/0.56 % Search class: FGUNF-FFMM21-SFFFFFNN
% 0.90/0.56 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.90/0.56 % Starting SubtermCWHack with 136s (1) cores
% 0.90/0.56 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.90/0.56 % Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S2S with 296s (1) cores
% 0.90/0.56 % Preprocessing time : 0.002 s
% 0.90/0.56 % Presaturation interreduction done
% 0.90/0.56
% 0.90/0.56 % Proof found!
% 0.90/0.56 % SZS status Unsatisfiable
% 0.90/0.56 % SZS output start CNFRefutation
% See solution above
% 0.90/0.56 % Parsed axioms : 33
% 0.90/0.56 % Removed by relevancy pruning/SinE : 0
% 0.90/0.56 % Initial clauses : 33
% 0.90/0.56 % Removed in clause preprocessing : 0
% 0.90/0.56 % Initial clauses in saturation : 33
% 0.90/0.56 % Processed clauses : 1047
% 0.90/0.56 % ...of these trivial : 68
% 0.90/0.56 % ...subsumed : 318
% 0.90/0.56 % ...remaining for further processing : 661
% 0.90/0.56 % Other redundant clauses eliminated : 0
% 0.90/0.56 % Clauses deleted for lack of memory : 0
% 0.90/0.56 % Backward-subsumed : 0
% 0.90/0.56 % Backward-rewritten : 24
% 0.90/0.56 % Generated clauses : 5493
% 0.90/0.56 % ...of the previous two non-redundant : 4387
% 0.90/0.56 % ...aggressively subsumed : 0
% 0.90/0.56 % Contextual simplify-reflections : 0
% 0.90/0.56 % Paramodulations : 5481
% 0.90/0.56 % Factorizations : 12
% 0.90/0.56 % NegExts : 0
% 0.90/0.56 % Equation resolutions : 0
% 0.90/0.56 % Disequality decompositions : 0
% 0.90/0.56 % Total rewrite steps : 3407
% 0.90/0.56 % ...of those cached : 3241
% 0.90/0.56 % Propositional unsat checks : 0
% 0.90/0.56 % Propositional check models : 0
% 0.90/0.56 % Propositional check unsatisfiable : 0
% 0.90/0.56 % Propositional clauses : 0
% 0.90/0.56 % Propositional clauses after purity: 0
% 0.90/0.56 % Propositional unsat core size : 0
% 0.90/0.56 % Propositional preprocessing time : 0.000
% 0.90/0.56 % Propositional encoding time : 0.000
% 0.90/0.56 % Propositional solver time : 0.000
% 0.90/0.56 % Success case prop preproc time : 0.000
% 0.90/0.56 % Success case prop encoding time : 0.000
% 0.90/0.56 % Success case prop solver time : 0.000
% 0.90/0.56 % Current number of processed clauses : 604
% 0.90/0.56 % Positive orientable unit clauses : 189
% 0.90/0.56 % Positive unorientable unit clauses: 0
% 0.90/0.56 % Negative unit clauses : 3
% 0.90/0.56 % Non-unit-clauses : 412
% 0.90/0.56 % Current number of unprocessed clauses: 3406
% 0.90/0.56 % ...number of literals in the above : 10202
% 0.90/0.56 % Current number of archived formulas : 0
% 0.90/0.56 % Current number of archived clauses : 57
% 0.90/0.56 % Clause-clause subsumption calls (NU) : 8241
% 0.90/0.56 % Rec. Clause-clause subsumption calls : 6772
% 0.90/0.56 % Non-unit clause-clause subsumptions : 318
% 0.90/0.56 % Unit Clause-clause subsumption calls : 1009
% 0.90/0.56 % Rewrite failures with RHS unbound : 0
% 0.90/0.56 % BW rewrite match attempts : 81
% 0.90/0.56 % BW rewrite match successes : 24
% 0.90/0.56 % Condensation attempts : 0
% 0.90/0.56 % Condensation successes : 0
% 0.90/0.56 % Termbank termtop insertions : 70133
% 0.90/0.56 % Search garbage collected termcells : 116
% 0.90/0.56
% 0.90/0.56 % -------------------------------------------------
% 0.90/0.56 % User time : 0.108 s
% 0.90/0.56 % System time : 0.013 s
% 0.90/0.56 % Total time : 0.121 s
% 0.90/0.56 % Maximum resident set size: 3660 pages
% 0.90/0.56
% 0.90/0.56 % -------------------------------------------------
% 0.90/0.56 % User time : 0.570 s
% 0.90/0.56 % System time : 0.042 s
% 0.90/0.56 % Total time : 0.613 s
% 0.90/0.56 % Maximum resident set size: 4864 pages
% 0.90/0.56 % E exiting
%------------------------------------------------------------------------------