TSTP Solution File: RNG118+1 by E---3.1.00

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E---3.1.00
% Problem  : RNG118+1 : TPTP v8.2.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n015.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 02:36:27 EDT 2024

% Result   : Theorem 0.21s 0.54s
% Output   : CNFRefutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    8
% Syntax   : Number of formulae    :   40 (  13 unt;   0 def)
%            Number of atoms       :  164 (  39 equ)
%            Maximal formula atoms :   29 (   4 avg)
%            Number of connectives :  202 (  78   ~;  73   |;  39   &)
%                                         (   1 <=>;  11  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   17 (   5 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    7 (   5 usr;   1 prp; 0-2 aty)
%            Number of functors    :   15 (  15 usr;   5 con; 0-2 aty)
%            Number of variables   :   48 (   0 sgn  24   !;   8   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(m__2273,hypothesis,
    ( aElementOf0(xu,xI)
    & xu != sz00
    & ! [X1] :
        ( ( aElementOf0(X1,xI)
          & X1 != sz00 )
       => ~ iLess0(sbrdtbr0(X1),sbrdtbr0(xu)) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2273) ).

fof(mEOfElem,axiom,
    ! [X1] :
      ( aSet0(X1)
     => ! [X2] :
          ( aElementOf0(X2,X1)
         => aElement0(X2) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mEOfElem) ).

fof(mDefIdeal,axiom,
    ! [X1] :
      ( aIdeal0(X1)
    <=> ( aSet0(X1)
        & ! [X2] :
            ( aElementOf0(X2,X1)
           => ( ! [X3] :
                  ( aElementOf0(X3,X1)
                 => aElementOf0(sdtpldt0(X2,X3),X1) )
              & ! [X3] :
                  ( aElement0(X3)
                 => aElementOf0(sdtasdt0(X3,X2),X1) ) ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDefIdeal) ).

fof(m__,conjecture,
    ? [X1,X2] :
      ( aElement0(X1)
      & aElement0(X2)
      & xb = sdtpldt0(sdtasdt0(X1,xu),X2)
      & ( X2 = sz00
        | iLess0(sbrdtbr0(X2),sbrdtbr0(xu)) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__) ).

fof(mDivision,axiom,
    ! [X1,X2] :
      ( ( aElement0(X1)
        & aElement0(X2)
        & X2 != sz00 )
     => ? [X3,X4] :
          ( aElement0(X3)
          & aElement0(X4)
          & X1 = sdtpldt0(sdtasdt0(X3,X2),X4)
          & ( X4 != sz00
           => iLess0(sbrdtbr0(X4),sbrdtbr0(X2)) ) ) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mDivision) ).

fof(m__2174,hypothesis,
    ( aIdeal0(xI)
    & xI = sdtpldt1(slsdtgt0(xa),slsdtgt0(xb)) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2174) ).

fof(m__2091,hypothesis,
    ( aElement0(xa)
    & aElement0(xb) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',m__2091) ).

fof(mSortsC,axiom,
    aElement0(sz00),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',mSortsC) ).

fof(c_0_8,hypothesis,
    ( aElementOf0(xu,xI)
    & xu != sz00
    & ! [X1] :
        ( ( aElementOf0(X1,xI)
          & X1 != sz00 )
       => ~ iLess0(sbrdtbr0(X1),sbrdtbr0(xu)) ) ),
    inference(fof_simplification,[status(thm)],[m__2273]) ).

fof(c_0_9,plain,
    ! [X34,X35] :
      ( ~ aSet0(X34)
      | ~ aElementOf0(X35,X34)
      | aElement0(X35) ),
    inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mEOfElem])])])]) ).

fof(c_0_10,hypothesis,
    ! [X117] :
      ( aElementOf0(xu,xI)
      & xu != sz00
      & ( ~ aElementOf0(X117,xI)
        | X117 = sz00
        | ~ iLess0(sbrdtbr0(X117),sbrdtbr0(xu)) ) ),
    inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])]) ).

