↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : SEU411+3 : TPTP v9.3.1. Released v3.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM

% Computer : n007.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:25:02 PM UTC 2026

% Result   : Theorem 74.91s 12.35s
% Output   : CNFRefutation 74.91s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   28 (  16 unt;   0 def)
%            Number of atoms       :  153 (  11 equ)
%            Maximal formula atoms :   20 (   5 avg)
%            Number of connectives :  171 (  46   ~;  31   |;  79   &)
%                                         (   2 <=>;  13  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   20 (   5 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :   14 (  12 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   2 con; 0-3 aty)
%            Number of variables   :   39 (   2 sgn  28   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(t20_latsum_1,conjecture,
    ! [X1] :
      ( ( l1_orders_2(X1)
        & v1_lattice3(X1)
        & v1_yellow_0(X1)
        & v4_orders_2(X1)
        & v3_orders_2(X1)
        & v2_orders_2(X1)
        & ~ v3_struct_0(X1) )
     => ! [X2] :
          ( ( l1_orders_2(X2)
            & v1_lattice3(X2)
            & v1_yellow_0(X2)
            & v4_orders_2(X2)
            & v3_orders_2(X2)
            & v2_orders_2(X2)
            & ~ v3_struct_0(X2) )
         => ( ( m1_subset_1(k3_xboole_0(u1_struct_0(X1),u1_struct_0(X2)),k1_zfmisc_1(u1_struct_0(X2)))
              & v12_waybel_0(k3_xboole_0(u1_struct_0(X1),u1_struct_0(X2)),X2)
              & v1_waybel_0(k3_xboole_0(u1_struct_0(X1),u1_struct_0(X2)),X2)
              & ~ v1_xboole_0(k3_xboole_0(u1_struct_0(X1),u1_struct_0(X2))) )
           => r2_hidden(k3_yellow_0(X2),u1_struct_0(X1)) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t20_latsum_1) ).

fof(t10_waybel12,axiom,
    ! [X1] :
      ( ( l1_orders_2(X1)
        & v1_yellow_0(X1)
        & v4_orders_2(X1)
        & ~ v3_struct_0(X1) )
     => ! [X2] :
          ( ( m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
            & v12_waybel_0(X2,X1)
            & ~ v1_xboole_0(X2) )
         => r2_hidden(k3_yellow_0(X1),X2) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+506.ax',t10_waybel12) ).

fof(commutativity_k3_xboole_0,axiom,
    ! [X1,X2] : k3_xboole_0(X1,X2) = k3_xboole_0(X2,X1),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+2.ax',commutativity_k3_xboole_0) ).

fof(d3_xboole_0,axiom,
    ! [X1,X2,X3] :
      ( X3 = k3_xboole_0(X1,X2)
    <=> ! [X4] :
          ( r2_hidden(X4,X3)
        <=> ( r2_hidden(X4,X2)
            & r2_hidden(X4,X1) ) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET007/SET007+2.ax',d3_xboole_0) ).

fof(c_0_4,negated_conjecture,
    ~ ! [X1] :
        ( ( l1_orders_2(X1)
          & v1_lattice3(X1)
          & v1_yellow_0(X1)
          & v4_orders_2(X1)
          & v3_orders_2(X1)
          & v2_orders_2(X1)
          & ~ v3_struct_0(X1) )
       => ! [X2] :
            ( ( l1_orders_2(X2)
              & v1_lattice3(X2)
              & v1_yellow_0(X2)
              & v4_orders_2(X2)
              & v3_orders_2(X2)
              & v2_orders_2(X2)
              & ~ v3_struct_0(X2) )
           => ( ( m1_subset_1(k3_xboole_0(u1_struct_0(X1),u1_struct_0(X2)),k1_zfmisc_1(u1_struct_0(X2)))
                & v12_waybel_0(k3_xboole_0(u1_struct_0(X1),u1_struct_0(X2)),X2)
                & v1_waybel_0(k3_xboole_0(u1_struct_0(X1),u1_struct_0(X2)),X2)
                & ~ v1_xboole_0(k3_xboole_0(u1_struct_0(X1),u1_struct_0(X2))) )
             => r2_hidden(k3_yellow_0(X2),u1_struct_0(X1)) ) ) ),
    inference(assume_negation,[status(cth)],[t20_latsum_1]) ).

fof(c_0_5,negated_conjecture,
    ~ ! [X1] :
        ( ( l1_orders_2(X1)
          & v1_lattice3(X1)
          & v1_yellow_0(X1)
          & v4_orders_2(X1)
          & v3_orders_2(X1)
          & v2_orders_2(X1)
          & ~ v3_struct_0(X1) )
       => ! [X2] :
            ( ( l1_orders_2(X2)
              & v1_lattice3(X2)
              & v1_yellow_0(X2)
              & v4_orders_2(X2)
              & v3_orders_2(X2)
              & v2_orders_2(X2)
              & ~ v3_struct_0(X2) )
           => ( ( m1_subset_1(k3_xboole_0(u1_struct_0(X1),u1_struct_0(X2)),k1_zfmisc_1(u1_struct_0(X2)))
                & v12_waybel_0(k3_xboole_0(u1_struct_0(X1),u1_struct_0(X2)),X2)
                & v1_waybel_0(k3_xboole_0(u1_struct_0(X1),u1_struct_0(X2)),X2)
                & ~ v1_xboole_0(k3_xboole_0(u1_struct_0(X1),u1_struct_0(X2))) )
             => r2_hidden(k3_yellow_0(X2),u1_struct_0(X1)) ) ) ),
    inference(fof_simplification,[status(thm)],[c_0_4]) ).

fof(c_0_6,plain,
    ! [X1] :
      ( ( l1_orders_2(X1)
        & v1_yellow_0(X1)
        & v4_orders_2(X1)
        & ~ v3_struct_0(X1) )
     => ! [X2] :
          ( ( m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
            & v12_waybel_0(X2,X1)
            & ~ v1_xboole_0(X2) )
         => r2_hidden(k3_yellow_0(X1),X2) ) ),
    inference(fof_simplification,[status(thm)],[t10_waybel12]) ).

fof(c_0_7,negated_conjecture,
    ( ~ r2_hidden(k3_yellow_0(esk2_0),u1_struct_0(esk1_0))
    & m1_subset_1(k3_xboole_0(u1_struct_0(esk1_0),u1_struct_0(esk2_0)),k1_zfmisc_1(u1_struct_0(esk2_0)))
    & v12_waybel_0(k3_xboole_0(u1_struct_0(esk1_0),u1_struct_0(esk2_0)),esk2_0)
    & v1_waybel_0(k3_xboole_0(u1_struct_0(esk1_0),u1_struct_0(esk2_0)),esk2_0)
    & ~ v1_xboole_0(k3_xboole_0(u1_struct_0(esk1_0),u1_struct_0(esk2_0)))
    & l1_orders_2(esk2_0)
    & v1_lattice3(esk2_0)
    & v1_yellow_0(esk2_0)
    & v4_orders_2(esk2_0)
    & v3_orders_2(esk2_0)
    & v2_orders_2(esk2_0)
    & ~ v3_struct_0(esk2_0)
    & l1_orders_2(esk1_0)
    & v1_lattice3(esk1_0)
    & v1_yellow_0(esk1_0)
    & v4_orders_2(esk1_0)
    & v3_orders_2(esk1_0)
    & v2_orders_2(esk1_0)
    & ~ v3_struct_0(esk1_0) ),
    inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])]) ).

fof(c_0_8,plain,
    ! [X135,X136] : k3_xboole_0(X135,X136) = k3_xboole_0(X136,X135),
    inference(variable_rename,[status(thm)],[commutativity_k3_xboole_0]) ).

fof(c_0_9,plain,
    ! [X118,X119,X120,X121,X122,X123,X124,X125] :
      ( ( X125 = k3_xboole_0(X123,X124)
        | r2_hidden(esk11_3(X123,X124,X125),X125)
        | r2_hidden(esk11_3(X123,X124,X125),X124) )
      & ( X125 = k3_xboole_0(X123,X124)
        | r2_hidden(esk11_3(X123,X124,X125),X125)
        | r2_hidden(esk11_3(X123,X124,X125),X123) )
      & ( X125 = k3_xboole_0(X123,X124)
        | ~ r2_hidden(esk11_3(X123,X124,X125),X124)
        | ~ r2_hidden(esk11_3(X123,X124,X125),X123)
        | ~ r2_hidden(esk11_3(X123,X124,X125),X125) )
      & ( X120 != k3_xboole_0(X118,X119)
        | r2_hidden(X122,X120)
        | ~ r2_hidden(X122,X119)
        | ~ r2_hidden(X122,X118) )
      & ( X120 != k3_xboole_0(X118,X119)
        | ~ r2_hidden(X121,X120)
        | r2_hidden(X121,X119) )
      & ( X120 != k3_xboole_0(X118,X119)
        | ~ r2_hidden(X121,X120)
        | r2_hidden(X121,X118) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[d3_xboole_0])])])])])])]) ).

