%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : GRP062-1 : TPTP v9.3.1. Released v1.0.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n002.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:37:46 PM UTC 2026
% Result : Unsatisfiable 3.72s 6.06s
% Output : CNFRefutation 3.72s
% Verified :
% SZS Type : Refutation
% Derivation depth : 34
% Number of leaves : 2
% Syntax : Number of clauses : 55 ( 51 unt; 0 nHn; 6 RR)
% Number of literals : 62 ( 61 equ; 12 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 11 ( 3 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 9 ( 9 usr; 7 con; 0-2 aty)
% Number of variables : 144 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(single_axiom,axiom,
inverse(multiply(X1,multiply(X2,multiply(multiply(X3,inverse(X3)),inverse(multiply(X4,multiply(X1,X2))))))) = X4,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',single_axiom) ).
cnf(prove_these_axioms,negated_conjecture,
( multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3))
| multiply(multiply(inverse(b2),b2),a2) != a2
| multiply(inverse(a1),a1) != multiply(inverse(b1),b1) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_these_axioms) ).
cnf(c_0_2,axiom,
inverse(multiply(X1,multiply(X2,multiply(multiply(X3,inverse(X3)),inverse(multiply(X4,multiply(X1,X2))))))) = X4,
single_axiom ).
cnf(c_0_3,plain,
inverse(multiply(X1,multiply(multiply(multiply(X2,inverse(X2)),inverse(multiply(X3,multiply(X4,X1)))),multiply(multiply(X5,inverse(X5)),X3)))) = X4,
inference(spm,[status(thm)],[c_0_2,c_0_2]) ).
cnf(c_0_4,plain,
inverse(multiply(multiply(multiply(X1,inverse(X1)),inverse(multiply(X2,multiply(X3,X4)))),multiply(multiply(multiply(X5,inverse(X5)),X2),multiply(multiply(X6,inverse(X6)),X3)))) = X4,
inference(spm,[status(thm)],[c_0_2,c_0_3]) ).
cnf(c_0_5,plain,
inverse(multiply(multiply(multiply(X1,inverse(X1)),X2),multiply(multiply(multiply(X3,inverse(X3)),X4),multiply(multiply(X5,inverse(X5)),X6)))) = multiply(multiply(X7,inverse(X7)),inverse(multiply(X2,multiply(X4,X6)))),
inference(spm,[status(thm)],[c_0_3,c_0_3]) ).
cnf(c_0_6,plain,
multiply(multiply(X1,inverse(X1)),inverse(multiply(inverse(multiply(X2,multiply(X3,X4))),multiply(X2,X3)))) = X4,
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_7,plain,
multiply(multiply(X1,inverse(X1)),X2) = multiply(multiply(X3,inverse(X3)),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_4]),c_0_3]) ).
cnf(c_0_8,plain,
multiply(X1,inverse(X1)) = multiply(X2,inverse(X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_2,c_0_7]),c_0_2]) ).
cnf(c_0_9,plain,
inverse(multiply(X1,multiply(inverse(X1),multiply(multiply(X2,inverse(X2)),inverse(multiply(X3,multiply(X4,inverse(X4)))))))) = X3,
inference(spm,[status(thm)],[c_0_2,c_0_8]) ).
cnf(c_0_10,plain,
inverse(multiply(X1,multiply(inverse(X1),X2))) = inverse(multiply(X3,multiply(inverse(X3),X2))),
inference(spm,[status(thm)],[c_0_9,c_0_6]) ).
cnf(c_0_11,plain,
inverse(multiply(inverse(X1),multiply(X2,multiply(multiply(X3,inverse(X3)),inverse(multiply(X4,multiply(inverse(X4),X2))))))) = X1,
inference(spm,[status(thm)],[c_0_2,c_0_10]) ).
cnf(c_0_12,plain,
multiply(multiply(X1,inverse(X1)),inverse(multiply(inverse(multiply(X2,multiply(inverse(X2),X3))),multiply(X4,inverse(X4))))) = X3,
inference(spm,[status(thm)],[c_0_6,c_0_8]) ).
cnf(c_0_13,plain,
inverse(multiply(inverse(X1),multiply(inverse(inverse(inverse(multiply(X2,multiply(inverse(X2),X3))))),X3))) = X1,
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
cnf(c_0_14,plain,
inverse(multiply(inverse(inverse(inverse(multiply(X1,multiply(inverse(X1),X2))))),multiply(X2,multiply(multiply(X3,inverse(X3)),X4)))) = inverse(X4),
inference(spm,[status(thm)],[c_0_2,c_0_13]) ).
cnf(c_0_15,plain,
multiply(multiply(X1,inverse(X1)),inverse(multiply(inverse(multiply(X2,multiply(X3,inverse(X3)))),multiply(X2,X4)))) = inverse(X4),
inference(spm,[status(thm)],[c_0_6,c_0_8]) ).
cnf(c_0_16,plain,
inverse(inverse(multiply(X1,multiply(inverse(inverse(inverse(multiply(X2,multiply(inverse(X2),X3))))),X3)))) = X1,
inference(spm,[status(thm)],[c_0_2,c_0_14]) ).
cnf(c_0_17,plain,
multiply(multiply(X1,inverse(X1)),multiply(inverse(inverse(inverse(multiply(X2,multiply(inverse(X2),X3))))),multiply(X4,inverse(X4)))) = inverse(X3),
inference(spm,[status(thm)],[c_0_15,c_0_13]) ).
cnf(c_0_18,plain,
inverse(inverse(inverse(multiply(X1,inverse(X1))))) = multiply(X2,inverse(X2)),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_19,plain,
multiply(X1,multiply(inverse(X1),X2)) = multiply(X3,multiply(inverse(X3),X2)),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_10]),c_0_11]) ).
cnf(c_0_20,plain,
multiply(X1,inverse(X1)) = multiply(inverse(inverse(multiply(X2,inverse(X2)))),multiply(X3,inverse(X3))),
inference(spm,[status(thm)],[c_0_8,c_0_18]) ).
cnf(c_0_21,plain,
multiply(X1,inverse(X1)) = multiply(X2,multiply(inverse(X2),inverse(inverse(inverse(inverse(multiply(X3,inverse(X3)))))))),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_22,plain,
multiply(inverse(X1),inverse(inverse(inverse(inverse(multiply(X2,inverse(X2))))))) = inverse(X1),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_21]),c_0_15]) ).
cnf(c_0_23,plain,
multiply(inverse(X1),inverse(multiply(X2,inverse(X2)))) = inverse(X1),
inference(spm,[status(thm)],[c_0_22,c_0_18]) ).
cnf(c_0_24,plain,
multiply(X1,inverse(multiply(X2,inverse(X2)))) = X1,
inference(spm,[status(thm)],[c_0_23,c_0_4]) ).
cnf(c_0_25,plain,
inverse(multiply(inverse(X1),inverse(inverse(inverse(multiply(X2,inverse(X2))))))) = X1,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_24]),c_0_23]) ).
cnf(c_0_26,plain,
multiply(multiply(X1,inverse(X1)),inverse(multiply(inverse(multiply(X2,multiply(X3,inverse(X3)))),multiply(X4,inverse(X4))))) = inverse(inverse(X2)),
inference(spm,[status(thm)],[c_0_15,c_0_8]) ).
cnf(c_0_27,plain,
inverse(multiply(inverse(X1),multiply(X2,inverse(X2)))) = X1,
inference(spm,[status(thm)],[c_0_25,c_0_18]) ).
cnf(c_0_28,plain,
multiply(X1,inverse(inverse(inverse(multiply(X2,inverse(X2)))))) = multiply(X3,multiply(inverse(X3),inverse(inverse(X1)))),
inference(spm,[status(thm)],[c_0_19,c_0_18]) ).
cnf(c_0_29,plain,
multiply(multiply(X1,inverse(X1)),multiply(X2,multiply(X3,inverse(X3)))) = inverse(inverse(X2)),
inference(rw,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_30,plain,
inverse(multiply(X1,multiply(inverse(X1),inverse(inverse(inverse(X2)))))) = X2,
inference(spm,[status(thm)],[c_0_25,c_0_28]) ).
cnf(c_0_31,plain,
inverse(inverse(inverse(inverse(inverse(multiply(X1,multiply(inverse(X1),X2))))))) = inverse(X2),
inference(rw,[status(thm)],[c_0_17,c_0_29]) ).
cnf(c_0_32,plain,
inverse(inverse(inverse(inverse(multiply(X1,multiply(inverse(X1),X2)))))) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_30]) ).
cnf(c_0_33,plain,
multiply(multiply(X1,inverse(X1)),multiply(X2,multiply(inverse(X2),X3))) = X3,
inference(rw,[status(thm)],[c_0_12,c_0_27]) ).
cnf(c_0_34,plain,
inverse(multiply(X1,multiply(inverse(X1),inverse(inverse(X2))))) = inverse(multiply(X2,multiply(X3,inverse(X3)))),
inference(spm,[status(thm)],[c_0_9,c_0_15]) ).
cnf(c_0_35,plain,
multiply(X1,multiply(X2,multiply(inverse(X2),X3))) = multiply(X4,multiply(inverse(X4),multiply(inverse(inverse(X1)),X3))),
inference(spm,[status(thm)],[c_0_19,c_0_19]) ).
cnf(c_0_36,plain,
multiply(inverse(inverse(multiply(X1,inverse(X1)))),X2) = inverse(inverse(inverse(inverse(X2)))),
inference(spm,[status(thm)],[c_0_32,c_0_33]) ).
cnf(c_0_37,plain,
multiply(X1,multiply(inverse(X1),inverse(inverse(X2)))) = multiply(X2,multiply(X3,inverse(X3))),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_34]),c_0_11]) ).
cnf(c_0_38,plain,
multiply(X1,multiply(inverse(X1),inverse(inverse(inverse(inverse(X2)))))) = X2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_33]) ).
cnf(c_0_39,plain,
multiply(inverse(inverse(X1)),multiply(X2,inverse(X2))) = X1,
inference(spm,[status(thm)],[c_0_37,c_0_38]) ).
cnf(c_0_40,plain,
inverse(inverse(X1)) = X1,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_18]),c_0_36]),c_0_22]) ).
cnf(c_0_41,plain,
multiply(multiply(X1,inverse(X1)),X2) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_36,c_0_40]),c_0_40]),c_0_40]) ).
cnf(c_0_42,plain,
multiply(X1,multiply(X2,inverse(X2))) = X1,
inference(rw,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_43,plain,
inverse(multiply(inverse(multiply(X1,X2)),X1)) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_3,c_0_41]),c_0_42]),c_0_41]),c_0_41]) ).
cnf(c_0_44,plain,
multiply(X1,multiply(inverse(X1),X2)) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_28,c_0_40]),c_0_24]),c_0_40]) ).
cnf(c_0_45,negated_conjecture,
( multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3))
| multiply(multiply(inverse(b2),b2),a2) != a2
| multiply(inverse(a1),a1) != multiply(inverse(b1),b1) ),
inference(fof_simplification,[status(thm)],[prove_these_axioms]) ).
cnf(c_0_46,plain,
multiply(inverse(multiply(X1,X2)),X1) = inverse(X2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_43]),c_0_44]),c_0_41]),c_0_42]) ).
cnf(c_0_47,negated_conjecture,
( multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3))
| multiply(multiply(inverse(b2),b2),a2) != a2
| multiply(inverse(a1),a1) != multiply(inverse(b1),b1) ),
c_0_45 ).
cnf(c_0_48,plain,
multiply(multiply(inverse(X1),X1),X2) = X2,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_11]),c_0_44]),c_0_41]),c_0_42]) ).
cnf(c_0_49,plain,
multiply(X1,inverse(multiply(X2,X1))) = inverse(X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_46]),c_0_40]) ).
cnf(c_0_50,negated_conjecture,
( multiply(inverse(a1),a1) != multiply(inverse(b1),b1)
| multiply(multiply(a3,b3),c3) != multiply(a3,multiply(b3,c3)) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_47,c_0_48])]) ).
cnf(c_0_51,plain,
multiply(multiply(X1,X2),X3) = multiply(X1,multiply(X2,X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_4]),c_0_41]),c_0_41]),c_0_41]),c_0_40]) ).
cnf(c_0_52,negated_conjecture,
multiply(inverse(a1),a1) != multiply(inverse(b1),b1),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_50,c_0_51])]) ).
cnf(c_0_53,plain,
multiply(X1,inverse(X1)) = multiply(inverse(X2),X2),
inference(spm,[status(thm)],[c_0_8,c_0_40]) ).
cnf(c_0_54,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_53]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP062-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.10/5.38 % Computer : n002.cluster.edu
% 0.10/5.38 % Model : x86_64 x86_64
% 0.10/5.38 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/5.38 % Memory : 8046.5625MB
% 0.10/5.38 % OS : Linux 6.8.0-71-generic
% 0.10/5.38 % CPULimit : 300
% 0.10/5.38 % WCLimit : 300
% 0.10/5.38 % DateTime : Sun Sep 20 19:58:52 UTC 2026
% 0.10/5.38 % CPUTime :
% 0.10/5.39 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/5.43 Running first-order theorem proving
% 0.15/5.43 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
% 3.72/6.06 % Version: 3.5.1
% 3.72/6.06 % Preprocessing class: FSSSSMSSSSSNFFN.
% 3.72/6.06 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.72/6.06 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 3.72/6.06 % Starting new_bool_3 with 300s (1) cores
% 3.72/6.06 % Starting new_bool_1 with 300s (1) cores
% 3.72/6.06 % Starting sh5l with 300s (1) cores
% 3.72/6.06 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 1569589 completed with status 0
% 3.72/6.06 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 3.72/6.06 % Preprocessing class: FSSSSMSSSSSNFFN.
% 3.72/6.06 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.72/6.06 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 3.72/6.06 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 3.72/6.06 % No SInE strategy applied
% 3.72/6.06 % Search class: FUHPF-FFSF21-DFFFFFNN
% 3.72/6.06 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 3.72/6.06 % Starting SubtermCWHack with 136s (1) cores
% 3.72/6.06 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 3.72/6.06 % Starting G-E--_208_C18_F1_SE_CS_SSP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 3.72/6.06 % Starting new_bool_3 with 136s (1) cores
% 3.72/6.06 % Starting new_bool_1 with 136s (1) cores
% 3.72/6.06 % new_bool_1 with pid 1569600 completed with status 0
% 3.72/6.06 % Result found by new_bool_1
% 3.72/6.06 % Preprocessing class: FSSSSMSSSSSNFFN.
% 3.72/6.06 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 3.72/6.06 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 3.72/6.06 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 3.72/6.06 % No SInE strategy applied
% 3.72/6.06 % Search class: FUHPF-FFSF21-DFFFFFNN
% 3.72/6.06 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 3.72/6.06 % Starting SubtermCWHack with 136s (1) cores
% 3.72/6.06 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 3.72/6.06 % Starting G-E--_208_C18_F1_SE_CS_SSP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 3.72/6.06 % Starting new_bool_3 with 136s (1) cores
% 3.72/6.06 % Starting new_bool_1 with 136s (1) cores
% 3.72/6.06 % Preprocessing time : 0.001 s
% 3.72/6.06 % Presaturation interreduction done
% 3.72/6.06
% 3.72/6.06 % Proof found!
% 3.72/6.06 % SZS status Unsatisfiable
% 3.72/6.06 % SZS output start CNFRefutation
% See solution above
% 3.72/6.06 % Parsed axioms : 2
% 3.72/6.06 % Removed by relevancy pruning/SinE : 0
% 3.72/6.06 % Initial clauses : 2
% 3.72/6.06 % Removed in clause preprocessing : 0
% 3.72/6.06 % Initial clauses in saturation : 2
% 3.72/6.06 % Processed clauses : 436
% 3.72/6.06 % ...of these trivial : 84
% 3.72/6.06 % ...subsumed : 253
% 3.72/6.06 % ...remaining for further processing : 99
% 3.72/6.06 % Other redundant clauses eliminated : 0
% 3.72/6.06 % Clauses deleted for lack of memory : 0
% 3.72/6.06 % Backward-subsumed : 3
% 3.72/6.06 % Backward-rewritten : 60
% 3.72/6.06 % Generated clauses : 24823
% 3.72/6.06 % ...of the previous two non-redundant : 23419
% 3.72/6.06 % ...aggressively subsumed : 0
% 3.72/6.06 % Contextual simplify-reflections : 0
% 3.72/6.06 % Paramodulations : 24823
% 3.72/6.06 % Factorizations : 0
% 3.72/6.06 % NegExts : 0
% 3.72/6.06 % Equation resolutions : 0
% 3.72/6.06 % Disequality decompositions : 0
% 3.72/6.06 % Total rewrite steps : 17604
% 3.72/6.06 % ...of those cached : 13217
% 3.72/6.06 % Propositional unsat checks : 0
% 3.72/6.06 % Propositional check models : 0
% 3.72/6.06 % Propositional check unsatisfiable : 0
% 3.72/6.06 % Propositional clauses : 0
% 3.72/6.06 % Propositional clauses after purity: 0
% 3.72/6.06 % Propositional unsat core size : 0
% 3.72/6.06 % Propositional preprocessing time : 0.000
% 3.72/6.06 % Propositional encoding time : 0.000
% 3.72/6.06 % Propositional solver time : 0.000
% 3.72/6.06 % Success case prop preproc time : 0.000
% 3.72/6.06 % Success case prop encoding time : 0.000
% 3.72/6.06 % Success case prop solver time : 0.000
% 3.72/6.06 % Current number of processed clauses : 34
% 3.72/6.06 % Positive orientable unit clauses : 31
% 3.72/6.06 % Positive unorientable unit clauses: 2
% 3.72/6.06 % Negative unit clauses : 1
% 3.72/6.06 % Non-unit-clauses : 0
% 3.72/6.06 % Current number of unprocessed clauses: 22718
% 3.72/6.06 % ...number of literals in the above : 22718
% 3.72/6.06 % Current number of archived formulas : 0
% 3.72/6.06 % Current number of archived clauses : 65
% 3.72/6.06 % Clause-clause subsumption calls (NU) : 0
% 3.72/6.06 % Rec. Clause-clause subsumption calls : 0
% 3.72/6.06 % Non-unit clause-clause subsumptions : 0
% 3.72/6.06 % Unit Clause-clause subsumption calls : 231
% 3.72/6.06 % Rewrite failures with RHS unbound : 757
% 3.72/6.06 % BW rewrite match attempts : 955
% 3.72/6.06 % BW rewrite match successes : 131
% 3.72/6.06 % Condensation attempts : 0
% 3.72/6.06 % Condensation successes : 0
% 3.72/6.06 % Termbank termtop insertions : 721443
% 3.72/6.06 % Search garbage collected termcells : 8
% 3.72/6.06
% 3.72/6.06 % -------------------------------------------------
% 3.72/6.06 % User time : 0.562 s
% 3.72/6.06 % System time : 0.029 s
% 3.72/6.06 % Total time : 0.591 s
% 3.72/6.06 % Maximum resident set size: 3584 pages
% 3.72/6.06
% 3.72/6.06 % -------------------------------------------------
% 3.72/6.06 % User time : 2.802 s
% 3.72/6.06 % System time : 0.173 s
% 3.72/6.06 % Total time : 2.975 s
% 3.72/6.06 % Maximum resident set size: 4608 pages
% 3.72/6.06 % E exiting
%------------------------------------------------------------------------------