↑ Up

E-SAT---3.5.1.UNS-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E-SAT---3.5.1
% Problem  : SWV843-1 : TPTP v9.3.1. Released v4.1.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:07:00 PM UTC 2026

% Result   : Unsatisfiable 0.15s 0.88s
% Output   : CNFRefutation 0.15s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   13
% Syntax   : Number of clauses     :   47 (  21 unt;   0 nHn;  29 RR)
%            Number of literals    :   87 (  12 equ;  46 neg)
%            Maximal clause size   :    4 (   1 avg)
%            Maximal term depth    :    6 (   2 avg)
%            Number of predicates  :    8 (   6 usr;   1 prp; 0-2 aty)
%            Number of functors    :   14 (  14 usr;   2 con; 0-4 aty)
%            Number of variables   :   74 (  14 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(cls_sup__max_0,axiom,
    ( ~ class_Lattices_Oupper__semilattice(X1)
    | ~ class_Orderings_Olinorder(X1)
    | c_Lattices_Oupper__semilattice__class_Osup(X1) = c_Orderings_Oord__class_Omax(X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_sup__max_0) ).

cnf(cls_finite_0,axiom,
    ( ~ class_Finite__Set_Ofinite_Ofinite(X1)
    | c_Finite__Set_Ofinite(X2,X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_finite_0) ).

cnf(clsarity_fun__Finite__Set_Ofinite_Ofinite,axiom,
    ( ~ class_Finite__Set_Ofinite_Ofinite(X1)
    | ~ class_Finite__Set_Ofinite_Ofinite(X2)
    | class_Finite__Set_Ofinite_Ofinite(tc_fun(X1,X2)) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clsarity_fun__Finite__Set_Ofinite_Ofinite) ).

cnf(cls_Max__def__raw_0,axiom,
    ( ~ class_Orderings_Olinorder(X1)
    | c_Finite__Set_Olinorder__class_OMax(X1) = c_Finite__Set_Ofold1(c_Orderings_Oord__class_Omax(X1),X1) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Max__def__raw_0) ).

cnf(clsarity_nat__Lattices_Oupper__semilattice,axiom,
    class_Lattices_Oupper__semilattice(tc_nat),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clsarity_nat__Lattices_Oupper__semilattice) ).

cnf(clsarity_nat__Orderings_Olinorder,axiom,
    class_Orderings_Olinorder(tc_nat),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clsarity_nat__Orderings_Olinorder) ).

cnf(cls_double__compl_0,axiom,
    ( ~ class_Lattices_Oboolean__algebra(X1)
    | hAPP(c_HOL_Ouminus__class_Ouminus(X1),hAPP(c_HOL_Ouminus__class_Ouminus(X1),X2)) = X2 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_double__compl_0) ).

cnf(cls_Suc__n__not__le__n_0,axiom,
    ~ hBOOL(hAPP(hAPP(c_lessequals(tc_nat),c_Suc(X1)),X1)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Suc__n__not__le__n_0) ).

cnf(cls_Max__ge_0,axiom,
    ( ~ c_Finite__Set_Ofinite(X3,X1)
    | ~ hBOOL(c_in(X2,X3,X1))
    | ~ class_Orderings_Olinorder(X1)
    | hBOOL(hAPP(hAPP(c_lessequals(X1),X2),hAPP(c_Finite__Set_Olinorder__class_OMax(X1),X3))) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_Max__ge_0) ).

cnf(clsarity_bool__Lattices_Oboolean__algebra,axiom,
    class_Lattices_Oboolean__algebra(tc_bool),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clsarity_bool__Lattices_Oboolean__algebra) ).

cnf(clsarity_bool__Finite__Set_Ofinite_Ofinite,axiom,
    class_Finite__Set_Ofinite_Ofinite(tc_bool),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',clsarity_bool__Finite__Set_Ofinite_Ofinite) ).

cnf(cls_rangeI_0,axiom,
    hBOOL(c_in(hAPP(X1,X2),c_Set_Oimage(X1,c_Orderings_Otop__class_Otop(tc_fun(X3,tc_bool)),X3,X4),X4)),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_rangeI_0) ).