fof(c_0_10,plain,
    ! [X104,X105] :
      ( r2_hidden(k3_yellow_0(X104),X105)
      | ~ m1_subset_1(X105,k1_zfmisc_1(u1_struct_0(X104)))
      | ~ v12_waybel_0(X105,X104)
      | v1_xboole_0(X105)
      | ~ l1_orders_2(X104)
      | ~ v1_yellow_0(X104)
      | ~ v4_orders_2(X104)
      | v3_struct_0(X104) ),
    inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])]) ).

cnf(c_0_11,negated_conjecture,
    v12_waybel_0(k3_xboole_0(u1_struct_0(esk1_0),u1_struct_0(esk2_0)),esk2_0),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_12,plain,
    k3_xboole_0(X1,X2) = k3_xboole_0(X2,X1),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_13,negated_conjecture,
    m1_subset_1(k3_xboole_0(u1_struct_0(esk1_0),u1_struct_0(esk2_0)),k1_zfmisc_1(u1_struct_0(esk2_0))),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_14,negated_conjecture,
    ~ v1_xboole_0(k3_xboole_0(u1_struct_0(esk1_0),u1_struct_0(esk2_0))),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_15,plain,
    ( X3 != k3_xboole_0(X4,X2)
    | ~ r2_hidden(X1,X3)
    | r2_hidden(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_16,plain,
    ( ~ m1_subset_1(X2,k1_zfmisc_1(u1_struct_0(X1)))
    | ~ v12_waybel_0(X2,X1)
    | ~ l1_orders_2(X1)
    | ~ v1_yellow_0(X1)
    | ~ v4_orders_2(X1)
    | r2_hidden(k3_yellow_0(X1),X2)
    | v1_xboole_0(X2)
    | v3_struct_0(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_17,negated_conjecture,
    v12_waybel_0(k3_xboole_0(u1_struct_0(esk2_0),u1_struct_0(esk1_0)),esk2_0),
    inference(rw,[status(thm)],[c_0_11,c_0_12]) ).

cnf(c_0_18,negated_conjecture,
    v1_yellow_0(esk2_0),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_19,negated_conjecture,
    v4_orders_2(esk2_0),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_20,negated_conjecture,
    l1_orders_2(esk2_0),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_21,negated_conjecture,
    m1_subset_1(k3_xboole_0(u1_struct_0(esk2_0),u1_struct_0(esk1_0)),k1_zfmisc_1(u1_struct_0(esk2_0))),
    inference(rw,[status(thm)],[c_0_13,c_0_12]) ).

cnf(c_0_22,negated_conjecture,
    ~ v3_struct_0(esk2_0),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_23,negated_conjecture,
    ~ v1_xboole_0(k3_xboole_0(u1_struct_0(esk2_0),u1_struct_0(esk1_0))),
    inference(rw,[status(thm)],[c_0_14,c_0_12]) ).

cnf(c_0_24,plain,
    ( ~ r2_hidden(X1,k3_xboole_0(X3,X2))
    | r2_hidden(X1,X2) ),
    inference(er,[status(thm)],[c_0_15]) ).

cnf(c_0_25,negated_conjecture,
    r2_hidden(k3_yellow_0(esk2_0),k3_xboole_0(u1_struct_0(esk2_0),u1_struct_0(esk1_0))),
    inference(sr,[status(thm)],[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_16,c_0_17]),c_0_18]),c_0_19]),c_0_20]),c_0_21])]),c_0_22]),c_0_23]) ).

