%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : FLD019-1 : TPTP v9.3.1. Bugfixed v2.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n012.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:41 PM UTC 2026
% Result : Unsatisfiable 0.49s 0.56s
% Output : CNFRefutation 0.49s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 14
% Syntax : Number of clauses : 68 ( 16 unt; 5 nHn; 68 RR)
% Number of literals : 152 ( 0 equ; 83 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 3 ( 1 avg)
% Number of predicates : 4 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 4 ( 4 usr; 2 con; 0-2 aty)
% Number of variables : 90 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(totality_of_order_relation,axiom,
( ~ defined(X2)
| ~ defined(X1)
| less_or_equal(X2,X1)
| less_or_equal(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',totality_of_order_relation) ).
cnf(well_definedness_of_additive_identity,axiom,
defined(additive_identity),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',well_definedness_of_additive_identity) ).
cnf(a_is_defined,hypothesis,
defined(a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_is_defined) ).
cnf(compatibility_of_equality_and_order_relation,axiom,
( ~ equalish(X3,X1)
| ~ less_or_equal(X3,X2)
| less_or_equal(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',compatibility_of_equality_and_order_relation) ).
cnf(symmetry_of_equality,axiom,
( ~ equalish(X2,X1)
| equalish(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',symmetry_of_equality) ).
cnf(transitivity_of_equality,axiom,
( ~ equalish(X3,X2)
| ~ equalish(X1,X3)
| equalish(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',transitivity_of_equality) ).
cnf(additive_inverse_equals_additive_identity_2,negated_conjecture,
equalish(additive_inverse(a),additive_identity),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',additive_inverse_equals_additive_identity_2) ).
cnf(existence_of_identity_addition,axiom,
( ~ defined(X1)
| equalish(add(additive_identity,X1),X1) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',existence_of_identity_addition) ).
cnf(existence_of_inverse_addition,axiom,
( ~ defined(X1)
| equalish(add(X1,additive_inverse(X1)),additive_identity) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',existence_of_inverse_addition) ).
cnf(compatibility_of_equality_and_addition,axiom,
( ~ equalish(X1,X3)
| ~ defined(X2)
| equalish(add(X1,X2),add(X3,X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',compatibility_of_equality_and_addition) ).
cnf(commutativity_addition,axiom,
( ~ defined(X2)
| ~ defined(X1)
| equalish(add(X1,X2),add(X2,X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',commutativity_addition) ).
cnf(well_definedness_of_additive_inverse,axiom,
( ~ defined(X1)
| defined(additive_inverse(X1)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',well_definedness_of_additive_inverse) ).
cnf(antisymmetry_of_order_relation,axiom,
( ~ less_or_equal(X2,X1)
| ~ less_or_equal(X1,X2)
| equalish(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',antisymmetry_of_order_relation) ).
cnf(a_not_equal_to_additive_identity_3,negated_conjecture,
~ equalish(a,additive_identity),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_not_equal_to_additive_identity_3) ).
cnf(c_0_14,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_15,plain,
( ~ defined(X2)
| ~ defined(X1)
| less_or_equal(X2,X1)
| less_or_equal(X1,X2) ),
c_0_14 ).
cnf(c_0_16,axiom,
defined(additive_identity),
well_definedness_of_additive_identity ).
cnf(c_0_17,hypothesis,
defined(a),
a_is_defined ).
cnf(c_0_18,plain,
( ~ equalish(X3,X1)
| ~ less_or_equal(X3,X2)
| less_or_equal(X1,X2) ),
inference(fof_simplification,[status(thm)],[compatibility_of_equality_and_order_relation]) ).
cnf(c_0_19,plain,
( ~ defined(X1)
| less_or_equal(additive_identity,X1)
| less_or_equal(X1,additive_identity) ),
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,plain,
( ~ equalish(X2,X1)
| equalish(X1,X2) ),
inference(fof_simplification,[status(thm)],[symmetry_of_equality]) ).
cnf(c_0_21,plain,
( ~ equalish(X3,X2)
| ~ equalish(X1,X3)
| equalish(X1,X2) ),
inference(fof_simplification,[status(thm)],[transitivity_of_equality]) ).
cnf(c_0_22,hypothesis,
( ~ defined(X1)
| less_or_equal(a,X1)
| less_or_equal(X1,a) ),
inference(spm,[status(thm)],[c_0_15,c_0_17]) ).
cnf(c_0_23,plain,
( ~ equalish(X3,X1)
| ~ less_or_equal(X3,X2)
| less_or_equal(X1,X2) ),
c_0_18 ).
cnf(c_0_24,plain,
less_or_equal(additive_identity,additive_identity),
inference(spm,[status(thm)],[c_0_19,c_0_16]) ).
cnf(c_0_25,plain,
( ~ equalish(X2,X1)
| equalish(X1,X2) ),
c_0_20 ).
cnf(c_0_26,negated_conjecture,
equalish(additive_inverse(a),additive_identity),
additive_inverse_equals_additive_identity_2 ).
cnf(c_0_27,plain,
( ~ equalish(X3,X2)
| ~ equalish(X1,X3)
| equalish(X1,X2) ),
c_0_21 ).
cnf(c_0_28,hypothesis,
less_or_equal(a,a),
inference(spm,[status(thm)],[c_0_22,c_0_17]) ).
cnf(c_0_29,plain,
( ~ defined(X1)
| equalish(add(additive_identity,X1),X1) ),
inference(fof_simplification,[status(thm)],[existence_of_identity_addition]) ).
cnf(c_0_30,plain,
( ~ equalish(additive_identity,X1)
| less_or_equal(X1,additive_identity) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_31,negated_conjecture,
equalish(additive_identity,additive_inverse(a)),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_32,negated_conjecture,
( ~ equalish(X1,additive_inverse(a))
| equalish(X1,additive_identity) ),
inference(spm,[status(thm)],[c_0_27,c_0_26]) ).
cnf(c_0_33,hypothesis,
( ~ equalish(a,X1)
| less_or_equal(X1,a) ),
inference(spm,[status(thm)],[c_0_23,c_0_28]) ).
cnf(c_0_34,plain,
( ~ defined(X1)
| equalish(add(additive_identity,X1),X1) ),
c_0_29 ).
cnf(c_0_35,plain,
( ~ equalish(X2,X1)
| ~ equalish(additive_identity,X2)
| less_or_equal(X1,additive_identity) ),
inference(spm,[status(thm)],[c_0_23,c_0_30]) ).
cnf(c_0_36,negated_conjecture,
( ~ equalish(X1,additive_identity)
| equalish(X1,additive_inverse(a)) ),
inference(spm,[status(thm)],[c_0_27,c_0_31]) ).
cnf(c_0_37,negated_conjecture,
equalish(additive_identity,additive_identity),
inference(spm,[status(thm)],[c_0_32,c_0_31]) ).
cnf(c_0_38,plain,
( ~ defined(X1)
| equalish(add(X1,additive_inverse(X1)),additive_identity) ),
inference(fof_simplification,[status(thm)],[existence_of_inverse_addition]) ).
cnf(c_0_39,hypothesis,
( ~ equalish(X2,X1)
| ~ equalish(a,X2)
| less_or_equal(X1,a) ),
inference(spm,[status(thm)],[c_0_23,c_0_33]) ).
cnf(c_0_40,plain,
( ~ defined(X1)
| equalish(X1,add(additive_identity,X1)) ),
inference(spm,[status(thm)],[c_0_25,c_0_34]) ).
cnf(c_0_41,plain,
( ~ equalish(X1,X3)
| ~ defined(X2)
| equalish(add(X1,X2),add(X3,X2)) ),
inference(fof_simplification,[status(thm)],[compatibility_of_equality_and_addition]) ).
cnf(c_0_42,negated_conjecture,
( ~ equalish(additive_inverse(a),X1)
| less_or_equal(X1,additive_identity) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37])]) ).
cnf(c_0_43,negated_conjecture,
( ~ equalish(X1,additive_identity)
| equalish(additive_inverse(a),X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_36]) ).
cnf(c_0_44,plain,
( ~ defined(X1)
| equalish(add(X1,additive_inverse(X1)),additive_identity) ),
c_0_38 ).
cnf(c_0_45,plain,
( ~ defined(X2)
| ~ defined(X1)
| equalish(add(X1,X2),add(X2,X1)) ),
inference(fof_simplification,[status(thm)],[commutativity_addition]) ).
cnf(c_0_46,plain,
( ~ defined(X1)
| defined(additive_inverse(X1)) ),
inference(fof_simplification,[status(thm)],[well_definedness_of_additive_inverse]) ).
cnf(c_0_47,hypothesis,
( ~ equalish(add(additive_identity,a),X1)
| less_or_equal(X1,a) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_17])]) ).
cnf(c_0_48,plain,
( ~ equalish(X1,X3)
| ~ defined(X2)
| equalish(add(X1,X2),add(X3,X2)) ),
c_0_41 ).
cnf(c_0_49,negated_conjecture,
( ~ equalish(X1,additive_identity)
| less_or_equal(X1,additive_identity) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
cnf(c_0_50,plain,
( ~ equalish(X1,add(X2,additive_inverse(X2)))
| ~ defined(X2)
| equalish(X1,additive_identity) ),
inference(spm,[status(thm)],[c_0_27,c_0_44]) ).
cnf(c_0_51,plain,
( ~ defined(X2)
| ~ defined(X1)
| equalish(add(X1,X2),add(X2,X1)) ),
c_0_45 ).
cnf(c_0_52,plain,
( ~ defined(X1)
| defined(additive_inverse(X1)) ),
c_0_46 ).
cnf(c_0_53,hypothesis,
( ~ equalish(additive_identity,X1)
| less_or_equal(add(X1,a),a) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_17])]) ).
cnf(c_0_54,negated_conjecture,
( ~ equalish(X2,X1)
| ~ equalish(X2,additive_identity)
| less_or_equal(X1,additive_identity) ),
inference(spm,[status(thm)],[c_0_23,c_0_49]) ).
cnf(c_0_55,plain,
( ~ defined(X1)
| equalish(add(additive_inverse(X1),X1),additive_identity) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_52]) ).
cnf(c_0_56,plain,
( ~ equalish(X1,add(additive_identity,X2))
| ~ defined(X2)
| equalish(X1,X2) ),
inference(spm,[status(thm)],[c_0_27,c_0_34]) ).
cnf(c_0_57,plain,
( ~ less_or_equal(X2,X1)
| ~ less_or_equal(X1,X2)
| equalish(X1,X2) ),
inference(fof_simplification,[status(thm)],[antisymmetry_of_order_relation]) ).
cnf(c_0_58,hypothesis,
( ~ equalish(additive_identity,X2)
| ~ equalish(add(X2,a),X1)
| less_or_equal(X1,a) ),
inference(spm,[status(thm)],[c_0_23,c_0_53]) ).
cnf(c_0_59,negated_conjecture,
~ equalish(a,additive_identity),
inference(fof_simplification,[status(thm)],[a_not_equal_to_additive_identity_3]) ).
cnf(c_0_60,negated_conjecture,
( ~ equalish(add(additive_inverse(X2),X2),X1)
| ~ defined(X2)
| less_or_equal(X1,additive_identity) ),
inference(spm,[status(thm)],[c_0_54,c_0_55]) ).
cnf(c_0_61,plain,
( ~ equalish(X1,additive_identity)
| ~ defined(X2)
| equalish(add(X1,X2),X2) ),
inference(spm,[status(thm)],[c_0_56,c_0_48]) ).
cnf(c_0_62,plain,
( ~ less_or_equal(X2,X1)
| ~ less_or_equal(X1,X2)
| equalish(X1,X2) ),
c_0_57 ).
cnf(c_0_63,hypothesis,
less_or_equal(additive_identity,a),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_55]),c_0_31]),c_0_17])]) ).
cnf(c_0_64,negated_conjecture,
~ equalish(a,additive_identity),
c_0_59 ).
cnf(c_0_65,negated_conjecture,
( ~ equalish(additive_inverse(X1),additive_identity)
| ~ defined(X1)
| less_or_equal(X1,additive_identity) ),
inference(spm,[status(thm)],[c_0_60,c_0_61]) ).
cnf(c_0_66,hypothesis,
~ less_or_equal(a,additive_identity),
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_64]) ).
cnf(c_0_67,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_65,c_0_43]),c_0_17]),c_0_37])]),c_0_66]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : FLD019-1 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.37 % Computer : n012.cluster.edu
% 0.09/0.37 % Model : x86_64 x86_64
% 0.09/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.37 % Memory : 8046.5625MB
% 0.09/0.37 % OS : Linux 6.8.0-71-generic
% 0.09/0.37 % CPULimit : 300
% 0.09/0.37 % WCLimit : 300
% 0.09/0.37 % DateTime : Mon Sep 21 15:37:51 UTC 2026
% 0.09/0.37 % CPUTime :
% 0.09/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.41 Running first-order theorem proving
% 0.09/0.41 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
% 0.49/0.56 % Version: 3.5.1
% 0.49/0.56 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.49/0.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.49/0.56 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.49/0.56 % Starting new_bool_3 with 300s (1) cores
% 0.49/0.56 % Starting new_bool_1 with 300s (1) cores
% 0.49/0.56 % Starting sh5l with 300s (1) cores
% 0.49/0.56 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2672575 completed with status 0
% 0.49/0.56 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.49/0.56 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.49/0.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.49/0.56 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.49/0.56 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.49/0.56 % No SInE strategy applied
% 0.49/0.56 % Search class: FGUNF-FFMS21-SFFFFFNN
% 0.49/0.56 % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 0.49/0.56 % Starting SubtermCWHack with 136s (1) cores
% 0.49/0.56 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.49/0.56 % Starting G-E--_208_C18_SOS_F1_SE_CS_SP_PS_S4c with 136s (1) cores
% 0.49/0.56 % Starting U----_206e_02_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.49/0.56 % Starting G-E--_208_C02CMA_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.49/0.56 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 2672580 completed with status 0
% 0.49/0.56 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.49/0.56 % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.49/0.56 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.49/0.56 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.49/0.56 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.49/0.56 % No SInE strategy applied
% 0.49/0.56 % Search class: FGUNF-FFMS21-SFFFFFNN
% 0.49/0.56 % Scheduled 8 strats onto 5 cores with 1500 seconds (1500 total)
% 0.49/0.56 % Starting SubtermCWHack with 136s (1) cores
% 0.49/0.56 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.49/0.56 % Preprocessing time : 0.001 s
% 0.49/0.56 % Presaturation interreduction done
% 0.49/0.56
% 0.49/0.56 % Proof found!
% 0.49/0.56 % SZS status Unsatisfiable
% 0.49/0.56 % SZS output start CNFRefutation
% See solution above
% 0.49/0.56 % Parsed axioms : 30
% 0.49/0.56 % Removed by relevancy pruning/SinE : 0
% 0.49/0.56 % Initial clauses : 30
% 0.49/0.56 % Removed in clause preprocessing : 0
% 0.49/0.56 % Initial clauses in saturation : 30
% 0.49/0.56 % Processed clauses : 1526
% 0.49/0.56 % ...of these trivial : 49
% 0.49/0.56 % ...subsumed : 893
% 0.49/0.56 % ...remaining for further processing : 584
% 0.49/0.56 % Other redundant clauses eliminated : 0
% 0.49/0.56 % Clauses deleted for lack of memory : 0
% 0.49/0.56 % Backward-subsumed : 77
% 0.49/0.56 % Backward-rewritten : 23
% 0.49/0.56 % Generated clauses : 6112
% 0.49/0.56 % ...of the previous two non-redundant : 4846
% 0.49/0.56 % ...aggressively subsumed : 0
% 0.49/0.56 % Contextual simplify-reflections : 4
% 0.49/0.56 % Paramodulations : 6112
% 0.49/0.56 % Factorizations : 0
% 0.49/0.56 % NegExts : 0
% 0.49/0.56 % Equation resolutions : 0
% 0.49/0.56 % Disequality decompositions : 0
% 0.49/0.56 % Total rewrite steps : 2843
% 0.49/0.56 % ...of those cached : 2779
% 0.49/0.56 % Propositional unsat checks : 0
% 0.49/0.56 % Propositional check models : 0
% 0.49/0.56 % Propositional check unsatisfiable : 0
% 0.49/0.56 % Propositional clauses : 0
% 0.49/0.56 % Propositional clauses after purity: 0
% 0.49/0.56 % Propositional unsat core size : 0
% 0.49/0.56 % Propositional preprocessing time : 0.000
% 0.49/0.56 % Propositional encoding time : 0.000
% 0.49/0.56 % Propositional solver time : 0.000
% 0.49/0.56 % Success case prop preproc time : 0.000
% 0.49/0.56 % Success case prop encoding time : 0.000
% 0.49/0.56 % Success case prop solver time : 0.000
% 0.49/0.56 % Current number of processed clauses : 454
% 0.49/0.56 % Positive orientable unit clauses : 67
% 0.49/0.56 % Positive unorientable unit clauses: 0
% 0.49/0.56 % Negative unit clauses : 4
% 0.49/0.56 % Non-unit-clauses : 383
% 0.49/0.56 % Current number of unprocessed clauses: 3332
% 0.49/0.56 % ...number of literals in the above : 11201
% 0.49/0.56 % Current number of archived formulas : 0
% 0.49/0.56 % Current number of archived clauses : 130
% 0.49/0.56 % Clause-clause subsumption calls (NU) : 20412
% 0.49/0.56 % Rec. Clause-clause subsumption calls : 17503
% 0.49/0.56 % Non-unit clause-clause subsumptions : 889
% 0.49/0.56 % Unit Clause-clause subsumption calls : 427
% 0.49/0.56 % Rewrite failures with RHS unbound : 0
% 0.49/0.56 % BW rewrite match attempts : 13
% 0.49/0.56 % BW rewrite match successes : 13
% 0.49/0.56 % Condensation attempts : 0
% 0.49/0.56 % Condensation successes : 0
% 0.49/0.56 % Termbank termtop insertions : 76485
% 0.49/0.56 % Search garbage collected termcells : 71
% 0.49/0.56
% 0.49/0.56 % -------------------------------------------------
% 0.49/0.56 % User time : 0.108 s
% 0.49/0.56 % System time : 0.003 s
% 0.49/0.56 % Total time : 0.112 s
% 0.49/0.56 % Maximum resident set size: 3660 pages
% 0.49/0.56
% 0.49/0.56 % -------------------------------------------------
% 0.49/0.56 % User time : 0.455 s
% 0.49/0.56 % System time : 0.030 s
% 0.49/0.56 % Total time : 0.485 s
% 0.49/0.56 % Maximum resident set size: 4864 pages
% 0.49/0.56 % E exiting
%------------------------------------------------------------------------------