cnf(cls_finite__imageI_0,axiom,
    ( ~ c_Finite__Set_Ofinite(X2,X3)
    | c_Finite__Set_Ofinite(c_Set_Oimage(X1,X2,X3,X4),X4) ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',cls_finite__imageI_0) ).

cnf(c_0_13,plain,
    ( ~ class_Lattices_Oupper__semilattice(X1)
    | ~ class_Orderings_Olinorder(X1)
    | c_Lattices_Oupper__semilattice__class_Osup(X1) = c_Orderings_Oord__class_Omax(X1) ),
    inference(fof_simplification,[status(thm)],[cls_sup__max_0]) ).

cnf(c_0_14,plain,
    ( ~ class_Finite__Set_Ofinite_Ofinite(X1)
    | c_Finite__Set_Ofinite(X2,X1) ),
    inference(fof_simplification,[status(thm)],[cls_finite_0]) ).

cnf(c_0_15,plain,
    ( ~ class_Finite__Set_Ofinite_Ofinite(X1)
    | ~ class_Finite__Set_Ofinite_Ofinite(X2)
    | class_Finite__Set_Ofinite_Ofinite(tc_fun(X1,X2)) ),
    inference(fof_simplification,[status(thm)],[clsarity_fun__Finite__Set_Ofinite_Ofinite]) ).

cnf(c_0_16,plain,
    ( ~ class_Orderings_Olinorder(X1)
    | c_Finite__Set_Olinorder__class_OMax(X1) = c_Finite__Set_Ofold1(c_Orderings_Oord__class_Omax(X1),X1) ),
    inference(fof_simplification,[status(thm)],[cls_Max__def__raw_0]) ).

cnf(c_0_17,plain,
    ( ~ class_Lattices_Oupper__semilattice(X1)
    | ~ class_Orderings_Olinorder(X1)
    | c_Lattices_Oupper__semilattice__class_Osup(X1) = c_Orderings_Oord__class_Omax(X1) ),
    c_0_13 ).

cnf(c_0_18,axiom,
    class_Lattices_Oupper__semilattice(tc_nat),
    clsarity_nat__Lattices_Oupper__semilattice ).

cnf(c_0_19,axiom,
    class_Orderings_Olinorder(tc_nat),
    clsarity_nat__Orderings_Olinorder ).

cnf(c_0_20,plain,
    ( ~ class_Lattices_Oboolean__algebra(X1)
    | hAPP(c_HOL_Ouminus__class_Ouminus(X1),hAPP(c_HOL_Ouminus__class_Ouminus(X1),X2)) = X2 ),
    inference(fof_simplification,[status(thm)],[cls_double__compl_0]) ).

cnf(c_0_21,plain,
    ( ~ class_Finite__Set_Ofinite_Ofinite(X1)
    | c_Finite__Set_Ofinite(X2,X1) ),
    c_0_14 ).

cnf(c_0_22,plain,
    ( ~ class_Finite__Set_Ofinite_Ofinite(X1)
    | ~ class_Finite__Set_Ofinite_Ofinite(X2)
    | class_Finite__Set_Ofinite_Ofinite(tc_fun(X1,X2)) ),
    c_0_15 ).

cnf(c_0_23,plain,
    ~ hBOOL(hAPP(hAPP(c_lessequals(tc_nat),c_Suc(X1)),X1)),
    inference(fof_simplification,[status(thm)],[cls_Suc__n__not__le__n_0]) ).

cnf(c_0_24,plain,
    ( ~ c_Finite__Set_Ofinite(X3,X1)
    | ~ hBOOL(c_in(X2,X3,X1))
    | ~ class_Orderings_Olinorder(X1)
    | hBOOL(hAPP(hAPP(c_lessequals(X1),X2),hAPP(c_Finite__Set_Olinorder__class_OMax(X1),X3))) ),
    inference(fof_simplification,[status(thm)],[cls_Max__ge_0]) ).

cnf(c_0_25,plain,
    ( ~ class_Orderings_Olinorder(X1)
    | c_Finite__Set_Olinorder__class_OMax(X1) = c_Finite__Set_Ofold1(c_Orderings_Oord__class_Omax(X1),X1) ),
    c_0_16 ).

cnf(c_0_26,plain,
    c_Orderings_Oord__class_Omax(tc_nat) = c_Lattices_Oupper__semilattice__class_Osup(tc_nat),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]) ).

