%------------------------------------------------------------------------------
% File : E---3.5.1
% Problem : SWC379-1 : TPTP v9.3.1. Released v2.4.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% Computer : n018.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 02:44:10 PM UTC 2026
% Result : Unsatisfiable 0.15s 0.44s
% Output : CNFRefutation 0.15s
% Verified :
% SZS Type : Refutation
% Derivation depth : 10
% Number of leaves : 15
% Syntax : Number of clauses : 64 ( 13 unt; 22 nHn; 64 RR)
% Number of literals : 195 ( 24 equ; 114 neg)
% Maximal clause size : 6 ( 3 avg)
% Maximal term depth : 2 ( 1 avg)
% Number of predicates : 5 ( 3 usr; 1 prp; 0-2 aty)
% Number of functors : 7 ( 7 usr; 6 con; 0-1 aty)
% Number of variables : 32 ( 0 sgn)
% Comments :
%------------------------------------------------------------------------------
cnf(co1_11,negated_conjecture,
( ~ memberP(sk3,X1)
| ~ ssItem(X1)
| memberP(sk4,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_11) ).
cnf(co1_15,negated_conjecture,
( ~ leq(X1,sk6)
| ~ memberP(sk2,X1)
| ~ ssItem(X1)
| sk6 = X1
| memberP(sk1,sk6) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_15) ).
cnf(co1_9,negated_conjecture,
( ~ memberP(sk4,X1)
| ~ ssItem(X1)
| leq(sk5(X1),X1)
| memberP(sk3,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_9) ).
cnf(co1_6,negated_conjecture,
sk1 = sk3,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_6) ).
cnf(co1_14,negated_conjecture,
( memberP(sk2,sk6)
| memberP(sk1,sk6) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_14) ).
cnf(co1_5,negated_conjecture,
sk2 = sk4,
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_5) ).
cnf(co1_13,negated_conjecture,
ssItem(sk6),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_13) ).
cnf(co1_8,negated_conjecture,
( ~ memberP(sk4,X1)
| ~ ssItem(X1)
| memberP(sk4,sk5(X1))
| memberP(sk3,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_8) ).
cnf(co1_7,negated_conjecture,
( ~ memberP(sk4,X1)
| ~ ssItem(X1)
| ssItem(sk5(X1))
| memberP(sk3,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_7) ).
cnf(co1_10,negated_conjecture,
( ~ memberP(sk4,X1)
| X1 != sk5(X1)
| ~ ssItem(X1)
| memberP(sk3,X1) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_10) ).
cnf(co1_16,negated_conjecture,
( ~ memberP(sk1,sk6)
| ~ memberP(sk2,sk6)
| ssItem(sk7) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_16) ).
cnf(co1_18,negated_conjecture,
( ~ memberP(sk1,sk6)
| ~ memberP(sk2,sk6)
| leq(sk7,sk6) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_18) ).
cnf(co1_17,negated_conjecture,
( ~ memberP(sk1,sk6)
| ~ memberP(sk2,sk6)
| memberP(sk2,sk7) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_17) ).
cnf(co1_19,negated_conjecture,
( ~ memberP(sk1,sk6)
| ~ memberP(sk2,sk6)
| sk6 != sk7 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_19) ).
cnf(co1_12,negated_conjecture,
( ~ leq(X2,X1)
| ~ memberP(sk4,X2)
| ~ ssItem(X2)
| ~ memberP(sk3,X1)
| ~ ssItem(X1)
| X1 = X2 ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1_12) ).
cnf(c_0_15,negated_conjecture,
( ~ memberP(sk3,X1)
| ~ ssItem(X1)
| memberP(sk4,X1) ),
inference(fof_simplification,[status(thm)],[co1_11]) ).
cnf(c_0_16,negated_conjecture,
( ~ leq(X1,sk6)
| ~ memberP(sk2,X1)
| ~ ssItem(X1)
| sk6 = X1
| memberP(sk1,sk6) ),
inference(fof_simplification,[status(thm)],[co1_15]) ).
cnf(c_0_17,negated_conjecture,
( ~ memberP(sk4,X1)
| ~ ssItem(X1)
| leq(sk5(X1),X1)
| memberP(sk3,X1) ),
inference(fof_simplification,[status(thm)],[co1_9]) ).
cnf(c_0_18,negated_conjecture,
( ~ memberP(sk3,X1)
| ~ ssItem(X1)
| memberP(sk4,X1) ),
c_0_15 ).
cnf(c_0_19,negated_conjecture,
sk1 = sk3,
co1_6 ).
cnf(c_0_20,negated_conjecture,
( memberP(sk2,sk6)
| memberP(sk1,sk6) ),
co1_14 ).
cnf(c_0_21,negated_conjecture,
sk2 = sk4,
co1_5 ).
cnf(c_0_22,negated_conjecture,
( ~ leq(X1,sk6)
| ~ memberP(sk2,X1)
| ~ ssItem(X1)
| sk6 = X1
| memberP(sk1,sk6) ),
c_0_16 ).
cnf(c_0_23,negated_conjecture,
( ~ memberP(sk4,X1)
| ~ ssItem(X1)
| leq(sk5(X1),X1)
| memberP(sk3,X1) ),
c_0_17 ).
cnf(c_0_24,negated_conjecture,
( ~ ssItem(X1)
| ~ memberP(sk1,X1)
| memberP(sk4,X1) ),
inference(rw,[status(thm)],[c_0_18,c_0_19]) ).
cnf(c_0_25,negated_conjecture,
( memberP(sk1,sk6)
| memberP(sk4,sk6) ),
inference(rw,[status(thm)],[c_0_20,c_0_21]) ).
cnf(c_0_26,negated_conjecture,
ssItem(sk6),
co1_13 ).
cnf(c_0_27,negated_conjecture,
( ~ memberP(sk4,X1)
| ~ ssItem(X1)
| memberP(sk4,sk5(X1))
| memberP(sk3,X1) ),
inference(fof_simplification,[status(thm)],[co1_8]) ).
cnf(c_0_28,negated_conjecture,
( ~ ssItem(X1)
| ~ leq(X1,sk6)
| ~ memberP(sk4,X1)
| memberP(sk1,sk6)
| sk6 = X1 ),
inference(rw,[status(thm)],[c_0_22,c_0_21]) ).
cnf(c_0_29,negated_conjecture,
( ~ ssItem(X1)
| ~ memberP(sk4,X1)
| leq(sk5(X1),X1)
| memberP(sk1,X1) ),
inference(rw,[status(thm)],[c_0_23,c_0_19]) ).
cnf(c_0_30,negated_conjecture,
memberP(sk4,sk6),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26])]) ).
cnf(c_0_31,negated_conjecture,
( ~ memberP(sk4,X1)
| ~ ssItem(X1)
| memberP(sk4,sk5(X1))
| memberP(sk3,X1) ),
c_0_27 ).
cnf(c_0_32,negated_conjecture,
( ~ memberP(sk4,X1)
| ~ ssItem(X1)
| ssItem(sk5(X1))
| memberP(sk3,X1) ),
inference(fof_simplification,[status(thm)],[co1_7]) ).
cnf(c_0_33,negated_conjecture,
( ~ memberP(sk4,X1)
| X1 != sk5(X1)
| ~ ssItem(X1)
| memberP(sk3,X1) ),
inference(fof_simplification,[status(thm)],[co1_10]) ).
cnf(c_0_34,negated_conjecture,
( ~ ssItem(sk5(sk6))
| ~ memberP(sk4,sk5(sk6))
| memberP(sk1,sk6)
| sk5(sk6) = sk6 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30]),c_0_26])]) ).
cnf(c_0_35,negated_conjecture,
( ~ ssItem(X1)
| ~ memberP(sk4,X1)
| memberP(sk1,X1)
| memberP(sk4,sk5(X1)) ),
inference(rw,[status(thm)],[c_0_31,c_0_19]) ).
cnf(c_0_36,negated_conjecture,
( ~ memberP(sk4,X1)
| ~ ssItem(X1)
| ssItem(sk5(X1))
| memberP(sk3,X1) ),
c_0_32 ).
cnf(c_0_37,negated_conjecture,
( ~ memberP(sk1,sk6)
| ~ memberP(sk2,sk6)
| ssItem(sk7) ),
inference(fof_simplification,[status(thm)],[co1_16]) ).
cnf(c_0_38,negated_conjecture,
( ~ memberP(sk1,sk6)
| ~ memberP(sk2,sk6)
| leq(sk7,sk6) ),
inference(fof_simplification,[status(thm)],[co1_18]) ).
cnf(c_0_39,negated_conjecture,
( ~ memberP(sk4,X1)
| X1 != sk5(X1)
| ~ ssItem(X1)
| memberP(sk3,X1) ),
c_0_33 ).
cnf(c_0_40,negated_conjecture,
( ~ ssItem(sk5(sk6))
| memberP(sk1,sk6)
| sk5(sk6) = sk6 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_30]),c_0_26])]) ).
cnf(c_0_41,negated_conjecture,
( ~ ssItem(X1)
| ~ memberP(sk4,X1)
| ssItem(sk5(X1))
| memberP(sk1,X1) ),
inference(rw,[status(thm)],[c_0_36,c_0_19]) ).
cnf(c_0_42,negated_conjecture,
( ~ memberP(sk1,sk6)
| ~ memberP(sk2,sk6)
| memberP(sk2,sk7) ),
inference(fof_simplification,[status(thm)],[co1_17]) ).
cnf(c_0_43,negated_conjecture,
( ~ memberP(sk1,sk6)
| ~ memberP(sk2,sk6)
| ssItem(sk7) ),
c_0_37 ).
cnf(c_0_44,negated_conjecture,
( ~ memberP(sk1,sk6)
| ~ memberP(sk2,sk6)
| sk6 != sk7 ),
inference(fof_simplification,[status(thm)],[co1_19]) ).
cnf(c_0_45,negated_conjecture,
( ~ leq(X2,X1)
| ~ memberP(sk4,X2)
| ~ ssItem(X2)
| ~ memberP(sk3,X1)
| ~ ssItem(X1)
| X1 = X2 ),
inference(fof_simplification,[status(thm)],[co1_12]) ).
cnf(c_0_46,negated_conjecture,
( ~ memberP(sk1,sk6)
| ~ memberP(sk2,sk6)
| leq(sk7,sk6) ),
c_0_38 ).
cnf(c_0_47,negated_conjecture,
( ~ ssItem(X1)
| ~ memberP(sk4,X1)
| sk5(X1) != X1
| memberP(sk1,X1) ),
inference(rw,[status(thm)],[c_0_39,c_0_19]) ).
cnf(c_0_48,negated_conjecture,
( memberP(sk1,sk6)
| sk5(sk6) = sk6 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_30]),c_0_26])]) ).
cnf(c_0_49,negated_conjecture,
( ~ memberP(sk1,sk6)
| ~ memberP(sk2,sk6)
| memberP(sk2,sk7) ),
c_0_42 ).
cnf(c_0_50,negated_conjecture,
( ~ memberP(sk4,sk6)
| ~ memberP(sk1,sk6)
| ssItem(sk7) ),
inference(rw,[status(thm)],[c_0_43,c_0_21]) ).
cnf(c_0_51,negated_conjecture,
( ~ memberP(sk1,sk6)
| ~ memberP(sk2,sk6)
| sk6 != sk7 ),
c_0_44 ).
cnf(c_0_52,negated_conjecture,
( ~ leq(X2,X1)
| ~ memberP(sk4,X2)
| ~ ssItem(X2)
| ~ memberP(sk3,X1)
| ~ ssItem(X1)
| X1 = X2 ),
c_0_45 ).
cnf(c_0_53,negated_conjecture,
( ~ memberP(sk1,sk6)
| leq(sk7,sk6) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_46,c_0_21]),c_0_30])]) ).
cnf(c_0_54,negated_conjecture,
memberP(sk1,sk6),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_48]),c_0_30]),c_0_26])]) ).
cnf(c_0_55,negated_conjecture,
( ~ memberP(sk1,sk6)
| memberP(sk4,sk7) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_49,c_0_21]),c_0_21]),c_0_30])]) ).
cnf(c_0_56,negated_conjecture,
( ~ memberP(sk1,sk6)
| ssItem(sk7) ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_50,c_0_30])]) ).
cnf(c_0_57,negated_conjecture,
( ~ memberP(sk1,sk6)
| sk7 != sk6 ),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_51,c_0_21]),c_0_30])]) ).
cnf(c_0_58,negated_conjecture,
( ~ ssItem(X1)
| ~ ssItem(X2)
| ~ leq(X2,X1)
| ~ memberP(sk4,X2)
| ~ memberP(sk1,X1)
| X1 = X2 ),
inference(rw,[status(thm)],[c_0_52,c_0_19]) ).
cnf(c_0_59,negated_conjecture,
leq(sk7,sk6),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_53,c_0_54])]) ).
cnf(c_0_60,negated_conjecture,
memberP(sk4,sk7),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_55,c_0_54])]) ).
cnf(c_0_61,negated_conjecture,
ssItem(sk7),
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_56,c_0_54])]) ).
cnf(c_0_62,negated_conjecture,
sk7 != sk6,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_57,c_0_54])]) ).
cnf(c_0_63,negated_conjecture,
$false,
inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_59]),c_0_54]),c_0_60]),c_0_61]),c_0_26])]),c_0_62]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03 % Problem : SWC379-1 : TPTP v9.3.1. Released v2.4.0.
% 0.00/0.05 % Command : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.09/0.36 % Computer : n018.cluster.edu
% 0.09/0.36 % Model : x86_64 x86_64
% 0.09/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.36 % Memory : 8046.5625MB
% 0.09/0.36 % OS : Linux 6.8.0-71-generic
% 0.09/0.36 % CPULimit : 300
% 0.09/0.36 % WCLimit : 300
% 0.09/0.36 % DateTime : Mon Sep 21 08:21:58 UTC 2026
% 0.09/0.36 % CPUTime :
% 0.09/0.36 Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.15/0.40 Running first-order theorem proving
% 0.15/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
% 0.15/0.44 % Version: 3.5.1
% 0.15/0.44 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.44 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.44 % Starting new_bool_1 with 300s (1) cores
% 0.15/0.44 % Starting sh5l with 300s (1) cores
% 0.15/0.44 % new_bool_3 with pid 1434454 completed with status 0
% 0.15/0.44 % Result found by new_bool_3
% 0.15/0.44 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.44 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/0.44 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.44 % Search class: FGHSF-FFMM21-SFFFFFNN
% 0.15/0.44 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.44 % Starting SubtermCWHack with 28s (1) cores
% 0.15/0.44 % SubtermCWHack with pid 1434460 completed with status 0
% 0.15/0.44 % Result found by SubtermCWHack
% 0.15/0.44 % Preprocessing class: FSLSSMSMSSSNFFN.
% 0.15/0.44 % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.44 % Starting C07_19_nc_SOS_SAT001_MinMin_p005000_rr with 1500s (5) cores
% 0.15/0.44 % Starting new_bool_3 with 300s (1) cores
% 0.15/0.44 % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 0.15/0.44 % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.15/0.44 % Search class: FGHSF-FFMM21-SFFFFFNN
% 0.15/0.44 % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.15/0.44 % Starting SubtermCWHack with 28s (1) cores
% 0.15/0.44 % Preprocessing time : 0.002 s
% 0.15/0.44
% 0.15/0.44 % Proof found!
% 0.15/0.44 % SZS status Unsatisfiable
% 0.15/0.44 % SZS output start CNFRefutation
% See solution above
% 0.15/0.44 % Parsed axioms : 204
% 0.15/0.44 % Removed by relevancy pruning/SinE : 149
% 0.15/0.44 % Initial clauses : 55
% 0.15/0.44 % Removed in clause preprocessing : 0
% 0.15/0.44 % Initial clauses in saturation : 55
% 0.15/0.44 % Processed clauses : 99
% 0.15/0.44 % ...of these trivial : 0
% 0.15/0.44 % ...subsumed : 20
% 0.15/0.44 % ...remaining for further processing : 79
% 0.15/0.44 % Other redundant clauses eliminated : 8
% 0.15/0.44 % Clauses deleted for lack of memory : 0
% 0.15/0.44 % Backward-subsumed : 2
% 0.15/0.44 % Backward-rewritten : 11
% 0.15/0.44 % Generated clauses : 100
% 0.15/0.44 % ...of the previous two non-redundant : 70
% 0.15/0.44 % ...aggressively subsumed : 0
% 0.15/0.44 % Contextual simplify-reflections : 2
% 0.15/0.44 % Paramodulations : 89
% 0.15/0.44 % Factorizations : 0
% 0.15/0.44 % NegExts : 0
% 0.15/0.44 % Equation resolutions : 12
% 0.15/0.44 % Disequality decompositions : 0
% 0.15/0.44 % Total rewrite steps : 114
% 0.15/0.44 % ...of those cached : 103
% 0.15/0.44 % Propositional unsat checks : 0
% 0.15/0.44 % Propositional check models : 0
% 0.15/0.44 % Propositional check unsatisfiable : 0
% 0.15/0.44 % Propositional clauses : 0
% 0.15/0.44 % Propositional clauses after purity: 0
% 0.15/0.44 % Propositional unsat core size : 0
% 0.15/0.44 % Propositional preprocessing time : 0.000
% 0.15/0.44 % Propositional encoding time : 0.000
% 0.15/0.44 % Propositional solver time : 0.000
% 0.15/0.44 % Success case prop preproc time : 0.000
% 0.15/0.44 % Success case prop encoding time : 0.000
% 0.15/0.44 % Success case prop solver time : 0.000
% 0.15/0.44 % Current number of processed clauses : 63
% 0.15/0.44 % Positive orientable unit clauses : 12
% 0.15/0.44 % Positive unorientable unit clauses: 0
% 0.15/0.44 % Negative unit clauses : 3
% 0.15/0.44 % Non-unit-clauses : 48
% 0.15/0.44 % Current number of unprocessed clauses: 25
% 0.15/0.44 % ...number of literals in the above : 142
% 0.15/0.44 % Current number of archived formulas : 0
% 0.15/0.44 % Current number of archived clauses : 13
% 0.15/0.44 % Clause-clause subsumption calls (NU) : 372
% 0.15/0.44 % Rec. Clause-clause subsumption calls : 126
% 0.15/0.44 % Non-unit clause-clause subsumptions : 20
% 0.15/0.44 % Unit Clause-clause subsumption calls : 16
% 0.15/0.44 % Rewrite failures with RHS unbound : 0
% 0.15/0.44 % BW rewrite match attempts : 4
% 0.15/0.44 % BW rewrite match successes : 4
% 0.15/0.44 % Condensation attempts : 0
% 0.15/0.44 % Condensation successes : 0
% 0.15/0.44 % Termbank termtop insertions : 5668
% 0.15/0.44 % Search garbage collected termcells : 926
% 0.15/0.44
% 0.15/0.44 % -------------------------------------------------
% 0.15/0.44 % User time : 0.009 s
% 0.15/0.44 % System time : 0.004 s
% 0.15/0.44 % Total time : 0.013 s
% 0.15/0.44 % Maximum resident set size: 3764 pages
% 0.15/0.44
% 0.15/0.44 % -------------------------------------------------
% 0.15/0.44 % User time : 0.013 s
% 0.15/0.44 % System time : 0.009 s
% 0.15/0.44 % Total time : 0.022 s
% 0.15/0.44 % Maximum resident set size: 4864 pages
% 0.15/0.44 % E exiting
%------------------------------------------------------------------------------