fof(c_0_11,plain,
    ! [X62,X63,X64,X65,X66] :
      ( ( aSet0(X62)
        | ~ aIdeal0(X62) )
      & ( ~ aElementOf0(X64,X62)
        | aElementOf0(sdtpldt0(X63,X64),X62)
        | ~ aElementOf0(X63,X62)
        | ~ aIdeal0(X62) )
      & ( ~ aElement0(X65)
        | aElementOf0(sdtasdt0(X65,X63),X62)
        | ~ aElementOf0(X63,X62)
        | ~ aIdeal0(X62) )
      & ( aElementOf0(esk9_1(X66),X66)
        | ~ aSet0(X66)
        | aIdeal0(X66) )
      & ( aElement0(esk11_1(X66))
        | aElementOf0(esk10_1(X66),X66)
        | ~ aSet0(X66)
        | aIdeal0(X66) )
      & ( ~ aElementOf0(sdtasdt0(esk11_1(X66),esk9_1(X66)),X66)
        | aElementOf0(esk10_1(X66),X66)
        | ~ aSet0(X66)
        | aIdeal0(X66) )
      & ( aElement0(esk11_1(X66))
        | ~ aElementOf0(sdtpldt0(esk9_1(X66),esk10_1(X66)),X66)
        | ~ aSet0(X66)
        | aIdeal0(X66) )
      & ( ~ aElementOf0(sdtasdt0(esk11_1(X66),esk9_1(X66)),X66)
        | ~ aElementOf0(sdtpldt0(esk9_1(X66),esk10_1(X66)),X66)
        | ~ aSet0(X66)
        | aIdeal0(X66) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[mDefIdeal])])])])])])]) ).

fof(c_0_12,negated_conjecture,
    ~ ? [X1,X2] :
        ( aElement0(X1)
        & aElement0(X2)
        & xb = sdtpldt0(sdtasdt0(X1,xu),X2)
        & ( X2 = sz00
          | iLess0(sbrdtbr0(X2),sbrdtbr0(xu)) ) ),
    inference(assume_negation,[status(cth)],[m__]) ).

fof(c_0_13,plain,
    ! [X1,X2] :
      ( ( aElement0(X1)
        & aElement0(X2)
        & X2 != sz00 )
     => ? [X3,X4] :
          ( aElement0(X3)
          & aElement0(X4)
          & X1 = sdtpldt0(sdtasdt0(X3,X2),X4)
          & ( X4 != sz00
           => iLess0(sbrdtbr0(X4),sbrdtbr0(X2)) ) ) ),
    inference(fof_simplification,[status(thm)],[mDivision]) ).

cnf(c_0_14,plain,
    ( aElement0(X2)
    | ~ aSet0(X1)
    | ~ aElementOf0(X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_15,hypothesis,
    aElementOf0(xu,xI),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_16,plain,
    ( aSet0(X1)
    | ~ aIdeal0(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_17,hypothesis,
    aIdeal0(xI),
    inference(split_conjunct,[status(thm)],[m__2174]) ).

fof(c_0_18,negated_conjecture,
    ! [X120,X121] :
      ( ( X121 != sz00
        | ~ aElement0(X120)
        | ~ aElement0(X121)
        | xb != sdtpldt0(sdtasdt0(X120,xu),X121) )
      & ( ~ iLess0(sbrdtbr0(X121),sbrdtbr0(xu))
        | ~ aElement0(X120)
        | ~ aElement0(X121)
        | xb != sdtpldt0(sdtasdt0(X120,xu),X121) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])])]) ).