cnf(c_0_27,plain,
    ( ~ class_Lattices_Oboolean__algebra(X1)
    | hAPP(c_HOL_Ouminus__class_Ouminus(X1),hAPP(c_HOL_Ouminus__class_Ouminus(X1),X2)) = X2 ),
    c_0_20 ).

cnf(c_0_28,axiom,
    class_Lattices_Oboolean__algebra(tc_bool),
    clsarity_bool__Lattices_Oboolean__algebra ).

cnf(c_0_29,plain,
    ( ~ class_Finite__Set_Ofinite_Ofinite(X2)
    | ~ class_Finite__Set_Ofinite_Ofinite(X3)
    | c_Finite__Set_Ofinite(X1,tc_fun(X2,X3)) ),
    inference(spm,[status(thm)],[c_0_21,c_0_22]) ).

cnf(c_0_30,axiom,
    class_Finite__Set_Ofinite_Ofinite(tc_bool),
    clsarity_bool__Finite__Set_Ofinite_Ofinite ).

cnf(c_0_31,plain,
    ~ hBOOL(hAPP(hAPP(c_lessequals(tc_nat),c_Suc(X1)),X1)),
    c_0_23 ).

cnf(c_0_32,plain,
    ( ~ c_Finite__Set_Ofinite(X3,X1)
    | ~ hBOOL(c_in(X2,X3,X1))
    | ~ class_Orderings_Olinorder(X1)
    | hBOOL(hAPP(hAPP(c_lessequals(X1),X2),hAPP(c_Finite__Set_Olinorder__class_OMax(X1),X3))) ),
    c_0_24 ).

cnf(c_0_33,plain,
    c_Finite__Set_Olinorder__class_OMax(tc_nat) = c_Finite__Set_Ofold1(c_Lattices_Oupper__semilattice__class_Osup(tc_nat),tc_nat),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_26]),c_0_19])]) ).

cnf(c_0_34,axiom,
    hBOOL(c_in(hAPP(X1,X2),c_Set_Oimage(X1,c_Orderings_Otop__class_Otop(tc_fun(X3,tc_bool)),X3,X4),X4)),
    cls_rangeI_0 ).

cnf(c_0_35,plain,
    hAPP(c_HOL_Ouminus__class_Ouminus(tc_bool),hAPP(c_HOL_Ouminus__class_Ouminus(tc_bool),X1)) = X1,
    inference(spm,[status(thm)],[c_0_27,c_0_28]) ).

cnf(c_0_36,plain,
    ( ~ class_Finite__Set_Ofinite_Ofinite(X2)
    | c_Finite__Set_Ofinite(X1,tc_fun(X2,tc_bool)) ),
    inference(spm,[status(thm)],[c_0_29,c_0_30]) ).

cnf(c_0_37,plain,
    ( ~ hBOOL(c_in(c_Suc(hAPP(c_Finite__Set_Ofold1(c_Lattices_Oupper__semilattice__class_Osup(tc_nat),tc_nat),X1)),X1,tc_nat))
    | ~ c_Finite__Set_Ofinite(X1,tc_nat) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]),c_0_19])]) ).

cnf(c_0_38,plain,
    hBOOL(c_in(X1,c_Set_Oimage(c_HOL_Ouminus__class_Ouminus(tc_bool),c_Orderings_Otop__class_Otop(tc_fun(X2,tc_bool)),X2,X3),X3)),
    inference(spm,[status(thm)],[c_0_34,c_0_35]) ).

cnf(c_0_39,plain,
    ( ~ c_Finite__Set_Ofinite(X2,X3)
    | c_Finite__Set_Ofinite(c_Set_Oimage(X1,X2,X3,X4),X4) ),
    inference(fof_simplification,[status(thm)],[cls_finite__imageI_0]) ).

cnf(c_0_40,plain,
    ( ~ class_Finite__Set_Ofinite_Ofinite(X2)
    | ~ class_Finite__Set_Ofinite_Ofinite(X3)
    | c_Finite__Set_Ofinite(X1,tc_fun(tc_fun(X2,X3),tc_bool)) ),
    inference(spm,[status(thm)],[c_0_36,c_0_22]) ).

