↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : CSR141^2 : TPTP v9.3.1. Released v4.1.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM

% Computer : n020.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 : Wed Sep 30 07:46:39 AM UTC 2026

% Result   : Theorem 0.24s 0.31s
% Output   : CNFRefutation 0.24s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   27 (   9 unt;   0 typ;   0 def)
%            Number of atoms       :   85 (   0 equ;   0 cnn)
%            Maximal formula atoms :   12 (   3 avg)
%            Number of connectives :  243 (  37   ~;  25   |;  10   &; 167   @)
%                                         (   0 <=>;   4  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   13 (   6 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   13 (  11 usr;   7 con; 0-3 aty)
%            Number of variables   :   21 (   0   ^;  21   !;   0   ?;  21   :)

% Comments : 
%------------------------------------------------------------------------------
thf(decl_23,type,
    agent_THFTYPE_IiioI: $i > $i > $o ).

thf(decl_26,type,
    connected_THFTYPE_IiioI: $i > $i > $o ).

thf(decl_43,type,
    holdsDuring_THFTYPE_IiooI: $i > $o > $o ).

thf(decl_52,type,
    instance_THFTYPE_IiioI: $i > $i > $o ).

thf(decl_60,type,
    lCADE_BM_THFTYPE_i: $i ).

thf(decl_70,type,
    lMariaPaola_THFTYPE_i: $i ).

thf(decl_72,type,
    lMeeting_THFTYPE_i: $i ).

thf(decl_74,type,
    lNear_THFTYPE_i: $i ).

thf(decl_80,type,
    lReiner_THFTYPE_i: $i ).

thf(decl_89,type,
    lWhenFn_THFTYPE_IiiI: $i > $i ).

thf(decl_97,type,
    orientation_THFTYPE_IiiioI: $i > $i > $i > $o ).

thf(con,conjecture,
    ( holdsDuring_THFTYPE_IiooI @ ( lWhenFn_THFTYPE_IiiI @ lCADE_BM_THFTYPE_i )
    @ ~ ( connected_THFTYPE_IiioI @ lMariaPaola_THFTYPE_i @ lReiner_THFTYPE_i ) ),
    file('/export/starexec/sandbox2/tmp/tmp.SEeqb2zgc4/E---3.1_1391291.p',con) ).

thf(ax_058,axiom,
    ! [X12: $i,X13: $i] :
      ( ( orientation_THFTYPE_IiiioI @ X12 @ X13 @ lNear_THFTYPE_i )
     => ~ ( connected_THFTYPE_IiioI @ X12 @ X13 ) ),
    file('/export/starexec/sandbox2/tmp/tmp.SEeqb2zgc4/E---3.1_1391291.p',ax_058) ).

thf(ax_001,axiom,
    ! [X1: $i,X2: $i,X3: $i] :
      ( ( ( instance_THFTYPE_IiioI @ X1 @ lMeeting_THFTYPE_i )
        & ( agent_THFTYPE_IiioI @ X1 @ X3 )
        & ( agent_THFTYPE_IiioI @ X1 @ X2 ) )
     => ( holdsDuring_THFTYPE_IiooI @ ( lWhenFn_THFTYPE_IiiI @ X1 ) @ ( orientation_THFTYPE_IiiioI @ X3 @ X2 @ lNear_THFTYPE_i ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.SEeqb2zgc4/E---3.1_1391291.p',ax_001) ).

thf(ax_160,axiom,
    holdsDuring_THFTYPE_IiooI @ ( lWhenFn_THFTYPE_IiiI @ lCADE_BM_THFTYPE_i ) @ $true,
    file('/export/starexec/sandbox2/tmp/tmp.SEeqb2zgc4/E---3.1_1391291.p',ax_160) ).

thf(ax_022,axiom,
    agent_THFTYPE_IiioI @ lCADE_BM_THFTYPE_i @ lReiner_THFTYPE_i,
    file('/export/starexec/sandbox2/tmp/tmp.SEeqb2zgc4/E---3.1_1391291.p',ax_022) ).

thf(ax_067,axiom,
    instance_THFTYPE_IiioI @ lCADE_BM_THFTYPE_i @ lMeeting_THFTYPE_i,
    file('/export/starexec/sandbox2/tmp/tmp.SEeqb2zgc4/E---3.1_1391291.p',ax_067) ).

thf(ax_025,axiom,
    agent_THFTYPE_IiioI @ lCADE_BM_THFTYPE_i @ lMariaPaola_THFTYPE_i,
    file('/export/starexec/sandbox2/tmp/tmp.SEeqb2zgc4/E---3.1_1391291.p',ax_025) ).

thf(c_0_7,negated_conjecture,
    ~ ( holdsDuring_THFTYPE_IiooI @ ( lWhenFn_THFTYPE_IiiI @ lCADE_BM_THFTYPE_i )
      @ ~ ( connected_THFTYPE_IiioI @ lMariaPaola_THFTYPE_i @ lReiner_THFTYPE_i ) ),
    inference(assume_negation,[status(cth)],[con]) ).

thf(c_0_8,negated_conjecture,
    ~ ( ( ( connected_THFTYPE_IiioI @ lMariaPaola_THFTYPE_i @ lReiner_THFTYPE_i )
        | ( holdsDuring_THFTYPE_IiooI @ ( lWhenFn_THFTYPE_IiiI @ lCADE_BM_THFTYPE_i ) @ $true ) )
      & ( ~ ( connected_THFTYPE_IiioI @ lMariaPaola_THFTYPE_i @ lReiner_THFTYPE_i )
        | ( holdsDuring_THFTYPE_IiooI @ ( lWhenFn_THFTYPE_IiiI @ lCADE_BM_THFTYPE_i ) @ $false ) ) ),
    inference(fof_simplification,[status(thm)],[inference(fool_unroll,[status(thm)],[c_0_7])]) ).

thf(c_0_9,negated_conjecture,
    ( ( ( connected_THFTYPE_IiioI @ lMariaPaola_THFTYPE_i @ lReiner_THFTYPE_i )
      | ~ ( connected_THFTYPE_IiioI @ lMariaPaola_THFTYPE_i @ lReiner_THFTYPE_i ) )
    & ( ~ ( holdsDuring_THFTYPE_IiooI @ ( lWhenFn_THFTYPE_IiiI @ lCADE_BM_THFTYPE_i ) @ $false )
      | ~ ( connected_THFTYPE_IiioI @ lMariaPaola_THFTYPE_i @ lReiner_THFTYPE_i ) )
    & ( ( connected_THFTYPE_IiioI @ lMariaPaola_THFTYPE_i @ lReiner_THFTYPE_i )
      | ~ ( holdsDuring_THFTYPE_IiooI @ ( lWhenFn_THFTYPE_IiiI @ lCADE_BM_THFTYPE_i ) @ $true ) )
    & ( ~ ( holdsDuring_THFTYPE_IiooI @ ( lWhenFn_THFTYPE_IiiI @ lCADE_BM_THFTYPE_i ) @ $false )
      | ~ ( holdsDuring_THFTYPE_IiooI @ ( lWhenFn_THFTYPE_IiiI @ lCADE_BM_THFTYPE_i ) @ $true ) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])]) ).

thf(c_0_10,plain,
    ! [X12: $i,X13: $i] :
      ( ( orientation_THFTYPE_IiiioI @ X12 @ X13 @ lNear_THFTYPE_i )
     => ~ ( connected_THFTYPE_IiioI @ X12 @ X13 ) ),
    inference(fof_simplification,[status(thm)],[ax_058]) ).

thf(c_0_11,axiom,
    ! [X1: $i,X2: $i,X3: $i] :
      ( ( ( instance_THFTYPE_IiioI @ X1 @ lMeeting_THFTYPE_i )
        & ( agent_THFTYPE_IiioI @ X1 @ X3 )
        & ( agent_THFTYPE_IiioI @ X1 @ X2 ) )
     => ( ( ~ ( orientation_THFTYPE_IiiioI @ X3 @ X2 @ lNear_THFTYPE_i )
          | ( holdsDuring_THFTYPE_IiooI @ ( lWhenFn_THFTYPE_IiiI @ X1 ) @ $true ) )
        & ( ( orientation_THFTYPE_IiiioI @ X3 @ X2 @ lNear_THFTYPE_i )
          | ( holdsDuring_THFTYPE_IiooI @ ( lWhenFn_THFTYPE_IiiI @ X1 ) @ $false ) ) ) ),
    inference(fool_unroll,[status(thm)],[ax_001]) ).

thf(c_0_12,negated_conjecture,
    ( ( connected_THFTYPE_IiioI @ lMariaPaola_THFTYPE_i @ lReiner_THFTYPE_i )
    | ~ ( holdsDuring_THFTYPE_IiooI @ ( lWhenFn_THFTYPE_IiiI @ lCADE_BM_THFTYPE_i ) @ $true ) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

thf(c_0_13,plain,
    holdsDuring_THFTYPE_IiooI @ ( lWhenFn_THFTYPE_IiiI @ lCADE_BM_THFTYPE_i ) @ $true,
    inference(split_conjunct,[status(thm)],[ax_160]) ).

thf(c_0_14,plain,
    ! [X134: $i,X135: $i] :
      ( ~ ( orientation_THFTYPE_IiiioI @ X134 @ X135 @ lNear_THFTYPE_i )
      | ~ ( connected_THFTYPE_IiioI @ X134 @ X135 ) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_10])])]) ).

thf(c_0_15,plain,
    ! [X126: $i,X127: $i,X128: $i] :
      ( ( ~ ( orientation_THFTYPE_IiiioI @ X128 @ X127 @ lNear_THFTYPE_i )
        | ( holdsDuring_THFTYPE_IiooI @ ( lWhenFn_THFTYPE_IiiI @ X126 ) @ $true )
        | ~ ( instance_THFTYPE_IiioI @ X126 @ lMeeting_THFTYPE_i )
        | ~ ( agent_THFTYPE_IiioI @ X126 @ X128 )
        | ~ ( agent_THFTYPE_IiioI @ X126 @ X127 ) )
      & ( ( orientation_THFTYPE_IiiioI @ X128 @ X127 @ lNear_THFTYPE_i )
        | ( holdsDuring_THFTYPE_IiooI @ ( lWhenFn_THFTYPE_IiiI @ X126 ) @ $false )
        | ~ ( instance_THFTYPE_IiioI @ X126 @ lMeeting_THFTYPE_i )
        | ~ ( agent_THFTYPE_IiioI @ X126 @ X128 )
        | ~ ( agent_THFTYPE_IiioI @ X126 @ X127 ) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_11])])])]) ).

