TSTP Solution File: SWC109+1 by ET---2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : ET---2.0
% Problem  : SWC109+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_ET %s %d

% Computer : n032.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  : 600s
% DateTime : Tue Jul 19 20:26:44 EDT 2022

% Result   : Theorem 0.18s 1.36s
% Output   : CNFRefutation 0.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :    7
% Syntax   : Number of formulae    :   49 (  10 unt;   0 def)
%            Number of atoms       :  248 (  99 equ)
%            Maximal formula atoms :   52 (   5 avg)
%            Number of connectives :  310 ( 111   ~; 130   |;  46   &)
%                                         (   3 <=>;  20  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   29 (   5 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    8 (   6 usr;   1 prp; 0-2 aty)
%            Number of functors    :   12 (  12 usr;   8 con; 0-2 aty)
%            Number of variables   :   62 (   0 sgn  38   !;   6   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(co1,conjecture,
    ! [X1] :
      ( ssList(X1)
     => ! [X2] :
          ( ssList(X2)
         => ! [X3] :
              ( ssList(X3)
             => ! [X4] :
                  ( ~ ssList(X4)
                  | X2 != X4
                  | X1 != X3
                  | ( ! [X5] :
                        ( ssItem(X5)
                       => ! [X6] :
                            ( ssList(X6)
                           => ! [X7] :
                                ( ~ ssList(X7)
                                | cons(X5,nil) != X3
                                | app(app(X6,X3),X7) != X4
                                | ? [X8] :
                                    ( ssItem(X8)
                                    & memberP(X6,X8)
                                    & lt(X5,X8) )
                                | ? [X9] :
                                    ( ssItem(X9)
                                    & memberP(X7,X9)
                                    & lt(X9,X5) ) ) ) )
                    & ( nil != X4
                      | nil != X3 ) )
                  | ( ( nil != X2
                      | nil = X1 )
                    & ( ~ neq(X2,nil)
                      | ( neq(X1,nil)
                        & segmentP(X2,X1) ) ) ) ) ) ) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',co1) ).

fof(ax83,axiom,
    ! [X1] :
      ( ssList(X1)
     => ! [X2] :
          ( ssList(X2)
         => ( nil = app(X1,X2)
          <=> ( nil = X2
              & nil = X1 ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax83) ).

fof(ax21,axiom,
    ! [X1] :
      ( ssList(X1)
     => ! [X2] :
          ( ssItem(X2)
         => nil != cons(X2,X1) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax21) ).

fof(ax26,axiom,
    ! [X1] :
      ( ssList(X1)
     => ! [X2] :
          ( ssList(X2)
         => ssList(app(X1,X2)) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax26) ).

fof(ax15,axiom,
    ! [X1] :
      ( ssList(X1)
     => ! [X2] :
          ( ssList(X2)
         => ( neq(X1,X2)
          <=> X1 != X2 ) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax15) ).

fof(ax17,axiom,
    ssList(nil),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).

fof(ax7,axiom,
    ! [X1] :
      ( ssList(X1)
     => ! [X2] :
          ( ssList(X2)
         => ( segmentP(X1,X2)
          <=> ? [X3] :
                ( ssList(X3)
                & ? [X4] :
                    ( ssList(X4)
                    & app(app(X3,X2),X4) = X1 ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax7) ).

fof(c_0_7,negated_conjecture,
    ~ ! [X1] :
        ( ssList(X1)
       => ! [X2] :
            ( ssList(X2)
           => ! [X3] :
                ( ssList(X3)
               => ! [X4] :
                    ( ~ ssList(X4)
                    | X2 != X4
                    | X1 != X3
                    | ( ! [X5] :
                          ( ssItem(X5)
                         => ! [X6] :
                              ( ssList(X6)
                             => ! [X7] :
                                  ( ~ ssList(X7)
                                  | cons(X5,nil) != X3
                                  | app(app(X6,X3),X7) != X4
                                  | ? [X8] :
                                      ( ssItem(X8)
                                      & memberP(X6,X8)
                                      & lt(X5,X8) )
                                  | ? [X9] :
                                      ( ssItem(X9)
                                      & memberP(X7,X9)
                                      & lt(X9,X5) ) ) ) )
                      & ( nil != X4
                        | nil != X3 ) )
                    | ( ( nil != X2
                        | nil = X1 )
                      & ( ~ neq(X2,nil)
                        | ( neq(X1,nil)
                          & segmentP(X2,X1) ) ) ) ) ) ) ),
    inference(assume_negation,[status(cth)],[co1]) ).

fof(c_0_8,negated_conjecture,
    ! [X17,X18] :
      ( ssList(esk1_0)
      & ssList(esk2_0)
      & ssList(esk3_0)
      & ssList(esk4_0)
      & esk2_0 = esk4_0
      & esk1_0 = esk3_0
      & ( nil = esk4_0
        | ssItem(esk5_0) )
      & ( nil = esk3_0
        | ssItem(esk5_0) )
      & ( nil = esk4_0
        | ssList(esk6_0) )
      & ( nil = esk3_0
        | ssList(esk6_0) )
      & ( nil = esk4_0
        | ssList(esk7_0) )
      & ( nil = esk3_0
        | ssList(esk7_0) )
      & ( nil = esk4_0
        | cons(esk5_0,nil) = esk3_0 )
      & ( nil = esk3_0
        | cons(esk5_0,nil) = esk3_0 )
      & ( nil = esk4_0
        | app(app(esk6_0,esk3_0),esk7_0) = esk4_0 )
      & ( nil = esk3_0
        | app(app(esk6_0,esk3_0),esk7_0) = esk4_0 )
      & ( nil = esk4_0
        | ~ ssItem(X17)
        | ~ memberP(esk6_0,X17)
        | ~ lt(esk5_0,X17) )
      & ( nil = esk3_0
        | ~ ssItem(X17)
        | ~ memberP(esk6_0,X17)
        | ~ lt(esk5_0,X17) )
      & ( nil = esk4_0
        | ~ ssItem(X18)
        | ~ memberP(esk7_0,X18)
        | ~ lt(X18,esk5_0) )
      & ( nil = esk3_0
        | ~ ssItem(X18)
        | ~ memberP(esk7_0,X18)
        | ~ lt(X18,esk5_0) )
      & ( neq(esk2_0,nil)
        | nil = esk2_0 )
      & ( ~ neq(esk1_0,nil)
        | ~ segmentP(esk2_0,esk1_0)
        | nil = esk2_0 )
      & ( neq(esk2_0,nil)
        | nil != esk1_0 )
      & ( ~ neq(esk1_0,nil)
        | ~ segmentP(esk2_0,esk1_0)
        | nil != esk1_0 ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[c_0_7])])])])])])])]) ).

fof(c_0_9,plain,
    ! [X3,X4] :
      ( ( nil = X4
        | nil != app(X3,X4)
        | ~ ssList(X4)
        | ~ ssList(X3) )
      & ( nil = X3
        | nil != app(X3,X4)
        | ~ ssList(X4)
        | ~ ssList(X3) )
      & ( nil != X4
        | nil != X3
        | nil = app(X3,X4)
        | ~ ssList(X4)
        | ~ ssList(X3) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax83])])])])])]) ).

