%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : GRP768-1 : TPTP v9.3.1. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% Computer : n026.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:45:06 PM UTC 2026
% Result : Unsatisfiable 9.86s 6.93s
% Output : CNFRefutation 9.86s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 15
% Syntax : Number of clauses : 64 ( 64 unt; 0 nHn; 7 RR)
% Number of literals : 64 ( 63 equ; 6 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 11 ( 11 usr; 4 con; 0-2 aty)
% Number of variables : 119 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(sos08,axiom,
difference(product(X1,X2),product(X1,product(X2,X3))) = quotient(quotient(product(X3,product(X1,X2)),X2),X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos08) ).
cnf(sos07,axiom,
difference(X1,product(product(X1,X2),X3)) = quotient(product(X2,product(X3,X1)),X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos07) ).
cnf(sos12,axiom,
eta(X1) = product(i(X1),X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos12) ).
cnf(sos09,axiom,
i(X1) = difference(X1,one),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos09) ).
cnf(sos03,axiom,
product(X1,difference(X1,X2)) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos03) ).
cnf(sos04,axiom,
difference(X1,product(X1,X2)) = X2,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos04) ).
cnf(sos01,axiom,
product(X1,one) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos01) ).
cnf(sos13,axiom,
product(i(i(X1)),X2) = product(eta(X1),product(X1,X2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos13) ).
cnf(sos11,axiom,
product(i(X1),X1) = product(X1,j(X1)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos11) ).
cnf(sos10,axiom,
j(X1) = quotient(one,X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos10) ).
cnf(sos16,axiom,
product(eta(X1),product(X2,X3)) = product(product(eta(X1),X2),X3),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos16) ).
cnf(sos06,axiom,
product(quotient(X1,X2),X2) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos06) ).
cnf(goals,negated_conjecture,
t(eta(x0),product(x1,x2)) != product(t(eta(x0),x1),t(eta(x0),x2)),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',goals) ).
cnf(sos05,axiom,
quotient(product(X1,X2),X2) = X1,
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos05) ).
cnf(sos19,axiom,
t(X1,X2) = quotient(product(X1,X2),X1),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',sos19) ).
cnf(c_0_15,axiom,
difference(product(X1,X2),product(X1,product(X2,X3))) = quotient(quotient(product(X3,product(X1,X2)),X2),X1),
sos08 ).
cnf(c_0_16,axiom,
difference(X1,product(product(X1,X2),X3)) = quotient(product(X2,product(X3,X1)),X1),
sos07 ).
cnf(c_0_17,axiom,
eta(X1) = product(i(X1),X1),
sos12 ).
cnf(c_0_18,axiom,
i(X1) = difference(X1,one),
sos09 ).
cnf(c_0_19,plain,
quotient(difference(X1,product(product(X1,X2),X3)),X3) = difference(product(X3,X1),product(X3,product(X1,X2))),
inference(rw,[status(thm)],[c_0_15,c_0_16]) ).
cnf(c_0_20,axiom,
product(X1,difference(X1,X2)) = X2,
sos03 ).
cnf(c_0_21,axiom,
difference(X1,product(X1,X2)) = X2,
sos04 ).
cnf(c_0_22,axiom,
product(X1,one) = X1,
sos01 ).
cnf(c_0_23,axiom,
product(i(i(X1)),X2) = product(eta(X1),product(X1,X2)),
sos13 ).
cnf(c_0_24,plain,
eta(X1) = product(difference(X1,one),X1),
inference(rw,[status(thm)],[c_0_17,c_0_18]) ).
cnf(c_0_25,axiom,
product(i(X1),X1) = product(X1,j(X1)),
sos11 ).
cnf(c_0_26,axiom,
j(X1) = quotient(one,X1),
sos10 ).
cnf(c_0_27,plain,
quotient(difference(X1,product(X2,X3)),X3) = difference(product(X3,X1),product(X3,X2)),
inference(spm,[status(thm)],[c_0_19,c_0_20]) ).
cnf(c_0_28,plain,
difference(X1,X1) = one,
inference(spm,[status(thm)],[c_0_21,c_0_22]) ).
cnf(c_0_29,axiom,
product(eta(X1),product(X2,X3)) = product(product(eta(X1),X2),X3),
sos16 ).
cnf(c_0_30,axiom,
product(quotient(X1,X2),X2) = X1,
sos06 ).
cnf(c_0_31,plain,
product(difference(difference(X1,one),one),X2) = product(product(difference(X1,one),X1),product(X1,X2)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_18]),c_0_18]),c_0_24]) ).
cnf(c_0_32,plain,
product(difference(X1,one),X1) = product(X1,quotient(one,X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_25,c_0_18]),c_0_26]) ).
cnf(c_0_33,plain,
difference(product(X1,product(X2,X1)),product(X1,X2)) = quotient(one,X1),
inference(spm,[status(thm)],[c_0_27,c_0_28]) ).
cnf(c_0_34,plain,
product(product(difference(X1,one),X1),product(X2,X3)) = product(product(product(difference(X1,one),X1),X2),X3),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_29,c_0_24]),c_0_24]) ).
cnf(c_0_35,plain,
difference(X1,product(product(X1,X2),quotient(X3,X1))) = quotient(product(X2,X3),X1),
inference(spm,[status(thm)],[c_0_16,c_0_30]) ).
cnf(c_0_36,plain,
product(product(X1,quotient(one,X1)),product(X1,X2)) = product(difference(difference(X1,one),one),X2),
inference(rw,[status(thm)],[c_0_31,c_0_32]) ).
cnf(c_0_37,negated_conjecture,
t(eta(x0),product(x1,x2)) != product(t(eta(x0),x1),t(eta(x0),x2)),
inference(fof_simplification,[status(thm)],[goals]) ).
cnf(c_0_38,plain,
product(product(X1,product(X2,X1)),quotient(one,X1)) = product(X1,X2),
inference(spm,[status(thm)],[c_0_20,c_0_33]) ).
cnf(c_0_39,plain,
product(product(product(X1,quotient(one,X1)),X2),X3) = product(product(X1,quotient(one,X1)),product(X2,X3)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_34,c_0_32]),c_0_32]) ).
cnf(c_0_40,plain,
product(product(X1,X2),quotient(X3,X1)) = product(X1,quotient(product(X2,X3),X1)),
inference(spm,[status(thm)],[c_0_20,c_0_35]) ).
cnf(c_0_41,axiom,
quotient(product(X1,X2),X2) = X1,
sos05 ).
cnf(c_0_42,plain,
product(product(X1,quotient(one,X1)),X1) = difference(difference(X1,one),one),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_22]),c_0_22]) ).
cnf(c_0_43,negated_conjecture,
t(eta(x0),product(x1,x2)) != product(t(eta(x0),x1),t(eta(x0),x2)),
c_0_37 ).
cnf(c_0_44,axiom,
t(X1,X2) = quotient(product(X1,X2),X1),
sos19 ).
cnf(c_0_45,plain,
product(product(X1,X2),quotient(one,X1)) = product(X1,quotient(X2,X1)),
inference(spm,[status(thm)],[c_0_38,c_0_30]) ).
cnf(c_0_46,plain,
product(product(X1,quotient(one,X1)),product(difference(product(X1,quotient(one,X1)),X2),X3)) = product(X2,X3),
inference(spm,[status(thm)],[c_0_39,c_0_20]) ).
cnf(c_0_47,plain,
product(X1,quotient(product(difference(X1,X2),X3),X1)) = product(X2,quotient(X3,X1)),
inference(spm,[status(thm)],[c_0_40,c_0_20]) ).
cnf(c_0_48,plain,
quotient(X1,difference(X2,X1)) = X2,
inference(spm,[status(thm)],[c_0_41,c_0_20]) ).
cnf(c_0_49,plain,
difference(difference(product(X1,quotient(one,X1)),one),one) = product(X1,quotient(one,X1)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_39]),c_0_30]),c_0_22]) ).
cnf(c_0_50,plain,
difference(difference(X1,X2),product(product(difference(X1,X2),X3),X1)) = quotient(product(X3,X2),difference(X1,X2)),
inference(spm,[status(thm)],[c_0_16,c_0_20]) ).
cnf(c_0_51,negated_conjecture,
quotient(product(product(difference(x0,one),x0),product(x1,x2)),product(difference(x0,one),x0)) != product(quotient(product(product(difference(x0,one),x0),x1),product(difference(x0,one),x0)),quotient(product(product(difference(x0,one),x0),x2),product(difference(x0,one),x0))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_43,c_0_24]),c_0_24]),c_0_24]),c_0_44]),c_0_44]),c_0_44]) ).
cnf(c_0_52,plain,
product(X1,quotient(difference(X1,X2),X1)) = product(X2,quotient(one,X1)),
inference(spm,[status(thm)],[c_0_45,c_0_20]) ).
cnf(c_0_53,plain,
difference(product(X1,quotient(one,X1)),product(X2,X3)) = product(difference(product(X1,quotient(one,X1)),X2),X3),
inference(spm,[status(thm)],[c_0_21,c_0_46]) ).
cnf(c_0_54,plain,
quotient(product(difference(X1,X2),X3),X1) = difference(X1,product(X2,quotient(X3,X1))),
inference(spm,[status(thm)],[c_0_21,c_0_47]) ).
cnf(c_0_55,plain,
quotient(one,product(X1,quotient(one,X1))) = difference(product(X1,quotient(one,X1)),one),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_56,plain,
product(X1,difference(product(X2,quotient(one,X2)),one)) = quotient(X1,product(X2,quotient(one,X2))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_49]),c_0_39]),c_0_21]),c_0_22]) ).
cnf(c_0_57,plain,
difference(X1,product(product(X1,product(X2,quotient(one,X2))),X3)) = product(product(X2,quotient(one,X2)),X3),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_39]),c_0_16]) ).
cnf(c_0_58,negated_conjecture,
product(quotient(product(product(x0,quotient(one,x0)),x1),product(x0,quotient(one,x0))),quotient(product(product(x0,quotient(one,x0)),x2),product(x0,quotient(one,x0)))) != quotient(product(product(x0,quotient(one,x0)),product(x1,x2)),product(x0,quotient(one,x0))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_51,c_0_32]),c_0_32]),c_0_32]),c_0_32]),c_0_32]),c_0_32]) ).
cnf(c_0_59,plain,
quotient(product(X1,X2),product(X3,quotient(one,X3))) = product(X1,quotient(X2,product(X3,quotient(one,X3)))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[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_53]),c_0_46]),c_0_55]),c_0_56]) ).
cnf(c_0_60,plain,
product(product(X1,product(X2,quotient(one,X2))),X3) = product(X1,product(product(X2,quotient(one,X2)),X3)),
inference(spm,[status(thm)],[c_0_20,c_0_57]) ).
cnf(c_0_61,negated_conjecture,
product(product(x0,quotient(one,x0)),product(quotient(x1,product(x0,quotient(one,x0))),product(product(x0,quotient(one,x0)),quotient(x2,product(x0,quotient(one,x0)))))) != product(product(x0,quotient(one,x0)),product(x1,quotient(x2,product(x0,quotient(one,x0))))),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_58,c_0_59]),c_0_59]),c_0_39]),c_0_59]),c_0_59]) ).
cnf(c_0_62,plain,
product(quotient(X1,product(X2,quotient(one,X2))),product(product(X2,quotient(one,X2)),X3)) = product(X1,X3),
inference(spm,[status(thm)],[c_0_60,c_0_30]) ).
cnf(c_0_63,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_61,c_0_62])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : GRP768-1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/5.39 % Computer : n026.cluster.edu
% 0.11/5.39 % Model : x86_64 x86_64
% 0.11/5.39 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/5.39 % Memory : 8046.5625MB
% 0.11/5.39 % OS : Linux 6.8.0-71-generic
% 0.11/5.39 % CPULimit : 300
% 0.11/5.39 % WCLimit : 300
% 0.11/5.39 % DateTime : Sun Sep 20 20:41:58 UTC 2026
% 0.11/5.39 % CPUTime :
% 0.11/5.39 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.16/5.44 Running first-order theorem proving
% 0.16/5.44 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
% 9.86/6.93 % Version: 3.5.1
% 9.86/6.93 % Preprocessing class: FSMSSMSSSSSNFFN.
% 9.86/6.93 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 9.86/6.93 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 9.86/6.93 % Starting new_bool_3 with 300s (1) cores
% 9.86/6.93 % Starting new_bool_1 with 300s (1) cores
% 9.86/6.93 % Starting sh5l with 300s (1) cores
% 9.86/6.93 % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 559708 completed with status 0
% 9.86/6.93 % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 9.86/6.93 % Preprocessing class: FSMSSMSSSSSNFFN.
% 9.86/6.93 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 9.86/6.93 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 9.86/6.93 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 9.86/6.93 % No SInE strategy applied
% 9.86/6.93 % Search class: FUUPM-FFMF22-MFFFFFNN
% 9.86/6.93 % partial match(1): FUUPM-FFSF22-MFFFFFNN
% 9.86/6.93 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 9.86/6.93 % Starting SubtermCWHack with 136s (1) cores
% 9.86/6.93 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 9.86/6.93 % Starting E---G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with 136s (1) cores
% 9.86/6.93 % Starting U----_206d_05_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 9.86/6.93 % Starting U----_102_C09_12_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 9.86/6.93 % U----_206d_05_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with pid 559718 completed with status 0
% 9.86/6.93 % Result found by U----_206d_05_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN
% 9.86/6.93 % Preprocessing class: FSMSSMSSSSSNFFN.
% 9.86/6.93 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 9.86/6.93 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 9.86/6.93 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 9.86/6.93 % No SInE strategy applied
% 9.86/6.93 % Search class: FUUPM-FFMF22-MFFFFFNN
% 9.86/6.93 % partial match(1): FUUPM-FFSF22-MFFFFFNN
% 9.86/6.93 % Scheduled 10 strats onto 5 cores with 1500 seconds (1500 total)
% 9.86/6.93 % Starting SubtermCWHack with 136s (1) cores
% 9.86/6.93 % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 9.86/6.93 % Starting E---G----_X1276__C12_02_nc_F1_AE_CS_SP_S5PRR_S2S with 136s (1) cores
% 9.86/6.93 % Starting U----_206d_05_C11_08_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 9.86/6.93 % Preprocessing time : 0.001 s
% 9.86/6.93 % Presaturation interreduction done
% 9.86/6.93
% 9.86/6.93 % Proof found!
% 9.86/6.93 % SZS status Unsatisfiable
% 9.86/6.93 % SZS output start CNFRefutation
% See solution above
% 9.86/6.93 % Parsed axioms : 20
% 9.86/6.93 % Removed by relevancy pruning/SinE : 0
% 9.86/6.93 % Initial clauses : 20
% 9.86/6.93 % Removed in clause preprocessing : 4
% 9.86/6.93 % Initial clauses in saturation : 16
% 9.86/6.93 % Processed clauses : 1098
% 9.86/6.93 % ...of these trivial : 601
% 9.86/6.93 % ...subsumed : 0
% 9.86/6.93 % ...remaining for further processing : 497
% 9.86/6.93 % Other redundant clauses eliminated : 0
% 9.86/6.93 % Clauses deleted for lack of memory : 0
% 9.86/6.93 % Backward-subsumed : 0
% 9.86/6.93 % Backward-rewritten : 181
% 9.86/6.93 % Generated clauses : 53059
% 9.86/6.93 % ...of the previous two non-redundant : 35503
% 9.86/6.93 % ...aggressively subsumed : 0
% 9.86/6.93 % Contextual simplify-reflections : 0
% 9.86/6.93 % Paramodulations : 53059
% 9.86/6.93 % Factorizations : 0
% 9.86/6.93 % NegExts : 0
% 9.86/6.93 % Equation resolutions : 0
% 9.86/6.93 % Disequality decompositions : 0
% 9.86/6.93 % Total rewrite steps : 176109
% 9.86/6.93 % ...of those cached : 167005
% 9.86/6.93 % Propositional unsat checks : 0
% 9.86/6.93 % Propositional check models : 0
% 9.86/6.93 % Propositional check unsatisfiable : 0
% 9.86/6.93 % Propositional clauses : 0
% 9.86/6.93 % Propositional clauses after purity: 0
% 9.86/6.93 % Propositional unsat core size : 0
% 9.86/6.93 % Propositional preprocessing time : 0.000
% 9.86/6.93 % Propositional encoding time : 0.000
% 9.86/6.93 % Propositional solver time : 0.000
% 9.86/6.93 % Success case prop preproc time : 0.000
% 9.86/6.93 % Success case prop encoding time : 0.000
% 9.86/6.93 % Success case prop solver time : 0.000
% 9.86/6.93 % Current number of processed clauses : 300
% 9.86/6.93 % Positive orientable unit clauses : 299
% 9.86/6.93 % Positive unorientable unit clauses: 1
% 9.86/6.93 % Negative unit clauses : 0
% 9.86/6.93 % Non-unit-clauses : 0
% 9.86/6.93 % Current number of unprocessed clauses: 34018
% 9.86/6.93 % ...number of literals in the above : 34018
% 9.86/6.93 % Current number of archived formulas : 0
% 9.86/6.93 % Current number of archived clauses : 201
% 9.86/6.93 % Clause-clause subsumption calls (NU) : 0
% 9.86/6.93 % Rec. Clause-clause subsumption calls : 0
% 9.86/6.93 % Non-unit clause-clause subsumptions : 0
% 9.86/6.93 % Unit Clause-clause subsumption calls : 1
% 9.86/6.93 % Rewrite failures with RHS unbound : 0
% 9.86/6.93 % BW rewrite match attempts : 791
% 9.86/6.93 % BW rewrite match successes : 149
% 9.86/6.93 % Condensation attempts : 0
% 9.86/6.93 % Condensation successes : 0
% 9.86/6.93 % Termbank termtop insertions : 1277503
% 9.86/6.93 % Search garbage collected termcells : 2
% 9.86/6.93
% 9.86/6.93 % -------------------------------------------------
% 9.86/6.93 % User time : 1.288 s
% 9.86/6.93 % System time : 0.047 s
% 9.86/6.93 % Total time : 1.335 s
% 9.86/6.93 % Maximum resident set size: 3644 pages
% 9.86/6.93
% 9.86/6.93 % -------------------------------------------------
% 9.86/6.93 % User time : 6.533 s
% 9.86/6.93 % System time : 0.271 s
% 9.86/6.93 % Total time : 6.804 s
% 9.86/6.93 % Maximum resident set size: 4608 pages
% 9.86/6.93 % E exiting
%------------------------------------------------------------------------------