TSTP Solution File: SWC204+1 by E-SAT---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E-SAT---3.1.00
% Problem  : SWC204+1 : TPTP v8.2.0. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n020.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 : Tue May 21 04:28:18 EDT 2024

% Result   : Theorem 0.20s 0.50s
% Output   : CNFRefutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   16
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   51 (  14 unt;   0 def)
%            Number of atoms       :  183 (  66 equ)
%            Maximal formula atoms :   28 (   3 avg)
%            Number of connectives :  211 (  79   ~;  77   |;  24   &)
%                                         (   2 <=>;  29  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   22 (   5 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   5 con; 0-2 aty)
%            Number of variables   :   47 (   0 sgn  33   !;   4   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(co1,conjecture,
    ! [X1] :
      ( ssList(X1)
     => ! [X2] :
          ( ssList(X2)
         => ! [X3] :
              ( ssList(X3)
             => ! [X4] :
                  ( ssList(X4)
                 => ( X2 != X4
                    | X1 != X3
                    | ( ( ~ neq(X2,nil)
                        | ? [X5] :
                            ( ssList(X5)
                            & X4 != X5
                            & ? [X6] :
                                ( ssList(X6)
                                & tl(X4) = X6
                                & app(X3,X6) = X5
                                & neq(nil,X4) ) )
                        | neq(X1,nil) )
                      & ( ~ neq(X2,nil)
                        | neq(X4,nil) ) ) ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',co1) ).

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(ax24,axiom,
    ! [X1] :
      ( ssList(X1)
     => ( nil != X1
       => ssList(tl(X1)) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax24) ).

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

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

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

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

fof(c_0_8,negated_conjecture,
    ~ ! [X1] :
        ( ssList(X1)
       => ! [X2] :
            ( ssList(X2)
           => ! [X3] :
                ( ssList(X3)
               => ! [X4] :
                    ( ssList(X4)
                   => ( X2 != X4
                      | X1 != X3
                      | ( ( ~ neq(X2,nil)
                          | ? [X5] :
                              ( ssList(X5)
                              & X4 != X5
                              & ? [X6] :
                                  ( ssList(X6)
                                  & tl(X4) = X6
                                  & app(X3,X6) = X5
                                  & neq(nil,X4) ) )
                          | neq(X1,nil) )
                        & ( ~ neq(X2,nil)
                          | neq(X4,nil) ) ) ) ) ) ) ),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[co1])]) ).

fof(c_0_9,negated_conjecture,
    ! [X11,X12] :
      ( ssList(esk1_0)
      & ssList(esk2_0)
      & ssList(esk3_0)
      & ssList(esk4_0)
      & esk2_0 = esk4_0
      & esk1_0 = esk3_0
      & ( neq(esk2_0,nil)
        | neq(esk2_0,nil) )
      & ( ~ neq(esk4_0,nil)
        | neq(esk2_0,nil) )
      & ( neq(esk2_0,nil)
        | ~ ssList(X11)
        | esk4_0 = X11
        | ~ ssList(X12)
        | tl(esk4_0) != X12
        | app(esk3_0,X12) != X11
        | ~ neq(nil,esk4_0) )
      & ( ~ neq(esk4_0,nil)
        | ~ ssList(X11)
        | esk4_0 = X11
        | ~ ssList(X12)
        | tl(esk4_0) != X12
        | app(esk3_0,X12) != X11
        | ~ neq(nil,esk4_0) )
      & ( neq(esk2_0,nil)
        | ~ neq(esk1_0,nil) )
      & ( ~ neq(esk4_0,nil)
        | ~ neq(esk1_0,nil) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])])])]) ).