cnf(c_0_10,negated_conjecture,
    ( app(app(esk6_0,esk3_0),esk7_0) = esk4_0
    | nil = esk3_0 ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_11,negated_conjecture,
    esk1_0 = esk3_0,
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_12,negated_conjecture,
    esk2_0 = esk4_0,
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_13,negated_conjecture,
    ( ssList(esk7_0)
    | nil = esk3_0 ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

fof(c_0_14,plain,
    ! [X3,X4] :
      ( ~ ssList(X3)
      | ~ ssItem(X4)
      | nil != cons(X4,X3) ),
    inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax21])])])])]) ).

cnf(c_0_15,negated_conjecture,
    ( cons(esk5_0,nil) = esk3_0
    | nil = esk4_0 ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_16,negated_conjecture,
    ( ssItem(esk5_0)
    | nil = esk4_0 ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_17,plain,
    ( nil = X1
    | ~ ssList(X1)
    | ~ ssList(X2)
    | nil != app(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_18,negated_conjecture,
    ( app(app(esk6_0,esk1_0),esk7_0) = esk2_0
    | nil = esk1_0 ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_10,c_0_11]),c_0_11]),c_0_12]) ).

cnf(c_0_19,negated_conjecture,
    ( nil = esk1_0
    | ssList(esk7_0) ),
    inference(rw,[status(thm)],[c_0_13,c_0_11]) ).

fof(c_0_20,plain,
    ! [X3,X4] :
      ( ~ ssList(X3)
      | ~ ssList(X4)
      | ssList(app(X3,X4)) ),
    inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax26])])])])]) ).

cnf(c_0_21,negated_conjecture,
    ( ssList(esk6_0)
    | nil = esk3_0 ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

fof(c_0_22,plain,
    ! [X3,X4] :
      ( ( ~ neq(X3,X4)
        | X3 != X4
        | ~ ssList(X4)
        | ~ ssList(X3) )
      & ( X3 = X4
        | neq(X3,X4)
        | ~ ssList(X4)
        | ~ ssList(X3) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax15])])])])])]) ).

