↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : CSR126^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 : n018.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:35 AM UTC 2026

% Result   : Theorem 0.21s 0.28s
% Output   : CNFRefutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    4
% Syntax   : Number of formulae    :   27 (   3 unt;   0 typ;   0 def)
%            Number of atoms       :  110 (   0 equ;   0 cnn)
%            Maximal formula atoms :   12 (   4 avg)
%            Number of connectives :  269 (  42   ~;  36   |;  13   &; 173   @)
%                                         (   0 <=>;   5  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   11 (   6 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :    0 (   0   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :    9 (   7 usr;   6 con; 0-2 aty)
%            Number of variables   :   22 (   0   ^;  22   !;   0   ?;  22   :)

% Comments : 
%------------------------------------------------------------------------------
thf(decl_38,type,
    holdsDuring_THFTYPE_IiooI: $i > $o > $o ).

thf(decl_50,type,
    lBill_THFTYPE_i: $i ).

thf(decl_61,type,
    lMary_THFTYPE_i: $i ).

thf(decl_73,type,
    lSue_THFTYPE_i: $i ).

thf(decl_84,type,
    lYearFn_THFTYPE_IiiI: $i > $i ).

thf(decl_88,type,
    likes_THFTYPE_IiioI: $i > $i > $o ).

thf(decl_94,type,
    n2009_THFTYPE_i: $i ).

thf(ax_022,axiom,
    ! [X20: $i,X21: $o] :
      ( ( holdsDuring_THFTYPE_IiooI @ X20 @ ~ X21 )
     => ~ ( holdsDuring_THFTYPE_IiooI @ X20 @ X21 ) ),
    file('/export/starexec/sandbox2/tmp/tmp.l4dM3gFlvr/E---3.1_423308.p',ax_022) ).

thf(ax_023,axiom,
    ! [X22: $i] : ( holdsDuring_THFTYPE_IiooI @ X22 @ ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i ) ),
    file('/export/starexec/sandbox2/tmp/tmp.l4dM3gFlvr/E---3.1_423308.p',ax_023) ).

thf(ax_005,axiom,
    ! [X5: $i] :
      ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i )
      @ ( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X5 )
       => ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X5 ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.l4dM3gFlvr/E---3.1_423308.p',ax_005) ).

thf(con,conjecture,
    holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i ),
    file('/export/starexec/sandbox2/tmp/tmp.l4dM3gFlvr/E---3.1_423308.p',con) ).

thf(c_0_4,plain,
    ! [X20: $i,X21: $o] :
      ( ( ( X21
          | ( holdsDuring_THFTYPE_IiooI @ X20 @ $true ) )
        & ( ~ X21
          | ( holdsDuring_THFTYPE_IiooI @ X20 @ $false ) ) )
     => ~ ( holdsDuring_THFTYPE_IiooI @ X20 @ X21 ) ),
    inference(fof_simplification,[status(thm)],[inference(fool_unroll,[status(thm)],[ax_022])]) ).

thf(c_0_5,axiom,
    ! [X22: $i] :
      ( ( ~ ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
        | ( holdsDuring_THFTYPE_IiooI @ X22 @ $true ) )
      & ( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
        | ( holdsDuring_THFTYPE_IiooI @ X22 @ $false ) ) ),
    inference(fool_unroll,[status(thm)],[ax_023]) ).

thf(c_0_6,plain,
    ! [X100: $i,X101: $o] :
      ( ( X101
        | ~ X101
        | ~ ( holdsDuring_THFTYPE_IiooI @ X100 @ X101 ) )
      & ( ~ ( holdsDuring_THFTYPE_IiooI @ X100 @ $false )
        | ~ X101
        | ~ ( holdsDuring_THFTYPE_IiooI @ X100 @ X101 ) )
      & ( X101
        | ~ ( holdsDuring_THFTYPE_IiooI @ X100 @ $true )
        | ~ ( holdsDuring_THFTYPE_IiooI @ X100 @ X101 ) )
      & ( ~ ( holdsDuring_THFTYPE_IiooI @ X100 @ $false )
        | ~ ( holdsDuring_THFTYPE_IiooI @ X100 @ $true )
        | ~ ( holdsDuring_THFTYPE_IiooI @ X100 @ X101 ) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])]) ).

