%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GRP378-1 : TPTP v9.3.1. Released v2.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n020.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:39:26 PM UTC 2026
% Result : Unsatisfiable 2.94s 0.86s
% Output : CNFRefutation 2.94s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 12
% Syntax : Number of clauses : 62 ( 25 unt; 30 nHn; 45 RR)
% Number of literals : 140 ( 139 equ; 54 neg)
% Maximal clause size : 15 ( 2 avg)
% Maximal term depth : 5 ( 1 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 12 ( 12 usr; 10 con; 0-2 aty)
% Number of variables : 52 ( 4 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(associativity,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',associativity) ).
cnf(left_inverse,axiom,
multiply(inverse(X1),X1) = identity,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',left_inverse) ).
cnf(left_identity,axiom,
multiply(identity,X1) = X1,
file('/export/starexec/sandbox/benchmark/Axioms/GRP004-0.ax',left_identity) ).
cnf(prove_this_36,negated_conjecture,
( inverse(sk_c5) = sk_c8
| inverse(sk_c1) = sk_c2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_36) ).
cnf(prove_this_26,negated_conjecture,
( inverse(sk_c5) = sk_c8
| multiply(sk_c1,sk_c2) = sk_c11 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_26) ).
cnf(prove_this_35,negated_conjecture,
( multiply(sk_c5,sk_c8) = sk_c11
| inverse(sk_c1) = sk_c2 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_35) ).
cnf(prove_this_25,negated_conjecture,
( multiply(sk_c5,sk_c8) = sk_c11
| multiply(sk_c1,sk_c2) = sk_c11 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_25) ).
cnf(prove_this_2,negated_conjecture,
( inverse(sk_c3) = sk_c11
| inverse(sk_c11) = sk_c10 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_2) ).
cnf(prove_this_1,negated_conjecture,
( multiply(sk_c3,sk_c11) = sk_c10
| inverse(sk_c11) = sk_c10 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_1) ).
cnf(prove_this_14,negated_conjecture,
( inverse(sk_c4) = sk_c10
| multiply(sk_c11,sk_c9) = sk_c10 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_14) ).
cnf(prove_this_13,negated_conjecture,
( multiply(sk_c4,sk_c10) = sk_c9
| multiply(sk_c11,sk_c9) = sk_c10 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_13) ).
cnf(prove_this_51,negated_conjecture,
( multiply(X7,X6) != X8
| inverse(X8) != X6
| inverse(X7) != X8
| multiply(X6,sk_c10) != sk_c11
| inverse(X5) != X6
| multiply(X5,X6) != sk_c11
| inverse(X4) != sk_c10
| multiply(X4,sk_c10) != sk_c9
| inverse(X3) != sk_c11
| multiply(X3,sk_c11) != sk_c10
| multiply(X2,sk_c10) != sk_c11
| inverse(X1) != X2
| multiply(X1,X2) != sk_c11
| multiply(sk_c11,sk_c9) != sk_c10
| inverse(sk_c11) != sk_c10 ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_this_51) ).
cnf(c_0_12,axiom,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
associativity ).
cnf(c_0_13,axiom,
multiply(inverse(X1),X1) = identity,
left_inverse ).
cnf(c_0_14,axiom,
multiply(identity,X1) = X1,
left_identity ).
cnf(c_0_15,plain,
multiply(inverse(X1),multiply(X1,X2)) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_13]),c_0_14]) ).
cnf(c_0_16,plain,
multiply(inverse(inverse(X1)),identity) = X1,
inference(spm,[status(thm)],[c_0_15,c_0_13]) ).
cnf(c_0_17,plain,
multiply(inverse(inverse(inverse(X1))),X1) = identity,
inference(spm,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_18,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_17]),c_0_16]) ).
cnf(c_0_19,negated_conjecture,
( inverse(sk_c5) = sk_c8
| inverse(sk_c1) = sk_c2 ),
prove_this_36 ).
cnf(c_0_20,negated_conjecture,
( inverse(sk_c5) = sk_c8
| multiply(sk_c1,sk_c2) = sk_c11 ),
prove_this_26 ).
cnf(c_0_21,plain,
multiply(X1,inverse(X1)) = identity,
inference(spm,[status(thm)],[c_0_13,c_0_18]) ).
cnf(c_0_22,negated_conjecture,
( inverse(sk_c1) = sk_c2
| multiply(sk_c8,sk_c5) = identity ),
inference(spm,[status(thm)],[c_0_13,c_0_19]) ).
cnf(c_0_23,negated_conjecture,
( multiply(sk_c8,sk_c5) = identity
| multiply(sk_c1,sk_c2) = sk_c11 ),
inference(spm,[status(thm)],[c_0_13,c_0_20]) ).
cnf(c_0_24,negated_conjecture,
( multiply(sk_c1,sk_c2) = identity
| multiply(sk_c8,sk_c5) = identity ),
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_25,negated_conjecture,
( identity = sk_c11
| multiply(sk_c8,sk_c5) = identity ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_26,plain,
multiply(X1,identity) = X1,
inference(rw,[status(thm)],[c_0_16,c_0_18]) ).
cnf(c_0_27,negated_conjecture,
( identity = sk_c11
| inverse(sk_c8) = sk_c5 ),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_25]),c_0_26]) ).
cnf(c_0_28,negated_conjecture,
( multiply(sk_c5,sk_c8) = sk_c11
| inverse(sk_c1) = sk_c2 ),
prove_this_35 ).
cnf(c_0_29,negated_conjecture,
( multiply(sk_c5,sk_c8) = sk_c11
| multiply(sk_c1,sk_c2) = sk_c11 ),
prove_this_25 ).
cnf(c_0_30,negated_conjecture,
( identity = sk_c11
| multiply(sk_c5,sk_c8) = identity ),
inference(spm,[status(thm)],[c_0_13,c_0_27]) ).
cnf(c_0_31,negated_conjecture,
( multiply(sk_c1,sk_c2) = identity
| multiply(sk_c5,sk_c8) = sk_c11 ),
inference(spm,[status(thm)],[c_0_21,c_0_28]) ).
cnf(c_0_32,negated_conjecture,
( inverse(sk_c3) = sk_c11
| inverse(sk_c11) = sk_c10 ),
prove_this_2 ).
cnf(c_0_33,negated_conjecture,
( identity = sk_c11
| multiply(sk_c1,sk_c2) = sk_c11 ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_34,negated_conjecture,
( identity = sk_c11
| multiply(sk_c1,sk_c2) = identity ),
inference(spm,[status(thm)],[c_0_31,c_0_30]) ).
cnf(c_0_35,negated_conjecture,
( inverse(sk_c11) = sk_c3
| inverse(sk_c11) = sk_c10 ),
inference(spm,[status(thm)],[c_0_18,c_0_32]) ).
cnf(c_0_36,plain,
multiply(inverse(identity),X1) = X1,
inference(spm,[status(thm)],[c_0_15,c_0_14]) ).
cnf(c_0_37,negated_conjecture,
( multiply(sk_c3,sk_c11) = sk_c10
| inverse(sk_c11) = sk_c10 ),
prove_this_1 ).
cnf(c_0_38,negated_conjecture,
identity = sk_c11,
inference(spm,[status(thm)],[c_0_33,c_0_34]) ).
cnf(c_0_39,negated_conjecture,
( sk_c3 != sk_c10
| inverse(sk_c11) = sk_c10 ),
inference(ef,[status(thm)],[c_0_35]) ).
cnf(c_0_40,plain,
multiply(inverse(inverse(identity)),X1) = X1,
inference(spm,[status(thm)],[c_0_15,c_0_36]) ).
cnf(c_0_41,negated_conjecture,
( inverse(sk_c10) = sk_c11
| multiply(sk_c3,sk_c11) = sk_c10 ),
inference(spm,[status(thm)],[c_0_18,c_0_37]) ).
cnf(c_0_42,plain,
multiply(X1,sk_c11) = X1,
inference(rw,[status(thm)],[c_0_26,c_0_38]) ).
cnf(c_0_43,negated_conjecture,
( sk_c3 != sk_c10
| inverse(sk_c10) = sk_c11 ),
inference(spm,[status(thm)],[c_0_18,c_0_39]) ).
cnf(c_0_44,plain,
inverse(identity) = identity,
inference(spm,[status(thm)],[c_0_13,c_0_40]) ).
cnf(c_0_45,negated_conjecture,
( inverse(sk_c4) = sk_c10
| multiply(sk_c11,sk_c9) = sk_c10 ),
prove_this_14 ).
cnf(c_0_46,negated_conjecture,
inverse(sk_c10) = sk_c11,
inference(csr,[status(thm)],[inference(rw,[status(thm)],[c_0_41,c_0_42]),c_0_43]) ).
cnf(c_0_47,plain,
inverse(sk_c11) = sk_c11,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_38]),c_0_38]) ).
cnf(c_0_48,negated_conjecture,
( inverse(sk_c10) = sk_c4
| multiply(sk_c11,sk_c9) = sk_c10 ),
inference(spm,[status(thm)],[c_0_18,c_0_45]) ).
cnf(c_0_49,plain,
multiply(sk_c11,X1) = X1,
inference(rw,[status(thm)],[c_0_14,c_0_38]) ).
cnf(c_0_50,negated_conjecture,
sk_c10 = sk_c11,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_46]),c_0_47]) ).
cnf(c_0_51,negated_conjecture,
( multiply(sk_c4,sk_c10) = sk_c9
| multiply(sk_c11,sk_c9) = sk_c10 ),
prove_this_13 ).
cnf(c_0_52,negated_conjecture,
( multiply(X7,X6) != X8
| inverse(X8) != X6
| inverse(X7) != X8
| multiply(X6,sk_c10) != sk_c11
| inverse(X5) != X6
| multiply(X5,X6) != sk_c11
| inverse(X4) != sk_c10
| multiply(X4,sk_c10) != sk_c9
| inverse(X3) != sk_c11
| multiply(X3,sk_c11) != sk_c10
| multiply(X2,sk_c10) != sk_c11
| inverse(X1) != X2
| multiply(X1,X2) != sk_c11
| multiply(sk_c11,sk_c9) != sk_c10
| inverse(sk_c11) != sk_c10 ),
inference(fof_simplification,[status(thm)],[prove_this_51]) ).
cnf(c_0_53,negated_conjecture,
( sk_c9 = sk_c11
| sk_c4 = sk_c11 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_48,c_0_49]),c_0_50]),c_0_50]),c_0_47]) ).
cnf(c_0_54,negated_conjecture,
( sk_c4 = sk_c9
| sk_c9 = sk_c11 ),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_51,c_0_49]),c_0_50]),c_0_42]),c_0_50]) ).
cnf(c_0_55,negated_conjecture,
( multiply(X7,X6) != X8
| inverse(X8) != X6
| inverse(X7) != X8
| multiply(X6,sk_c10) != sk_c11
| inverse(X5) != X6
| multiply(X5,X6) != sk_c11
| inverse(X4) != sk_c10
| multiply(X4,sk_c10) != sk_c9
| inverse(X3) != sk_c11
| multiply(X3,sk_c11) != sk_c10
| multiply(X2,sk_c10) != sk_c11
| inverse(X1) != X2
| multiply(X1,X2) != sk_c11
| multiply(sk_c11,sk_c9) != sk_c10
| inverse(sk_c11) != sk_c10 ),
c_0_52 ).
cnf(c_0_56,negated_conjecture,
sk_c9 = sk_c11,
inference(spm,[status(thm)],[c_0_53,c_0_54]) ).
cnf(c_0_57,negated_conjecture,
( inverse(X3) != sk_c11
| inverse(X2) != sk_c11
| multiply(X1,inverse(X2)) != inverse(X1)
| inverse(multiply(X1,inverse(X2))) != inverse(X2) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[inference(er,[status(thm)],[c_0_55])])]),c_0_21]),c_0_21])]),c_0_49]),c_0_50]),c_0_50]),c_0_42]),c_0_50]),c_0_42]),c_0_42]),c_0_50]),c_0_50]),c_0_42]),c_0_47]),c_0_50]),c_0_38]),c_0_50])])])]),c_0_47])]),c_0_56]),c_0_47]),c_0_56])]) ).
cnf(c_0_58,plain,
multiply(inverse(X1),X1) = sk_c11,
inference(rw,[status(thm)],[c_0_13,c_0_38]) ).
cnf(c_0_59,negated_conjecture,
( inverse(X2) != sk_c11
| inverse(X1) != sk_c11 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_47]),c_0_18])]) ).
cnf(c_0_60,negated_conjecture,
inverse(X1) != sk_c11,
inference(spm,[status(thm)],[c_0_59,c_0_47]) ).
cnf(c_0_61,plain,
$false,
inference(sr,[status(thm)],[c_0_47,c_0_60]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP378-1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.36 % Computer : n020.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Sun Sep 20 20:11:34 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.13/0.41 Running first-order theorem proving
% 0.13/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
% 2.94/0.86 % Version: 3.5.1
% 2.94/0.86 % Preprocessing class: FSMSSMSMSSSNFFN.
% 2.94/0.86 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.94/0.86 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 2.94/0.86 % Starting new_bool_3 with 300s (1) cores
% 2.94/0.86 % Starting new_bool_1 with 300s (1) cores
% 2.94/0.86 % Starting sh5l with 300s (1) cores
% 2.94/0.86 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 1122682 completed with status 0
% 2.94/0.86 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 2.94/0.86 % Preprocessing class: FSMSSMSMSSSNFFN.
% 2.94/0.86 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.94/0.86 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 2.94/0.86 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 2.94/0.86 % No SInE strategy applied
% 2.94/0.86 % Search class: FGHPS-FFMM21-SFFFFFNN
% 2.94/0.86 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 2.94/0.86 % Starting SubtermCWHack with 136s (1) cores
% 2.94/0.86 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 2.94/0.86 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 2.94/0.86 % Starting new_bool_3 with 136s (1) cores
% 2.94/0.86 % Starting new_bool_1 with 136s (1) cores
% 2.94/0.86 % SubtermCWHack with pid 1122686 completed with status 0
% 2.94/0.86 % Result found by SubtermCWHack
% 2.94/0.86 % Preprocessing class: FSMSSMSMSSSNFFN.
% 2.94/0.86 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 2.94/0.86 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 2.94/0.86 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 2.94/0.86 % No SInE strategy applied
% 2.94/0.86 % Search class: FGHPS-FFMM21-SFFFFFNN
% 2.94/0.86 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 2.94/0.86 % Starting SubtermCWHack with 136s (1) cores
% 2.94/0.86 % Preprocessing time : 0.002 s
% 2.94/0.86
% 2.94/0.86 % Proof found!
% 2.94/0.86 % SZS status Unsatisfiable
% 2.94/0.86 % SZS output start CNFRefutation
% See solution above
% 2.94/0.86 % Parsed axioms : 54
% 2.94/0.86 % Removed by relevancy pruning/SinE : 0
% 2.94/0.86 % Initial clauses : 54
% 2.94/0.86 % Removed in clause preprocessing : 0
% 2.94/0.86 % Initial clauses in saturation : 54
% 2.94/0.86 % Processed clauses : 8296
% 2.94/0.86 % ...of these trivial : 94
% 2.94/0.86 % ...subsumed : 6961
% 2.94/0.86 % ...remaining for further processing : 1241
% 2.94/0.86 % Other redundant clauses eliminated : 8
% 2.94/0.86 % Clauses deleted for lack of memory : 0
% 2.94/0.86 % Backward-subsumed : 38
% 2.94/0.86 % Backward-rewritten : 505
% 2.94/0.86 % Generated clauses : 40029
% 2.94/0.86 % ...of the previous two non-redundant : 38846
% 2.94/0.86 % ...aggressively subsumed : 0
% 2.94/0.86 % Contextual simplify-reflections : 2
% 2.94/0.86 % Paramodulations : 39988
% 2.94/0.86 % Factorizations : 1
% 2.94/0.86 % NegExts : 0
% 2.94/0.86 % Equation resolutions : 8
% 2.94/0.86 % Disequality decompositions : 0
% 2.94/0.86 % Total rewrite steps : 14110
% 2.94/0.86 % ...of those cached : 13113
% 2.94/0.86 % Propositional unsat checks : 0
% 2.94/0.86 % Propositional check models : 0
% 2.94/0.86 % Propositional check unsatisfiable : 0
% 2.94/0.86 % Propositional clauses : 0
% 2.94/0.86 % Propositional clauses after purity: 0
% 2.94/0.86 % Propositional unsat core size : 0
% 2.94/0.86 % Propositional preprocessing time : 0.000
% 2.94/0.86 % Propositional encoding time : 0.000
% 2.94/0.86 % Propositional solver time : 0.000
% 2.94/0.86 % Success case prop preproc time : 0.000
% 2.94/0.86 % Success case prop encoding time : 0.000
% 2.94/0.86 % Success case prop solver time : 0.000
% 2.94/0.86 % Current number of processed clauses : 661
% 2.94/0.86 % Positive orientable unit clauses : 16
% 2.94/0.86 % Positive unorientable unit clauses: 0
% 2.94/0.86 % Negative unit clauses : 1
% 2.94/0.86 % Non-unit-clauses : 644
% 2.94/0.86 % Current number of unprocessed clauses: 22441
% 2.94/0.86 % ...number of literals in the above : 58799
% 2.94/0.86 % Current number of archived formulas : 0
% 2.94/0.86 % Current number of archived clauses : 578
% 2.94/0.86 % Clause-clause subsumption calls (NU) : 214581
% 2.94/0.86 % Rec. Clause-clause subsumption calls : 200056
% 2.94/0.86 % Non-unit clause-clause subsumptions : 6976
% 2.94/0.86 % Unit Clause-clause subsumption calls : 743
% 2.94/0.86 % Rewrite failures with RHS unbound : 0
% 2.94/0.86 % BW rewrite match attempts : 90
% 2.94/0.86 % BW rewrite match successes : 43
% 2.94/0.86 % Condensation attempts : 0
% 2.94/0.86 % Condensation successes : 0
% 2.94/0.86 % Termbank termtop insertions : 336675
% 2.94/0.86 % Search garbage collected termcells : 42
% 2.94/0.86
% 2.94/0.86 % -------------------------------------------------
% 2.94/0.86 % User time : 0.384 s
% 2.94/0.86 % System time : 0.017 s
% 2.94/0.86 % Total time : 0.401 s
% 2.94/0.86 % Maximum resident set size: 3404 pages
% 2.94/0.86
% 2.94/0.86 % -------------------------------------------------
% 2.94/0.86 % User time : 1.904 s
% 2.94/0.86 % System time : 0.076 s
% 2.94/0.86 % Total time : 1.980 s
% 2.94/0.86 % Maximum resident set size: 4608 pages
% 2.94/0.86 % E exiting
%------------------------------------------------------------------------------