↑ Up

E---3.5.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : SYN586-1 : TPTP v9.3.1. Released v2.5.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM

% Computer : n011.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 03:25:40 PM UTC 2026

% Result   : Unsatisfiable 0.61s 0.59s
% Output   : CNFRefutation 0.61s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :   15
% Syntax   : Number of clauses     :   58 (  27 unt;   7 nHn;  48 RR)
%            Number of literals    :  118 (   0 equ;  53 neg)
%            Maximal clause size   :    6 (   2 avg)
%            Maximal term depth    :    7 (   2 avg)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :   15 (  15 usr;   6 con; 0-2 aty)
%            Number of variables   :   89 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(p3_26,negated_conjecture,
    ( ~ p15(f4(f6(f10(X4),f6(f7(f8(f9(c17))),c18)),X2),X3)
    | ~ p15(f4(f6(f10(X4),f6(f7(f8(f9(c17))),c18)),X1),X3)
    | p15(f4(f6(f10(X4),f6(f7(f8(f9(c17))),c18)),f11(X1)),X3)
    | p15(f4(f6(f10(X4),f6(f7(f8(f9(c17))),c18)),f11(X2)),X3)
    | p12(f13(X3),f13(c18))
    | p3(X1,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p3_26) ).

cnf(not_p15_23,negated_conjecture,
    ~ p15(f4(f6(f10(c16),f6(f7(f8(f9(c17))),c18)),f11(c19)),c20),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_p15_23) ).