thf(c_0_7,plain,
    ! [X102: $i] :
      ( ( ~ ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
        | ( holdsDuring_THFTYPE_IiooI @ X102 @ $true ) )
      & ( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
        | ( holdsDuring_THFTYPE_IiooI @ X102 @ $false ) ) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_5])]) ).

thf(c_0_8,axiom,
    ! [X5: $i] :
      ( ( ~ ( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X5 )
           => ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X5 ) )
        | ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
      & ( ( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X5 )
         => ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X5 ) )
        | ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
    inference(fool_unroll,[status(thm)],[ax_005]) ).

thf(c_0_9,plain,
    ! [X1: $i] :
      ( ~ ( holdsDuring_THFTYPE_IiooI @ X1 @ $true )
      | ~ ( holdsDuring_THFTYPE_IiooI @ X1 @ ~ $true ) ),
    inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_6])])]) ).

thf(c_0_10,plain,
    ! [X1: $i] :
      ( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
      | ( holdsDuring_THFTYPE_IiooI @ X1 @ ~ $true ) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

thf(c_0_11,plain,
    ! [X98: $i] :
      ( ( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X98 )
        | ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
      & ( ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X98 )
        | ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
      & ( ~ ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X98 )
        | ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X98 )
        | ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])]) ).

thf(c_0_12,plain,
    ! [X1: $i] :
      ( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
      | ~ ( holdsDuring_THFTYPE_IiooI @ X1 @ $true ) ),
    inference(spm,[status(thm)],[c_0_9,c_0_10]) ).

thf(c_0_13,plain,
    ! [X1: $i] :
      ( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X1 )
      | ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) ),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

thf(c_0_14,negated_conjecture,
    ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i ) ),
    inference(assume_negation,[status(cth)],[con]) ).

thf(c_0_15,plain,
    ! [X1: $i] :
      ( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
      | ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X1 ) ),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

thf(c_0_16,negated_conjecture,
    ~ ( ( ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
        | ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
      & ( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
        | ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
    inference(fool_unroll,[status(thm)],[c_0_14]) ).

thf(c_0_17,plain,
    ! [X1: $i] :
      ( ( holdsDuring_THFTYPE_IiooI @ X1 @ $true )
      | ~ ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i ) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

thf(c_0_18,plain,
    likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i,
    inference(ef,[status(thm)],[c_0_15]) ).

thf(c_0_19,negated_conjecture,
    ( ( ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
      | ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i ) )
    & ( ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false )
      | ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i ) )
    & ( ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
      | ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
    & ( ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false )
      | ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_16])])]) ).

thf(c_0_20,plain,
    ! [X1: $i] : ( holdsDuring_THFTYPE_IiooI @ X1 @ $true ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18])]) ).

thf(c_0_21,negated_conjecture,
    ( ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
    | ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) ),
    inference(split_conjunct,[status(thm)],[c_0_19]) ).

thf(c_0_22,plain,
    ! [X1: $i] :
      ( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X1 )
      | ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ $true )
      | ~ ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X1 ) ),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

thf(c_0_23,plain,
    ! [X1: $i] :
      ~ ( holdsDuring_THFTYPE_IiooI @ X1 @ ~ $true ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_9,c_0_20])]) ).

thf(c_0_24,negated_conjecture,
    ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lBill_THFTYPE_i ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_21,c_0_20])]) ).