cnf(c_0_10,negated_conjecture,
    ( neq(esk2_0,nil)
    | neq(esk2_0,nil) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_11,negated_conjecture,
    neq(esk2_0,nil),
    inference(cn,[status(thm)],[c_0_10]) ).

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

fof(c_0_13,plain,
    ! [X1] :
      ( ssList(X1)
     => ! [X2] :
          ( ssList(X2)
         => ( neq(X1,X2)
          <=> X1 != X2 ) ) ),
    inference(fof_simplification,[status(thm)],[ax15]) ).

cnf(c_0_14,negated_conjecture,
    ( ~ neq(esk4_0,nil)
    | ~ neq(esk1_0,nil) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_15,negated_conjecture,
    neq(esk4_0,nil),
    inference(rw,[status(thm)],[c_0_11,c_0_12]) ).

fof(c_0_16,plain,
    ! [X15,X16] :
      ( ( ~ neq(X15,X16)
        | X15 != X16
        | ~ ssList(X16)
        | ~ ssList(X15) )
      & ( X15 = X16
        | neq(X15,X16)
        | ~ ssList(X16)
        | ~ ssList(X15) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])])])]) ).

cnf(c_0_17,negated_conjecture,
    ( esk4_0 = X1
    | ~ neq(esk4_0,nil)
    | ~ ssList(X1)
    | ~ ssList(X2)
    | tl(esk4_0) != X2
    | app(esk3_0,X2) != X1
    | ~ neq(nil,esk4_0) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_18,negated_conjecture,
    esk1_0 = esk3_0,
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_19,negated_conjecture,
    ~ neq(esk1_0,nil),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_14,c_0_15])]) ).

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

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

cnf(c_0_22,negated_conjecture,
    ssList(esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_23,negated_conjecture,
    ( app(esk1_0,tl(esk4_0)) = esk4_0
    | ~ ssList(app(esk1_0,tl(esk4_0)))
    | ~ ssList(tl(esk4_0))
    | ~ neq(nil,esk4_0) ),
    inference(er,[status(thm)],[inference(er,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_17,c_0_18]),c_0_15])])])]) ).

cnf(c_0_24,negated_conjecture,
    esk1_0 = nil,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]),c_0_22])]) ).

cnf(c_0_25,negated_conjecture,
    ssList(esk2_0),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

fof(c_0_26,plain,
    ! [X1] :
      ( ssList(X1)
     => ( nil != X1
       => ssList(tl(X1)) ) ),
    inference(fof_simplification,[status(thm)],[ax24]) ).

cnf(c_0_27,negated_conjecture,
    ( app(nil,tl(esk4_0)) = esk4_0
    | ~ ssList(app(nil,tl(esk4_0)))
    | ~ ssList(tl(esk4_0))
    | ~ neq(nil,esk4_0) ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_23,c_0_24]),c_0_24]) ).

cnf(c_0_28,negated_conjecture,
    ssList(esk4_0),
    inference(rw,[status(thm)],[c_0_25,c_0_12]) ).

fof(c_0_29,plain,
    ! [X42] :
      ( ~ ssList(X42)
      | nil = X42
      | ssList(tl(X42)) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_26])])]) ).

cnf(c_0_30,negated_conjecture,
    ( app(nil,tl(esk4_0)) = esk4_0
    | esk4_0 = nil
    | ~ ssList(app(nil,tl(esk4_0)))
    | ~ ssList(tl(esk4_0)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_20]),c_0_28]),c_0_21])]) ).

cnf(c_0_31,plain,
    ( nil = X1
    | ssList(tl(X1))
    | ~ ssList(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_29]) ).

fof(c_0_32,plain,
    ! [X27] :
      ( ~ ssList(X27)
      | app(nil,X27) = X27 ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax28])])]) ).

fof(c_0_33,plain,
    ! [X1] :
      ( ssList(X1)
     => ( nil != X1
       => cons(hd(X1),tl(X1)) = X1 ) ),
    inference(fof_simplification,[status(thm)],[ax78]) ).

cnf(c_0_34,negated_conjecture,
    ( app(nil,tl(esk4_0)) = esk4_0
    | esk4_0 = nil
    | ~ ssList(app(nil,tl(esk4_0))) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_28])]) ).

cnf(c_0_35,plain,
    ( app(nil,X1) = X1
    | ~ ssList(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_32]) ).

fof(c_0_36,plain,
    ! [X1] :
      ( ssList(X1)
     => ! [X2] :
          ( ssItem(X2)
         => cons(X2,X1) != X1 ) ),
    inference(fof_simplification,[status(thm)],[ax18]) ).

fof(c_0_37,plain,
    ! [X49] :
      ( ~ ssList(X49)
      | nil = X49
      | cons(hd(X49),tl(X49)) = X49 ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_33])])]) ).

