%------------------------------------------------------------------------------
% File : E-SAT---3.5.1
% Problem : LCL125-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 : n019.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:33 PM UTC 2026
% Result : Unsatisfiable 10.82s 2.46s
% Output : CNFRefutation 10.82s
% Verified :
% SZS Type : Refutation
% Derivation depth : 28
% Number of leaves : 4
% Syntax : Number of clauses : 54 ( 17 unt; 0 nHn; 41 RR)
% Number of literals : 102 ( 0 equ; 71 neg)
% Maximal clause size : 3 ( 1 avg)
% Maximal term depth : 7 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 5 ( 5 usr; 4 con; 0-2 aty)
% Number of variables : 113 ( 5 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(condensed_detachment,axiom,
( ~ is_a_theorem(X1)
| ~ is_a_theorem(equivalent(X1,X2))
| is_a_theorem(X2) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',condensed_detachment) ).
cnf(q_3,axiom,
is_a_theorem(equivalent(X1,equivalent(equivalent(X1,equivalent(X2,X3)),equivalent(X3,X2)))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',q_3) ).
cnf(q_2,axiom,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(X3,X2)),equivalent(X1,X3))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',q_2) ).
cnf(prove_lg_2,negated_conjecture,
~ is_a_theorem(equivalent(a,equivalent(a,equivalent(equivalent(b,c),equivalent(equivalent(b,e),equivalent(c,e)))))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_lg_2) ).
cnf(c_0_4,plain,
( ~ is_a_theorem(X1)
| ~ is_a_theorem(equivalent(X1,X2))
| is_a_theorem(X2) ),
inference(fof_simplification,[status(thm)],[condensed_detachment]) ).
cnf(c_0_5,plain,
( ~ is_a_theorem(X1)
| ~ is_a_theorem(equivalent(X1,X2))
| is_a_theorem(X2) ),
c_0_4 ).
cnf(c_0_6,axiom,
is_a_theorem(equivalent(X1,equivalent(equivalent(X1,equivalent(X2,X3)),equivalent(X3,X2)))),
q_3 ).
cnf(c_0_7,plain,
( ~ is_a_theorem(X1)
| is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X3)),equivalent(X3,X2))) ),
inference(spm,[status(thm)],[c_0_5,c_0_6]) ).
cnf(c_0_8,plain,
( ~ is_a_theorem(X3)
| ~ is_a_theorem(equivalent(X3,equivalent(X2,X1)))
| is_a_theorem(equivalent(X1,X2)) ),
inference(spm,[status(thm)],[c_0_5,c_0_7]) ).
cnf(c_0_9,axiom,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(X3,X2)),equivalent(X1,X3))),
q_2 ).
cnf(c_0_10,plain,
( ~ is_a_theorem(X3)
| is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X3,equivalent(X2,X1)))) ),
inference(spm,[status(thm)],[c_0_8,c_0_6]) ).
cnf(c_0_11,plain,
( ~ is_a_theorem(equivalent(equivalent(X2,X3),equivalent(X1,X3)))
| is_a_theorem(equivalent(X1,X2)) ),
inference(spm,[status(thm)],[c_0_8,c_0_9]) ).
cnf(c_0_12,negated_conjecture,
~ is_a_theorem(equivalent(a,equivalent(a,equivalent(equivalent(b,c),equivalent(equivalent(b,e),equivalent(c,e)))))),
inference(fof_simplification,[status(thm)],[prove_lg_2]) ).
cnf(c_0_13,plain,
( ~ is_a_theorem(equivalent(equivalent(X1,X3),equivalent(X2,X3)))
| is_a_theorem(equivalent(X1,X2)) ),
inference(spm,[status(thm)],[c_0_5,c_0_9]) ).
cnf(c_0_14,plain,
( ~ is_a_theorem(X1)
| ~ is_a_theorem(equivalent(X3,X2))
| is_a_theorem(equivalent(X1,equivalent(X2,X3))) ),
inference(spm,[status(thm)],[c_0_5,c_0_10]) ).
cnf(c_0_15,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,equivalent(X2,X3)),equivalent(X3,X2)),X1)),
inference(spm,[status(thm)],[c_0_11,c_0_6]) ).
cnf(c_0_16,negated_conjecture,
~ is_a_theorem(equivalent(a,equivalent(a,equivalent(equivalent(b,c),equivalent(equivalent(b,e),equivalent(c,e)))))),
c_0_12 ).
cnf(c_0_17,plain,
( ~ is_a_theorem(equivalent(X1,X3))
| ~ is_a_theorem(equivalent(X3,X2))
| is_a_theorem(equivalent(X1,X2)) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_18,plain,
( ~ is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X3)),equivalent(X3,X2)))
| is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_5,c_0_15]) ).
cnf(c_0_19,negated_conjecture,
( ~ is_a_theorem(equivalent(a,X1))
| ~ is_a_theorem(equivalent(X1,equivalent(a,equivalent(equivalent(b,c),equivalent(equivalent(b,e),equivalent(c,e)))))) ),
inference(spm,[status(thm)],[c_0_16,c_0_17]) ).
cnf(c_0_20,plain,
is_a_theorem(equivalent(X1,X1)),
inference(spm,[status(thm)],[c_0_18,c_0_9]) ).
cnf(c_0_21,negated_conjecture,
( ~ is_a_theorem(X1)
| ~ is_a_theorem(equivalent(a,equivalent(X1,equivalent(equivalent(equivalent(b,c),equivalent(equivalent(b,e),equivalent(c,e))),a)))) ),
inference(spm,[status(thm)],[c_0_19,c_0_7]) ).
cnf(c_0_22,plain,
( ~ is_a_theorem(equivalent(X2,X1))
| is_a_theorem(equivalent(X1,X2)) ),
inference(spm,[status(thm)],[c_0_8,c_0_20]) ).
cnf(c_0_23,negated_conjecture,
( ~ is_a_theorem(X2)
| ~ is_a_theorem(equivalent(a,X1))
| ~ is_a_theorem(equivalent(X1,equivalent(X2,equivalent(equivalent(equivalent(b,c),equivalent(equivalent(b,e),equivalent(c,e))),a)))) ),
inference(spm,[status(thm)],[c_0_21,c_0_17]) ).
cnf(c_0_24,plain,
is_a_theorem(equivalent(equivalent(X1,X2),equivalent(equivalent(X1,X3),equivalent(X2,X3)))),
inference(spm,[status(thm)],[c_0_22,c_0_9]) ).
cnf(c_0_25,negated_conjecture,
( ~ is_a_theorem(equivalent(X1,a))
| ~ is_a_theorem(equivalent(a,equivalent(X1,equivalent(equivalent(b,c),equivalent(equivalent(b,e),equivalent(c,e)))))) ),
inference(spm,[status(thm)],[c_0_23,c_0_24]) ).
cnf(c_0_26,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(a,equivalent(equivalent(equivalent(b,e),equivalent(c,e)),equivalent(b,c))),a)),
inference(spm,[status(thm)],[c_0_25,c_0_6]) ).
cnf(c_0_27,plain,
( ~ is_a_theorem(equivalent(X2,X3))
| ~ is_a_theorem(equivalent(X3,X1))
| is_a_theorem(equivalent(X1,X2)) ),
inference(spm,[status(thm)],[c_0_11,c_0_14]) ).
cnf(c_0_28,plain,
( ~ is_a_theorem(X2)
| ~ is_a_theorem(equivalent(X1,X2))
| is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_5,c_0_22]) ).
cnf(c_0_29,negated_conjecture,
( ~ is_a_theorem(equivalent(a,X1))
| ~ is_a_theorem(equivalent(X1,equivalent(a,equivalent(equivalent(equivalent(b,e),equivalent(c,e)),equivalent(b,c))))) ),
inference(spm,[status(thm)],[c_0_26,c_0_27]) ).
cnf(c_0_30,plain,
( ~ is_a_theorem(equivalent(X1,X3))
| is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X3,X2))) ),
inference(spm,[status(thm)],[c_0_28,c_0_9]) ).
cnf(c_0_31,negated_conjecture,
( ~ is_a_theorem(equivalent(X1,a))
| ~ is_a_theorem(equivalent(a,equivalent(X1,equivalent(equivalent(equivalent(b,e),equivalent(c,e)),equivalent(b,c))))) ),
inference(spm,[status(thm)],[c_0_29,c_0_30]) ).
cnf(c_0_32,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(a,equivalent(equivalent(b,c),equivalent(equivalent(b,e),equivalent(c,e)))),a)),
inference(spm,[status(thm)],[c_0_31,c_0_6]) ).
cnf(c_0_33,negated_conjecture,
( ~ is_a_theorem(equivalent(X1,a))
| ~ is_a_theorem(equivalent(equivalent(a,equivalent(equivalent(b,c),equivalent(equivalent(b,e),equivalent(c,e)))),X1)) ),
inference(spm,[status(thm)],[c_0_32,c_0_17]) ).
cnf(c_0_34,negated_conjecture,
( ~ is_a_theorem(equivalent(a,X1))
| ~ is_a_theorem(equivalent(equivalent(X1,equivalent(equivalent(b,c),equivalent(equivalent(b,e),equivalent(c,e)))),a)) ),
inference(spm,[status(thm)],[c_0_33,c_0_30]) ).
cnf(c_0_35,plain,
( ~ is_a_theorem(equivalent(equivalent(X1,X3),X4))
| is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(X3,X2)),X4)) ),
inference(spm,[status(thm)],[c_0_17,c_0_9]) ).
cnf(c_0_36,negated_conjecture,
( ~ is_a_theorem(equivalent(equivalent(X1,equivalent(b,c)),a))
| ~ is_a_theorem(equivalent(a,equivalent(X1,equivalent(equivalent(b,e),equivalent(c,e))))) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
cnf(c_0_37,plain,
( ~ is_a_theorem(equivalent(X1,equivalent(X2,X4)))
| is_a_theorem(equivalent(X1,equivalent(equivalent(X2,X3),equivalent(X4,X3)))) ),
inference(spm,[status(thm)],[c_0_17,c_0_24]) ).
cnf(c_0_38,plain,
( ~ is_a_theorem(equivalent(equivalent(X1,X4),X3))
| ~ is_a_theorem(equivalent(X3,equivalent(X2,X4)))
| is_a_theorem(equivalent(X1,X2)) ),
inference(spm,[status(thm)],[c_0_13,c_0_17]) ).
cnf(c_0_39,negated_conjecture,
( ~ is_a_theorem(equivalent(a,equivalent(X1,equivalent(b,e))))
| ~ is_a_theorem(equivalent(equivalent(equivalent(X1,equivalent(c,e)),equivalent(b,c)),a)) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_40,plain,
( ~ is_a_theorem(equivalent(X1,equivalent(X4,equivalent(X3,X2))))
| is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X3)),X4)) ),
inference(spm,[status(thm)],[c_0_38,c_0_15]) ).
cnf(c_0_41,negated_conjecture,
( ~ is_a_theorem(equivalent(a,equivalent(X1,equivalent(b,e))))
| ~ is_a_theorem(equivalent(equivalent(X1,equivalent(c,e)),equivalent(a,equivalent(c,b)))) ),
inference(spm,[status(thm)],[c_0_39,c_0_40]) ).
cnf(c_0_42,plain,
( ~ is_a_theorem(equivalent(equivalent(X2,X4),X3))
| ~ is_a_theorem(equivalent(X3,equivalent(X1,X4)))
| is_a_theorem(equivalent(X1,X2)) ),
inference(spm,[status(thm)],[c_0_11,c_0_17]) ).
cnf(c_0_43,negated_conjecture,
( ~ is_a_theorem(equivalent(equivalent(X1,c),equivalent(a,equivalent(c,b))))
| ~ is_a_theorem(equivalent(a,equivalent(equivalent(X1,e),equivalent(b,e)))) ),
inference(spm,[status(thm)],[c_0_41,c_0_35]) ).
cnf(c_0_44,plain,
( ~ is_a_theorem(equivalent(X2,equivalent(X1,equivalent(X4,X3))))
| is_a_theorem(equivalent(X1,equivalent(X2,equivalent(X3,X4)))) ),
inference(spm,[status(thm)],[c_0_42,c_0_15]) ).
cnf(c_0_45,negated_conjecture,
( ~ is_a_theorem(equivalent(a,equivalent(equivalent(X1,c),equivalent(b,c))))
| ~ is_a_theorem(equivalent(a,equivalent(equivalent(X1,e),equivalent(b,e)))) ),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_46,plain,
( ~ is_a_theorem(equivalent(equivalent(X2,X4),X1))
| is_a_theorem(equivalent(X1,equivalent(equivalent(X2,X3),equivalent(X4,X3)))) ),
inference(spm,[status(thm)],[c_0_27,c_0_9]) ).
cnf(c_0_47,plain,
( ~ is_a_theorem(equivalent(X3,equivalent(equivalent(X1,X4),equivalent(X2,X4))))
| is_a_theorem(equivalent(equivalent(X1,X2),X3)) ),
inference(spm,[status(thm)],[c_0_27,c_0_9]) ).
cnf(c_0_48,negated_conjecture,
~ is_a_theorem(equivalent(a,equivalent(equivalent(X1,c),equivalent(b,c)))),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_47]) ).
cnf(c_0_49,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(X1,b),a)),
inference(spm,[status(thm)],[c_0_48,c_0_46]) ).
cnf(c_0_50,negated_conjecture,
( ~ is_a_theorem(equivalent(X2,a))
| ~ is_a_theorem(equivalent(equivalent(X1,b),X2)) ),
inference(spm,[status(thm)],[c_0_49,c_0_17]) ).
cnf(c_0_51,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(b,X2)),a)),
inference(spm,[status(thm)],[c_0_50,c_0_24]) ).
cnf(c_0_52,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(X1,X2),equivalent(a,equivalent(X2,b)))),
inference(spm,[status(thm)],[c_0_51,c_0_40]) ).
cnf(c_0_53,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_52,c_0_15]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL125-1 : TPTP v9.3.1. Released v1.0.0.
% 0.00/0.06 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.16/0.64 % Computer : n019.cluster.edu
% 0.16/0.64 % Model : x86_64 x86_64
% 0.16/0.64 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.16/0.64 % Memory : 8046.5625MB
% 0.16/0.64 % OS : Linux 6.8.0-71-generic
% 0.16/0.64 % CPULimit : 300
% 0.16/0.64 % WCLimit : 300
% 0.16/0.64 % DateTime : Mon Sep 21 00:06:50 UTC 2026
% 0.16/0.65 % CPUTime :
% 0.16/0.65 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.22/0.72 Running first-order theorem proving
% 0.22/0.72 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
% 10.82/2.46 % Version: 3.5.1
% 10.82/2.46 % Preprocessing class: FSSSSMSSSSSNFFN.
% 10.82/2.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 10.82/2.46 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 10.82/2.46 % Starting new_bool_3 with 300s (1) cores
% 10.82/2.46 % Starting new_bool_1 with 300s (1) cores
% 10.82/2.46 % Starting sh5l with 300s (1) cores
% 10.82/2.46 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 1272621 completed with status 0
% 10.82/2.46 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 10.82/2.46 % Preprocessing class: FSSSSMSSSSSNFFN.
% 10.82/2.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 10.82/2.46 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 10.82/2.46 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 10.82/2.46 % No SInE strategy applied
% 10.82/2.46 % Search class: FHUNS-FFSF22-MFFFFFNN
% 10.82/2.46 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 10.82/2.46 % Starting SubtermCWHack with 136s (1) cores
% 10.82/2.46 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 10.82/2.46 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S00 with 136s (1) cores
% 10.82/2.46 % Starting G-E--_060_C18_F1_PI_AE_CS_SP_S0Y with 136s (1) cores
% 10.82/2.46 % Starting new_bool_3 with 136s (1) cores
% 10.82/2.46 % G-E--_208_C18_F1_SE_CS_SP_PS_S00 with pid 1272624 completed with status 0
% 10.82/2.46 % Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S00
% 10.82/2.46 % Preprocessing class: FSSSSMSSSSSNFFN.
% 10.82/2.46 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 10.82/2.46 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 10.82/2.46 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 10.82/2.46 % No SInE strategy applied
% 10.82/2.46 % Search class: FHUNS-FFSF22-MFFFFFNN
% 10.82/2.46 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 10.82/2.46 % Starting SubtermCWHack with 136s (1) cores
% 10.82/2.46 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 10.82/2.46 % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S00 with 136s (1) cores
% 10.82/2.46 % Preprocessing time : 0.002 s
% 10.82/2.46 % Presaturation interreduction done
% 10.82/2.46
% 10.82/2.46 % Proof found!
% 10.82/2.46 % SZS status Unsatisfiable
% 10.82/2.46 % SZS output start CNFRefutation
% See solution above
% 10.82/2.46 % Parsed axioms : 4
% 10.82/2.46 % Removed by relevancy pruning/SinE : 0
% 10.82/2.46 % Initial clauses : 4
% 10.82/2.46 % Removed in clause preprocessing : 0
% 10.82/2.46 % Initial clauses in saturation : 4
% 10.82/2.46 % Processed clauses : 4962
% 10.82/2.46 % ...of these trivial : 1
% 10.82/2.46 % ...subsumed : 4225
% 10.82/2.46 % ...remaining for further processing : 736
% 10.82/2.46 % Other redundant clauses eliminated : 0
% 10.82/2.46 % Clauses deleted for lack of memory : 0
% 10.82/2.46 % Backward-subsumed : 136
% 10.82/2.46 % Backward-rewritten : 0
% 10.82/2.46 % Generated clauses : 95647
% 10.82/2.46 % ...of the previous two non-redundant : 94614
% 10.82/2.46 % ...aggressively subsumed : 0
% 10.82/2.46 % Contextual simplify-reflections : 4
% 10.82/2.46 % Paramodulations : 95647
% 10.82/2.46 % Factorizations : 0
% 10.82/2.46 % NegExts : 0
% 10.82/2.46 % Equation resolutions : 0
% 10.82/2.46 % Disequality decompositions : 0
% 10.82/2.46 % Total rewrite steps : 774
% 10.82/2.46 % ...of those cached : 750
% 10.82/2.46 % Propositional unsat checks : 0
% 10.82/2.46 % Propositional check models : 0
% 10.82/2.46 % Propositional check unsatisfiable : 0
% 10.82/2.46 % Propositional clauses : 0
% 10.82/2.46 % Propositional clauses after purity: 0
% 10.82/2.46 % Propositional unsat core size : 0
% 10.82/2.46 % Propositional preprocessing time : 0.000
% 10.82/2.46 % Propositional encoding time : 0.000
% 10.82/2.46 % Propositional solver time : 0.000
% 10.82/2.46 % Success case prop preproc time : 0.000
% 10.82/2.46 % Success case prop encoding time : 0.000
% 10.82/2.46 % Success case prop solver time : 0.000
% 10.82/2.46 % Current number of processed clauses : 596
% 10.82/2.46 % Positive orientable unit clauses : 5
% 10.82/2.46 % Positive unorientable unit clauses: 0
% 10.82/2.46 % Negative unit clauses : 59
% 10.82/2.46 % Non-unit-clauses : 532
% 10.82/2.46 % Current number of unprocessed clauses: 89054
% 10.82/2.46 % ...number of literals in the above : 409665
% 10.82/2.46 % Current number of archived formulas : 0
% 10.82/2.46 % Current number of archived clauses : 140
% 10.82/2.46 % Clause-clause subsumption calls (NU) : 177366
% 10.82/2.46 % Rec. Clause-clause subsumption calls : 114586
% 10.82/2.46 % Non-unit clause-clause subsumptions : 2740
% 10.82/2.46 % Unit Clause-clause subsumption calls : 7292
% 10.82/2.46 % Rewrite failures with RHS unbound : 0
% 10.82/2.46 % BW rewrite match attempts : 31
% 10.82/2.46 % BW rewrite match successes : 0
% 10.82/2.46 % Condensation attempts : 0
% 10.82/2.46 % Condensation successes : 0
% 10.82/2.46 % Termbank termtop insertions : 1664260
% 10.82/2.46 % Search garbage collected termcells : 8
% 10.82/2.46
% 10.82/2.46 % -------------------------------------------------
% 10.82/2.46 % User time : 1.546 s
% 10.82/2.46 % System time : 0.071 s
% 10.82/2.46 % Total time : 1.617 s
% 10.82/2.46 % Maximum resident set size: 3380 pages
% 10.82/2.46
% 10.82/2.46 % -------------------------------------------------
% 10.82/2.46 % User time : 7.218 s
% 10.82/2.46 % System time : 0.290 s
% 10.82/2.46 % Total time : 7.508 s
% 10.82/2.46 % Maximum resident set size: 4608 pages
% 10.82/2.46 % E exiting
%------------------------------------------------------------------------------