fof(c_0_19,plain,
    ! [X87,X88] :
      ( ( aElement0(esk14_2(X87,X88))
        | ~ aElement0(X87)
        | ~ aElement0(X88)
        | X88 = sz00 )
      & ( aElement0(esk15_2(X87,X88))
        | ~ aElement0(X87)
        | ~ aElement0(X88)
        | X88 = sz00 )
      & ( X87 = sdtpldt0(sdtasdt0(esk14_2(X87,X88),X88),esk15_2(X87,X88))
        | ~ aElement0(X87)
        | ~ aElement0(X88)
        | X88 = sz00 )
      & ( esk15_2(X87,X88) = sz00
        | iLess0(sbrdtbr0(esk15_2(X87,X88)),sbrdtbr0(X88))
        | ~ aElement0(X87)
        | ~ aElement0(X88)
        | X88 = sz00 ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])])])]) ).

cnf(c_0_20,hypothesis,
    ( aElement0(xu)
    | ~ aSet0(xI) ),
    inference(spm,[status(thm)],[c_0_14,c_0_15]) ).

cnf(c_0_21,hypothesis,
    aSet0(xI),
    inference(spm,[status(thm)],[c_0_16,c_0_17]) ).

cnf(c_0_22,negated_conjecture,
    ( ~ iLess0(sbrdtbr0(X1),sbrdtbr0(xu))
    | ~ aElement0(X2)
    | ~ aElement0(X1)
    | xb != sdtpldt0(sdtasdt0(X2,xu),X1) ),
    inference(split_conjunct,[status(thm)],[c_0_18]) ).

cnf(c_0_23,plain,
    ( X1 = sdtpldt0(sdtasdt0(esk14_2(X1,X2),X2),esk15_2(X1,X2))
    | X2 = sz00
    | ~ aElement0(X1)
    | ~ aElement0(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_19]) ).

cnf(c_0_24,hypothesis,
    xu != sz00,
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_25,hypothesis,
    aElement0(xb),
    inference(split_conjunct,[status(thm)],[m__2091]) ).

cnf(c_0_26,hypothesis,
    aElement0(xu),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_21])]) ).

cnf(c_0_27,negated_conjecture,
    ( ~ iLess0(sbrdtbr0(esk15_2(xb,xu)),sbrdtbr0(xu))
    | ~ aElement0(esk14_2(xb,xu))
    | ~ aElement0(esk15_2(xb,xu)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24])]),c_0_25])]),c_0_26])]) ).

cnf(c_0_28,plain,
    ( aElement0(esk14_2(X1,X2))
    | X2 = sz00
    | ~ aElement0(X1)
    | ~ aElement0(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_19]) ).

cnf(c_0_29,negated_conjecture,
    ( ~ iLess0(sbrdtbr0(esk15_2(xb,xu)),sbrdtbr0(xu))
    | ~ aElement0(esk15_2(xb,xu)) ),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_26]),c_0_25])]),c_0_24]) ).

cnf(c_0_30,plain,
    ( aElement0(esk15_2(X1,X2))
    | X2 = sz00
    | ~ aElement0(X1)
    | ~ aElement0(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_19]) ).

cnf(c_0_31,negated_conjecture,
    ~ iLess0(sbrdtbr0(esk15_2(xb,xu)),sbrdtbr0(xu)),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_26]),c_0_25])]),c_0_24]) ).

cnf(c_0_32,plain,
    ( esk15_2(X1,X2) = sz00
    | iLess0(sbrdtbr0(esk15_2(X1,X2)),sbrdtbr0(X2))
    | X2 = sz00
    | ~ aElement0(X1)
    | ~ aElement0(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_19]) ).

cnf(c_0_33,negated_conjecture,
    ( X1 != sz00
    | ~ aElement0(X2)
    | ~ aElement0(X1)
    | xb != sdtpldt0(sdtasdt0(X2,xu),X1) ),
    inference(split_conjunct,[status(thm)],[c_0_18]) ).

cnf(c_0_34,plain,
    aElement0(sz00),
    inference(split_conjunct,[status(thm)],[mSortsC]) ).