cnf(c_0_41,plain,
    ~ c_Finite__Set_Ofinite(c_Set_Oimage(c_HOL_Ouminus__class_Ouminus(tc_bool),c_Orderings_Otop__class_Otop(tc_fun(X1,tc_bool)),X1,tc_nat),tc_nat),
    inference(spm,[status(thm)],[c_0_37,c_0_38]) ).

cnf(c_0_42,plain,
    ( ~ c_Finite__Set_Ofinite(X2,X3)
    | c_Finite__Set_Ofinite(c_Set_Oimage(X1,X2,X3,X4),X4) ),
    c_0_39 ).

cnf(c_0_43,plain,
    ( ~ class_Finite__Set_Ofinite_Ofinite(X2)
    | c_Finite__Set_Ofinite(X1,tc_fun(tc_fun(X2,tc_bool),tc_bool)) ),
    inference(spm,[status(thm)],[c_0_40,c_0_30]) ).

cnf(c_0_44,plain,
    ~ c_Finite__Set_Ofinite(c_Orderings_Otop__class_Otop(tc_fun(X1,tc_bool)),X1),
    inference(spm,[status(thm)],[c_0_41,c_0_42]) ).

cnf(c_0_45,plain,
    c_Finite__Set_Ofinite(X1,tc_fun(tc_fun(tc_bool,tc_bool),tc_bool)),
    inference(spm,[status(thm)],[c_0_43,c_0_30]) ).