cnf(not_p12_6,negated_conjecture,
    ~ p12(f13(c20),f13(c18)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',not_p12_6) ).

cnf(p15_18,negated_conjecture,
    p15(f4(f6(f10(c16),f6(f7(f8(f9(c17))),c18)),c19),c20),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p15_18) ).

cnf(p3_15,negated_conjecture,
    ( ~ p3(X3,X2)
    | ~ p3(X3,X1)
    | p3(X1,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p3_15) ).

cnf(p12_25,negated_conjecture,
    ( ~ p15(f4(f6(f10(X2),f6(f7(f8(f9(c17))),c18)),f11(f14(X1,X2))),X1)
    | p12(f13(X1),f13(c18)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p12_25) ).

cnf(p12_24,negated_conjecture,
    ( p15(f4(f6(f10(X2),f6(f7(f8(f9(c17))),c18)),f14(X1,X2)),X1)
    | p12(f13(X1),f13(c18)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p12_24) ).

cnf(p3_3,negated_conjecture,
    p3(X1,X1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p3_3) ).

cnf(p3_5,negated_conjecture,
    p3(c21,c19),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p3_5) ).

cnf(p2_20,negated_conjecture,
    ( ~ p3(X2,X4)
    | ~ p2(X1,X3)
    | p2(f4(X1,X2),f4(X3,X4)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p2_20) ).

cnf(p3_12,negated_conjecture,
    ( ~ p3(X1,X2)
    | p3(f11(X1),f11(X2)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p3_12) ).

cnf(p2_4,negated_conjecture,
    p2(X1,X1),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p2_4) ).

cnf(p15_17,negated_conjecture,
    ( ~ p15(X3,X4)
    | ~ p2(X4,X2)
    | ~ p2(X3,X1)
    | p15(X1,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p15_17) ).

cnf(p2_16,negated_conjecture,
    ( ~ p2(X3,X2)
    | ~ p2(X3,X1)
    | p2(X1,X2) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p2_16) ).

cnf(p15_22,negated_conjecture,
    p15(f4(f6(f10(c16),f6(f7(f8(f9(c17))),c18)),f11(c21)),c20),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',p15_22) ).

cnf(c_0_15,negated_conjecture,
    ( ~ p15(f4(f6(f10(X4),f6(f7(f8(f9(c17))),c18)),X2),X3)
    | ~ p15(f4(f6(f10(X4),f6(f7(f8(f9(c17))),c18)),X1),X3)
    | p15(f4(f6(f10(X4),f6(f7(f8(f9(c17))),c18)),f11(X1)),X3)
    | p15(f4(f6(f10(X4),f6(f7(f8(f9(c17))),c18)),f11(X2)),X3)
    | p12(f13(X3),f13(c18))
    | p3(X1,X2) ),
    inference(fof_simplification,[status(thm)],[p3_26]) ).

cnf(c_0_16,negated_conjecture,
    ~ p15(f4(f6(f10(c16),f6(f7(f8(f9(c17))),c18)),f11(c19)),c20),
    inference(fof_simplification,[status(thm)],[not_p15_23]) ).

cnf(c_0_17,negated_conjecture,
    ~ p12(f13(c20),f13(c18)),
    inference(fof_simplification,[status(thm)],[not_p12_6]) ).

cnf(c_0_18,negated_conjecture,
    ( ~ p15(f4(f6(f10(X4),f6(f7(f8(f9(c17))),c18)),X2),X3)
    | ~ p15(f4(f6(f10(X4),f6(f7(f8(f9(c17))),c18)),X1),X3)
    | p15(f4(f6(f10(X4),f6(f7(f8(f9(c17))),c18)),f11(X1)),X3)
    | p15(f4(f6(f10(X4),f6(f7(f8(f9(c17))),c18)),f11(X2)),X3)
    | p12(f13(X3),f13(c18))
    | p3(X1,X2) ),
    c_0_15 ).

cnf(c_0_19,negated_conjecture,
    p15(f4(f6(f10(c16),f6(f7(f8(f9(c17))),c18)),c19),c20),
    p15_18 ).

cnf(c_0_20,negated_conjecture,
    ~ p15(f4(f6(f10(c16),f6(f7(f8(f9(c17))),c18)),f11(c19)),c20),
    c_0_16 ).

cnf(c_0_21,negated_conjecture,
    ~ p12(f13(c20),f13(c18)),
    c_0_17 ).

cnf(c_0_22,negated_conjecture,
    ( ~ p3(X3,X2)
    | ~ p3(X3,X1)
    | p3(X1,X2) ),
    inference(fof_simplification,[status(thm)],[p3_15]) ).

cnf(c_0_23,negated_conjecture,
    ( ~ p15(f4(f6(f10(X2),f6(f7(f8(f9(c17))),c18)),f11(f14(X1,X2))),X1)
    | p12(f13(X1),f13(c18)) ),
    inference(fof_simplification,[status(thm)],[p12_25]) ).

cnf(c_0_24,negated_conjecture,
    ( ~ p15(f4(f6(f10(c16),f6(f7(f8(f9(c17))),c18)),X1),c20)
    | p3(X1,c19)
    | p15(f4(f6(f10(c16),f6(f7(f8(f9(c17))),c18)),f11(X1)),c20) ),
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20]),c_0_21]) ).

cnf(c_0_25,negated_conjecture,
    ( p15(f4(f6(f10(X2),f6(f7(f8(f9(c17))),c18)),f14(X1,X2)),X1)
    | p12(f13(X1),f13(c18)) ),
    p12_24 ).

cnf(c_0_26,negated_conjecture,
    ( ~ p3(X3,X2)
    | ~ p3(X3,X1)
    | p3(X1,X2) ),
    c_0_22 ).

cnf(c_0_27,negated_conjecture,
    p3(X1,X1),
    p3_3 ).

cnf(c_0_28,negated_conjecture,
    ( ~ p15(f4(f6(f10(X2),f6(f7(f8(f9(c17))),c18)),f11(f14(X1,X2))),X1)
    | p12(f13(X1),f13(c18)) ),
    c_0_23 ).

cnf(c_0_29,negated_conjecture,
    ( p3(f14(c20,c16),c19)
    | p15(f4(f6(f10(c16),f6(f7(f8(f9(c17))),c18)),f11(f14(c20,c16))),c20) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_21]) ).

cnf(c_0_30,negated_conjecture,
    ( ~ p3(X2,X1)
    | p3(X1,X2) ),
    inference(spm,[status(thm)],[c_0_26,c_0_27]) ).

cnf(c_0_31,negated_conjecture,
    p3(f14(c20,c16),c19),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_21]) ).