cnf(c_0_23,plain,
    ( nil != cons(X1,X2)
    | ~ ssItem(X1)
    | ~ ssList(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

cnf(c_0_24,negated_conjecture,
    ( cons(esk5_0,nil) = esk1_0
    | nil = esk2_0 ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_12]),c_0_11]) ).

cnf(c_0_25,plain,
    ssList(nil),
    inference(split_conjunct,[status(thm)],[ax17]) ).

cnf(c_0_26,negated_conjecture,
    ( nil = esk2_0
    | ssItem(esk5_0) ),
    inference(rw,[status(thm)],[c_0_16,c_0_12]) ).

fof(c_0_27,plain,
    ! [X5,X6,X9,X10] :
      ( ( ssList(esk8_2(X5,X6))
        | ~ segmentP(X5,X6)
        | ~ ssList(X6)
        | ~ ssList(X5) )
      & ( ssList(esk9_2(X5,X6))
        | ~ segmentP(X5,X6)
        | ~ ssList(X6)
        | ~ ssList(X5) )
      & ( app(app(esk8_2(X5,X6),X6),esk9_2(X5,X6)) = X5
        | ~ segmentP(X5,X6)
        | ~ ssList(X6)
        | ~ ssList(X5) )
      & ( ~ ssList(X9)
        | ~ ssList(X10)
        | app(app(X9,X6),X10) != X5
        | segmentP(X5,X6)
        | ~ ssList(X6)
        | ~ ssList(X5) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax7])])])])])])]) ).

cnf(c_0_28,negated_conjecture,
    ( app(esk6_0,esk1_0) = nil
    | nil = esk1_0
    | nil != esk2_0
    | ~ ssList(app(esk6_0,esk1_0)) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_18]),c_0_19]) ).

cnf(c_0_29,plain,
    ( ssList(app(X1,X2))
    | ~ ssList(X2)
    | ~ ssList(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_20]) ).

cnf(c_0_30,negated_conjecture,
    ssList(esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_31,negated_conjecture,
    ( nil = esk1_0
    | ssList(esk6_0) ),
    inference(rw,[status(thm)],[c_0_21,c_0_11]) ).

cnf(c_0_32,negated_conjecture,
    ( nil = esk2_0
    | ~ segmentP(esk2_0,esk1_0)
    | ~ neq(esk1_0,nil) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_33,plain,
    ( neq(X1,X2)
    | X1 = X2
    | ~ ssList(X1)
    | ~ ssList(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_22]) ).

cnf(c_0_34,negated_conjecture,
    ( nil = esk2_0
    | nil != esk1_0 ),
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_25])]),c_0_26]) ).

cnf(c_0_35,plain,
    ( segmentP(X1,X2)
    | ~ ssList(X1)
    | ~ ssList(X2)
    | app(app(X3,X2),X4) != X1
    | ~ ssList(X4)
    | ~ ssList(X3) ),
    inference(split_conjunct,[status(thm)],[c_0_27]) ).

cnf(c_0_36,plain,
    ( nil = X2
    | ~ ssList(X1)
    | ~ ssList(X2)
    | nil != app(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_37,negated_conjecture,
    ( app(esk6_0,esk1_0) = nil
    | nil = esk1_0
    | nil != esk2_0 ),
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_30])]),c_0_31]) ).

cnf(c_0_38,negated_conjecture,
    ( nil = esk2_0
    | ~ segmentP(esk2_0,esk1_0) ),
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_33]),c_0_25]),c_0_30])]),c_0_34]) ).

cnf(c_0_39,negated_conjecture,
    ( nil = esk1_0
    | segmentP(X1,esk1_0)
    | esk2_0 != X1
    | ~ ssList(X1) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_18]),c_0_30])]),c_0_31]),c_0_19]) ).

cnf(c_0_40,negated_conjecture,
    ssList(esk2_0),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_41,negated_conjecture,
    ( nil = esk1_0
    | nil != esk2_0 ),
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_30])]),c_0_31]) ).

cnf(c_0_42,negated_conjecture,
    nil = esk2_0,
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40])]),c_0_34]) ).

cnf(c_0_43,plain,
    ( ~ ssList(X1)
    | ~ ssList(X2)
    | X1 != X2
    | ~ neq(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_22]) ).

cnf(c_0_44,negated_conjecture,
    ( neq(esk2_0,nil)
    | nil != esk1_0 ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_45,negated_conjecture,
    esk2_0 = esk1_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_41,c_0_42]),c_0_42])]) ).

cnf(c_0_46,plain,
    ( ~ ssList(X1)
    | ~ neq(X1,X1) ),
    inference(er,[status(thm)],[c_0_43]) ).