thf(c_0_16,negated_conjecture,
    ( ~ ( holdsDuring_THFTYPE_IiooI @ ( lWhenFn_THFTYPE_IiiI @ lCADE_BM_THFTYPE_i ) @ ~ $true )
    | ~ ( connected_THFTYPE_IiioI @ lMariaPaola_THFTYPE_i @ lReiner_THFTYPE_i ) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

thf(c_0_17,negated_conjecture,
    connected_THFTYPE_IiioI @ lMariaPaola_THFTYPE_i @ lReiner_THFTYPE_i,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_13])]) ).

thf(c_0_18,plain,
    ! [X1: $i,X2: $i] :
      ( ~ ( orientation_THFTYPE_IiiioI @ X1 @ X2 @ lNear_THFTYPE_i )
      | ~ ( connected_THFTYPE_IiioI @ X1 @ X2 ) ),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

thf(c_0_19,plain,
    ! [X1: $i,X3: $i,X2: $i] :
      ( ( orientation_THFTYPE_IiiioI @ X1 @ X2 @ lNear_THFTYPE_i )
      | ( holdsDuring_THFTYPE_IiooI @ ( lWhenFn_THFTYPE_IiiI @ X3 ) @ ~ $true )
      | ~ ( instance_THFTYPE_IiioI @ X3 @ lMeeting_THFTYPE_i )
      | ~ ( agent_THFTYPE_IiioI @ X3 @ X1 )
      | ~ ( agent_THFTYPE_IiioI @ X3 @ X2 ) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

thf(c_0_20,plain,
    agent_THFTYPE_IiioI @ lCADE_BM_THFTYPE_i @ lReiner_THFTYPE_i,
    inference(split_conjunct,[status(thm)],[ax_022]) ).

thf(c_0_21,plain,
    instance_THFTYPE_IiioI @ lCADE_BM_THFTYPE_i @ lMeeting_THFTYPE_i,
    inference(split_conjunct,[status(thm)],[ax_067]) ).

thf(c_0_22,negated_conjecture,
    ~ ( holdsDuring_THFTYPE_IiooI @ ( lWhenFn_THFTYPE_IiiI @ lCADE_BM_THFTYPE_i ) @ ~ $true ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_16,c_0_17])]) ).