cnf(c_0_32,negated_conjecture,
    p3(c19,f14(c20,c16)),
    inference(spm,[status(thm)],[c_0_30,c_0_31]) ).

cnf(c_0_33,negated_conjecture,
    p3(c21,c19),
    p3_5 ).

cnf(c_0_34,negated_conjecture,
    ( ~ p3(X2,X4)
    | ~ p2(X1,X3)
    | p2(f4(X1,X2),f4(X3,X4)) ),
    inference(fof_simplification,[status(thm)],[p2_20]) ).

cnf(c_0_35,negated_conjecture,
    ( ~ p3(X1,X2)
    | p3(f11(X1),f11(X2)) ),
    inference(fof_simplification,[status(thm)],[p3_12]) ).

cnf(c_0_36,negated_conjecture,
    ( ~ p3(c19,X1)
    | p3(X1,f14(c20,c16)) ),
    inference(spm,[status(thm)],[c_0_26,c_0_32]) ).

cnf(c_0_37,negated_conjecture,
    p3(c19,c21),
    inference(spm,[status(thm)],[c_0_30,c_0_33]) ).

cnf(c_0_38,negated_conjecture,
    ( ~ p3(X2,X4)
    | ~ p2(X1,X3)
    | p2(f4(X1,X2),f4(X3,X4)) ),
    c_0_34 ).

cnf(c_0_39,negated_conjecture,
    p2(X1,X1),
    p2_4 ).

cnf(c_0_40,negated_conjecture,
    ( ~ p3(X1,X2)
    | p3(f11(X1),f11(X2)) ),
    c_0_35 ).

cnf(c_0_41,negated_conjecture,
    p3(c21,f14(c20,c16)),
    inference(spm,[status(thm)],[c_0_36,c_0_37]) ).

cnf(c_0_42,negated_conjecture,
    ( ~ p15(X3,X4)
    | ~ p2(X4,X2)
    | ~ p2(X3,X1)
    | p15(X1,X2) ),
    inference(fof_simplification,[status(thm)],[p15_17]) ).

cnf(c_0_43,negated_conjecture,
    ( ~ p2(X3,X2)
    | ~ p2(X3,X1)
    | p2(X1,X2) ),
    inference(fof_simplification,[status(thm)],[p2_16]) ).

cnf(c_0_44,negated_conjecture,
    ( ~ p3(X2,X3)
    | p2(f4(X1,X2),f4(X1,X3)) ),
    inference(spm,[status(thm)],[c_0_38,c_0_39]) ).

cnf(c_0_45,negated_conjecture,
    p3(f11(f14(c20,c16)),f11(c19)),
    inference(spm,[status(thm)],[c_0_40,c_0_31]) ).

cnf(c_0_46,negated_conjecture,
    p3(f14(c20,c16),c21),
    inference(spm,[status(thm)],[c_0_30,c_0_41]) ).

cnf(c_0_47,negated_conjecture,
    ( ~ p15(X3,X4)
    | ~ p2(X4,X2)
    | ~ p2(X3,X1)
    | p15(X1,X2) ),
    c_0_42 ).

cnf(c_0_48,negated_conjecture,
    p15(f4(f6(f10(c16),f6(f7(f8(f9(c17))),c18)),f11(c21)),c20),
    p15_22 ).

cnf(c_0_49,negated_conjecture,
    ( ~ p2(X3,X2)
    | ~ p2(X3,X1)
    | p2(X1,X2) ),
    c_0_43 ).

cnf(c_0_50,negated_conjecture,
    p2(f4(X1,f11(f14(c20,c16))),f4(X1,f11(c19))),
    inference(spm,[status(thm)],[c_0_44,c_0_45]) ).

cnf(c_0_51,negated_conjecture,
    p3(f11(f14(c20,c16)),f11(c21)),
    inference(spm,[status(thm)],[c_0_40,c_0_46]) ).

cnf(c_0_52,negated_conjecture,
    ( ~ p2(c20,X2)
    | ~ p2(f4(f6(f10(c16),f6(f7(f8(f9(c17))),c18)),f11(c21)),X1)
    | p15(X1,X2) ),
    inference(spm,[status(thm)],[c_0_47,c_0_48]) ).