cnf(c_0_46,plain,
    $false,
    inference(spm,[status(thm)],[c_0_44,c_0_45]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SWV843-1 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.12/0.58  % Computer : n011.cluster.edu
% 0.12/0.58  % Model    : x86_64 x86_64
% 0.12/0.58  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.58  % Memory   : 8046.5625MB
% 0.12/0.58  % OS       : Linux 6.8.0-71-generic
% 0.12/0.58  % CPULimit : 300
% 0.12/0.58  % WCLimit  : 300
% 0.12/0.58  % DateTime : Mon Sep 21 09:28:26 UTC 2026
% 0.12/0.59  % CPUTime  : 
% 0.12/0.59  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.15/0.63  Running first-order theorem proving
% 0.15/0.63  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.15/0.88  % Version: 3.5.1
% 0.15/0.88  % Preprocessing class: FMLMSMSMSSSNFFN.
% 0.15/0.88  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.88  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.88  % Starting new_bool_3 with 300s (1) cores
% 0.15/0.88  % Starting new_bool_1 with 300s (1) cores
% 0.15/0.88  % Starting sh5l with 300s (1) cores
% 0.15/0.88  % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1560973 completed with status 0
% 0.15/0.88  % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.15/0.88  % Preprocessing class: FMLMSMSMSSSNFFN.
% 0.15/0.88  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.88  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.88  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.88  % No SInE strategy applied
% 0.15/0.88  % Search class: FGHSM-SSLM32-DFFFFFNN
% 0.15/0.88  % Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.88  % Starting SubtermCWHack with 136s (1) cores
% 0.15/0.88  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.15/0.88  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2mI with 113s (1) cores
% 0.15/0.88  % Starting G-E--_208_B07_F1_SE_CS_SP_PS_S4d with 113s (1) cores
% 0.15/0.88  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_RG_S04AI with 113s (1) cores
% 0.15/0.88  % SubtermCWHack with pid 1560992 completed with status 0
% 0.15/0.88  % Result found by SubtermCWHack
% 0.15/0.88  % Preprocessing class: FMLMSMSMSSSNFFN.
% 0.15/0.88  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.15/0.88  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.15/0.88  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.15/0.88  % No SInE strategy applied
% 0.15/0.88  % Search class: FGHSM-SSLM32-DFFFFFNN
% 0.15/0.88  % Scheduled 13 strats onto 5 cores with 1500 seconds (1500 total)
% 0.15/0.88  % Starting SubtermCWHack with 136s (1) cores
% 0.15/0.88  % Preprocessing time       : 0.014 s
% 0.15/0.88  
% 0.15/0.88  % Proof found!
% 0.15/0.88  % SZS status Unsatisfiable
% 0.15/0.88  % SZS output start CNFRefutation
% See solution above
% 0.15/0.88  % Parsed axioms                        : 1041
% 0.15/0.88  % Removed by relevancy pruning/SinE    : 0
% 0.15/0.88  % Initial clauses                      : 1041
% 0.15/0.88  % Removed in clause preprocessing      : 1
% 0.15/0.88  % Initial clauses in saturation        : 1040
% 0.15/0.88  % Processed clauses                    : 2325
% 0.15/0.88  % ...of these trivial                  : 128
% 0.15/0.88  % ...subsumed                          : 1252
% 0.15/0.88  % ...remaining for further processing  : 945
% 0.15/0.88  % Other redundant clauses eliminated   : 130
% 0.15/0.88  % Clauses deleted for lack of memory   : 0
% 0.15/0.88  % Backward-subsumed                    : 13
% 0.15/0.88  % Backward-rewritten                   : 14
% 0.15/0.88  % Generated clauses                    : 7462
% 0.15/0.88  % ...of the previous two non-redundant : 5320
% 0.15/0.88  % ...aggressively subsumed             : 0
% 0.15/0.88  % Contextual simplify-reflections      : 0
% 0.15/0.88  % Paramodulations                      : 7317
% 0.15/0.88  % Factorizations                       : 4
% 0.15/0.88  % NegExts                              : 0
% 0.15/0.88  % Equation resolutions                 : 141
% 0.15/0.88  % Disequality decompositions           : 0
% 0.15/0.88  % Total rewrite steps                  : 3489
% 0.15/0.88  % ...of those cached                   : 2893
% 0.15/0.88  % Propositional unsat checks           : 0
% 0.15/0.88  %    Propositional check models        : 0
% 0.15/0.88  %    Propositional check unsatisfiable : 0
% 0.15/0.88  %    Propositional clauses             : 0
% 0.15/0.88  %    Propositional clauses after purity: 0
% 0.15/0.88  %    Propositional unsat core size     : 0
% 0.15/0.88  %    Propositional preprocessing time  : 0.000
% 0.15/0.88  %    Propositional encoding time       : 0.000
% 0.15/0.88  %    Propositional solver time         : 0.000
% 0.15/0.88  %    Success case prop preproc time    : 0.000
% 0.15/0.88  %    Success case prop encoding time   : 0.000
% 0.15/0.88  %    Success case prop solver time     : 0.000
% 0.15/0.88  % Current number of processed clauses  : 918
% 0.15/0.88  %    Positive orientable unit clauses  : 286
% 0.15/0.88  %    Positive unorientable unit clauses: 9
% 0.15/0.88  %    Negative unit clauses             : 53
% 0.15/0.88  %    Non-unit-clauses                  : 570
% 0.15/0.88  % Current number of unprocessed clauses: 3954
% 0.15/0.88  % ...number of literals in the above   : 9498
% 0.15/0.88  % Current number of archived formulas  : 0
% 0.15/0.88  % Current number of archived clauses   : 28
% 0.15/0.88  % Clause-clause subsumption calls (NU) : 64017
% 0.15/0.88  % Rec. Clause-clause subsumption calls : 46150
% 0.15/0.88  % Non-unit clause-clause subsumptions  : 848
% 0.15/0.88  % Unit Clause-clause subsumption calls : 2202
% 0.15/0.88  % Rewrite failures with RHS unbound    : 0
% 0.15/0.88  % BW rewrite match attempts            : 2451
% 0.15/0.88  % BW rewrite match successes           : 72
% 0.15/0.88  % Condensation attempts                : 0
% 0.15/0.88  % Condensation successes               : 0
% 0.15/0.88  % Termbank termtop insertions          : 157531
% 0.15/0.88  % Search garbage collected termcells   : 1954
% 0.15/0.88  
% 0.15/0.88  % -------------------------------------------------
% 0.15/0.88  % User time                : 0.203 s
% 0.15/0.88  % System time              : 0.015 s
% 0.15/0.88  % Total time               : 0.218 s
% 0.15/0.88  % Maximum resident set size: 5792 pages
% 0.15/0.88  
% 0.15/0.88  % -------------------------------------------------
% 0.15/0.88  % User time                : 0.944 s
% 0.15/0.88  % System time              : 0.060 s
% 0.15/0.88  % Total time               : 1.005 s
% 0.15/0.88  % Maximum resident set size: 5376 pages
% 0.15/0.88  % E exiting
%------------------------------------------------------------------------------