cnf(c_0_38,negated_conjecture,
    ( tl(esk4_0) = esk4_0
    | esk4_0 = nil
    | ~ ssList(tl(esk4_0)) ),
    inference(spm,[status(thm)],[c_0_34,c_0_35]) ).

fof(c_0_39,plain,
    ! [X56,X57] :
      ( ~ ssList(X56)
      | ~ ssItem(X57)
      | cons(X57,X56) != X56 ),
    inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_36])])])]) ).

cnf(c_0_40,plain,
    ( nil = X1
    | cons(hd(X1),tl(X1)) = X1
    | ~ ssList(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_37]) ).

cnf(c_0_41,negated_conjecture,
    ( tl(esk4_0) = esk4_0
    | esk4_0 = nil ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_31]),c_0_28])]) ).

fof(c_0_42,plain,
    ! [X1] :
      ( ssList(X1)
     => ( nil != X1
       => ssItem(hd(X1)) ) ),
    inference(fof_simplification,[status(thm)],[ax22]) ).

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

cnf(c_0_44,negated_conjecture,
    ( cons(hd(esk4_0),esk4_0) = esk4_0
    | esk4_0 = nil ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_28])]) ).

fof(c_0_45,plain,
    ! [X62] :
      ( ~ ssList(X62)
      | nil = X62
      | ssItem(hd(X62)) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_42])])]) ).

cnf(c_0_46,negated_conjecture,
    ( esk4_0 = nil
    | ~ ssItem(hd(esk4_0)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_28])]) ).

cnf(c_0_47,plain,
    ( nil = X1
    | ssItem(hd(X1))
    | ~ ssList(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_45]) ).

cnf(c_0_48,negated_conjecture,
    esk4_0 = nil,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_28])]) ).

cnf(c_0_49,negated_conjecture,
    ~ neq(nil,nil),
    inference(rw,[status(thm)],[c_0_19,c_0_24]) ).