cnf(c_0_53,negated_conjecture,
    ( ~ p2(f4(X2,f11(f14(c20,c16))),X1)
    | p2(X1,f4(X2,f11(c19))) ),
    inference(spm,[status(thm)],[c_0_49,c_0_50]) ).

cnf(c_0_54,negated_conjecture,
    p2(f4(X1,f11(f14(c20,c16))),f4(X1,f11(c21))),
    inference(spm,[status(thm)],[c_0_44,c_0_51]) ).

cnf(c_0_55,negated_conjecture,
    ( ~ p2(f4(f6(f10(c16),f6(f7(f8(f9(c17))),c18)),f11(c21)),X1)
    | p15(X1,c20) ),
    inference(spm,[status(thm)],[c_0_52,c_0_39]) ).

cnf(c_0_56,negated_conjecture,
    p2(f4(X1,f11(c21)),f4(X1,f11(c19))),
    inference(spm,[status(thm)],[c_0_53,c_0_54]) ).

cnf(c_0_57,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_56]),c_0_20]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYN586-1 : TPTP v9.3.1. Released v2.5.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.36  % Computer : n011.cluster.edu
% 0.12/0.36  % Model    : x86_64 x86_64
% 0.12/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.36  % Memory   : 8046.5625MB
% 0.12/0.36  % OS       : Linux 6.8.0-71-generic
% 0.12/0.37  % CPULimit : 300
% 0.12/0.37  % WCLimit  : 300
% 0.12/0.37  % DateTime : Mon Sep 21 11:09:25 UTC 2026
% 0.12/0.37  % CPUTime  : 
% 0.12/0.37  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/0.41  Running first-order theorem proving
% 0.15/0.41  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
% 0.61/0.59  % Version: 3.5.1
% 0.61/0.59  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.61/0.59  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.61/0.59  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.61/0.59  % Starting new_bool_3 with 300s (1) cores
% 0.61/0.59  % Starting new_bool_1 with 300s (1) cores
% 0.61/0.59  % Starting sh5l with 300s (1) cores
% 0.61/0.59  % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1745743 completed with status 0
% 0.61/0.59  % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.61/0.59  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.61/0.59  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.61/0.59  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.61/0.59  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.61/0.59  % No SInE strategy applied
% 0.61/0.59  % Search class: FGUNM-FFMS21-DFFFFFNN
% 0.61/0.59  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.61/0.59  % Starting SubtermCWHack with 136s (1) cores
% 0.61/0.59  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.61/0.59  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.61/0.59  % Starting new_bool_3 with 136s (1) cores
% 0.61/0.59  % Starting new_bool_1 with 136s (1) cores
% 0.61/0.59  % new_bool_1 with pid 1745754 completed with status 0
% 0.61/0.59  % Result found by new_bool_1
% 0.61/0.59  % Preprocessing class: FSMSSMSSSSSNFFN.
% 0.61/0.59  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.61/0.59  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.61/0.59  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.61/0.59  % No SInE strategy applied
% 0.61/0.59  % Search class: FGUNM-FFMS21-DFFFFFNN
% 0.61/0.59  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.61/0.59  % Starting SubtermCWHack with 136s (1) cores
% 0.61/0.59  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.61/0.59  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AN with 136s (1) cores
% 0.61/0.59  % Starting new_bool_3 with 136s (1) cores
% 0.61/0.59  % Starting new_bool_1 with 136s (1) cores
% 0.61/0.59  % Preprocessing time       : 0.002 s
% 0.61/0.59  % Presaturation interreduction done
% 0.61/0.59  
% 0.61/0.59  % Proof found!
% 0.61/0.59  % SZS status Unsatisfiable
% 0.61/0.59  % SZS output start CNFRefutation
% See solution above
% 0.61/0.59  % Parsed axioms                        : 26
% 0.61/0.59  % Removed by relevancy pruning/SinE    : 0
% 0.61/0.59  % Initial clauses                      : 26
% 0.61/0.59  % Removed in clause preprocessing      : 0
% 0.61/0.59  % Initial clauses in saturation        : 26
% 0.61/0.59  % Processed clauses                    : 945
% 0.61/0.59  % ...of these trivial                  : 113
% 0.61/0.59  % ...subsumed                          : 0
% 0.61/0.59  % ...remaining for further processing  : 832
% 0.61/0.59  % Other redundant clauses eliminated   : 0
% 0.61/0.59  % Clauses deleted for lack of memory   : 0
% 0.61/0.59  % Backward-subsumed                    : 0
% 0.61/0.59  % Backward-rewritten                   : 1
% 0.61/0.59  % Generated clauses                    : 10007
% 0.61/0.59  % ...of the previous two non-redundant : 9247
% 0.61/0.59  % ...aggressively subsumed             : 0
% 0.61/0.59  % Contextual simplify-reflections      : 1
% 0.61/0.59  % Paramodulations                      : 10007
% 0.61/0.59  % Factorizations                       : 0
% 0.61/0.59  % NegExts                              : 0
% 0.61/0.59  % Equation resolutions                 : 0
% 0.61/0.59  % Disequality decompositions           : 0
% 0.61/0.59  % Total rewrite steps                  : 873
% 0.61/0.59  % ...of those cached                   : 384
% 0.61/0.59  % Propositional unsat checks           : 0
% 0.61/0.59  %    Propositional check models        : 0
% 0.61/0.59  %    Propositional check unsatisfiable : 0
% 0.61/0.59  %    Propositional clauses             : 0
% 0.61/0.59  %    Propositional clauses after purity: 0
% 0.61/0.59  %    Propositional unsat core size     : 0
% 0.61/0.59  %    Propositional preprocessing time  : 0.000
% 0.61/0.59  %    Propositional encoding time       : 0.000
% 0.61/0.59  %    Propositional solver time         : 0.000
% 0.61/0.59  %    Success case prop preproc time    : 0.000
% 0.61/0.59  %    Success case prop encoding time   : 0.000
% 0.61/0.59  %    Success case prop solver time     : 0.000
% 0.61/0.59  % Current number of processed clauses  : 805
% 0.61/0.59  %    Positive orientable unit clauses  : 451
% 0.61/0.59  %    Positive unorientable unit clauses: 0
% 0.61/0.59  %    Negative unit clauses             : 2
% 0.61/0.59  %    Non-unit-clauses                  : 352
% 0.61/0.59  % Current number of unprocessed clauses: 8271
% 0.61/0.59  % ...number of literals in the above   : 8772
% 0.61/0.59  % Current number of archived formulas  : 0
% 0.61/0.59  % Current number of archived clauses   : 27
% 0.61/0.59  % Clause-clause subsumption calls (NU) : 7528
% 0.61/0.59  % Rec. Clause-clause subsumption calls : 6464
% 0.61/0.59  % Non-unit clause-clause subsumptions  : 1
% 0.61/0.59  % Unit Clause-clause subsumption calls : 2468
% 0.61/0.59  % Rewrite failures with RHS unbound    : 0
% 0.61/0.59  % BW rewrite match attempts            : 5571
% 0.61/0.59  % BW rewrite match successes           : 1
% 0.61/0.59  % Condensation attempts                : 0
% 0.61/0.59  % Condensation successes               : 0
% 0.61/0.59  % Termbank termtop insertions          : 189725
% 0.61/0.59  % Search garbage collected termcells   : 69
% 0.61/0.59  
% 0.61/0.59  % -------------------------------------------------
% 0.61/0.59  % User time                : 0.142 s
% 0.61/0.59  % System time              : 0.022 s
% 0.61/0.59  % Total time               : 0.164 s
% 0.61/0.59  % Maximum resident set size: 3664 pages
% 0.61/0.59  
% 0.61/0.59  % -------------------------------------------------
% 0.61/0.59  % User time                : 0.704 s
% 0.61/0.59  % System time              : 0.056 s
% 0.61/0.59  % Total time               : 0.760 s
% 0.61/0.59  % Maximum resident set size: 4608 pages
% 0.61/0.59  % E exiting
%------------------------------------------------------------------------------