TSTP Solution File: ITP262^3 by E---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1.00
% Problem  : ITP262^3 : TPTP v8.2.0. Released v8.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n005.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Mon May 20 22:17:42 EDT 2024

% Result   : Theorem 43.62s 12.20s
% Output   : CNFRefutation 43.62s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :   36
% Syntax   : Number of formulae    :   53 (  17 unt;  28 typ;   0 def)
%            Number of atoms       :   40 (  13 equ;   0 cnn)
%            Maximal formula atoms :    6 (   1 avg)
%            Number of connectives :  310 (  15   ~;  10   |;   2   &; 280   @)
%                                         (   1 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   16 (   6 avg)
%            Number of types       :    6 (   5 usr)
%            Number of type conns  :   24 (  24   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   25 (  23 usr;   9 con; 0-3 aty)
%            Number of variables   :   16 (   0   ^  13   !;   3   ?;  16   :)

% Comments : 
%------------------------------------------------------------------------------
thf(decl_sort1,type,
    nat: $tType ).

thf(decl_sort2,type,
    num: $tType ).

thf(decl_sort3,type,
    list_VEBT_VEBT: $tType ).

thf(decl_sort4,type,
    option_nat: $tType ).

thf(decl_sort5,type,
    vEBT_VEBT: $tType ).

thf(decl_203,type,
    one_one_nat: nat ).

thf(decl_341,type,
    list_u1324408373059187874T_VEBT: list_VEBT_VEBT > nat > vEBT_VEBT > list_VEBT_VEBT ).

thf(decl_358,type,
    nth_VEBT_VEBT: list_VEBT_VEBT > nat > vEBT_VEBT ).

thf(decl_381,type,
    suc: nat > nat ).

thf(decl_410,type,
    size_s6755466524823107622T_VEBT: list_VEBT_VEBT > nat ).

thf(decl_445,type,
    bit0: num > num ).

thf(decl_447,type,
    one: num ).

thf(decl_455,type,
    numeral_numeral_nat: num > nat ).

thf(decl_464,type,
    some_nat: nat > option_nat ).

thf(decl_492,type,
    ord_less_nat: nat > nat > $o ).

thf(decl_552,type,
    power_power_nat: nat > nat > nat ).

thf(decl_767,type,
    vEBT_V8194947554948674370ptions: vEBT_VEBT > nat > $o ).

thf(decl_768,type,
    vEBT_VEBT_high: nat > nat > nat ).

thf(decl_770,type,
    vEBT_VEBT_low: nat > nat > nat ).

thf(decl_781,type,
    vEBT_vebt_delete: vEBT_VEBT > nat > vEBT_VEBT ).

thf(decl_802,type,
    vEBT_vebt_maxt: vEBT_VEBT > option_nat ).

thf(decl_836,type,
    m: nat ).

thf(decl_838,type,
    maxs: nat ).

thf(decl_840,type,
    na: nat ).

thf(decl_841,type,
    summary: vEBT_VEBT ).

thf(decl_842,type,
    treeList: list_VEBT_VEBT ).

thf(decl_843,type,
    xa: nat ).

thf(decl_1176,type,
    esk304_1: nat > nat ).

thf(conj_0,conjecture,
    ? [X27: nat] : ( vEBT_V8194947554948674370ptions @ ( nth_VEBT_VEBT @ ( list_u1324408373059187874T_VEBT @ treeList @ ( vEBT_VEBT_high @ xa @ na ) @ ( vEBT_vebt_delete @ ( nth_VEBT_VEBT @ treeList @ ( vEBT_VEBT_high @ xa @ na ) ) @ ( vEBT_VEBT_low @ xa @ na ) ) ) @ maxs ) @ X27 ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0) ).

thf(fact_26__C111_C,axiom,
    ! [X7: nat] :
      ( ( ord_less_nat @ X7 @ ( power_power_nat @ ( numeral_numeral_nat @ ( bit0 @ one ) ) @ m ) )
     => ( ? [X8: nat] : ( vEBT_V8194947554948674370ptions @ ( nth_VEBT_VEBT @ ( list_u1324408373059187874T_VEBT @ treeList @ ( vEBT_VEBT_high @ xa @ na ) @ ( vEBT_vebt_delete @ ( nth_VEBT_VEBT @ treeList @ ( vEBT_VEBT_high @ xa @ na ) ) @ ( vEBT_VEBT_low @ xa @ na ) ) ) @ X7 ) @ X8 )
      <=> ( vEBT_V8194947554948674370ptions @ ( vEBT_vebt_delete @ summary @ ( vEBT_VEBT_high @ xa @ na ) ) @ X7 ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_26__C111_C) ).

thf(fact_36__C2_C,axiom,
    ( ( size_s6755466524823107622T_VEBT @ treeList )
    = ( power_power_nat @ ( numeral_numeral_nat @ ( bit0 @ one ) ) @ m ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_36__C2_C) ).

thf(fact_2830_Suc__1,axiom,
    ( ( suc @ one_one_nat )
    = ( numeral_numeral_nat @ ( bit0 @ one ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_2830_Suc__1) ).

thf(fact_2__C8_C,axiom,
    na = m,
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_2__C8_C) ).

thf(fact_10_bb,axiom,
    ( ( maxs
     != ( vEBT_VEBT_high @ xa @ na ) )
    & ( ord_less_nat @ maxs @ ( power_power_nat @ ( numeral_numeral_nat @ ( bit0 @ one ) ) @ m ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_10_bb) ).

thf(fact_854_maxbmo,axiom,
    ! [X3: vEBT_VEBT,X1: nat] :
      ( ( ( vEBT_vebt_maxt @ X3 )
        = ( some_nat @ X1 ) )
     => ( vEBT_V8194947554948674370ptions @ X3 @ X1 ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_854_maxbmo) ).

thf(fact_837__092_060open_062Some_Amaxs_A_061_Avebt__maxt_A_Ivebt__delete_Asummary_A_Ihigh_Ax_An_J_J_092_060close_062,axiom,
    ( ( some_nat @ maxs )
    = ( vEBT_vebt_maxt @ ( vEBT_vebt_delete @ summary @ ( vEBT_VEBT_high @ xa @ na ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_837__092_060open_062Some_Amaxs_A_061_Avebt__maxt_A_Ivebt__delete_Asummary_A_Ihigh_Ax_An_J_J_092_060close_062) ).

thf(c_0_8,negated_conjecture,
    ~ ? [X27: nat] : ( vEBT_V8194947554948674370ptions @ ( nth_VEBT_VEBT @ ( list_u1324408373059187874T_VEBT @ treeList @ ( vEBT_VEBT_high @ xa @ na ) @ ( vEBT_vebt_delete @ ( nth_VEBT_VEBT @ treeList @ ( vEBT_VEBT_high @ xa @ na ) ) @ ( vEBT_VEBT_low @ xa @ na ) ) ) @ maxs ) @ X27 ),
    inference(assume_negation,[status(cth)],[conj_0]) ).

thf(c_0_9,plain,
    ! [X29035: nat,X29036: nat] :
      ( ( ~ ( vEBT_V8194947554948674370ptions @ ( nth_VEBT_VEBT @ ( list_u1324408373059187874T_VEBT @ treeList @ ( vEBT_VEBT_high @ xa @ na ) @ ( vEBT_vebt_delete @ ( nth_VEBT_VEBT @ treeList @ ( vEBT_VEBT_high @ xa @ na ) ) @ ( vEBT_VEBT_low @ xa @ na ) ) ) @ X29035 ) @ X29036 )
        | ( vEBT_V8194947554948674370ptions @ ( vEBT_vebt_delete @ summary @ ( vEBT_VEBT_high @ xa @ na ) ) @ X29035 )
        | ~ ( ord_less_nat @ X29035 @ ( power_power_nat @ ( numeral_numeral_nat @ ( bit0 @ one ) ) @ m ) ) )
      & ( ~ ( vEBT_V8194947554948674370ptions @ ( vEBT_vebt_delete @ summary @ ( vEBT_VEBT_high @ xa @ na ) ) @ X29035 )
        | ( vEBT_V8194947554948674370ptions @ ( nth_VEBT_VEBT @ ( list_u1324408373059187874T_VEBT @ treeList @ ( vEBT_VEBT_high @ xa @ na ) @ ( vEBT_vebt_delete @ ( nth_VEBT_VEBT @ treeList @ ( vEBT_VEBT_high @ xa @ na ) ) @ ( vEBT_VEBT_low @ xa @ na ) ) ) @ X29035 ) @ ( esk304_1 @ X29035 ) )
        | ~ ( ord_less_nat @ X29035 @ ( power_power_nat @ ( numeral_numeral_nat @ ( bit0 @ one ) ) @ m ) ) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_26__C111_C])])])])]) ).

thf(c_0_10,plain,
    ( ( size_s6755466524823107622T_VEBT @ treeList )
    = ( power_power_nat @ ( numeral_numeral_nat @ ( bit0 @ one ) ) @ m ) ),
    inference(split_conjunct,[status(thm)],[fact_36__C2_C]) ).

thf(c_0_11,plain,
    ( ( suc @ one_one_nat )
    = ( numeral_numeral_nat @ ( bit0 @ one ) ) ),
    inference(split_conjunct,[status(thm)],[fact_2830_Suc__1]) ).

thf(c_0_12,plain,
    na = m,
    inference(split_conjunct,[status(thm)],[fact_2__C8_C]) ).

thf(c_0_13,negated_conjecture,
    ! [X26703: nat] :
      ~ ( vEBT_V8194947554948674370ptions @ ( nth_VEBT_VEBT @ ( list_u1324408373059187874T_VEBT @ treeList @ ( vEBT_VEBT_high @ xa @ na ) @ ( vEBT_vebt_delete @ ( nth_VEBT_VEBT @ treeList @ ( vEBT_VEBT_high @ xa @ na ) ) @ ( vEBT_VEBT_low @ xa @ na ) ) ) @ maxs ) @ X26703 ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])]) ).

thf(c_0_14,plain,
    ! [X1: nat] :
      ( ( vEBT_V8194947554948674370ptions @ ( nth_VEBT_VEBT @ ( list_u1324408373059187874T_VEBT @ treeList @ ( vEBT_VEBT_high @ xa @ na ) @ ( vEBT_vebt_delete @ ( nth_VEBT_VEBT @ treeList @ ( vEBT_VEBT_high @ xa @ na ) ) @ ( vEBT_VEBT_low @ xa @ na ) ) ) @ X1 ) @ ( esk304_1 @ X1 ) )
      | ~ ( vEBT_V8194947554948674370ptions @ ( vEBT_vebt_delete @ summary @ ( vEBT_VEBT_high @ xa @ na ) ) @ X1 )
      | ~ ( ord_less_nat @ X1 @ ( power_power_nat @ ( numeral_numeral_nat @ ( bit0 @ one ) ) @ m ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

thf(c_0_15,plain,
    ( ( power_power_nat @ ( suc @ one_one_nat ) @ na )
    = ( size_s6755466524823107622T_VEBT @ treeList ) ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_11]),c_0_12]) ).

thf(c_0_16,plain,
    ord_less_nat @ maxs @ ( power_power_nat @ ( numeral_numeral_nat @ ( bit0 @ one ) ) @ m ),
    inference(split_conjunct,[status(thm)],[fact_10_bb]) ).

thf(c_0_17,negated_conjecture,
    ! [X1: nat] :
      ~ ( vEBT_V8194947554948674370ptions @ ( nth_VEBT_VEBT @ ( list_u1324408373059187874T_VEBT @ treeList @ ( vEBT_VEBT_high @ xa @ na ) @ ( vEBT_vebt_delete @ ( nth_VEBT_VEBT @ treeList @ ( vEBT_VEBT_high @ xa @ na ) ) @ ( vEBT_VEBT_low @ xa @ na ) ) ) @ maxs ) @ X1 ),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

thf(c_0_18,plain,
    ! [X1: nat] :
      ( ( vEBT_V8194947554948674370ptions @ ( nth_VEBT_VEBT @ ( list_u1324408373059187874T_VEBT @ treeList @ ( vEBT_VEBT_high @ xa @ na ) @ ( vEBT_vebt_delete @ ( nth_VEBT_VEBT @ treeList @ ( vEBT_VEBT_high @ xa @ na ) ) @ ( vEBT_VEBT_low @ xa @ na ) ) ) @ X1 ) @ ( esk304_1 @ X1 ) )
      | ~ ( vEBT_V8194947554948674370ptions @ ( vEBT_vebt_delete @ summary @ ( vEBT_VEBT_high @ xa @ na ) ) @ X1 )
      | ~ ( ord_less_nat @ X1 @ ( size_s6755466524823107622T_VEBT @ treeList ) ) ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_11]),c_0_12]),c_0_15]) ).