cnf(c_0_26,negated_conjecture,
    ~ r2_hidden(k3_yellow_0(esk2_0),u1_struct_0(esk1_0)),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_27,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SEU411+3 : TPTP v9.3.1. Released v3.4.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.38  % Computer : n007.cluster.edu
% 0.12/0.38  % Model    : x86_64 x86_64
% 0.12/0.38  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.38  % Memory   : 8046.5625MB
% 0.12/0.38  % OS       : Linux 6.8.0-71-generic
% 0.12/0.38  % CPULimit : 300
% 0.12/0.38  % WCLimit  : 300
% 0.12/0.38  % DateTime : Mon Sep 21 06:20:22 UTC 2026
% 0.12/0.38  % CPUTime  : 
% 0.12/0.38  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.12/0.42  Running first-order theorem proving
% 0.12/0.42  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
% 74.91/12.35  % Version: 3.5.1
% 74.91/12.35  % Preprocessing class: FMLLMMLLSSSNFFN.
% 74.91/12.35  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 74.91/12.35  % Starting new_bool_3 with 900s (3) cores
% 74.91/12.35  % Starting new_bool_1 with 900s (3) cores
% 74.91/12.35  % Starting sh5l with 300s (1) cores
% 74.91/12.35  % Starting G-E--_211_C18_F1_AE_CS_SP_S0Y with 300s (1) cores
% 74.91/12.35  % new_bool_1 with pid 371650 completed with status 0
% 74.91/12.35  % Result found by new_bool_1
% 74.91/12.35  % Preprocessing class: FMLLMMLLSSSNFFN.
% 74.91/12.35  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 74.91/12.35  % Starting new_bool_3 with 900s (3) cores
% 74.91/12.35  % Starting new_bool_1 with 900s (3) cores
% 74.91/12.35  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 74.91/12.35  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 74.91/12.35  % Search class: FGHSM-SMLM32-MFFFFFNN
% 74.91/12.35  % Scheduled 13 strats onto 3 cores with 900 seconds (900 total)
% 74.91/12.35  % Starting SubtermCWHack with 82s (1) cores
% 74.91/12.35  % Starting new_bool_1 with 91s (1) cores
% 74.91/12.35  % Starting C12_02_nc_SAT001_MinMin_p005000_rr with 68s (1) cores
% 74.91/12.35  % new_bool_1 with pid 371657 completed with status 0
% 74.91/12.35  % Result found by new_bool_1
% 74.91/12.35  % Preprocessing class: FMLLMMLLSSSNFFN.
% 74.91/12.35  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 74.91/12.35  % Starting new_bool_3 with 900s (3) cores
% 74.91/12.35  % Starting new_bool_1 with 900s (3) cores
% 74.91/12.35  % (lift_lambdas = 0, lambda_to_forall = 0,unroll_only_formulas = 0, sine = GSinE(CountFormulas,hypos,1.5,,3,20000,1.0))
% 74.91/12.35  % SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 74.91/12.35  % Search class: FGHSM-SMLM32-MFFFFFNN
% 74.91/12.35  % Scheduled 13 strats onto 3 cores with 900 seconds (900 total)
% 74.91/12.35  % Starting SubtermCWHack with 82s (1) cores
% 74.91/12.35  % Starting new_bool_1 with 91s (1) cores
% 74.91/12.35  % Preprocessing time       : 0.142 s
% 74.91/12.35  % Presaturation interreduction done
% 74.91/12.35  
% 74.91/12.35  % Proof found!
% 74.91/12.35  % SZS status Theorem
% 74.91/12.35  % SZS output start CNFRefutation
% See solution above
% 74.91/12.35  % Parsed axioms                        : 19046
% 74.91/12.35  % Removed by relevancy pruning/SinE    : 17025
% 74.91/12.35  % Initial clauses                      : 5051
% 74.91/12.35  % Removed in clause preprocessing      : 142
% 74.91/12.35  % Initial clauses in saturation        : 4909
% 74.91/12.35  % Processed clauses                    : 21727
% 74.91/12.35  % ...of these trivial                  : 280
% 74.91/12.35  % ...subsumed                          : 11308
% 74.91/12.35  % ...remaining for further processing  : 10139
% 74.91/12.35  % Other redundant clauses eliminated   : 648
% 74.91/12.35  % Clauses deleted for lack of memory   : 0
% 74.91/12.35  % Backward-subsumed                    : 39
% 74.91/12.35  % Backward-rewritten                   : 162
% 74.91/12.35  % Generated clauses                    : 74973
% 74.91/12.35  % ...of the previous two non-redundant : 62746
% 74.91/12.35  % ...aggressively subsumed             : 0
% 74.91/12.35  % Contextual simplify-reflections      : 364
% 74.91/12.35  % Paramodulations                      : 74332
% 74.91/12.35  % Factorizations                       : 3
% 74.91/12.35  % NegExts                              : 0
% 74.91/12.35  % Equation resolutions                 : 655
% 74.91/12.35  % Disequality decompositions           : 0
% 74.91/12.35  % Total rewrite steps                  : 24703
% 74.91/12.35  % ...of those cached                   : 21438
% 74.91/12.35  % Propositional unsat checks           : 2
% 74.91/12.35  %    Propositional check models        : 1
% 74.91/12.35  %    Propositional check unsatisfiable : 0
% 74.91/12.35  %    Propositional clauses             : 0
% 74.91/12.35  %    Propositional clauses after purity: 0
% 74.91/12.35  %    Propositional unsat core size     : 0
% 74.91/12.35  %    Propositional preprocessing time  : 0.000
% 74.91/12.35  %    Propositional encoding time       : 0.171
% 74.91/12.35  %    Propositional solver time         : 0.237
% 74.91/12.35  %    Success case prop preproc time    : 0.000
% 74.91/12.35  %    Success case prop encoding time   : 0.000
% 74.91/12.35  %    Success case prop solver time     : 0.000
% 74.91/12.35  % Current number of processed clauses  : 5250
% 74.91/12.35  %    Positive orientable unit clauses  : 1313
% 74.91/12.35  %    Positive unorientable unit clauses: 3
% 74.91/12.35  %    Negative unit clauses             : 1459
% 74.91/12.35  %    Non-unit-clauses                  : 2475
% 74.91/12.35  % Current number of unprocessed clauses: 50057
% 74.91/12.35  % ...number of literals in the above   : 149885
% 74.91/12.35  % Current number of archived formulas  : 0
% 74.91/12.35  % Current number of archived clauses   : 4598
% 74.91/12.35  % Clause-clause subsumption calls (NU) : 13635315
% 74.91/12.35  % Rec. Clause-clause subsumption calls : 1354617
% 74.91/12.35  % Non-unit clause-clause subsumptions  : 2229
% 74.91/12.35  % Unit Clause-clause subsumption calls : 460356
% 74.91/12.35  % Rewrite failures with RHS unbound    : 0
% 74.91/12.35  % BW rewrite match attempts            : 503
% 74.91/12.35  % BW rewrite match successes           : 246
% 74.91/12.35  % Condensation attempts                : 0
% 74.91/12.35  % Condensation successes               : 0
% 74.91/12.35  % Termbank termtop insertions          : 2072133
% 74.91/12.35  % Search garbage collected termcells   : 255235
% 74.91/12.35  
% 74.91/12.35  % -------------------------------------------------
% 74.91/12.35  % User time                : 10.300 s
% 74.91/12.35  % System time              : 0.256 s
% 74.91/12.35  % Total time               : 10.556 s
% 74.91/12.35  % Maximum resident set size: 46644 pages
% 74.91/12.35  
% 74.91/12.35  % -------------------------------------------------
% 74.91/12.35  % User time                : 30.975 s
% 74.91/12.35  % System time              : 0.654 s
% 74.91/12.35  % Total time               : 31.629 s
% 74.91/12.35  % Maximum resident set size: 32768 pages
% 74.91/12.35  % E exiting
%------------------------------------------------------------------------------