cnf(c_0_35,negated_conjecture,
    esk15_2(xb,xu) = sz00,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_26]),c_0_25])]),c_0_24]) ).

cnf(c_0_36,negated_conjecture,
    ( sdtpldt0(sdtasdt0(X1,xu),sz00) != xb
    | ~ aElement0(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(er,[status(thm)],[c_0_33]),c_0_34])]) ).

cnf(c_0_37,negated_conjecture,
    sdtpldt0(sdtasdt0(esk14_2(xb,xu),xu),sz00) = xb,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_35]),c_0_26]),c_0_25])]),c_0_24]) ).

cnf(c_0_38,negated_conjecture,
    ~ aElement0(esk14_2(xb,xu)),
    inference(spm,[status(thm)],[c_0_36,c_0_37]) ).

cnf(c_0_39,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_28]),c_0_26]),c_0_25])]),c_0_24]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : RNG118+1 : TPTP v8.2.0. Released v4.0.0.
% 0.03/0.13  % Command    : run_E %s %d THM
% 0.14/0.35  % Computer : n015.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit   : 300
% 0.14/0.35  % WCLimit    : 300
% 0.14/0.35  % DateTime   : Sat May 18 12:18:08 EDT 2024
% 0.14/0.35  % CPUTime    : 
% 0.21/0.48  Running first-order theorem proving
% 0.21/0.48  Running: /export/starexec/sandbox2/solver/bin/eprover --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
% 0.21/0.54  # Version: 3.1.0
% 0.21/0.54  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.54  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.54  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.54  # Starting new_bool_3 with 300s (1) cores
% 0.21/0.54  # Starting new_bool_1 with 300s (1) cores
% 0.21/0.54  # Starting sh5l with 300s (1) cores
% 0.21/0.54  # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 11015 completed with status 0
% 0.21/0.54  # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.21/0.54  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.54  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.54  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.54  # No SInE strategy applied
% 0.21/0.54  # Search class: FGHSF-FSMM32-MFFFFFNN
% 0.21/0.54  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.54  # Starting SAT001_CO_MinMin_p005000_rr with 811s (1) cores
% 0.21/0.54  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.21/0.54  # Starting new_bool_3 with 136s (1) cores
% 0.21/0.54  # Starting new_bool_1 with 136s (1) cores
% 0.21/0.54  # Starting sh5l with 136s (1) cores
% 0.21/0.54  # G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with pid 11022 completed with status 0
% 0.21/0.54  # Result found by G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S
% 0.21/0.54  # Preprocessing class: FSLSSMSSSSSNFFN.
% 0.21/0.54  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.54  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 1500s (5) cores
% 0.21/0.54  # No SInE strategy applied
% 0.21/0.54  # Search class: FGHSF-FSMM32-MFFFFFNN
% 0.21/0.54  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.21/0.54  # Starting SAT001_CO_MinMin_p005000_rr with 811s (1) cores
% 0.21/0.54  # Starting G-E--_207_C18_F1_SE_CS_SP_PI_PS_S5PRR_S2S with 151s (1) cores
% 0.21/0.54  # Preprocessing time       : 0.004 s
% 0.21/0.54  # Presaturation interreduction done
% 0.21/0.54  
% 0.21/0.54  # Proof found!
% 0.21/0.54  # SZS status Theorem
% 0.21/0.54  # SZS output start CNFRefutation
% See solution above
% 0.21/0.54  # Parsed axioms                        : 50
% 0.21/0.54  # Removed by relevancy pruning/SinE    : 0
% 0.21/0.54  # Initial clauses                      : 116
% 0.21/0.54  # Removed in clause preprocessing      : 4
% 0.21/0.54  # Initial clauses in saturation        : 112
% 0.21/0.54  # Processed clauses                    : 376
% 0.21/0.54  # ...of these trivial                  : 4
% 0.21/0.54  # ...subsumed                          : 70
% 0.21/0.54  # ...remaining for further processing  : 302
% 0.21/0.54  # Other redundant clauses eliminated   : 20
% 0.21/0.54  # Clauses deleted for lack of memory   : 0
% 0.21/0.54  # Backward-subsumed                    : 9
% 0.21/0.54  # Backward-rewritten                   : 8
% 0.21/0.54  # Generated clauses                    : 636
% 0.21/0.54  # ...of the previous two non-redundant : 598
% 0.21/0.54  # ...aggressively subsumed             : 0
% 0.21/0.54  # Contextual simplify-reflections      : 1
% 0.21/0.54  # Paramodulations                      : 614
% 0.21/0.54  # Factorizations                       : 4
% 0.21/0.54  # NegExts                              : 0
% 0.21/0.54  # Equation resolutions                 : 20
% 0.21/0.54  # Disequality decompositions           : 0
% 0.21/0.54  # Total rewrite steps                  : 327
% 0.21/0.54  # ...of those cached                   : 310
% 0.21/0.54  # Propositional unsat checks           : 0
% 0.21/0.54  #    Propositional check models        : 0
% 0.21/0.54  #    Propositional check unsatisfiable : 0
% 0.21/0.54  #    Propositional clauses             : 0
% 0.21/0.54  #    Propositional clauses after purity: 0
% 0.21/0.54  #    Propositional unsat core size     : 0
% 0.21/0.54  #    Propositional preprocessing time  : 0.000
% 0.21/0.54  #    Propositional encoding time       : 0.000
% 0.21/0.54  #    Propositional solver time         : 0.000
% 0.21/0.54  #    Success case prop preproc time    : 0.000
% 0.21/0.54  #    Success case prop encoding time   : 0.000
% 0.21/0.54  #    Success case prop solver time     : 0.000
% 0.21/0.54  # Current number of processed clauses  : 158
% 0.21/0.54  #    Positive orientable unit clauses  : 38
% 0.21/0.54  #    Positive unorientable unit clauses: 0
% 0.21/0.54  #    Negative unit clauses             : 17
% 0.21/0.54  #    Non-unit-clauses                  : 103
% 0.21/0.54  # Current number of unprocessed clauses: 439
% 0.21/0.54  # ...number of literals in the above   : 2279
% 0.21/0.54  # Current number of archived formulas  : 0
% 0.21/0.54  # Current number of archived clauses   : 129
% 0.21/0.54  # Clause-clause subsumption calls (NU) : 3155
% 0.21/0.54  # Rec. Clause-clause subsumption calls : 826
% 0.21/0.54  # Non-unit clause-clause subsumptions  : 38
% 0.21/0.54  # Unit Clause-clause subsumption calls : 619
% 0.21/0.54  # Rewrite failures with RHS unbound    : 0
% 0.21/0.54  # BW rewrite match attempts            : 6
% 0.21/0.54  # BW rewrite match successes           : 6
% 0.21/0.54  # Condensation attempts                : 0
% 0.21/0.54  # Condensation successes               : 0
% 0.21/0.54  # Termbank termtop insertions          : 19413
% 0.21/0.54  # Search garbage collected termcells   : 1953
% 0.21/0.54  
% 0.21/0.54  # -------------------------------------------------
% 0.21/0.54  # User time                : 0.038 s
% 0.21/0.54  # System time              : 0.006 s
% 0.21/0.54  # Total time               : 0.044 s
% 0.21/0.54  # Maximum resident set size: 2068 pages
% 0.21/0.54  
% 0.21/0.54  # -------------------------------------------------
% 0.21/0.54  # User time                : 0.165 s
% 0.21/0.54  # System time              : 0.022 s
% 0.21/0.54  # Total time               : 0.188 s
% 0.21/0.54  # Maximum resident set size: 1752 pages
% 0.21/0.54  % E---3.1 exiting
% 0.21/0.54  % E exiting
%------------------------------------------------------------------------------