thf(c_0_23,negated_conjecture,
    ~ ( orientation_THFTYPE_IiiioI @ lMariaPaola_THFTYPE_i @ lReiner_THFTYPE_i @ lNear_THFTYPE_i ),
    inference(spm,[status(thm)],[c_0_18,c_0_17]) ).

thf(c_0_24,plain,
    ! [X1: $i] :
      ( ( orientation_THFTYPE_IiiioI @ X1 @ lReiner_THFTYPE_i @ lNear_THFTYPE_i )
      | ~ ( agent_THFTYPE_IiioI @ lCADE_BM_THFTYPE_i @ X1 ) ),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21])]),c_0_22]) ).

thf(c_0_25,plain,
    agent_THFTYPE_IiioI @ lCADE_BM_THFTYPE_i @ lMariaPaola_THFTYPE_i,
    inference(split_conjunct,[status(thm)],[ax_025]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : CSR141^2 : TPTP v9.3.1. Released v4.1.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.19  % Computer : n020.cluster.edu
% 0.10/0.19  % Model    : x86_64 x86_64
% 0.10/0.19  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.19  % Memory   : 8046.5625MB
% 0.10/0.19  % OS       : Linux 6.8.0-71-generic
% 0.10/0.19  % CPULimit : 300
% 0.10/0.19  % WCLimit  : 300
% 0.10/0.19  % DateTime : Tue Sep 29 17:57:19 UTC 2026
% 0.10/0.19  % CPUTime  : 
% 0.10/0.19  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.10/0.24  Running higher-order theorem proving
% 0.10/0.27  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/tmp/tmp.SEeqb2zgc4/E---3.1_1391291.p
% 0.24/0.31  % Version: 3.5.1-ho
% 0.24/0.31  % Preprocessing class: HSLSSMSMSSSNHFA.
% 0.24/0.31  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.31  % Starting new_ho_10 with 1500s (5) cores
% 0.24/0.31  % Starting new_ho_10_cnf2 with 300s (1) cores
% 0.24/0.31  % Starting full_lambda_6 with 300s (1) cores
% 0.24/0.31  % Starting full_lambda_9 with 300s (1) cores
% 0.24/0.31  % full_lambda_9 with pid 1391307 completed with status 0
% 0.24/0.31  % Result found by full_lambda_9
% 0.24/0.31  % Preprocessing class: HSLSSMSMSSSNHFA.
% 0.24/0.31  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.31  % Starting new_ho_10 with 1500s (5) cores
% 0.24/0.31  % Starting new_ho_10_cnf2 with 300s (1) cores
% 0.24/0.31  % Starting full_lambda_6 with 300s (1) cores
% 0.24/0.31  % Starting full_lambda_9 with 300s (1) cores
% 0.24/0.31  % (lift_lambdas = 1, lambda_to_forall = 0,unroll_only_formulas = 1, sine = GSinE(CountFormulas,hypos,4,,3,20000,3.0,true))
% 0.24/0.31  % SinE strategy is GSinE(CountFormulas,hypos,4,,3,20000,3.0,true)
% 0.24/0.31  % Search class: HGHSF-FFMM11-SHFFFFBN
% 0.24/0.31  % partial match(1): HGHSF-FFMM21-SHFFFFBN
% 0.24/0.31  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.24/0.31  % Starting SubtermCWHack with 28s (1) cores
% 0.24/0.31  % SubtermCWHack with pid 1391308 completed with status 0
% 0.24/0.31  % Result found by SubtermCWHack
% 0.24/0.31  % Preprocessing class: HSLSSMSMSSSNHFA.
% 0.24/0.31  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.24/0.31  % Starting new_ho_10 with 1500s (5) cores
% 0.24/0.31  % Starting new_ho_10_cnf2 with 300s (1) cores
% 0.24/0.31  % Starting full_lambda_6 with 300s (1) cores
% 0.24/0.31  % Starting full_lambda_9 with 300s (1) cores
% 0.24/0.31  % (lift_lambdas = 1, lambda_to_forall = 0,unroll_only_formulas = 1, sine = GSinE(CountFormulas,hypos,4,,3,20000,3.0,true))
% 0.24/0.31  % SinE strategy is GSinE(CountFormulas,hypos,4,,3,20000,3.0,true)
% 0.24/0.31  % Search class: HGHSF-FFMM11-SHFFFFBN
% 0.24/0.31  % partial match(1): HGHSF-FFMM21-SHFFFFBN
% 0.24/0.31  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.24/0.31  % Starting SubtermCWHack with 28s (1) cores
% 0.24/0.31  % Preprocessing time       : 0.003 s
% 0.24/0.31  
% 0.24/0.31  % Proof found!
% 0.24/0.31  % SZS status Theorem
% 0.24/0.31  % SZS output start CNFRefutation
% See solution above
% 0.24/0.31  % Parsed axioms                        : 252
% 0.24/0.31  % Removed by relevancy pruning/SinE    : 108
% 0.24/0.31  % Initial clauses                      : 166
% 0.24/0.31  % Removed in clause preprocessing      : 6
% 0.24/0.31  % Initial clauses in saturation        : 160
% 0.24/0.31  % Processed clauses                    : 250
% 0.24/0.31  % ...of these trivial                  : 3
% 0.24/0.31  % ...subsumed                          : 6
% 0.24/0.31  % ...remaining for further processing  : 241
% 0.24/0.31  % Other redundant clauses eliminated   : 0
% 0.24/0.31  % Clauses deleted for lack of memory   : 0
% 0.24/0.31  % Backward-subsumed                    : 0
% 0.24/0.31  % Backward-rewritten                   : 1
% 0.24/0.31  % Generated clauses                    : 131
% 0.24/0.31  % ...of the previous two non-redundant : 117
% 0.24/0.31  % ...aggressively subsumed             : 0
% 0.24/0.31  % Contextual simplify-reflections      : 0
% 0.24/0.31  % Paramodulations                      : 130
% 0.24/0.31  % Factorizations                       : 0
% 0.24/0.31  % NegExts                              : 0
% 0.24/0.31  % Equation resolutions                 : 1
% 0.24/0.31  % Disequality decompositions           : 0
% 0.24/0.31  % Total rewrite steps                  : 19
% 0.24/0.31  % ...of those cached                   : 4
% 0.24/0.31  % Propositional unsat checks           : 0
% 0.24/0.31  %    Propositional check models        : 0
% 0.24/0.31  %    Propositional check unsatisfiable : 0
% 0.24/0.31  %    Propositional clauses             : 0
% 0.24/0.31  %    Propositional clauses after purity: 0
% 0.24/0.31  %    Propositional unsat core size     : 0
% 0.24/0.31  %    Propositional preprocessing time  : 0.000
% 0.24/0.31  %    Propositional encoding time       : 0.000
% 0.24/0.31  %    Propositional solver time         : 0.000
% 0.24/0.31  %    Success case prop preproc time    : 0.000
% 0.24/0.31  %    Success case prop encoding time   : 0.000
% 0.24/0.31  %    Success case prop solver time     : 0.000
% 0.24/0.31  % Current number of processed clauses  : 240
% 0.24/0.31  %    Positive orientable unit clauses  : 127
% 0.24/0.31  %    Positive unorientable unit clauses: 0
% 0.24/0.31  %    Negative unit clauses             : 2
% 0.24/0.31  %    Non-unit-clauses                  : 111
% 0.24/0.31  % Current number of unprocessed clauses: 27
% 0.24/0.31  % ...number of literals in the above   : 106
% 0.24/0.31  % Current number of archived formulas  : 0
% 0.24/0.31  % Current number of archived clauses   : 1
% 0.24/0.31  % Clause-clause subsumption calls (NU) : 1465
% 0.24/0.31  % Rec. Clause-clause subsumption calls : 1122
% 0.24/0.31  % Non-unit clause-clause subsumptions  : 5
% 0.24/0.31  % Unit Clause-clause subsumption calls : 21
% 0.24/0.31  % Rewrite failures with RHS unbound    : 0
% 0.24/0.31  % BW rewrite match attempts            : 3
% 0.24/0.31  % BW rewrite match successes           : 1
% 0.24/0.31  % Condensation attempts                : 0
% 0.24/0.31  % Condensation successes               : 0
% 0.24/0.31  % Termbank termtop insertions          : 9470
% 0.24/0.31  % Search garbage collected termcells   : 1243
% 0.24/0.31  
% 0.24/0.31  % -------------------------------------------------
% 0.24/0.31  % User time                : 0.016 s
% 0.24/0.31  % System time              : 0.004 s
% 0.24/0.31  % Total time               : 0.019 s
% 0.24/0.31  % Maximum resident set size: 4084 pages
% 0.24/0.31  
% 0.24/0.31  % -------------------------------------------------
% 0.24/0.31  % User time                : 0.021 s
% 0.24/0.31  % System time              : 0.008 s
% 0.24/0.31  % Total time               : 0.029 s
% 0.24/0.31  % Maximum resident set size: 5120 pages
% 0.24/0.31  % E exiting
%------------------------------------------------------------------------------