%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : FLD016-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 : n005.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:23:08 PM UTC 2026
% Result : Unsatisfiable 25.53s 4.32s
% Output : CNFRefutation 25.53s
% Verified :
% SZS Type : Refutation
% Derivation depth : 18
% Number of leaves : 15
% Syntax : Number of clauses : 68 ( 20 unt; 0 nHn; 68 RR)
% Number of literals : 159 ( 0 equ; 94 neg)
% Maximal clause size : 4 ( 2 avg)
% Maximal term depth : 4 ( 1 avg)
% Number of predicates : 3 ( 2 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 5 con; 0-2 aty)
% Number of variables : 98 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
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(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(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(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(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(associativity_addition,axiom,
( ~ defined(X3)
| ~ defined(X2)
| ~ defined(X1)
| equalish(add(X1,add(X2,X3)),add(add(X1,X2),X3)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',associativity_addition) ).
cnf(well_definedness_of_addition,axiom,
( ~ defined(X2)
| ~ defined(X1)
| defined(add(X1,X2)) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',well_definedness_of_addition) ).
cnf(symmetry_of_equality,axiom,
( ~ equalish(X2,X1)
| equalish(X1,X2) ),
file('/export/starexec/sandbox2/benchmark/Axioms/FLD001-0.ax',symmetry_of_equality) ).
cnf(add_equals_b_5,negated_conjecture,
equalish(add(a,u),b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',add_equals_b_5) ).
cnf(add_equals_b_6,negated_conjecture,
equalish(add(a,v),b),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',add_equals_b_6) ).
cnf(u_is_defined,hypothesis,
defined(u),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',u_is_defined) ).
cnf(a_is_defined,hypothesis,
defined(a),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',a_is_defined) ).
cnf(v_is_defined,hypothesis,
defined(v),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',v_is_defined) ).
cnf(u_not_equal_to_v_7,negated_conjecture,
~ equalish(u,v),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',u_not_equal_to_v_7) ).
cnf(c_0_15,plain,
( ~ equalish(X3,X2)
| ~ equalish(X1,X3)
| equalish(X1,X2) ),
inference(fof_simplification,[status(thm)],[transitivity_of_equality]) ).
cnf(c_0_16,plain,
( ~ defined(X1)
| equalish(add(additive_identity,X1),X1) ),
inference(fof_simplification,[status(thm)],[existence_of_identity_addition]) ).
cnf(c_0_17,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_18,plain,
( ~ defined(X1)
| equalish(add(X1,additive_inverse(X1)),additive_identity) ),
inference(fof_simplification,[status(thm)],[existence_of_inverse_addition]) ).
cnf(c_0_19,plain,
( ~ equalish(X3,X2)
| ~ equalish(X1,X3)
| equalish(X1,X2) ),
c_0_15 ).
cnf(c_0_20,plain,
( ~ defined(X1)
| equalish(add(additive_identity,X1),X1) ),
c_0_16 ).
cnf(c_0_21,plain,
( ~ equalish(X1,X3)
| ~ defined(X2)
| equalish(add(X1,X2),add(X3,X2)) ),
c_0_17 ).
cnf(c_0_22,plain,
( ~ defined(X1)
| equalish(add(X1,additive_inverse(X1)),additive_identity) ),
c_0_18 ).
cnf(c_0_23,plain,
( ~ equalish(X1,add(additive_identity,X2))
| ~ defined(X2)
| equalish(X1,X2) ),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_24,plain,
( ~ defined(X1)
| ~ defined(X2)
| equalish(add(add(X1,additive_inverse(X1)),X2),add(additive_identity,X2)) ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_25,plain,
( ~ defined(X2)
| ~ defined(X1)
| equalish(add(X1,X2),add(X2,X1)) ),
inference(fof_simplification,[status(thm)],[commutativity_addition]) ).
cnf(c_0_26,plain,
( ~ defined(X1)
| ~ defined(X2)
| equalish(add(add(X1,additive_inverse(X1)),X2),X2) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_27,plain,
( ~ defined(X2)
| ~ defined(X1)
| equalish(add(X1,X2),add(X2,X1)) ),
c_0_25 ).
cnf(c_0_28,plain,
( ~ defined(X1)
| defined(additive_inverse(X1)) ),
inference(fof_simplification,[status(thm)],[well_definedness_of_additive_inverse]) ).
cnf(c_0_29,plain,
( ~ equalish(X1,add(add(X3,additive_inverse(X3)),X2))
| ~ defined(X3)
| ~ defined(X2)
| equalish(X1,X2) ),
inference(spm,[status(thm)],[c_0_19,c_0_26]) ).
cnf(c_0_30,plain,
( ~ defined(X1)
| ~ defined(X2)
| ~ defined(X3)
| equalish(add(add(X1,X2),X3),add(add(X2,X1),X3)) ),
inference(spm,[status(thm)],[c_0_21,c_0_27]) ).
cnf(c_0_31,plain,
( ~ defined(X1)
| defined(additive_inverse(X1)) ),
c_0_28 ).
cnf(c_0_32,plain,
( ~ defined(X1)
| ~ defined(X2)
| equalish(add(add(additive_inverse(X1),X1),X2),X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]) ).
cnf(c_0_33,plain,
( ~ defined(X3)
| ~ defined(X2)
| ~ defined(X1)
| equalish(add(X1,add(X2,X3)),add(add(X1,X2),X3)) ),
inference(fof_simplification,[status(thm)],[associativity_addition]) ).
cnf(c_0_34,plain,
( ~ equalish(X1,add(add(additive_inverse(X3),X3),X2))
| ~ defined(X3)
| ~ defined(X2)
| equalish(X1,X2) ),
inference(spm,[status(thm)],[c_0_19,c_0_32]) ).
cnf(c_0_35,plain,
( ~ defined(X3)
| ~ defined(X2)
| ~ defined(X1)
| equalish(add(X1,add(X2,X3)),add(add(X1,X2),X3)) ),
c_0_33 ).
cnf(c_0_36,plain,
( ~ defined(X2)
| ~ defined(X1)
| defined(add(X1,X2)) ),
inference(fof_simplification,[status(thm)],[well_definedness_of_addition]) ).
cnf(c_0_37,plain,
( ~ defined(X1)
| ~ defined(X2)
| equalish(add(additive_inverse(X1),add(X1,X2)),X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_31]) ).
cnf(c_0_38,plain,
( ~ equalish(X1,add(X3,X2))
| ~ defined(X3)
| ~ defined(X2)
| equalish(X1,add(X2,X3)) ),
inference(spm,[status(thm)],[c_0_19,c_0_27]) ).
cnf(c_0_39,plain,
( ~ defined(X2)
| ~ defined(X1)
| defined(add(X1,X2)) ),
c_0_36 ).
cnf(c_0_40,plain,
( ~ equalish(X1,add(additive_inverse(X3),add(X3,X2)))
| ~ defined(X3)
| ~ defined(X2)
| equalish(X1,X2) ),
inference(spm,[status(thm)],[c_0_19,c_0_37]) ).
cnf(c_0_41,plain,
( ~ defined(X1)
| ~ defined(X2)
| ~ defined(X3)
| equalish(add(X1,add(X2,X3)),add(X3,add(X1,X2))) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_35]),c_0_39]) ).
cnf(c_0_42,plain,
( ~ equalish(X2,X1)
| equalish(X1,X2) ),
inference(fof_simplification,[status(thm)],[symmetry_of_equality]) ).
cnf(c_0_43,plain,
( ~ defined(X1)
| ~ defined(X2)
| equalish(add(X1,add(X2,additive_inverse(X1))),X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_31]) ).
cnf(c_0_44,plain,
( ~ equalish(X2,X1)
| equalish(X1,X2) ),
c_0_42 ).
cnf(c_0_45,plain,
( ~ equalish(X1,add(X3,add(X2,additive_inverse(X3))))
| ~ defined(X3)
| ~ defined(X2)
| equalish(X1,X2) ),
inference(spm,[status(thm)],[c_0_19,c_0_43]) ).
cnf(c_0_46,plain,
( ~ defined(X1)
| ~ defined(X2)
| ~ defined(X3)
| equalish(add(add(X1,X2),X3),add(X1,add(X2,X3))) ),
inference(spm,[status(thm)],[c_0_44,c_0_35]) ).
cnf(c_0_47,negated_conjecture,
equalish(add(a,u),b),
add_equals_b_5 ).
cnf(c_0_48,negated_conjecture,
equalish(add(a,v),b),
add_equals_b_6 ).
cnf(c_0_49,plain,
( ~ defined(X1)
| ~ defined(X2)
| equalish(add(add(X1,X2),additive_inverse(X1)),X2) ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_31]) ).
cnf(c_0_50,negated_conjecture,
equalish(b,add(a,u)),
inference(spm,[status(thm)],[c_0_44,c_0_47]) ).
cnf(c_0_51,negated_conjecture,
equalish(b,add(a,v)),
inference(spm,[status(thm)],[c_0_44,c_0_48]) ).
cnf(c_0_52,plain,
( ~ equalish(X1,add(add(X3,X2),additive_inverse(X3)))
| ~ defined(X3)
| ~ defined(X2)
| equalish(X1,X2) ),
inference(spm,[status(thm)],[c_0_19,c_0_49]) ).
cnf(c_0_53,negated_conjecture,
( ~ defined(X1)
| equalish(add(b,X1),add(add(a,u),X1)) ),
inference(spm,[status(thm)],[c_0_21,c_0_50]) ).
cnf(c_0_54,hypothesis,
defined(u),
u_is_defined ).
cnf(c_0_55,hypothesis,
defined(a),
a_is_defined ).
cnf(c_0_56,negated_conjecture,
( ~ defined(X1)
| equalish(add(b,X1),add(add(a,v),X1)) ),
inference(spm,[status(thm)],[c_0_21,c_0_51]) ).
cnf(c_0_57,hypothesis,
defined(v),
v_is_defined ).
cnf(c_0_58,negated_conjecture,
( ~ defined(additive_inverse(a))
| equalish(add(b,additive_inverse(a)),u) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_54]),c_0_55])]) ).
cnf(c_0_59,negated_conjecture,
( ~ defined(additive_inverse(a))
| equalish(add(b,additive_inverse(a)),v) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_56]),c_0_57]),c_0_55])]) ).
cnf(c_0_60,negated_conjecture,
equalish(add(b,additive_inverse(a)),u),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_31]),c_0_55])]) ).
cnf(c_0_61,negated_conjecture,
equalish(add(b,additive_inverse(a)),v),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_31]),c_0_55])]) ).
cnf(c_0_62,negated_conjecture,
( ~ equalish(X1,add(b,additive_inverse(a)))
| equalish(X1,u) ),
inference(spm,[status(thm)],[c_0_19,c_0_60]) ).
cnf(c_0_63,negated_conjecture,
equalish(v,add(b,additive_inverse(a))),
inference(spm,[status(thm)],[c_0_44,c_0_61]) ).
cnf(c_0_64,negated_conjecture,
~ equalish(u,v),
inference(fof_simplification,[status(thm)],[u_not_equal_to_v_7]) ).
cnf(c_0_65,negated_conjecture,
equalish(v,u),
inference(spm,[status(thm)],[c_0_62,c_0_63]) ).
cnf(c_0_66,negated_conjecture,
~ equalish(u,v),
c_0_64 ).
cnf(c_0_67,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_65]),c_0_66]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : FLD016-1 : TPTP v9.3.1. Bugfixed v2.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.36 % Computer : n005.cluster.edu
% 0.10/0.36 % Model : x86_64 x86_64
% 0.10/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.36 % Memory : 8046.5625MB
% 0.10/0.36 % OS : Linux 6.8.0-71-generic
% 0.10/0.36 % CPULimit : 300
% 0.10/0.36 % WCLimit : 300
% 0.10/0.36 % DateTime : Mon Sep 21 15:37:02 UTC 2026
% 0.15/0.37 % CPUTime :
% 0.15/0.37 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.43 Running first-order theorem proving
% 0.15/0.43 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
% 25.53/4.32 % Version: 3.5.1
% 25.53/4.32 % Preprocessing class: FSMSSMSSSSSNFFN.
% 25.53/4.32 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 25.53/4.32 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 25.53/4.32 % Starting new_bool_3 with 300s (1) cores
% 25.53/4.32 % Starting new_bool_1 with 300s (1) cores
% 25.53/4.32 % Starting sh5l with 300s (1) cores
% 25.53/4.32 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 3843970 completed with status 0
% 25.53/4.32 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 25.53/4.32 % Preprocessing class: FSMSSMSSSSSNFFN.
% 25.53/4.32 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 25.53/4.32 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 25.53/4.32 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 25.53/4.32 % No SInE strategy applied
% 25.53/4.32 % Search class: FGUNF-FFMM21-SFFFFFNN
% 25.53/4.32 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 25.53/4.32 % Starting SubtermCWHack with 136s (1) cores
% 25.53/4.32 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 25.53/4.32 % Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S2S with 296s (1) cores
% 25.53/4.32 % Starting new_bool_3 with 269s (1) cores
% 25.53/4.32 % Starting G-E--_107_B00_00_F1_PI_AE_Q4_CS_SP_PS_S08BN with 136s (1) cores
% 25.53/4.32 % H----_102_C18_F1_PI_AE_CS_SP_PS_S2S with pid 3843978 completed with status 0
% 25.53/4.32 % Result found by H----_102_C18_F1_PI_AE_CS_SP_PS_S2S
% 25.53/4.32 % Preprocessing class: FSMSSMSSSSSNFFN.
% 25.53/4.32 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 25.53/4.32 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 25.53/4.32 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 25.53/4.32 % No SInE strategy applied
% 25.53/4.32 % Search class: FGUNF-FFMM21-SFFFFFNN
% 25.53/4.32 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 25.53/4.32 % Starting SubtermCWHack with 136s (1) cores
% 25.53/4.32 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 25.53/4.32 % Starting H----_102_C18_F1_PI_AE_CS_SP_PS_S2S with 296s (1) cores
% 25.53/4.32 % Preprocessing time : 0.002 s
% 25.53/4.32 % Presaturation interreduction done
% 25.53/4.32
% 25.53/4.32 % Proof found!
% 25.53/4.32 % SZS status Unsatisfiable
% 25.53/4.32 % SZS output start CNFRefutation
% See solution above
% 25.53/4.32 % Parsed axioms : 34
% 25.53/4.32 % Removed by relevancy pruning/SinE : 0
% 25.53/4.32 % Initial clauses : 34
% 25.53/4.32 % Removed in clause preprocessing : 0
% 25.53/4.32 % Initial clauses in saturation : 34
% 25.53/4.32 % Processed clauses : 13512
% 25.53/4.32 % ...of these trivial : 2196
% 25.53/4.32 % ...subsumed : 6212
% 25.53/4.32 % ...remaining for further processing : 5104
% 25.53/4.32 % Other redundant clauses eliminated : 0
% 25.53/4.32 % Clauses deleted for lack of memory : 0
% 25.53/4.32 % Backward-subsumed : 126
% 25.53/4.33 % Backward-rewritten : 322
% 25.53/4.33 % Generated clauses : 311193
% 25.53/4.33 % ...of the previous two non-redundant : 281761
% 25.53/4.33 % ...aggressively subsumed : 0
% 25.53/4.33 % Contextual simplify-reflections : 154
% 25.53/4.33 % Paramodulations : 311179
% 25.53/4.33 % Factorizations : 14
% 25.53/4.33 % NegExts : 0
% 25.53/4.33 % Equation resolutions : 0
% 25.53/4.33 % Disequality decompositions : 0
% 25.53/4.33 % Total rewrite steps : 139987
% 25.53/4.33 % ...of those cached : 139080
% 25.53/4.33 % Propositional unsat checks : 0
% 25.53/4.33 % Propositional check models : 0
% 25.53/4.33 % Propositional check unsatisfiable : 0
% 25.53/4.33 % Propositional clauses : 0
% 25.53/4.33 % Propositional clauses after purity: 0
% 25.53/4.33 % Propositional unsat core size : 0
% 25.53/4.33 % Propositional preprocessing time : 0.000
% 25.53/4.33 % Propositional encoding time : 0.000
% 25.53/4.33 % Propositional solver time : 0.000
% 25.53/4.33 % Success case prop preproc time : 0.000
% 25.53/4.33 % Success case prop encoding time : 0.000
% 25.53/4.33 % Success case prop solver time : 0.000
% 25.53/4.33 % Current number of processed clauses : 4622
% 25.53/4.33 % Positive orientable unit clauses : 913
% 25.53/4.33 % Positive unorientable unit clauses: 0
% 25.53/4.33 % Negative unit clauses : 2
% 25.53/4.33 % Non-unit-clauses : 3707
% 25.53/4.33 % Current number of unprocessed clauses: 268158
% 25.53/4.33 % ...number of literals in the above : 659326
% 25.53/4.33 % Current number of archived formulas : 0
% 25.53/4.33 % Current number of archived clauses : 482
% 25.53/4.33 % Clause-clause subsumption calls (NU) : 523915
% 25.53/4.33 % Rec. Clause-clause subsumption calls : 430656
% 25.53/4.33 % Non-unit clause-clause subsumptions : 6492
% 25.53/4.33 % Unit Clause-clause subsumption calls : 10148
% 25.53/4.33 % Rewrite failures with RHS unbound : 0
% 25.53/4.33 % BW rewrite match attempts : 1077
% 25.53/4.33 % BW rewrite match successes : 312
% 25.53/4.33 % Condensation attempts : 0
% 25.53/4.33 % Condensation successes : 0
% 25.53/4.33 % Termbank termtop insertions : 4802201
% 25.53/4.33 % Search garbage collected termcells : 71
% 25.53/4.33
% 25.53/4.33 % -------------------------------------------------
% 25.53/4.33 % User time : 3.399 s
% 25.53/4.33 % System time : 0.195 s
% 25.53/4.33 % Total time : 3.594 s
% 25.53/4.33 % Maximum resident set size: 3404 pages
% 25.53/4.33
% 25.53/4.33 % -------------------------------------------------
% 25.53/4.33 % User time : 17.373 s
% 25.53/4.33 % System time : 0.803 s
% 25.53/4.33 % Total time : 18.176 s
% 25.53/4.33 % Maximum resident set size: 4864 pages
% 25.53/4.33 % E exiting
%------------------------------------------------------------------------------