cnf(c_0_47,negated_conjecture,
    neq(esk1_0,esk1_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_42]),c_0_42]),c_0_45]),c_0_45]),c_0_45])]) ).

cnf(c_0_48,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_30])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.10  % Problem  : SWC109+1 : TPTP v8.1.0. Released v2.4.0.
% 0.06/0.11  % Command  : run_ET %s %d
% 0.10/0.30  % Computer : n032.cluster.edu
% 0.10/0.30  % Model    : x86_64 x86_64
% 0.10/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30  % Memory   : 8042.1875MB
% 0.10/0.30  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30  % CPULimit : 300
% 0.10/0.30  % WCLimit  : 600
% 0.10/0.30  % DateTime : Sun Jun 12 02:49:25 EDT 2022
% 0.10/0.30  % CPUTime  : 
% 0.18/1.36  # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.18/1.36  # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.18/1.36  # Preprocessing time       : 0.016 s
% 0.18/1.36  
% 0.18/1.36  # Proof found!
% 0.18/1.36  # SZS status Theorem
% 0.18/1.36  # SZS output start CNFRefutation
% See solution above
% 0.18/1.36  # Proof object total steps             : 49
% 0.18/1.36  # Proof object clause steps            : 35
% 0.18/1.36  # Proof object formula steps           : 14
% 0.18/1.36  # Proof object conjectures             : 29
% 0.18/1.36  # Proof object clause conjectures      : 26
% 0.18/1.36  # Proof object formula conjectures     : 3
% 0.18/1.36  # Proof object initial clauses used    : 19
% 0.18/1.36  # Proof object initial formulas used   : 7
% 0.18/1.36  # Proof object generating inferences   : 8
% 0.18/1.36  # Proof object simplifying inferences  : 41
% 0.18/1.36  # Training examples: 0 positive, 0 negative
% 0.18/1.36  # Parsed axioms                        : 96
% 0.18/1.36  # Removed by relevancy pruning/SinE    : 57
% 0.18/1.36  # Initial clauses                      : 84
% 0.18/1.36  # Removed in clause preprocessing      : 0
% 0.18/1.36  # Initial clauses in saturation        : 84
% 0.18/1.36  # Processed clauses                    : 321
% 0.18/1.36  # ...of these trivial                  : 10
% 0.18/1.36  # ...subsumed                          : 116
% 0.18/1.36  # ...remaining for further processing  : 195
% 0.18/1.36  # Other redundant clauses eliminated   : 6
% 0.18/1.36  # Clauses deleted for lack of memory   : 0
% 0.18/1.36  # Backward-subsumed                    : 13
% 0.18/1.36  # Backward-rewritten                   : 119
% 0.18/1.36  # Generated clauses                    : 2071
% 0.18/1.36  # ...of the previous two non-trivial   : 1846
% 0.18/1.36  # Contextual simplify-reflections      : 189
% 0.18/1.36  # Paramodulations                      : 2057
% 0.18/1.36  # Factorizations                       : 0
% 0.18/1.36  # Equation resolutions                 : 14
% 0.18/1.36  # Current number of processed clauses  : 59
% 0.18/1.36  #    Positive orientable unit clauses  : 9
% 0.18/1.36  #    Positive unorientable unit clauses: 0
% 0.18/1.36  #    Negative unit clauses             : 1
% 0.18/1.36  #    Non-unit-clauses                  : 49
% 0.18/1.36  # Current number of unprocessed clauses: 198
% 0.18/1.36  # ...number of literals in the above   : 1138
% 0.18/1.36  # Current number of archived formulas  : 0
% 0.18/1.36  # Current number of archived clauses   : 132
% 0.18/1.36  # Clause-clause subsumption calls (NU) : 5832
% 0.18/1.36  # Rec. Clause-clause subsumption calls : 2726
% 0.18/1.36  # Non-unit clause-clause subsumptions  : 318
% 0.18/1.36  # Unit Clause-clause subsumption calls : 16
% 0.18/1.36  # Rewrite failures with RHS unbound    : 0
% 0.18/1.36  # BW rewrite match attempts            : 3
% 0.18/1.36  # BW rewrite match successes           : 3
% 0.18/1.36  # Condensation attempts                : 0
% 0.18/1.36  # Condensation successes               : 0
% 0.18/1.36  # Termbank termtop insertions          : 40067
% 0.18/1.36  
% 0.18/1.36  # -------------------------------------------------
% 0.18/1.36  # User time                : 0.102 s
% 0.18/1.36  # System time              : 0.001 s
% 0.18/1.36  # Total time               : 0.103 s
% 0.18/1.36  # Maximum resident set size: 4800 pages
%------------------------------------------------------------------------------