%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : LCL096-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 : n014.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:18:27 PM UTC 2026
% Result : Unsatisfiable 10.92s 2.25s
% Output : CNFRefutation 10.92s
% Verified :
% SZS Type : Refutation
% Derivation depth : 21
% Number of leaves : 6
% Syntax : Number of clauses : 50 ( 50 unt; 0 nHn; 4 RR)
% Number of literals : 50 ( 49 equ; 3 neg)
% Maximal clause size : 1 ( 1 avg)
% Maximal term depth : 9 ( 2 avg)
% Number of predicates : 2 ( 0 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 4 con; 0-4 aty)
% Number of variables : 167 ( 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(lg_2,axiom,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),equivalent(X2,X3)),X4),X4)) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lg_2) ).
cnf(ifeq_axiom,axiom,
ifeq(X1,X1,X2,X3) = X2,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',ifeq_axiom) ).
cnf(lg_4,axiom,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(X1,X2),X3),X4),equivalent(equivalent(equivalent(X1,X5),X3),equivalent(equivalent(X2,X5),X4)))) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lg_4) ).
cnf(lg_3,axiom,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),X4),equivalent(equivalent(X2,X3),X4)),X5),X5)) = true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',lg_3) ).
cnf(prove_lg_1,negated_conjecture,
is_a_theorem(equivalent(equivalent(equivalent(a,equivalent(equivalent(b,b),a)),c),c)) != true,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',prove_lg_1) ).
cnf(c_0_6,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_7,axiom,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),equivalent(X2,X3)),X4),X4)) = true,
lg_2 ).
cnf(c_0_8,axiom,
ifeq(X1,X1,X2,X3) = X2,
ifeq_axiom ).
cnf(c_0_9,plain,
ifeq(is_a_theorem(equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),equivalent(X2,X3)),X4)),true,is_a_theorem(X4),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8]) ).
cnf(c_0_10,axiom,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(X1,X2),X3),X4),equivalent(equivalent(equivalent(X1,X5),X3),equivalent(equivalent(X2,X5),X4)))) = true,
lg_4 ).
cnf(c_0_11,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),equivalent(equivalent(X4,X2),equivalent(X4,X3)))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_10]),c_0_8]) ).
cnf(c_0_12,plain,
ifeq(is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X1,X3))),true,is_a_theorem(equivalent(equivalent(X4,X2),equivalent(X4,X3))),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_11]),c_0_8]) ).
cnf(c_0_13,plain,
is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X3)),equivalent(X1,equivalent(X2,X3)))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_11]),c_0_8]) ).
cnf(c_0_14,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),equivalent(X2,X3))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_13]),c_0_8]) ).
cnf(c_0_15,plain,
ifeq(is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X1,X3))),true,is_a_theorem(equivalent(X2,X3)),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_14]),c_0_8]) ).
cnf(c_0_16,plain,
is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X1,X2))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_11]),c_0_8]) ).
cnf(c_0_17,plain,
is_a_theorem(equivalent(X1,equivalent(equivalent(X2,X2),X1))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_10]),c_0_8]) ).
cnf(c_0_18,plain,
is_a_theorem(equivalent(X1,X1)) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_8]) ).
cnf(c_0_19,plain,
is_a_theorem(equivalent(equivalent(X1,X1),equivalent(equivalent(equivalent(X2,X3),equivalent(X2,X4)),equivalent(X3,X4)))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_17]),c_0_8]) ).
cnf(c_0_20,plain,
ifeq(is_a_theorem(equivalent(equivalent(X1,X1),X2)),true,is_a_theorem(X2),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_18]),c_0_8]) ).
cnf(c_0_21,axiom,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),X4),equivalent(equivalent(X2,X3),X4)),X5),X5)) = true,
lg_3 ).
cnf(c_0_22,plain,
is_a_theorem(equivalent(equivalent(X1,equivalent(equivalent(X2,X3),equivalent(X2,X4))),equivalent(X1,equivalent(X3,X4)))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_19]),c_0_8]) ).
cnf(c_0_23,plain,
ifeq(is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),equivalent(X2,X3)),X4),X4),X5)),true,is_a_theorem(X5),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_7]),c_0_8]) ).
cnf(c_0_24,plain,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),X4),equivalent(equivalent(X2,X3),X4))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_8]) ).
cnf(c_0_25,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),X3),equivalent(equivalent(X4,X2),equivalent(equivalent(X1,X4),X3)))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_10]),c_0_8]) ).
cnf(c_0_26,plain,
ifeq(is_a_theorem(equivalent(X1,equivalent(equivalent(X2,X3),equivalent(X2,X4)))),true,is_a_theorem(equivalent(X1,equivalent(X3,X4))),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_22]),c_0_8]) ).
cnf(c_0_27,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),X3),equivalent(equivalent(equivalent(X4,X1),equivalent(X4,X2)),X3))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_8]) ).
cnf(c_0_28,plain,
is_a_theorem(equivalent(equivalent(X1,X2),equivalent(equivalent(X3,X1),equivalent(X3,X2)))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_25]),c_0_8]) ).
cnf(c_0_29,plain,
ifeq(is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X1,X2),X3),X4),equivalent(equivalent(equivalent(X1,X5),X3),equivalent(equivalent(X2,X5),X4))),X6)),true,is_a_theorem(X6),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_10]),c_0_8]) ).
cnf(c_0_30,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(equivalent(X3,X1),X4)),equivalent(equivalent(X3,X2),X4))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_27]),c_0_8]) ).
cnf(c_0_31,plain,
ifeq(is_a_theorem(equivalent(X1,X2)),true,is_a_theorem(equivalent(equivalent(X3,X1),equivalent(X3,X2))),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_28]),c_0_8]) ).
cnf(c_0_32,plain,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(X1,X1),X2),X3),equivalent(X2,X3))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_22]),c_0_8]) ).
cnf(c_0_33,plain,
is_a_theorem(equivalent(equivalent(X1,equivalent(equivalent(X2,X2),X3)),equivalent(X1,X3))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_12,c_0_30]),c_0_8]) ).
cnf(c_0_34,plain,
ifeq(is_a_theorem(equivalent(equivalent(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),X4),equivalent(equivalent(X2,X3),X4)),X5)),true,is_a_theorem(X5),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_21]),c_0_8]) ).
cnf(c_0_35,plain,
is_a_theorem(equivalent(equivalent(X1,equivalent(equivalent(equivalent(X2,X2),X3),X4)),equivalent(X1,equivalent(X3,X4)))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_8]) ).
cnf(c_0_36,plain,
ifeq(is_a_theorem(equivalent(X1,equivalent(equivalent(X2,X2),X3))),true,is_a_theorem(equivalent(X1,X3)),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_33]),c_0_8]) ).
cnf(c_0_37,plain,
ifeq(is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(X1,X3)),X4)),true,is_a_theorem(equivalent(equivalent(X2,X3),X4)),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_24]),c_0_8]) ).
cnf(c_0_38,plain,
is_a_theorem(equivalent(equivalent(equivalent(equivalent(X1,equivalent(X2,X2)),equivalent(X1,X3)),X4),equivalent(X3,X4))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_8]) ).
cnf(c_0_39,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(equivalent(X2,X1),X3)),X3)) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_30]),c_0_8]) ).
cnf(c_0_40,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),X3),equivalent(X2,equivalent(equivalent(X1,equivalent(X4,X4)),X3)))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_8]) ).
cnf(c_0_41,plain,
is_a_theorem(equivalent(equivalent(X1,equivalent(equivalent(X2,X3),equivalent(equivalent(X3,X2),X4))),equivalent(X1,X4))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_39]),c_0_8]) ).
cnf(c_0_42,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,equivalent(equivalent(X1,equivalent(X2,X2)),X3)),X4),equivalent(X3,X4))) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_26,c_0_40]),c_0_8]) ).
cnf(c_0_43,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,equivalent(X2,X3)),equivalent(X1,equivalent(equivalent(X3,X2),X4))),X4)) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_9,c_0_41]),c_0_8]) ).
cnf(c_0_44,negated_conjecture,
is_a_theorem(equivalent(equivalent(equivalent(a,equivalent(equivalent(b,b),a)),c),c)) != true,
inference(fof_simplification,[status(thm)],[prove_lg_1]) ).
cnf(c_0_45,plain,
ifeq(is_a_theorem(equivalent(equivalent(X1,equivalent(equivalent(X1,equivalent(X2,X2)),X3)),X4)),true,is_a_theorem(equivalent(X3,X4)),true) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_6,c_0_42]),c_0_8]) ).
cnf(c_0_46,plain,
is_a_theorem(equivalent(equivalent(X1,equivalent(equivalent(X2,X3),equivalent(equivalent(X1,equivalent(X3,X2)),X4))),X4)) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_43]),c_0_8]) ).
cnf(c_0_47,negated_conjecture,
is_a_theorem(equivalent(equivalent(equivalent(a,equivalent(equivalent(b,b),a)),c),c)) != true,
c_0_44 ).
cnf(c_0_48,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,equivalent(equivalent(X2,X2),X1)),X3),X3)) = true,
inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_8]) ).
cnf(c_0_49,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_47,c_0_48])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02 % Problem : LCL096-10 : TPTP v9.3.1. Released v7.3.0.
% 0.00/0.04 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.35 % Computer : n014.cluster.edu
% 0.08/0.35 % Model : x86_64 x86_64
% 0.08/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.35 % Memory : 8046.5625MB
% 0.08/0.35 % OS : Linux 6.8.0-71-generic
% 0.08/0.35 % CPULimit : 300
% 0.08/0.35 % WCLimit : 300
% 0.08/0.35 % DateTime : Mon Sep 21 00:04:34 UTC 2026
% 0.08/0.35 % CPUTime :
% 0.08/0.35 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.13/0.40 Running first-order theorem proving
% 0.13/0.40 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.92/2.25 % Version: 3.5.1
% 10.92/2.25 % Preprocessing class: FSSSSMSSSSSNFFN.
% 10.92/2.25 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 10.92/2.25 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 10.92/2.25 % Starting new_bool_3 with 300s (1) cores
% 10.92/2.25 % Starting new_bool_1 with 300s (1) cores
% 10.92/2.25 % Starting sh5l with 300s (1) cores
% 10.92/2.25 % new_bool_1 with pid 2725553 completed with status 9
% 10.92/2.25 % new_bool_3 with pid 2725551 completed with status 9
% 10.92/2.25 % sh5l with pid 2725554 completed with status 0
% 10.92/2.25 % Result found by sh5l
% 10.92/2.25 % Preprocessing class: FSSSSMSSSSSNFFN.
% 10.92/2.25 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 10.92/2.25 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 10.92/2.25 % Starting new_bool_3 with 300s (1) cores
% 10.92/2.25 % Starting new_bool_1 with 300s (1) cores
% 10.92/2.25 % Starting sh5l with 300s (1) cores
% 10.92/2.25 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 10.92/2.25 % SinE strategy is gf500_gu_R04_F100_L20000
% 10.92/2.25 % Search class: FUUPM-FFSF32-DFFFFFNN
% 10.92/2.25 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 10.92/2.25 % Starting SubtermCWHack with 31s (1) cores
% 10.92/2.25 % SubtermCWHack with pid 2725562 completed with status 0
% 10.92/2.25 % Result found by SubtermCWHack
% 10.92/2.25 % Preprocessing class: FSSSSMSSSSSNFFN.
% 10.92/2.25 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 10.92/2.25 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 10.92/2.25 % Starting new_bool_3 with 300s (1) cores
% 10.92/2.25 % Starting new_bool_1 with 300s (1) cores
% 10.92/2.25 % Starting sh5l with 300s (1) cores
% 10.92/2.25 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = gf500_gu_R04_F100_L20000)
% 10.92/2.25 % SinE strategy is gf500_gu_R04_F100_L20000
% 10.92/2.25 % Search class: FUUPM-FFSF32-DFFFFFNN
% 10.92/2.25 % Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 10.92/2.25 % Starting SubtermCWHack with 31s (1) cores
% 10.92/2.25 % Preprocessing time : 0.001 s
% 10.92/2.25
% 10.92/2.25 % Proof found!
% 10.92/2.25 % SZS status Unsatisfiable
% 10.92/2.25 % SZS output start CNFRefutation
% See solution above
% 10.92/2.25 % Parsed axioms : 6
% 10.92/2.25 % Removed by relevancy pruning/SinE : 0
% 10.92/2.25 % Initial clauses : 6
% 10.92/2.25 % Removed in clause preprocessing : 0
% 10.92/2.25 % Initial clauses in saturation : 6
% 10.92/2.25 % Processed clauses : 1145
% 10.92/2.25 % ...of these trivial : 512
% 10.92/2.25 % ...subsumed : 0
% 10.92/2.25 % ...remaining for further processing : 633
% 10.92/2.25 % Other redundant clauses eliminated : 0
% 10.92/2.25 % Clauses deleted for lack of memory : 0
% 10.92/2.25 % Backward-subsumed : 0
% 10.92/2.25 % Backward-rewritten : 20
% 10.92/2.25 % Generated clauses : 118564
% 10.92/2.25 % ...of the previous two non-redundant : 75895
% 10.92/2.25 % ...aggressively subsumed : 0
% 10.92/2.25 % Contextual simplify-reflections : 0
% 10.92/2.25 % Paramodulations : 118564
% 10.92/2.25 % Factorizations : 0
% 10.92/2.25 % NegExts : 0
% 10.92/2.25 % Equation resolutions : 0
% 10.92/2.25 % Disequality decompositions : 0
% 10.92/2.25 % Total rewrite steps : 132479
% 10.92/2.25 % ...of those cached : 90525
% 10.92/2.25 % Propositional unsat checks : 0
% 10.92/2.25 % Propositional check models : 0
% 10.92/2.25 % Propositional check unsatisfiable : 0
% 10.92/2.25 % Propositional clauses : 0
% 10.92/2.25 % Propositional clauses after purity: 0
% 10.92/2.25 % Propositional unsat core size : 0
% 10.92/2.25 % Propositional preprocessing time : 0.000
% 10.92/2.25 % Propositional encoding time : 0.000
% 10.92/2.25 % Propositional solver time : 0.000
% 10.92/2.25 % Success case prop preproc time : 0.000
% 10.92/2.25 % Success case prop encoding time : 0.000
% 10.92/2.25 % Success case prop solver time : 0.000
% 10.92/2.25 % Current number of processed clauses : 613
% 10.92/2.25 % Positive orientable unit clauses : 613
% 10.92/2.25 % Positive unorientable unit clauses: 0
% 10.92/2.25 % Negative unit clauses : 0
% 10.92/2.25 % Non-unit-clauses : 0
% 10.92/2.25 % Current number of unprocessed clauses: 74744
% 10.92/2.25 % ...number of literals in the above : 74744
% 10.92/2.25 % Current number of archived formulas : 0
% 10.92/2.25 % Current number of archived clauses : 20
% 10.92/2.25 % Clause-clause subsumption calls (NU) : 0
% 10.92/2.25 % Rec. Clause-clause subsumption calls : 0
% 10.92/2.25 % Non-unit clause-clause subsumptions : 0
% 10.92/2.25 % Unit Clause-clause subsumption calls : 0
% 10.92/2.25 % Rewrite failures with RHS unbound : 0
% 10.92/2.25 % BW rewrite match attempts : 99651
% 10.92/2.25 % BW rewrite match successes : 20
% 10.92/2.25 % Condensation attempts : 0
% 10.92/2.25 % Condensation successes : 0
% 10.92/2.25 % Termbank termtop insertions : 1880844
% 10.92/2.25 % Search garbage collected termcells : 2
% 10.92/2.25
% 10.92/2.25 % -------------------------------------------------
% 10.92/2.25 % User time : 1.754 s
% 10.92/2.25 % System time : 0.061 s
% 10.92/2.25 % Total time : 1.815 s
% 10.92/2.25 % Maximum resident set size: 3640 pages
% 10.92/2.25
% 10.92/2.25 % -------------------------------------------------
% 10.92/2.25 % User time : 1.798 s
% 10.92/2.25 % System time : 0.102 s
% 10.92/2.25 % Total time : 1.900 s
% 10.92/2.25 % Maximum resident set size: 4608 pages
% 10.92/2.25 % E exiting
%------------------------------------------------------------------------------