%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : LCL123-1 : TPTP v9.3.1. Bugfixed v2.3.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:11:50 PM UTC 2026
% Result : Unsatisfiable 106.14s 16.09s
% Output : CNFRefutation 106.14s
% Verified :
% SZS Type : Refutation
% Derivation depth : 20
% Number of leaves : 3
% Syntax : Number of clauses : 51 ( 14 unt; 0 nHn; 25 RR)
% Number of literals : 102 ( 0 equ; 56 neg)
% Maximal clause size : 3 ( 2 avg)
% Maximal term depth : 6 ( 2 avg)
% Number of predicates : 2 ( 1 usr; 1 prp; 0-1 aty)
% Number of functors : 6 ( 6 usr; 5 con; 0-2 aty)
% Number of variables : 168 ( 1 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(lg_2,axiom,
is_a_theorem(equivalent(X1,equivalent(X1,equivalent(equivalent(X2,X3),equivalent(equivalent(X2,X4),equivalent(X3,X4)))))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',lg_2) ).
cnf(prove_lg_4,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(a,equivalent(b,c)),equivalent(e,equivalent(b,f))),equivalent(a,equivalent(e,equivalent(c,f))))),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',prove_lg_4) ).
cnf(c_0_3,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_4,plain,
( ~ is_a_theorem(X1)
| ~ is_a_theorem(equivalent(X1,X2))
| is_a_theorem(X2) ),
c_0_3 ).
cnf(c_0_5,axiom,
is_a_theorem(equivalent(X1,equivalent(X1,equivalent(equivalent(X2,X3),equivalent(equivalent(X2,X4),equivalent(X3,X4)))))),
lg_2 ).
cnf(c_0_6,plain,
( ~ is_a_theorem(X1)
| is_a_theorem(equivalent(X1,equivalent(equivalent(X2,X3),equivalent(equivalent(X2,X4),equivalent(X3,X4))))) ),
inference(spm,[status(thm)],[c_0_4,c_0_5]) ).
cnf(c_0_7,plain,
( ~ is_a_theorem(X4)
| is_a_theorem(equivalent(equivalent(X1,X2),equivalent(equivalent(X1,X3),equivalent(X2,X3)))) ),
inference(spm,[status(thm)],[c_0_4,c_0_6]) ).
cnf(c_0_8,plain,
is_a_theorem(equivalent(equivalent(X1,X2),equivalent(equivalent(X1,X3),equivalent(X2,X3)))),
inference(spm,[status(thm)],[c_0_7,c_0_5]) ).
cnf(c_0_9,plain,
( ~ is_a_theorem(equivalent(X1,X3))
| is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X3,X2))) ),
inference(spm,[status(thm)],[c_0_4,c_0_8]) ).
cnf(c_0_10,plain,
( ~ is_a_theorem(equivalent(X3,X1))
| ~ is_a_theorem(equivalent(X3,X2))
| is_a_theorem(equivalent(X1,X2)) ),
inference(spm,[status(thm)],[c_0_4,c_0_9]) ).
cnf(c_0_11,plain,
( ~ is_a_theorem(equivalent(X4,X2))
| ~ is_a_theorem(equivalent(equivalent(X4,X3),X1))
| is_a_theorem(equivalent(X1,equivalent(X2,X3))) ),
inference(spm,[status(thm)],[c_0_10,c_0_9]) ).
cnf(c_0_12,plain,
( ~ is_a_theorem(equivalent(X1,X4))
| is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(X3,X2)),equivalent(X4,X3))) ),
inference(spm,[status(thm)],[c_0_11,c_0_8]) ).
cnf(c_0_13,plain,
( ~ is_a_theorem(equivalent(X3,X1))
| ~ is_a_theorem(equivalent(equivalent(X3,X4),equivalent(X2,X4)))
| is_a_theorem(equivalent(X1,X2)) ),
inference(spm,[status(thm)],[c_0_4,c_0_12]) ).
cnf(c_0_14,plain,
( ~ is_a_theorem(equivalent(X2,X1))
| is_a_theorem(equivalent(X1,equivalent(X2,equivalent(equivalent(X3,X4),equivalent(equivalent(X3,X5),equivalent(X4,X5)))))) ),
inference(spm,[status(thm)],[c_0_10,c_0_5]) ).
cnf(c_0_15,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_10,c_0_8]) ).
cnf(c_0_16,plain,
( ~ is_a_theorem(equivalent(X3,X1))
| ~ is_a_theorem(equivalent(X2,equivalent(X3,equivalent(equivalent(X4,X5),equivalent(equivalent(X4,X6),equivalent(X5,X6))))))
| is_a_theorem(equivalent(X1,X2)) ),
inference(spm,[status(thm)],[c_0_13,c_0_14]) ).
cnf(c_0_17,plain,
( ~ is_a_theorem(X4)
| ~ is_a_theorem(equivalent(equivalent(X1,X3),X4))
| is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X3,X2))) ),
inference(spm,[status(thm)],[c_0_4,c_0_15]) ).
cnf(c_0_18,plain,
( ~ is_a_theorem(equivalent(X2,X1))
| is_a_theorem(equivalent(X1,X2)) ),
inference(spm,[status(thm)],[c_0_16,c_0_5]) ).
cnf(c_0_19,plain,
( ~ is_a_theorem(equivalent(equivalent(X1,X4),equivalent(X3,X4)))
| is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X3,X2))) ),
inference(spm,[status(thm)],[c_0_17,c_0_8]) ).
cnf(c_0_20,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_18,c_0_15]) ).
cnf(c_0_21,plain,
( ~ is_a_theorem(equivalent(equivalent(X2,equivalent(equivalent(X3,X5),equivalent(X4,X5))),X1))
| is_a_theorem(equivalent(X1,equivalent(X2,equivalent(X3,X4)))) ),
inference(spm,[status(thm)],[c_0_16,c_0_8]) ).
cnf(c_0_22,plain,
( ~ is_a_theorem(equivalent(X1,equivalent(equivalent(X3,X5),equivalent(X4,X5))))
| is_a_theorem(equivalent(equivalent(X1,X2),equivalent(equivalent(X3,X4),X2))) ),
inference(spm,[status(thm)],[c_0_19,c_0_6]) ).
cnf(c_0_23,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(X3,X2)),equivalent(X1,X3))),
inference(spm,[status(thm)],[c_0_18,c_0_8]) ).
cnf(c_0_24,plain,
( ~ is_a_theorem(X5)
| ~ is_a_theorem(equivalent(X5,X1))
| is_a_theorem(equivalent(X1,equivalent(equivalent(X2,X3),equivalent(equivalent(X2,X4),equivalent(X3,X4))))) ),
inference(spm,[status(thm)],[c_0_10,c_0_6]) ).
cnf(c_0_25,plain,
( ~ is_a_theorem(equivalent(equivalent(X2,X4),X1))
| ~ is_a_theorem(equivalent(equivalent(X2,X3),equivalent(X4,X3)))
| is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_4,c_0_20]) ).
cnf(c_0_26,plain,
( ~ is_a_theorem(equivalent(X4,X1))
| is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X3)),equivalent(equivalent(X4,equivalent(X5,X3)),equivalent(X2,X5)))) ),
inference(spm,[status(thm)],[c_0_21,c_0_12]) ).
cnf(c_0_27,plain,
is_a_theorem(equivalent(equivalent(equivalent(X1,X2),X3),equivalent(equivalent(X1,X2),X3))),
inference(spm,[status(thm)],[c_0_22,c_0_8]) ).
cnf(c_0_28,plain,
( ~ is_a_theorem(equivalent(equivalent(X1,X3),equivalent(X2,X3)))
| is_a_theorem(equivalent(X1,X2)) ),
inference(spm,[status(thm)],[c_0_4,c_0_23]) ).
cnf(c_0_29,plain,
( ~ is_a_theorem(equivalent(X1,X3))
| is_a_theorem(equivalent(equivalent(equivalent(X1,X2),equivalent(X3,X2)),equivalent(equivalent(X4,X5),equivalent(equivalent(X4,X6),equivalent(X5,X6))))) ),
inference(spm,[status(thm)],[c_0_24,c_0_8]) ).
cnf(c_0_30,plain,
( ~ is_a_theorem(equivalent(X3,X2))
| ~ is_a_theorem(equivalent(equivalent(X2,equivalent(X3,equivalent(X4,X4))),X1))
| is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_26]) ).
cnf(c_0_31,plain,
( ~ is_a_theorem(equivalent(equivalent(equivalent(X2,X3),equivalent(X2,X3)),X1))
| is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_27]) ).
cnf(c_0_32,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(a,equivalent(b,c)),equivalent(e,equivalent(b,f))),equivalent(a,equivalent(e,equivalent(c,f))))),
inference(fof_simplification,[status(thm)],[prove_lg_4]) ).
cnf(c_0_33,plain,
( ~ is_a_theorem(equivalent(X1,equivalent(X4,X3)))
| is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X3)),equivalent(X4,X2))) ),
inference(spm,[status(thm)],[c_0_28,c_0_29]) ).
cnf(c_0_34,plain,
( ~ is_a_theorem(equivalent(equivalent(X4,equivalent(X2,X5)),X1))
| ~ is_a_theorem(equivalent(equivalent(X2,X3),equivalent(X4,equivalent(X3,X5))))
| is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_15]) ).
cnf(c_0_35,plain,
( ~ is_a_theorem(equivalent(X3,X1))
| is_a_theorem(equivalent(equivalent(X1,X2),equivalent(X3,X2))) ),
inference(spm,[status(thm)],[c_0_18,c_0_9]) ).
cnf(c_0_36,plain,
( ~ is_a_theorem(equivalent(equivalent(X3,X2),X1))
| ~ is_a_theorem(equivalent(X2,equivalent(X3,equivalent(X4,X4))))
| is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_30,c_0_20]) ).
cnf(c_0_37,plain,
is_a_theorem(equivalent(X1,X1)),
inference(spm,[status(thm)],[c_0_31,c_0_23]) ).
cnf(c_0_38,negated_conjecture,
~ is_a_theorem(equivalent(equivalent(equivalent(a,equivalent(b,c)),equivalent(e,equivalent(b,f))),equivalent(a,equivalent(e,equivalent(c,f))))),
c_0_32 ).
cnf(c_0_39,plain,
( ~ is_a_theorem(equivalent(X4,equivalent(X1,equivalent(X5,X3))))
| is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X3)),equivalent(X4,equivalent(X2,X5)))) ),
inference(spm,[status(thm)],[c_0_21,c_0_33]) ).
cnf(c_0_40,plain,
( ~ is_a_theorem(equivalent(equivalent(equivalent(X2,equivalent(X3,X4)),equivalent(X2,equivalent(equivalent(X3,X5),equivalent(X4,X5)))),X1))
| is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_34,c_0_5]) ).
cnf(c_0_41,plain,
( ~ is_a_theorem(equivalent(X3,X2))
| ~ is_a_theorem(equivalent(equivalent(X2,X3),X1))
| is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_25,c_0_35]) ).
cnf(c_0_42,plain,
( ~ is_a_theorem(equivalent(equivalent(X2,equivalent(X2,equivalent(X3,X3))),X1))
| is_a_theorem(X1) ),
inference(spm,[status(thm)],[c_0_36,c_0_37]) ).
cnf(c_0_43,negated_conjecture,
~ is_a_theorem(equivalent(a,equivalent(equivalent(a,equivalent(b,c)),equivalent(equivalent(c,f),equivalent(b,f))))),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
cnf(c_0_44,plain,
( ~ is_a_theorem(equivalent(X1,equivalent(X2,equivalent(X3,X5))))
| is_a_theorem(equivalent(X1,equivalent(X2,equivalent(equivalent(X3,X4),equivalent(X5,X4))))) ),
inference(spm,[status(thm)],[c_0_40,c_0_35]) ).
cnf(c_0_45,plain,
( ~ is_a_theorem(equivalent(equivalent(X2,X3),equivalent(X1,X3)))
| is_a_theorem(equivalent(X1,X2)) ),
inference(spm,[status(thm)],[c_0_41,c_0_23]) ).
cnf(c_0_46,plain,
is_a_theorem(equivalent(X1,equivalent(X1,equivalent(X2,X2)))),
inference(spm,[status(thm)],[c_0_42,c_0_37]) ).
cnf(c_0_47,negated_conjecture,
~ is_a_theorem(equivalent(a,equivalent(equivalent(a,equivalent(b,c)),equivalent(c,b)))),
inference(spm,[status(thm)],[c_0_43,c_0_44]) ).
cnf(c_0_48,plain,
( ~ is_a_theorem(equivalent(equivalent(X2,equivalent(X5,X4)),X1))
| is_a_theorem(equivalent(X1,equivalent(equivalent(X2,equivalent(X3,X4)),equivalent(X5,X3)))) ),
inference(spm,[status(thm)],[c_0_21,c_0_20]) ).
cnf(c_0_49,plain,
is_a_theorem(equivalent(equivalent(X1,equivalent(X2,X2)),X1)),
inference(spm,[status(thm)],[c_0_45,c_0_46]) ).
cnf(c_0_50,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_49])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : LCL123-1 : TPTP v9.3.1. Bugfixed v2.3.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.36 % Computer : n019.cluster.edu
% 0.11/0.36 % Model : x86_64 x86_64
% 0.11/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36 % Memory : 8046.5625MB
% 0.11/0.36 % OS : Linux 6.8.0-71-generic
% 0.11/0.36 % CPULimit : 300
% 0.11/0.36 % WCLimit : 300
% 0.11/0.36 % DateTime : Mon Sep 21 00:06:19 UTC 2026
% 0.11/0.37 % CPUTime :
% 0.11/0.37 Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.14/0.42 Running first-order theorem proving
% 0.14/0.42 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
% 106.14/16.09 % Version: 3.5.1
% 106.14/16.09 % Preprocessing class: FSSSSMSSSSSNFFN.
% 106.14/16.09 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 106.14/16.09 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 106.14/16.09 % Starting new_bool_3 with 300s (1) cores
% 106.14/16.09 % Starting new_bool_1 with 300s (1) cores
% 106.14/16.09 % Starting sh5l with 300s (1) cores
% 106.14/16.09 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 1272225 completed with status 0
% 106.14/16.09 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 106.14/16.09 % Preprocessing class: FSSSSMSSSSSNFFN.
% 106.14/16.09 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 106.14/16.09 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 106.14/16.09 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 106.14/16.09 % No SInE strategy applied
% 106.14/16.09 % Search class: FHUNF-FFSF22-MFFFFFNN
% 106.14/16.09 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 106.14/16.09 % Starting SubtermCWHack with 136s (1) cores
% 106.14/16.09 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 106.14/16.09 % Starting G-E--_060_C18_F1_PI_AE_CS_SP_S0Y with 136s (1) cores
% 106.14/16.09 % Starting new_bool_3 with 136s (1) cores
% 106.14/16.09 % Starting U----_206c_00_C07_23_F1_SE_PI_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 106.14/16.09 % G-E--_302_C18_F1_URBAN_RG_S04BN with pid 1272230 completed with status 0
% 106.14/16.09 % Result found by G-E--_302_C18_F1_URBAN_RG_S04BN
% 106.14/16.09 % Preprocessing class: FSSSSMSSSSSNFFN.
% 106.14/16.09 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 106.14/16.09 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 1500s (5) cores
% 106.14/16.09 % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 106.14/16.09 % No SInE strategy applied
% 106.14/16.09 % Search class: FHUNF-FFSF22-MFFFFFNN
% 106.14/16.09 % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 106.14/16.09 % Starting SubtermCWHack with 136s (1) cores
% 106.14/16.09 % Starting G-E--_302_C18_F1_URBAN_RG_S04BN with 151s (1) cores
% 106.14/16.09 % Preprocessing time : 0.030 s
% 106.14/16.09
% 106.14/16.09 % Proof found!
% 106.14/16.09 % SZS status Unsatisfiable
% 106.14/16.09 % SZS output start CNFRefutation
% See solution above
% 106.14/16.09 % Parsed axioms : 3
% 106.14/16.09 % Removed by relevancy pruning/SinE : 0
% 106.14/16.09 % Initial clauses : 3
% 106.14/16.09 % Removed in clause preprocessing : 0
% 106.14/16.09 % Initial clauses in saturation : 3
% 106.14/16.09 % Processed clauses : 7998
% 106.14/16.09 % ...of these trivial : 24
% 106.14/16.09 % ...subsumed : 6253
% 106.14/16.09 % ...remaining for further processing : 1721
% 106.14/16.09 % Other redundant clauses eliminated : 0
% 106.14/16.09 % Clauses deleted for lack of memory : 0
% 106.14/16.09 % Backward-subsumed : 66
% 106.14/16.09 % Backward-rewritten : 1
% 106.14/16.09 % Generated clauses : 381576
% 106.14/16.09 % ...of the previous two non-redundant : 372254
% 106.14/16.09 % ...aggressively subsumed : 0
% 106.14/16.09 % Contextual simplify-reflections : 11
% 106.14/16.09 % Paramodulations : 381576
% 106.14/16.09 % Factorizations : 0
% 106.14/16.09 % NegExts : 0
% 106.14/16.09 % Equation resolutions : 0
% 106.14/16.09 % Disequality decompositions : 0
% 106.14/16.09 % Total rewrite steps : 17078
% 106.14/16.09 % ...of those cached : 16605
% 106.14/16.09 % Propositional unsat checks : 0
% 106.14/16.09 % Propositional check models : 0
% 106.14/16.09 % Propositional check unsatisfiable : 0
% 106.14/16.09 % Propositional clauses : 0
% 106.14/16.09 % Propositional clauses after purity: 0
% 106.14/16.09 % Propositional unsat core size : 0
% 106.14/16.09 % Propositional preprocessing time : 0.000
% 106.14/16.09 % Propositional encoding time : 0.000
% 106.14/16.09 % Propositional solver time : 0.000
% 106.14/16.09 % Success case prop preproc time : 0.000
% 106.14/16.09 % Success case prop encoding time : 0.000
% 106.14/16.09 % Success case prop solver time : 0.000
% 106.14/16.09 % Current number of processed clauses : 1654
% 106.14/16.09 % Positive orientable unit clauses : 45
% 106.14/16.09 % Positive unorientable unit clauses: 0
% 106.14/16.09 % Negative unit clauses : 8
% 106.14/16.09 % Non-unit-clauses : 1601
% 106.14/16.09 % Current number of unprocessed clauses: 364129
% 106.14/16.09 % ...number of literals in the above : 1056901
% 106.14/16.09 % Current number of archived formulas : 0
% 106.14/16.09 % Current number of archived clauses : 67
% 106.14/16.09 % Clause-clause subsumption calls (NU) : 742902
% 106.14/16.09 % Rec. Clause-clause subsumption calls : 729070
% 106.14/16.09 % Non-unit clause-clause subsumptions : 6279
% 106.14/16.09 % Unit Clause-clause subsumption calls : 5111
% 106.14/16.09 % Rewrite failures with RHS unbound : 0
% 106.14/16.09 % BW rewrite match attempts : 8715
% 106.14/16.09 % BW rewrite match successes : 3
% 106.14/16.09 % Condensation attempts : 0
% 106.14/16.09 % Condensation successes : 0
% 106.14/16.09 % Termbank termtop insertions : 8674057
% 106.14/16.09 % Search garbage collected termcells : 8
% 106.14/16.09
% 106.14/16.09 % -------------------------------------------------
% 106.14/16.09 % User time : 14.643 s
% 106.14/16.09 % System time : 0.484 s
% 106.14/16.09 % Total time : 15.127 s
% 106.14/16.09 % Maximum resident set size: 3636 pages
% 106.14/16.09
% 106.14/16.09 % -------------------------------------------------
% 106.14/16.09 % User time : 73.958 s
% 106.14/16.09 % System time : 2.298 s
% 106.14/16.09 % Total time : 76.256 s
% 106.14/16.09 % Maximum resident set size: 4864 pages
% 106.14/16.09 % E exiting
%------------------------------------------------------------------------------