thf(c_0_19,plain,
    ord_less_nat @ maxs @ ( size_s6755466524823107622T_VEBT @ treeList ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_11]),c_0_12]),c_0_15]) ).

thf(c_0_20,plain,
    ! [X26728: vEBT_VEBT,X26729: nat] :
      ( ( ( vEBT_vebt_maxt @ X26728 )
       != ( some_nat @ X26729 ) )
      | ( vEBT_V8194947554948674370ptions @ X26728 @ X26729 ) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_854_maxbmo])]) ).

thf(c_0_21,negated_conjecture,
    ~ ( vEBT_V8194947554948674370ptions @ ( vEBT_vebt_delete @ summary @ ( vEBT_VEBT_high @ xa @ na ) ) @ maxs ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19])]) ).

thf(c_0_22,plain,
    ! [X3: vEBT_VEBT,X1: nat] :
      ( ( vEBT_V8194947554948674370ptions @ X3 @ X1 )
      | ( ( vEBT_vebt_maxt @ X3 )
       != ( some_nat @ X1 ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_20]) ).

thf(c_0_23,plain,
    ( ( some_nat @ maxs )
    = ( vEBT_vebt_maxt @ ( vEBT_vebt_delete @ summary @ ( vEBT_VEBT_high @ xa @ na ) ) ) ),
    inference(split_conjunct,[status(thm)],[fact_837__092_060open_062Some_Amaxs_A_061_Avebt__maxt_A_Ivebt__delete_Asummary_A_Ihigh_Ax_An_J_J_092_060close_062]) ).

thf(c_0_24,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.10  % Problem    : ITP262^3 : TPTP v8.2.0. Released v8.1.0.
% 0.02/0.11  % Command    : run_E %s %d THM
% 0.11/0.31  % Computer : n005.cluster.edu
% 0.11/0.31  % Model    : x86_64 x86_64
% 0.11/0.31  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.31  % Memory   : 8042.1875MB
% 0.11/0.31  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.31  % CPULimit   : 300
% 0.11/0.31  % WCLimit    : 300
% 0.11/0.31  % DateTime   : Sat May 18 17:00:23 EDT 2024
% 0.11/0.32  % CPUTime    : 
% 0.16/0.43  Running higher-order theorem proving
% 0.16/0.43  Running: /export/starexec/sandbox2/solver/bin/eprover-ho --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
% 43.62/12.20  # Version: 3.1.0-ho
% 43.62/12.20  # partial match(1): HMLMSMSMSSLCHFA
% 43.62/12.20  # Preprocessing class: HMLMSMLMSSLCHFA.
% 43.62/12.20  # Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 43.62/12.20  # Starting new_ho_10 with 1495s (5) cores
% 43.62/12.20  # Starting sh5l with 299s (1) cores
% 43.62/12.20  # Starting new_bool_1 with 299s (1) cores
% 43.62/12.20  # Starting new_bool_2 with 299s (1) cores
% 43.62/12.20  # new_bool_2 with pid 14860 completed with status 0
% 43.62/12.20  # Result found by new_bool_2
% 43.62/12.20  # partial match(1): HMLMSMSMSSLCHFA
% 43.62/12.20  # Preprocessing class: HMLMSMLMSSLCHFA.
% 43.62/12.20  # Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 43.62/12.20  # Starting new_ho_10 with 1495s (5) cores
% 43.62/12.20  # Starting sh5l with 299s (1) cores
% 43.62/12.20  # Starting new_bool_1 with 299s (1) cores
% 43.62/12.20  # Starting new_bool_2 with 299s (1) cores
% 43.62/12.20  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 43.62/12.20  # Search class: HGHSM-SMLM32-DHFFFSBN
% 43.62/12.20  # Scheduled 5 strats onto 1 cores with 298 seconds (298 total)
% 43.62/12.20  # Starting new_ho_10 with 179s (1) cores
% 43.62/12.20  # new_ho_10 with pid 14863 completed with status 0
% 43.62/12.20  # Result found by new_ho_10
% 43.62/12.20  # partial match(1): HMLMSMSMSSLCHFA
% 43.62/12.20  # Preprocessing class: HMLMSMLMSSLCHFA.
% 43.62/12.20  # Scheduled 4 strats onto 8 cores with 299 seconds (2392 total)
% 43.62/12.20  # Starting new_ho_10 with 1495s (5) cores
% 43.62/12.20  # Starting sh5l with 299s (1) cores
% 43.62/12.20  # Starting new_bool_1 with 299s (1) cores
% 43.62/12.20  # Starting new_bool_2 with 299s (1) cores
% 43.62/12.20  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 43.62/12.20  # Search class: HGHSM-SMLM32-DHFFFSBN
% 43.62/12.20  # Scheduled 5 strats onto 1 cores with 298 seconds (298 total)
% 43.62/12.20  # Starting new_ho_10 with 179s (1) cores
% 43.62/12.20  # Preprocessing time       : 0.195 s
% 43.62/12.20  # Presaturation interreduction done
% 43.62/12.20  
% 43.62/12.20  # Proof found!
% 43.62/12.20  # SZS status Theorem
% 43.62/12.20  # SZS output start CNFRefutation
% See solution above
% 43.62/12.20  # Parsed axioms                        : 11165
% 43.62/12.20  # Removed by relevancy pruning/SinE    : 7640
% 43.62/12.20  # Initial clauses                      : 9056
% 43.62/12.20  # Removed in clause preprocessing      : 1960
% 43.62/12.20  # Initial clauses in saturation        : 7096
% 43.62/12.20  # Processed clauses                    : 10346
% 43.62/12.20  # ...of these trivial                  : 372
% 43.62/12.20  # ...subsumed                          : 2279
% 43.62/12.20  # ...remaining for further processing  : 7695
% 43.62/12.20  # Other redundant clauses eliminated   : 1694
% 43.62/12.20  # Clauses deleted for lack of memory   : 0
% 43.62/12.20  # Backward-subsumed                    : 39
% 43.62/12.20  # Backward-rewritten                   : 102
% 43.62/12.20  # Generated clauses                    : 17243
% 43.62/12.20  # ...of the previous two non-redundant : 13341
% 43.62/12.20  # ...aggressively subsumed             : 0
% 43.62/12.20  # Contextual simplify-reflections      : 100
% 43.62/12.20  # Paramodulations                      : 15665
% 43.62/12.20  # Factorizations                       : 7
% 43.62/12.20  # NegExts                              : 0
% 43.62/12.20  # Equation resolutions                 : 1728
% 43.62/12.20  # Disequality decompositions           : 0
% 43.62/12.20  # Total rewrite steps                  : 10508
% 43.62/12.20  # ...of those cached                   : 9073
% 43.62/12.20  # Propositional unsat checks           : 0
% 43.62/12.20  #    Propositional check models        : 0
% 43.62/12.20  #    Propositional check unsatisfiable : 0
% 43.62/12.20  #    Propositional clauses             : 0
% 43.62/12.20  #    Propositional clauses after purity: 0
% 43.62/12.20  #    Propositional unsat core size     : 0
% 43.62/12.20  #    Propositional preprocessing time  : 0.000
% 43.62/12.20  #    Propositional encoding time       : 0.000
% 43.62/12.20  #    Propositional solver time         : 0.000
% 43.62/12.20  #    Success case prop preproc time    : 0.000
% 43.62/12.20  #    Success case prop encoding time   : 0.000
% 43.62/12.20  #    Success case prop solver time     : 0.000
% 43.62/12.20  # Current number of processed clauses  : 1693
% 43.62/12.20  #    Positive orientable unit clauses  : 614
% 43.62/12.20  #    Positive unorientable unit clauses: 11
% 43.62/12.20  #    Negative unit clauses             : 178
% 43.62/12.20  #    Non-unit-clauses                  : 890
% 43.62/12.20  # Current number of unprocessed clauses: 14954
% 43.62/12.20  # ...number of literals in the above   : 41423
% 43.62/12.20  # Current number of archived formulas  : 0
% 43.62/12.20  # Current number of archived clauses   : 5038
% 43.62/12.20  # Clause-clause subsumption calls (NU) : 10709686
% 43.62/12.20  # Rec. Clause-clause subsumption calls : 903096
% 43.62/12.20  # Non-unit clause-clause subsumptions  : 1633
% 43.62/12.20  # Unit Clause-clause subsumption calls : 41631
% 43.62/12.20  # Rewrite failures with RHS unbound    : 0
% 43.62/12.20  # BW rewrite match attempts            : 1258
% 43.62/12.20  # BW rewrite match successes           : 348
% 43.62/12.20  # Condensation attempts                : 10346
% 43.62/12.20  # Condensation successes               : 39
% 43.62/12.20  # Termbank termtop insertions          : 2648526
% 43.62/12.20  # Search garbage collected termcells   : 184706
% 43.62/12.20  
% 43.62/12.20  # -------------------------------------------------
% 43.62/12.20  # User time                : 10.398 s
% 43.62/12.20  # System time              : 0.139 s
% 43.62/12.20  # Total time               : 10.537 s
% 43.62/12.20  # Maximum resident set size: 46380 pages
% 43.62/12.20  
% 43.62/12.20  # -------------------------------------------------
% 43.62/12.20  # User time                : 11.521 s
% 43.62/12.20  # System time              : 0.171 s
% 43.62/12.20  # Total time               : 11.691 s
% 43.62/12.20  # Maximum resident set size: 25896 pages
% 43.62/12.20  % E---3.1 exiting
% 43.62/12.20  % E exiting
%------------------------------------------------------------------------------