cnf(c_0_50,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_15,c_0_48]),c_0_49]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem    : SWC204+1 : TPTP v8.2.0. Released v2.4.0.
% 0.12/0.13  % Command    : run_E %s %d THM
% 0.13/0.34  % Computer : n020.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit   : 300
% 0.13/0.34  % WCLimit    : 300
% 0.13/0.34  % DateTime   : Sun May 19 03:38:23 EDT 2024
% 0.13/0.34  % CPUTime    : 
% 0.20/0.47  Running first-order model finding
% 0.20/0.47  Running: /export/starexec/sandbox2/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.20/0.50  # Version: 3.1.0
% 0.20/0.50  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.50  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.50  # Starting new_bool_3 with 300s (1) cores
% 0.20/0.50  # Starting new_bool_1 with 300s (1) cores
% 0.20/0.50  # Starting sh5l with 300s (1) cores
% 0.20/0.50  # new_bool_3 with pid 13337 completed with status 0
% 0.20/0.50  # Result found by new_bool_3
% 0.20/0.50  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.50  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.50  # Starting new_bool_3 with 300s (1) cores
% 0.20/0.50  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.50  # Search class: FGHSF-FFMM21-SFFFFFNN
% 0.20/0.50  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.50  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 163s (1) cores
% 0.20/0.50  # G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with pid 13340 completed with status 0
% 0.20/0.50  # Result found by G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v
% 0.20/0.50  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.20/0.50  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.20/0.50  # Starting new_bool_3 with 300s (1) cores
% 0.20/0.50  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.20/0.50  # Search class: FGHSF-FFMM21-SFFFFFNN
% 0.20/0.50  # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.50  # Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S2v with 163s (1) cores
% 0.20/0.50  # Preprocessing time       : 0.002 s
% 0.20/0.50  # Presaturation interreduction done
% 0.20/0.50  
% 0.20/0.50  # Proof found!
% 0.20/0.50  # SZS status Theorem
% 0.20/0.50  # SZS output start CNFRefutation
% See solution above
% 0.20/0.50  # Parsed axioms                        : 96
% 0.20/0.50  # Removed by relevancy pruning/SinE    : 67
% 0.20/0.50  # Initial clauses                      : 51
% 0.20/0.50  # Removed in clause preprocessing      : 0
% 0.20/0.50  # Initial clauses in saturation        : 51
% 0.20/0.50  # Processed clauses                    : 130
% 0.20/0.50  # ...of these trivial                  : 5
% 0.20/0.50  # ...subsumed                          : 15
% 0.20/0.50  # ...remaining for further processing  : 110
% 0.20/0.50  # Other redundant clauses eliminated   : 15
% 0.20/0.50  # Clauses deleted for lack of memory   : 0
% 0.20/0.50  # Backward-subsumed                    : 4
% 0.20/0.50  # Backward-rewritten                   : 18
% 0.20/0.50  # Generated clauses                    : 96
% 0.20/0.50  # ...of the previous two non-redundant : 63
% 0.20/0.50  # ...aggressively subsumed             : 0
% 0.20/0.50  # Contextual simplify-reflections      : 0
% 0.20/0.50  # Paramodulations                      : 79
% 0.20/0.50  # Factorizations                       : 0
% 0.20/0.50  # NegExts                              : 0
% 0.20/0.50  # Equation resolutions                 : 19
% 0.20/0.50  # Disequality decompositions           : 0
% 0.20/0.50  # Total rewrite steps                  : 129
% 0.20/0.50  # ...of those cached                   : 120
% 0.20/0.50  # Propositional unsat checks           : 0
% 0.20/0.50  #    Propositional check models        : 0
% 0.20/0.50  #    Propositional check unsatisfiable : 0
% 0.20/0.50  #    Propositional clauses             : 0
% 0.20/0.50  #    Propositional clauses after purity: 0
% 0.20/0.50  #    Propositional unsat core size     : 0
% 0.20/0.50  #    Propositional preprocessing time  : 0.000
% 0.20/0.50  #    Propositional encoding time       : 0.000
% 0.20/0.50  #    Propositional solver time         : 0.000
% 0.20/0.50  #    Success case prop preproc time    : 0.000
% 0.20/0.50  #    Success case prop encoding time   : 0.000
% 0.20/0.50  #    Success case prop solver time     : 0.000
% 0.20/0.50  # Current number of processed clauses  : 38
% 0.20/0.50  #    Positive orientable unit clauses  : 7
% 0.20/0.50  #    Positive unorientable unit clauses: 0
% 0.20/0.50  #    Negative unit clauses             : 2
% 0.20/0.50  #    Non-unit-clauses                  : 29
% 0.20/0.50  # Current number of unprocessed clauses: 27
% 0.20/0.50  # ...number of literals in the above   : 127
% 0.20/0.50  # Current number of archived formulas  : 0
% 0.20/0.50  # Current number of archived clauses   : 68
% 0.20/0.50  # Clause-clause subsumption calls (NU) : 425
% 0.20/0.50  # Rec. Clause-clause subsumption calls : 183
% 0.20/0.50  # Non-unit clause-clause subsumptions  : 19
% 0.20/0.50  # Unit Clause-clause subsumption calls : 27
% 0.20/0.50  # Rewrite failures with RHS unbound    : 0
% 0.20/0.50  # BW rewrite match attempts            : 3
% 0.20/0.50  # BW rewrite match successes           : 3
% 0.20/0.50  # Condensation attempts                : 0
% 0.20/0.50  # Condensation successes               : 0
% 0.20/0.50  # Termbank termtop insertions          : 6521
% 0.20/0.50  # Search garbage collected termcells   : 1519
% 0.20/0.50  
% 0.20/0.50  # -------------------------------------------------
% 0.20/0.50  # User time                : 0.012 s
% 0.20/0.50  # System time              : 0.002 s
% 0.20/0.50  # Total time               : 0.015 s
% 0.20/0.50  # Maximum resident set size: 1908 pages
% 0.20/0.50  
% 0.20/0.50  # -------------------------------------------------
% 0.20/0.50  # User time                : 0.015 s
% 0.20/0.50  # System time              : 0.006 s
% 0.20/0.50  # Total time               : 0.020 s
% 0.20/0.50  # Maximum resident set size: 1820 pages
% 0.20/0.50  % E---3.1 exiting
%------------------------------------------------------------------------------