%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWX212-1 : TPTP v9.3.1. Released v9.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n008.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 03:14:17 PM UTC 2026
% Result : Unsatisfiable 10.26s 1.96s
% Output : CNFRefutation 10.26s
% Verified :
% SZS Type : Refutation
% Derivation depth : 9
% Number of leaves : 25
% Syntax : Number of clauses : 80 ( 80 unt; 0 nHn; 21 RR)
% Number of literals : 80 ( 79 equ; 9 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 8 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 21 ( 21 usr; 7 con; 0-4 aty)
% Number of variables : 137 ( 37 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(goal,negated_conjecture,
eq2(prop_koen(X1,X2,X3),bfalse) != btrue,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',goal) ).
cnf(axiom_079,axiom,
prop_koen(X1,X2,X3) = eq2(rec(y(X1,X2),X3),rec(y(X2,X1),X3)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_079) ).
cnf(axiom_073,axiom,
step(y(X1,X2),X3) = aux2(X3,X1,X2,eps2(X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_073) ).
cnf(axiom_077,axiom,
rec(X1,nil) = eps2(X1),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_077) ).
cnf(axiom_070,axiom,
eps2(atom(X1)) = bfalse,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_070) ).
cnf(axiom_067,axiom,
eps2(y(X1,X2)) = andb(eps2(X1),eps2(X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_067) ).
cnf(axiom_069,axiom,
eps2(nil2) = bfalse,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_069) ).
cnf(axiom_065,axiom,
eps2(eps) = btrue,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_065) ).
cnf(axiom_078,axiom,
rec(X1,cons(X2,X3)) = rec(step(X1,X2),X3),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_078) ).
cnf(axiom_003,axiom,
aux2(X1,X2,X3,bfalse) = x(y(step(X2,X1),X3),nil2),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_003) ).
cnf(axiom_071,axiom,
step(atom(X1),X2) = aux(X2,X1,eq(X1,X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_071) ).
cnf(axiom_083,axiom,
eq(b,c) = bfalse,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_083) ).
cnf(axiom_001,axiom,
aux(X1,X2,bfalse) = nil2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_001) ).
cnf(axiom_066,axiom,
eps2(x(X1,X2)) = orb(eps2(X1),eps2(X2)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_066) ).
cnf(axiom_064,axiom,
andb(bfalse,X1) = bfalse,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_064) ).
cnf(axiom_072,axiom,
step(x(X1,X2),X3) = x(step(X1,X3),step(X2,X3)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_072) ).
cnf(axiom_075,axiom,
step(nil2,X1) = nil2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_075) ).
cnf(axiom_062,axiom,
orb(bfalse,X1) = X1,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_062) ).
cnf(axiom_002,axiom,
aux2(X1,X2,X3,btrue) = x(y(step(X2,X1),X3),step(X3,X1)),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_002) ).
cnf(axiom_076,axiom,
step(eps,X1) = nil2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_076) ).
cnf(axiom_088,axiom,
eq(X1,X1) = btrue,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_088) ).
cnf(axiom,axiom,
aux(X1,X2,btrue) = eps,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom) ).
cnf(axiom_061,axiom,
orb(btrue,X1) = btrue,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_061) ).
cnf(axiom_087,axiom,
eq2(btrue,bfalse) = bfalse,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_087) ).
cnf(axiom_089,axiom,
eq2(X1,X1) = btrue,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',axiom_089) ).
cnf(c_0_25,negated_conjecture,
eq2(prop_koen(X1,X2,X3),bfalse) != btrue,
inference(fof_simplification,[status(thm)],[goal]) ).
cnf(c_0_26,negated_conjecture,
eq2(prop_koen(X1,X2,X3),bfalse) != btrue,
c_0_25 ).
cnf(c_0_27,axiom,
prop_koen(X1,X2,X3) = eq2(rec(y(X1,X2),X3),rec(y(X2,X1),X3)),
axiom_079 ).
cnf(c_0_28,axiom,
step(y(X1,X2),X3) = aux2(X3,X1,X2,eps2(X1)),
axiom_073 ).
cnf(c_0_29,axiom,
rec(X1,nil) = eps2(X1),
axiom_077 ).
cnf(c_0_30,axiom,
eps2(atom(X1)) = bfalse,
axiom_070 ).
cnf(c_0_31,axiom,
eps2(y(X1,X2)) = andb(eps2(X1),eps2(X2)),
axiom_067 ).
cnf(c_0_32,axiom,
eps2(nil2) = bfalse,
axiom_069 ).
cnf(c_0_33,axiom,
eps2(eps) = btrue,
axiom_065 ).
cnf(c_0_34,negated_conjecture,
eq2(eq2(rec(y(X1,X2),X3),rec(y(X2,X1),X3)),bfalse) != btrue,
inference(rw,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_35,axiom,
rec(X1,cons(X2,X3)) = rec(step(X1,X2),X3),
axiom_078 ).
cnf(c_0_36,plain,
step(y(X1,X2),X3) = aux2(X3,X1,X2,rec(X1,nil)),
inference(rw,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_37,plain,
rec(atom(X1),nil) = bfalse,
inference(rw,[status(thm)],[c_0_30,c_0_29]) ).
cnf(c_0_38,axiom,
aux2(X1,X2,X3,bfalse) = x(y(step(X2,X1),X3),nil2),
axiom_003 ).
cnf(c_0_39,axiom,
step(atom(X1),X2) = aux(X2,X1,eq(X1,X2)),
axiom_071 ).
cnf(c_0_40,axiom,
eq(b,c) = bfalse,
axiom_083 ).
cnf(c_0_41,axiom,
aux(X1,X2,bfalse) = nil2,
axiom_001 ).
cnf(c_0_42,axiom,
eps2(x(X1,X2)) = orb(eps2(X1),eps2(X2)),
axiom_066 ).
cnf(c_0_43,plain,
rec(y(X1,X2),nil) = andb(rec(X1,nil),rec(X2,nil)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_31,c_0_29]),c_0_29]),c_0_29]) ).
cnf(c_0_44,plain,
rec(nil2,nil) = bfalse,
inference(rw,[status(thm)],[c_0_32,c_0_29]) ).
cnf(c_0_45,axiom,
andb(bfalse,X1) = bfalse,
axiom_064 ).
cnf(c_0_46,plain,
rec(eps,nil) = btrue,
inference(rw,[status(thm)],[c_0_33,c_0_29]) ).
cnf(c_0_47,negated_conjecture,
eq2(eq2(rec(step(y(X1,X2),X3),X4),rec(step(y(X2,X1),X3),X4)),bfalse) != btrue,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_35]) ).
cnf(c_0_48,plain,
x(y(step(atom(X1),X2),X3),nil2) = step(y(atom(X1),X3),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_38]) ).
cnf(c_0_49,plain,
step(atom(b),c) = nil2,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_41]) ).
cnf(c_0_50,axiom,
step(x(X1,X2),X3) = x(step(X1,X3),step(X2,X3)),
axiom_072 ).
cnf(c_0_51,axiom,
step(nil2,X1) = nil2,
axiom_075 ).
cnf(c_0_52,plain,
rec(x(X1,X2),nil) = orb(rec(X1,nil),rec(X2,nil)),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_42,c_0_29]),c_0_29]),c_0_29]) ).
cnf(c_0_53,plain,
rec(y(nil2,X1),nil) = bfalse,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45]) ).
cnf(c_0_54,axiom,
orb(bfalse,X1) = X1,
axiom_062 ).
cnf(c_0_55,axiom,
aux2(X1,X2,X3,btrue) = x(y(step(X2,X1),X3),step(X3,X1)),
axiom_002 ).
cnf(c_0_56,axiom,
step(eps,X1) = nil2,
axiom_076 ).
cnf(c_0_57,plain,
aux2(X1,eps,X2,btrue) = step(y(eps,X2),X1),
inference(spm,[status(thm)],[c_0_36,c_0_46]) ).
cnf(c_0_58,negated_conjecture,
eq2(eq2(rec(step(step(y(X1,X2),X3),X4),X5),rec(step(step(y(X2,X1),X3),X4),X5)),bfalse) != btrue,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_35]),c_0_35]) ).
cnf(c_0_59,plain,
step(y(atom(b),X1),c) = x(y(nil2,X1),nil2),
inference(spm,[status(thm)],[c_0_48,c_0_49]) ).
cnf(c_0_60,plain,
step(x(X1,nil2),X2) = x(step(X1,X2),nil2),
inference(spm,[status(thm)],[c_0_50,c_0_51]) ).
cnf(c_0_61,plain,
step(y(nil2,X1),X2) = x(y(nil2,X1),nil2),
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_44]),c_0_38]),c_0_51]) ).
cnf(c_0_62,plain,
rec(x(y(nil2,X1),X2),nil) = rec(X2,nil),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_54]) ).
cnf(c_0_63,axiom,
eq(X1,X1) = btrue,
axiom_088 ).
cnf(c_0_64,axiom,
aux(X1,X2,btrue) = eps,
axiom ).
cnf(c_0_65,plain,
x(y(nil2,X1),step(X1,X2)) = step(y(eps,X1),X2),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_57]) ).
cnf(c_0_66,negated_conjecture,
eq2(eq2(rec(step(step(y(X1,atom(b)),c),X2),X3),rec(x(x(y(nil2,X1),nil2),nil2),X3)),bfalse) != btrue,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_60]),c_0_61]) ).
cnf(c_0_67,plain,
rec(x(x(y(nil2,X1),X2),X3),nil) = rec(x(X2,X3),nil),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_62]),c_0_52]) ).
cnf(c_0_68,plain,
rec(x(nil2,X1),nil) = rec(X1,nil),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_44]),c_0_54]) ).
cnf(c_0_69,plain,
step(atom(X1),X1) = eps,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_63]),c_0_64]) ).
cnf(c_0_70,plain,
rec(step(y(eps,X1),X2),nil) = rec(step(X1,X2),nil),
inference(spm,[status(thm)],[c_0_62,c_0_65]) ).
cnf(c_0_71,negated_conjecture,
eq2(eq2(rec(step(step(y(X1,atom(b)),c),X2),nil),bfalse),bfalse) != btrue,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_67]),c_0_68]),c_0_44]) ).
cnf(c_0_72,plain,
step(y(atom(X1),X2),X1) = x(y(eps,X2),nil2),
inference(spm,[status(thm)],[c_0_48,c_0_69]) ).
cnf(c_0_73,plain,
rec(x(step(y(eps,X1),X2),X3),nil) = rec(x(step(X1,X2),X3),nil),
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_70]),c_0_52]) ).
cnf(c_0_74,axiom,
orb(btrue,X1) = btrue,
axiom_061 ).
cnf(c_0_75,negated_conjecture,
eq2(eq2(rec(x(step(atom(b),X1),nil2),nil),bfalse),bfalse) != btrue,
inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_71,c_0_72]),c_0_60]),c_0_73]) ).
cnf(c_0_76,plain,
rec(x(eps,X1),nil) = btrue,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_46]),c_0_74]) ).
cnf(c_0_77,axiom,
eq2(btrue,bfalse) = bfalse,
axiom_087 ).
cnf(c_0_78,axiom,
eq2(X1,X1) = btrue,
axiom_089 ).
cnf(c_0_79,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_69]),c_0_76]),c_0_77]),c_0_78])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWX212-1 : TPTP v9.3.1. Released v9.3.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.37 % Computer : n008.cluster.edu
% 0.11/0.37 % Model : x86_64 x86_64
% 0.11/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.37 % Memory : 8046.5625MB
% 0.11/0.37 % OS : Linux 6.8.0-71-generic
% 0.11/0.37 % CPULimit : 300
% 0.11/0.37 % WCLimit : 300
% 0.11/0.37 % DateTime : Mon Sep 21 10:35:39 UTC 2026
% 0.11/0.38 % CPUTime :
% 0.11/0.38 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.11/0.42 Running first-order theorem proving
% 0.11/0.42 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
% 10.26/1.96 % Version: 3.5.1
% 10.26/1.96 % Preprocessing class: FSMSSMSMSSSNFFN.
% 10.26/1.96 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 10.26/1.96 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 10.26/1.96 % Starting new_bool_3 with 300s (1) cores
% 10.26/1.96 % Starting new_bool_1 with 300s (1) cores
% 10.26/1.96 % Starting sh5l with 300s (1) cores
% 10.26/1.96 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 765545 completed with status 0
% 10.26/1.96 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 10.26/1.96 % Preprocessing class: FSMSSMSMSSSNFFN.
% 10.26/1.96 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 10.26/1.96 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 10.26/1.96 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 10.26/1.96 % No SInE strategy applied
% 10.26/1.96 % Search class: FUUPM-FFMM32-MFFFFFNN
% 10.26/1.96 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 10.26/1.96 % Starting SubtermCWHack with 136s (1) cores
% 10.26/1.96 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 10.26/1.96 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 10.26/1.96 % Starting new_bool_3 with 136s (1) cores
% 10.26/1.96 % Starting new_bool_1 with 136s (1) cores
% 10.26/1.96 % G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with pid 765550 completed with status 0
% 10.26/1.96 % Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI
% 10.26/1.96 % Preprocessing class: FSMSSMSMSSSNFFN.
% 10.26/1.96 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 10.26/1.96 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 1500s (5) cores
% 10.26/1.96 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 10.26/1.96 % No SInE strategy applied
% 10.26/1.96 % Search class: FUUPM-FFMM32-MFFFFFNN
% 10.26/1.96 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 10.26/1.96 % Starting SubtermCWHack with 136s (1) cores
% 10.26/1.96 % Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S2SI with 151s (1) cores
% 10.26/1.96 % Preprocessing time : 0.002 s
% 10.26/1.96 % Presaturation interreduction done
% 10.26/1.96
% 10.26/1.96 % Proof found!
% 10.26/1.96 % SZS status Unsatisfiable
% 10.26/1.96 % SZS output start CNFRefutation
% See solution above
% 10.26/1.96 % Parsed axioms : 91
% 10.26/1.96 % Removed by relevancy pruning/SinE : 0
% 10.26/1.96 % Initial clauses : 91
% 10.26/1.96 % Removed in clause preprocessing : 2
% 10.26/1.96 % Initial clauses in saturation : 89
% 10.26/1.96 % Processed clauses : 11939
% 10.26/1.96 % ...of these trivial : 540
% 10.26/1.96 % ...subsumed : 9259
% 10.26/1.96 % ...remaining for further processing : 2140
% 10.26/1.96 % Other redundant clauses eliminated : 0
% 10.26/1.96 % Clauses deleted for lack of memory : 0
% 10.26/1.96 % Backward-subsumed : 0
% 10.26/1.96 % Backward-rewritten : 133
% 10.26/1.96 % Generated clauses : 91641
% 10.26/1.96 % ...of the previous two non-redundant : 67464
% 10.26/1.96 % ...aggressively subsumed : 0
% 10.26/1.96 % Contextual simplify-reflections : 0
% 10.26/1.96 % Paramodulations : 91641
% 10.26/1.96 % Factorizations : 0
% 10.26/1.96 % NegExts : 0
% 10.26/1.96 % Equation resolutions : 0
% 10.26/1.96 % Disequality decompositions : 0
% 10.26/1.96 % Total rewrite steps : 96512
% 10.26/1.96 % ...of those cached : 65329
% 10.26/1.96 % Propositional unsat checks : 0
% 10.26/1.96 % Propositional check models : 0
% 10.26/1.96 % Propositional check unsatisfiable : 0
% 10.26/1.96 % Propositional clauses : 0
% 10.26/1.96 % Propositional clauses after purity: 0
% 10.26/1.96 % Propositional unsat core size : 0
% 10.26/1.96 % Propositional preprocessing time : 0.000
% 10.26/1.96 % Propositional encoding time : 0.000
% 10.26/1.96 % Propositional solver time : 0.000
% 10.26/1.96 % Success case prop preproc time : 0.000
% 10.26/1.96 % Success case prop encoding time : 0.000
% 10.26/1.96 % Success case prop solver time : 0.000
% 10.26/1.96 % Current number of processed clauses : 1918
% 10.26/1.96 % Positive orientable unit clauses : 1062
% 10.26/1.96 % Positive unorientable unit clauses: 18
% 10.26/1.96 % Negative unit clauses : 838
% 10.26/1.96 % Non-unit-clauses : 0
% 10.26/1.96 % Current number of unprocessed clauses: 54962
% 10.26/1.96 % ...number of literals in the above : 54962
% 10.26/1.96 % Current number of archived formulas : 0
% 10.26/1.96 % Current number of archived clauses : 224
% 10.26/1.96 % Clause-clause subsumption calls (NU) : 0
% 10.26/1.96 % Rec. Clause-clause subsumption calls : 0
% 10.26/1.96 % Non-unit clause-clause subsumptions : 0
% 10.26/1.96 % Unit Clause-clause subsumption calls : 125978
% 10.26/1.96 % Rewrite failures with RHS unbound : 38
% 10.26/1.96 % BW rewrite match attempts : 7160
% 10.26/1.96 % BW rewrite match successes : 143
% 10.26/1.96 % Condensation attempts : 0
% 10.26/1.96 % Condensation successes : 0
% 10.26/1.96 % Termbank termtop insertions : 1717105
% 10.26/1.96 % Search garbage collected termcells : 2
% 10.26/1.96
% 10.26/1.96 % -------------------------------------------------
% 10.26/1.96 % User time : 1.275 s
% 10.26/1.96 % System time : 0.079 s
% 10.26/1.96 % Total time : 1.354 s
% 10.26/1.96 % Maximum resident set size: 3684 pages
% 10.26/1.96
% 10.26/1.96 % -------------------------------------------------
% 10.26/1.96 % User time : 6.735 s
% 10.26/1.96 % System time : 0.477 s
% 10.26/1.96 % Total time : 7.213 s
% 10.26/1.96 % Maximum resident set size: 4864 pages
% 10.26/1.96 % E exiting
%------------------------------------------------------------------------------