thf(c_0_25,plain,
    ! [X1: $i] :
      ( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ X1 )
      | ~ ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ X1 ) ),
    inference(sr,[status(thm)],[c_0_22,c_0_23]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : CSR126^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.07/0.19  % Computer : n018.cluster.edu
% 0.07/0.19  % Model    : x86_64 x86_64
% 0.07/0.19  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.19  % Memory   : 8046.5625MB
% 0.07/0.19  % OS       : Linux 6.8.0-71-generic
% 0.07/0.19  % CPULimit : 300
% 0.07/0.19  % WCLimit  : 300
% 0.07/0.19  % DateTime : Tue Sep 29 17:57:26 UTC 2026
% 0.07/0.19  % CPUTime  : 
% 0.07/0.19  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.07/0.24  Running higher-order theorem proving
% 0.07/0.25  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.l4dM3gFlvr/E---3.1_423308.p
% 0.21/0.28  % Version: 3.5.1-ho
% 0.21/0.28  % Preprocessing class: HSLSSMSMSSSNHFA.
% 0.21/0.28  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.28  % Starting new_ho_10 with 1500s (5) cores
% 0.21/0.28  % Starting new_ho_10_cnf2 with 300s (1) cores
% 0.21/0.28  % Starting full_lambda_6 with 300s (1) cores
% 0.21/0.28  % Starting full_lambda_9 with 300s (1) cores
% 0.21/0.28  % full_lambda_9 with pid 423324 completed with status 0
% 0.21/0.28  % Result found by full_lambda_9
% 0.21/0.28  % Preprocessing class: HSLSSMSMSSSNHFA.
% 0.21/0.28  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.28  % Starting new_ho_10 with 1500s (5) cores
% 0.21/0.28  % Starting new_ho_10_cnf2 with 300s (1) cores
% 0.21/0.28  % Starting full_lambda_6 with 300s (1) cores
% 0.21/0.28  % Starting full_lambda_9 with 300s (1) cores
% 0.21/0.28  % (lift_lambdas = 1, lambda_to_forall = 0,unroll_only_formulas = 1, sine = GSinE(CountFormulas,hypos,4,,3,20000,3.0,true))
% 0.21/0.28  % SinE strategy is GSinE(CountFormulas,hypos,4,,3,20000,3.0,true)
% 0.21/0.28  % Search class: HGHSF-FFMM21-SHFFFFBN
% 0.21/0.28  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.28  % Starting SubtermCWHack with 28s (1) cores
% 0.21/0.28  % SubtermCWHack with pid 423325 completed with status 0
% 0.21/0.28  % Result found by SubtermCWHack
% 0.21/0.28  % Preprocessing class: HSLSSMSMSSSNHFA.
% 0.21/0.28  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.28  % Starting new_ho_10 with 1500s (5) cores
% 0.21/0.28  % Starting new_ho_10_cnf2 with 300s (1) cores
% 0.21/0.28  % Starting full_lambda_6 with 300s (1) cores
% 0.21/0.28  % Starting full_lambda_9 with 300s (1) cores
% 0.21/0.28  % (lift_lambdas = 1, lambda_to_forall = 0,unroll_only_formulas = 1, sine = GSinE(CountFormulas,hypos,4,,3,20000,3.0,true))
% 0.21/0.28  % SinE strategy is GSinE(CountFormulas,hypos,4,,3,20000,3.0,true)
% 0.21/0.28  % Search class: HGHSF-FFMM21-SHFFFFBN
% 0.21/0.28  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.28  % Starting SubtermCWHack with 28s (1) cores
% 0.21/0.28  % Preprocessing time       : 0.002 s
% 0.21/0.28  
% 0.21/0.28  % Proof found!
% 0.21/0.28  % SZS status Theorem
% 0.21/0.28  % SZS output start CNFRefutation
% See solution above
% 0.21/0.28  % Parsed axioms                        : 281
% 0.21/0.28  % Removed by relevancy pruning/SinE    : 181
% 0.21/0.28  % Initial clauses                      : 117
% 0.21/0.28  % Removed in clause preprocessing      : 6
% 0.21/0.28  % Initial clauses in saturation        : 111
% 0.21/0.28  % Processed clauses                    : 132
% 0.21/0.28  % ...of these trivial                  : 15
% 0.21/0.28  % ...subsumed                          : 6
% 0.21/0.28  % ...remaining for further processing  : 111
% 0.21/0.28  % Other redundant clauses eliminated   : 0
% 0.21/0.28  % Clauses deleted for lack of memory   : 0
% 0.21/0.28  % Backward-subsumed                    : 3
% 0.21/0.28  % Backward-rewritten                   : 5
% 0.21/0.28  % Generated clauses                    : 42
% 0.21/0.28  % ...of the previous two non-redundant : 39
% 0.21/0.28  % ...aggressively subsumed             : 0
% 0.21/0.28  % Contextual simplify-reflections      : 0
% 0.21/0.28  % Paramodulations                      : 39
% 0.21/0.28  % Factorizations                       : 2
% 0.21/0.28  % NegExts                              : 0
% 0.21/0.28  % Equation resolutions                 : 1
% 0.21/0.28  % Disequality decompositions           : 0
% 0.21/0.28  % Total rewrite steps                  : 26
% 0.21/0.28  % ...of those cached                   : 16
% 0.21/0.28  % Propositional unsat checks           : 0
% 0.21/0.28  %    Propositional check models        : 0
% 0.21/0.28  %    Propositional check unsatisfiable : 0
% 0.21/0.28  %    Propositional clauses             : 0
% 0.21/0.28  %    Propositional clauses after purity: 0
% 0.21/0.28  %    Propositional unsat core size     : 0
% 0.21/0.28  %    Propositional preprocessing time  : 0.000
% 0.21/0.28  %    Propositional encoding time       : 0.000
% 0.21/0.28  %    Propositional solver time         : 0.000
% 0.21/0.28  %    Success case prop preproc time    : 0.000
% 0.21/0.28  %    Success case prop encoding time   : 0.000
% 0.21/0.28  %    Success case prop solver time     : 0.000
% 0.21/0.28  % Current number of processed clauses  : 103
% 0.21/0.28  %    Positive orientable unit clauses  : 90
% 0.21/0.28  %    Positive unorientable unit clauses: 0
% 0.21/0.28  %    Negative unit clauses             : 3
% 0.21/0.28  %    Non-unit-clauses                  : 10
% 0.21/0.28  % Current number of unprocessed clauses: 13
% 0.21/0.28  % ...number of literals in the above   : 43
% 0.21/0.28  % Current number of archived formulas  : 0
% 0.21/0.28  % Current number of archived clauses   : 8
% 0.21/0.28  % Clause-clause subsumption calls (NU) : 18
% 0.21/0.28  % Rec. Clause-clause subsumption calls : 18
% 0.21/0.28  % Non-unit clause-clause subsumptions  : 4
% 0.21/0.28  % Unit Clause-clause subsumption calls : 16
% 0.21/0.28  % Rewrite failures with RHS unbound    : 0
% 0.21/0.28  % BW rewrite match attempts            : 4
% 0.21/0.28  % BW rewrite match successes           : 4
% 0.21/0.28  % Condensation attempts                : 0
% 0.21/0.28  % Condensation successes               : 0
% 0.21/0.28  % Termbank termtop insertions          : 6326
% 0.21/0.28  % Search garbage collected termcells   : 1111
% 0.21/0.28  
% 0.21/0.28  % -------------------------------------------------
% 0.21/0.28  % User time                : 0.006 s
% 0.21/0.28  % System time              : 0.005 s
% 0.21/0.28  % Total time               : 0.011 s
% 0.21/0.28  % Maximum resident set size: 4100 pages
% 0.21/0.28  
% 0.21/0.28  % -------------------------------------------------
% 0.21/0.28  % User time                : 0.012 s
% 0.21/0.28  % System time              : 0.010 s
% 0.21/0.28  % Total time               : 0.022 s
% 0.21/0.28  % Maximum resident set size: 4864 pages
% 0.21/0.28  % E exiting
%------------------------------------------------------------------------------