%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL416-10 : TPTP v9.3.1. Released v7.3.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n007.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 01:12:41 PM UTC 2026
% Result : Unsatisfiable 67.63s 10.39s
% Output : CNFRefutation 67.63s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 4
% Syntax : Number of clauses : 43 ( 43 unt; 0 nHn; 4 RR)
% Number of literals : 43 ( 42 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 12 ( 3 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 5 ( 5 usr; 2 con; 0-4 aty)
% Number of variables : 187 ( 2 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(condensed_detachment,axiom,
ifeq(is_a_theorem(equivalent(X1,X2)),true,ifeq(is_a_theorem(X1),true,is_a_theorem(X2),true),true) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',condensed_detachment) ).
cnf(xcb,axiom,
is_a_theorem(equivalent(X1,equivalent(equivalent(equivalent(X1,X2),equivalent(X3,X2)),X3))) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',xcb) ).
cnf(ifeq_axiom,axiom,
ifeq(X1,X1,X2,X3) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ifeq_axiom) ).
cnf(prove_reflexivity,negated_conjecture,
is_a_theorem(equivalent(a,a)) != true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_reflexivity) ).
cnf(c_0_4,axiom,
ifeq(is_a_theorem(equivalent(X1,X2)),true,ifeq(is_a_theorem(X1),true,is_a_theorem(X2),true),true) = true,
condensed_detachment ).
cnf(c_0_5,axiom,
is_a_theorem(equivalent(X1,equivalent(equivalent(equivalent(X1,X2),equivalent(X3,X2)),X3))) = true,
xcb ).
cnf(c_0_6,axiom,
ifeq(X1,X1,X2,X3) = X2,
ifeq_axiom ).
cnf(c_0_7,plain,
ifeq(is_a_theorem(X1),true,is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(X3,X2)),X3)),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_5]),c_0_6]) ).
cnf(c_0_8,plain,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(X1,equivalent(equivalent(equivalent(X1,X2),equivalent(X3,X2)),X3)),X4),equivalent(X5,X4)),X5)) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_5]),c_0_6]) ).
cnf(c_0_9,plain,
ifeq(is_a_theorem(equivalent(equivalent(X1,equivalent(equivalent(equivalent(X1,X2),equivalent(X3,X2)),X3)),X4)),true,is_a_theorem(X4),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_5]),c_0_6]) ).
cnf(c_0_10,plain,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(X1,equivalent(equivalent(equivalent(X1,X2),equivalent(X3,X2)),X3)),X4),equivalent(X5,X4)),X5),X6),equivalent(X7,X6)),X7)) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_8]),c_0_6]) ).
cnf(c_0_11,plain,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(X1,equivalent(equivalent(equivalent(X1,X2),equivalent(X3,X2)),X3)),X4),X5),equivalent(X4,X5))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_8]),c_0_6]) ).
cnf(c_0_12,plain,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(X1,equivalent(equivalent(equivalent(X1,X2),equivalent(X3,X2)),X3)),X4),equivalent(X5,X4)),X5),X6),X7),equivalent(X6,X7))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_6]) ).
cnf(c_0_13,plain,
is_a_theorem(equivalent(X1,equivalent(equivalent(equivalent(equivalent(equivalent(X2,equivalent(equivalent(equivalent(X2,X3),equivalent(X4,X3)),X4)),X1),X5),equivalent(X6,X5)),X6))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_11]),c_0_6]) ).
cnf(c_0_14,plain,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(X1,equivalent(equivalent(equivalent(X1,X2),equivalent(X3,X2)),X3)),X4),X5),equivalent(X4,X5)),X6),equivalent(X7,X6)),X7)) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_11]),c_0_6]) ).
cnf(c_0_15,plain,
ifeq(is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(X1,equivalent(equivalent(equivalent(X1,X2),equivalent(X3,X2)),X3)),X4),equivalent(X5,X4)),X5),X6),X7)),true,is_a_theorem(equivalent(X6,X7)),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_12]),c_0_6]) ).
cnf(c_0_16,plain,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X1,equivalent(equivalent(equivalent(X1,X2),equivalent(X3,X2)),X3)),equivalent(X4,equivalent(equivalent(equivalent(X4,X5),equivalent(X6,X5)),X6))),X7),equivalent(X8,X7)),X8)) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_13]),c_0_6]) ).
cnf(c_0_17,plain,
ifeq(is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(X1,equivalent(equivalent(equivalent(X1,X2),equivalent(X3,X2)),X3)),X4),X5),equivalent(X4,X5)),X6),equivalent(X7,X6))),true,is_a_theorem(X7),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_14]),c_0_6]) ).
cnf(c_0_18,plain,
is_a_theorem(equivalent(equivalent(X1,equivalent(X2,equivalent(equivalent(equivalent(X2,X3),equivalent(X4,X3)),X4))),X1)) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_6]) ).
cnf(c_0_19,plain,
ifeq(is_a_theorem(equivalent(equivalent(equivalent(X1,equivalent(equivalent(equivalent(X1,X2),equivalent(X3,X2)),X3)),X4),equivalent(X5,X4))),true,is_a_theorem(X5),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_8]),c_0_6]) ).
cnf(c_0_20,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,equivalent(equivalent(equivalent(X1,X2),equivalent(X3,X2)),X3)),X4),equivalent(equivalent(equivalent(X4,X5),equivalent(X6,X5)),X6))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_6]) ).
cnf(c_0_21,plain,
is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X1,X2))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_6]) ).
cnf(c_0_22,plain,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X2)),X3),equivalent(X4,X3)),X4)) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_21]),c_0_6]) ).
cnf(c_0_23,plain,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X2)),X3),X4),equivalent(X3,X4))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_22]),c_0_6]) ).
cnf(c_0_24,plain,
ifeq(is_a_theorem(equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X2)),X3),equivalent(X4,X3))),true,is_a_theorem(X4),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_22]),c_0_6]) ).
cnf(c_0_25,plain,
is_a_theorem(equivalent(X1,equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(X2,X3),equivalent(X2,X3)),X1),X4),equivalent(X5,X4)),X5))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_23]),c_0_6]) ).
cnf(c_0_26,plain,
ifeq(is_a_theorem(equivalent(X1,equivalent(X2,equivalent(equivalent(equivalent(X2,X3),equivalent(X4,X3)),X4)))),true,is_a_theorem(X1),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_18]),c_0_6]) ).
cnf(c_0_27,plain,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X2)),equivalent(equivalent(equivalent(X3,X4),equivalent(X3,X4)),X5)),X6),equivalent(X5,X6))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_6]) ).
cnf(c_0_28,plain,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X2)),equivalent(equivalent(equivalent(X3,X4),equivalent(X3,X4)),X5)),equivalent(equivalent(equivalent(X5,X6),equivalent(X7,X6)),X7))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_6]) ).
cnf(c_0_29,plain,
is_a_theorem(equivalent(equivalent(X1,X2),equivalent(equivalent(equivalent(equivalent(X3,X4),equivalent(X3,X4)),X1),X2))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_28]),c_0_6]) ).
cnf(c_0_30,plain,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X1,equivalent(X2,equivalent(equivalent(equivalent(X2,X3),equivalent(X4,X3)),X4))),X1),X5),equivalent(X6,X5)),X6)) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_18]),c_0_6]) ).
cnf(c_0_31,plain,
ifeq(is_a_theorem(equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X2)),X3),X4)),true,is_a_theorem(equivalent(X3,X4)),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_23]),c_0_6]) ).
cnf(c_0_32,plain,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(equivalent(equivalent(equivalent(X3,X4),equivalent(X3,X4)),X1),X2)),X5),equivalent(X6,X5)),X6)) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_29]),c_0_6]) ).
cnf(c_0_33,plain,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X2)),X3),equivalent(X4,X3)),X4),X5),equivalent(X6,X5)),X6)) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_7,c_0_22]),c_0_6]) ).
cnf(c_0_34,plain,
ifeq(is_a_theorem(equivalent(equivalent(equivalent(equivalent(X1,equivalent(X2,equivalent(equivalent(equivalent(X2,X3),equivalent(X4,X3)),X4))),X1),X5),equivalent(X6,X5))),true,is_a_theorem(X6),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_30]),c_0_6]) ).
cnf(c_0_35,plain,
is_a_theorem(equivalent(equivalent(X1,equivalent(equivalent(X2,X3),equivalent(equivalent(equivalent(equivalent(X4,X5),equivalent(X4,X5)),X2),X3))),X1)) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_6]) ).
cnf(c_0_36,plain,
ifeq(is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X2)),X3),equivalent(X4,X3)),X4),X5),equivalent(X6,X5))),true,is_a_theorem(X6),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_4,c_0_33]),c_0_6]) ).
cnf(c_0_37,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(equivalent(equivalent(equivalent(X3,X4),equivalent(X3,X4)),X1),X2)),equivalent(X5,equivalent(equivalent(equivalent(X5,X6),equivalent(X7,X6)),X7)))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_6]) ).
cnf(c_0_38,negated_conjecture,
is_a_theorem(equivalent(a,a)) != true,
inference(fof_simplification,[status(thm)],[prove_reflexivity]) ).
cnf(c_0_39,plain,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X2)),X3),X3)) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_6]) ).
cnf(c_0_40,negated_conjecture,
is_a_theorem(equivalent(a,a)) != true,
c_0_38 ).
cnf(c_0_41,plain,
is_a_theorem(equivalent(X1,X1)) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_39]),c_0_6]) ).
cnf(c_0_42,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_40,c_0_41])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.05 % Problem : LCL416-10 : TPTP v9.3.1. Released v7.3.0.
% 0.00/0.08 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.18/0.48 % Computer : n007.cluster.edu
% 0.18/0.48 % Model : x86_64 x86_64
% 0.18/0.48 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.18/0.48 % Memory : 8046.5625MB
% 0.18/0.48 % OS : Linux 6.8.0-71-generic
% 0.18/0.48 % CPULimit : 300
% 0.18/0.48 % WCLimit : 300
% 0.18/0.48 % DateTime : Mon Sep 21 00:27:36 UTC 2026
% 0.18/0.48 % CPUTime :
% 0.18/0.48 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.24/0.55 Running first-order theorem proving
% 0.24/0.55 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
% 67.63/10.39 % Version: 3.5.1
% 67.63/10.39 % Preprocessing class: FSSSSMSSSSSNFFN.
% 67.63/10.39 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 67.63/10.39 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 67.63/10.39 % Starting new_bool_3 with 300s (1) cores
% 67.63/10.39 % Starting new_bool_1 with 300s (1) cores
% 67.63/10.39 % Starting sh5l with 300s (1) cores
% 67.63/10.39 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 3965435 completed with status 0
% 67.63/10.39 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 67.63/10.39 % Preprocessing class: FSSSSMSSSSSNFFN.
% 67.63/10.39 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 67.63/10.39 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 67.63/10.39 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 67.63/10.39 % No SInE strategy applied
% 67.63/10.39 % Search class: FUUPS-FFSF32-MFFFFFNN
% 67.63/10.39 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 67.63/10.39 % Starting SubtermCWHack with 136s (1) cores
% 67.63/10.39 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 67.63/10.39 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 67.63/10.39 % Starting new_bool_3 with 136s (1) cores
% 67.63/10.39 % Starting new_bool_1 with 136s (1) cores
% 67.63/10.39 % new_bool_1 with pid 3965446 completed with status 0
% 67.63/10.39 % Result found by new_bool_1
% 67.63/10.39 % Preprocessing class: FSSSSMSSSSSNFFN.
% 67.63/10.39 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 67.63/10.39 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 67.63/10.39 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 67.63/10.39 % No SInE strategy applied
% 67.63/10.39 % Search class: FUUPS-FFSF32-MFFFFFNN
% 67.63/10.39 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 67.63/10.39 % Starting SubtermCWHack with 136s (1) cores
% 67.63/10.39 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 67.63/10.39 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 67.63/10.39 % Starting new_bool_3 with 136s (1) cores
% 67.63/10.39 % Starting new_bool_1 with 136s (1) cores
% 67.63/10.39 % Preprocessing time : 0.002 s
% 67.63/10.39 % Presaturation interreduction done
% 67.63/10.39
% 67.63/10.39 % Proof found!
% 67.63/10.39 % SZS status Unsatisfiable
% 67.63/10.39 % SZS output start CNFRefutation
% See solution above
% 67.63/10.39 % Parsed axioms : 4
% 67.63/10.39 % Removed by relevancy pruning/SinE : 0
% 67.63/10.39 % Initial clauses : 4
% 67.63/10.39 % Removed in clause preprocessing : 0
% 67.63/10.39 % Initial clauses in saturation : 4
% 67.63/10.39 % Processed clauses : 5516
% 67.63/10.39 % ...of these trivial : 4142
% 67.63/10.39 % ...subsumed : 0
% 67.63/10.39 % ...remaining for further processing : 1374
% 67.63/10.39 % Other redundant clauses eliminated : 0
% 67.63/10.39 % Clauses deleted for lack of memory : 0
% 67.63/10.39 % Backward-subsumed : 0
% 67.63/10.39 % Backward-rewritten : 52
% 67.63/10.39 % Generated clauses : 367078
% 67.63/10.39 % ...of the previous two non-redundant : 318297
% 67.63/10.39 % ...aggressively subsumed : 0
% 67.63/10.39 % Contextual simplify-reflections : 0
% 67.63/10.39 % Paramodulations : 367078
% 67.63/10.39 % Factorizations : 0
% 67.63/10.39 % NegExts : 0
% 67.63/10.39 % Equation resolutions : 0
% 67.63/10.39 % Disequality decompositions : 0
% 67.63/10.39 % Total rewrite steps : 247597
% 67.63/10.39 % ...of those cached : 146867
% 67.63/10.39 % Propositional unsat checks : 0
% 67.63/10.39 % Propositional check models : 0
% 67.63/10.39 % Propositional check unsatisfiable : 0
% 67.63/10.39 % Propositional clauses : 0
% 67.63/10.39 % Propositional clauses after purity: 0
% 67.63/10.39 % Propositional unsat core size : 0
% 67.63/10.39 % Propositional preprocessing time : 0.000
% 67.63/10.39 % Propositional encoding time : 0.000
% 67.63/10.39 % Propositional solver time : 0.000
% 67.63/10.39 % Success case prop preproc time : 0.000
% 67.63/10.39 % Success case prop encoding time : 0.000
% 67.63/10.39 % Success case prop solver time : 0.000
% 67.63/10.39 % Current number of processed clauses : 1318
% 67.63/10.39 % Positive orientable unit clauses : 1318
% 67.63/10.39 % Positive unorientable unit clauses: 0
% 67.63/10.39 % Negative unit clauses : 0
% 67.63/10.39 % Non-unit-clauses : 0
% 67.63/10.39 % Current number of unprocessed clauses: 312784
% 67.63/10.39 % ...number of literals in the above : 312784
% 67.63/10.39 % Current number of archived formulas : 0
% 67.63/10.39 % Current number of archived clauses : 56
% 67.63/10.39 % Clause-clause subsumption calls (NU) : 0
% 67.63/10.39 % Rec. Clause-clause subsumption calls : 0
% 67.63/10.39 % Non-unit clause-clause subsumptions : 0
% 67.63/10.39 % Unit Clause-clause subsumption calls : 0
% 67.63/10.39 % Rewrite failures with RHS unbound : 0
% 67.63/10.39 % BW rewrite match attempts : 452792
% 67.63/10.39 % BW rewrite match successes : 52
% 67.63/10.39 % Condensation attempts : 0
% 67.63/10.39 % Condensation successes : 0
% 67.63/10.39 % Termbank termtop insertions : 9640920
% 67.63/10.39 % Search garbage collected termcells : 2
% 67.63/10.39
% 67.63/10.39 % -------------------------------------------------
% 67.63/10.39 % User time : 9.200 s
% 67.63/10.39 % System time : 0.291 s
% 67.63/10.39 % Total time : 9.491 s
% 67.63/10.39 % Maximum resident set size: 3632 pages
% 67.63/10.39
% 67.63/10.39 % -------------------------------------------------
% 67.63/10.39 % User time : 46.600 s
% 67.63/10.39 % System time : 1.392 s
% 67.63/10.39 % Total time : 47.992 s
% 67.63/10.39 % Maximum resident set size: 4864 pages
% 67.63/10.39 % E exiting
%------------------------------------------------------------------------------