TSTP Solution File: RNG121+4 by ET---2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : ET---2.0
% Problem  : RNG121+4 : TPTP v8.1.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_ET %s %d

% Computer : n027.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 : Mon Jul 18 20:27:00 EDT 2022

% Result   : Theorem 0.22s 1.41s
% Output   : CNFRefutation 0.22s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   12
% Syntax   : Number of formulae    :   50 (  15 unt;   0 def)
%            Number of atoms       :  212 (  70 equ)
%            Maximal formula atoms :   33 (   4 avg)
%            Number of connectives :  236 (  74   ~;  69   |;  79   &)
%                                         (   3 <=>;  11  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   32 (   5 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    8 (   6 usr;   1 prp; 0-2 aty)
%            Number of functors    :   20 (  20 usr;  11 con; 0-2 aty)
%            Number of variables   :   81 (   3 sgn  42   !;  21   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(mEOfElem,axiom,
    ! [X1] :
      ( aSet0(X1)
     => ! [X2] :
          ( aElementOf0(X2,X1)
         => aElement0(X2) ) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mEOfElem) ).

fof(m__2273,hypothesis,
    ( ? [X1,X2] :
        ( aElementOf0(X1,slsdtgt0(xa))
        & aElementOf0(X2,slsdtgt0(xb))
        & sdtpldt0(X1,X2) = xu )
    & aElementOf0(xu,xI)
    & xu != sz00
    & ! [X1] :
        ( ( ( ? [X2,X3] :
                ( aElementOf0(X2,slsdtgt0(xa))
                & aElementOf0(X3,slsdtgt0(xb))
                & sdtpldt0(X2,X3) = X1 )
            | aElementOf0(X1,xI) )
          & X1 != sz00 )
       => ~ iLess0(sbrdtbr0(X1),sbrdtbr0(xu)) ) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__2273) ).

fof(m__2174,hypothesis,
    ( aSet0(xI)
    & ! [X1] :
        ( aElementOf0(X1,xI)
       => ( ! [X2] :
              ( aElementOf0(X2,xI)
             => aElementOf0(sdtpldt0(X1,X2),xI) )
          & ! [X2] :
              ( aElement0(X2)
             => aElementOf0(sdtasdt0(X2,X1),xI) ) ) )
    & aIdeal0(xI)
    & ! [X1] :
        ( aElementOf0(X1,slsdtgt0(xa))
      <=> ? [X2] :
            ( aElement0(X2)
            & sdtasdt0(xa,X2) = X1 ) )
    & ! [X1] :
        ( aElementOf0(X1,slsdtgt0(xb))
      <=> ? [X2] :
            ( aElement0(X2)
            & sdtasdt0(xb,X2) = X1 ) )
    & ! [X1] :
        ( aElementOf0(X1,xI)
      <=> ? [X2,X3] :
            ( aElementOf0(X2,slsdtgt0(xa))
            & aElementOf0(X3,slsdtgt0(xb))
            & sdtpldt0(X2,X3) = X1 ) )
    & xI = sdtpldt1(slsdtgt0(xa),slsdtgt0(xb)) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__2174) ).

fof(mCancel,axiom,
    ! [X1,X2] :
      ( ( aElement0(X1)
        & aElement0(X2) )
     => ( sdtasdt0(X1,X2) = sz00
       => ( X1 = sz00
          | X2 = sz00 ) ) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mCancel) ).

fof(m__2203,hypothesis,
    ( ? [X1] :
        ( aElement0(X1)
        & sdtasdt0(xa,X1) = sz00 )
    & aElementOf0(sz00,slsdtgt0(xa))
    & ? [X1] :
        ( aElement0(X1)
        & sdtasdt0(xa,X1) = xa )
    & aElementOf0(xa,slsdtgt0(xa))
    & ? [X1] :
        ( aElement0(X1)
        & sdtasdt0(xb,X1) = sz00 )
    & aElementOf0(sz00,slsdtgt0(xb))
    & ? [X1] :
        ( aElement0(X1)
        & sdtasdt0(xb,X1) = xb )
    & aElementOf0(xb,slsdtgt0(xb)) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__2203) ).

fof(m__2612,hypothesis,
    ~ ( ? [X1] :
          ( aElement0(X1)
          & sdtasdt0(xu,X1) = xb )
      | doDivides0(xu,xb) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__2612) ).

fof(mMulZero,axiom,
    ! [X1] :
      ( aElement0(X1)
     => ( sdtasdt0(X1,sz00) = sz00
        & sz00 = sdtasdt0(sz00,X1) ) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mMulZero) ).

fof(m__,conjecture,
    ( ? [X1,X2] :
        ( aElementOf0(X1,slsdtgt0(xa))
        & aElementOf0(X2,slsdtgt0(xb))
        & sdtpldt0(X1,X2) = xb )
    | ? [X1,X2] :
        ( aElementOf0(X1,slsdtgt0(xa))
        & aElementOf0(X2,slsdtgt0(xb))
        & sdtpldt0(X1,X2) = xb )
    | aElementOf0(xb,xI) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__) ).

fof(m__2091,hypothesis,
    ( aElement0(xa)
    & aElement0(xb) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__2091) ).

fof(mSortsC,axiom,
    aElement0(sz00),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mSortsC) ).

fof(mAddComm,axiom,
    ! [X1,X2] :
      ( ( aElement0(X1)
        & aElement0(X2) )
     => sdtpldt0(X1,X2) = sdtpldt0(X2,X1) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mAddComm) ).

fof(mAddZero,axiom,
    ! [X1] :
      ( aElement0(X1)
     => ( sdtpldt0(X1,sz00) = X1
        & X1 = sdtpldt0(sz00,X1) ) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mAddZero) ).

fof(c_0_12,plain,
    ! [X3,X4] :
      ( ~ aSet0(X3)
      | ~ aElementOf0(X4,X3)
      | aElement0(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)],[mEOfElem])])])])]) ).

fof(c_0_13,hypothesis,
    ! [X6,X7,X8] :
      ( aElementOf0(esk17_0,slsdtgt0(xa))
      & aElementOf0(esk18_0,slsdtgt0(xb))
      & sdtpldt0(esk17_0,esk18_0) = xu
      & aElementOf0(xu,xI)
      & xu != sz00
      & ( ~ aElementOf0(X7,slsdtgt0(xa))
        | ~ aElementOf0(X8,slsdtgt0(xb))
        | sdtpldt0(X7,X8) != X6
        | X6 = sz00
        | ~ iLess0(sbrdtbr0(X6),sbrdtbr0(xu)) )
      & ( ~ aElementOf0(X6,xI)
        | X6 = sz00
        | ~ iLess0(sbrdtbr0(X6),sbrdtbr0(xu)) ) ),
    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)],[m__2273])])])])])])])]) ).

fof(c_0_14,hypothesis,
    ! [X4,X5,X6,X7,X7,X9,X10,X10,X12,X13,X13,X16,X17] :
      ( aSet0(xI)
      & ( ~ aElementOf0(X5,xI)
        | aElementOf0(sdtpldt0(X4,X5),xI)
        | ~ aElementOf0(X4,xI) )
      & ( ~ aElement0(X6)
        | aElementOf0(sdtasdt0(X6,X4),xI)
        | ~ aElementOf0(X4,xI) )
      & aIdeal0(xI)
      & ( aElement0(esk4_1(X7))
        | ~ aElementOf0(X7,slsdtgt0(xa)) )
      & ( sdtasdt0(xa,esk4_1(X7)) = X7
        | ~ aElementOf0(X7,slsdtgt0(xa)) )
      & ( ~ aElement0(X9)
        | sdtasdt0(xa,X9) != X7
        | aElementOf0(X7,slsdtgt0(xa)) )
      & ( aElement0(esk5_1(X10))
        | ~ aElementOf0(X10,slsdtgt0(xb)) )
      & ( sdtasdt0(xb,esk5_1(X10)) = X10
        | ~ aElementOf0(X10,slsdtgt0(xb)) )
      & ( ~ aElement0(X12)
        | sdtasdt0(xb,X12) != X10
        | aElementOf0(X10,slsdtgt0(xb)) )
      & ( aElementOf0(esk6_1(X13),slsdtgt0(xa))
        | ~ aElementOf0(X13,xI) )
      & ( aElementOf0(esk7_1(X13),slsdtgt0(xb))
        | ~ aElementOf0(X13,xI) )
      & ( sdtpldt0(esk6_1(X13),esk7_1(X13)) = X13
        | ~ aElementOf0(X13,xI) )
      & ( ~ aElementOf0(X16,slsdtgt0(xa))
        | ~ aElementOf0(X17,slsdtgt0(xb))
        | sdtpldt0(X16,X17) != X13
        | aElementOf0(X13,xI) )
      & xI = sdtpldt1(slsdtgt0(xa),slsdtgt0(xb)) ),
    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)],[m__2174])])])])])])]) ).

fof(c_0_15,plain,
    ! [X3,X4] :
      ( ~ aElement0(X3)
      | ~ aElement0(X4)
      | sdtasdt0(X3,X4) != sz00
      | X3 = sz00
      | X4 = sz00 ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mCancel])]) ).

fof(c_0_16,hypothesis,
    ( aElement0(esk8_0)
    & sdtasdt0(xa,esk8_0) = sz00
    & aElementOf0(sz00,slsdtgt0(xa))
    & aElement0(esk9_0)
    & sdtasdt0(xa,esk9_0) = xa
    & aElementOf0(xa,slsdtgt0(xa))
    & aElement0(esk10_0)
    & sdtasdt0(xb,esk10_0) = sz00
    & aElementOf0(sz00,slsdtgt0(xb))
    & aElement0(esk11_0)
    & sdtasdt0(xb,esk11_0) = xb
    & aElementOf0(xb,slsdtgt0(xb)) ),
    inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[m__2203])])])]) ).

fof(c_0_17,hypothesis,
    ! [X2] :
      ( ( ~ aElement0(X2)
        | sdtasdt0(xu,X2) != xb )
      & ~ doDivides0(xu,xb) ),
    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)],[m__2612])])])])]) ).

fof(c_0_18,plain,
    ! [X2] :
      ( ( sdtasdt0(X2,sz00) = sz00
        | ~ aElement0(X2) )
      & ( sz00 = sdtasdt0(sz00,X2)
        | ~ aElement0(X2) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mMulZero])])]) ).

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

cnf(c_0_20,hypothesis,
    aElementOf0(xu,xI),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

cnf(c_0_21,hypothesis,
    aSet0(xI),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

fof(c_0_22,negated_conjecture,
    ~ ( ? [X1,X2] :
          ( aElementOf0(X1,slsdtgt0(xa))
          & aElementOf0(X2,slsdtgt0(xb))
          & sdtpldt0(X1,X2) = xb )
      | ? [X1,X2] :
          ( aElementOf0(X1,slsdtgt0(xa))
          & aElementOf0(X2,slsdtgt0(xb))
          & sdtpldt0(X1,X2) = xb )
      | aElementOf0(xb,xI) ),
    inference(assume_negation,[status(cth)],[m__]) ).

cnf(c_0_23,plain,
    ( X1 = sz00
    | X2 = sz00
    | sdtasdt0(X2,X1) != sz00
    | ~ aElement0(X1)
    | ~ aElement0(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_24,hypothesis,
    sdtasdt0(xb,esk10_0) = sz00,
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

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

cnf(c_0_26,hypothesis,
    aElement0(esk10_0),
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

cnf(c_0_27,hypothesis,
    ( sdtasdt0(xu,X1) != xb
    | ~ aElement0(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

cnf(c_0_28,plain,
    ( sdtasdt0(X1,sz00) = sz00
    | ~ aElement0(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_18]) ).

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

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

fof(c_0_31,negated_conjecture,
    ! [X3,X4] :
      ( ( ~ aElementOf0(X3,slsdtgt0(xa))
        | ~ aElementOf0(X4,slsdtgt0(xb))
        | sdtpldt0(X3,X4) != xb )
      & ~ aElementOf0(xb,xI) ),
    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)],[inference(fof_simplification,[status(thm)],[c_0_22])])])])])]) ).

fof(c_0_32,plain,
    ! [X3,X4] :
      ( ~ aElement0(X3)
      | ~ aElement0(X4)
      | sdtpldt0(X3,X4) = sdtpldt0(X4,X3) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mAddComm])]) ).

fof(c_0_33,plain,
    ! [X2] :
      ( ( sdtpldt0(X2,sz00) = X2
        | ~ aElement0(X2) )
      & ( X2 = sdtpldt0(sz00,X2)
        | ~ aElement0(X2) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mAddZero])])]) ).

cnf(c_0_34,hypothesis,
    ( xb = sz00
    | sz00 = esk10_0 ),
    inference(cn,[status(thm)],[inference(rw,[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,hypothesis,
    xb != sz00,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29])]),c_0_30])]) ).

cnf(c_0_36,negated_conjecture,
    ( sdtpldt0(X1,X2) != xb
    | ~ aElementOf0(X2,slsdtgt0(xb))
    | ~ aElementOf0(X1,slsdtgt0(xa)) ),
    inference(split_conjunct,[status(thm)],[c_0_31]) ).

cnf(c_0_37,plain,
    ( sdtpldt0(X1,X2) = sdtpldt0(X2,X1)
    | ~ aElement0(X2)
    | ~ aElement0(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_32]) ).

cnf(c_0_38,plain,
    ( sdtpldt0(X1,sz00) = X1
    | ~ aElement0(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_33]) ).

cnf(c_0_39,hypothesis,
    sz00 = esk10_0,
    inference(sr,[status(thm)],[c_0_34,c_0_35]) ).

cnf(c_0_40,hypothesis,
    aElementOf0(sz00,slsdtgt0(xa)),
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

cnf(c_0_41,hypothesis,
    ( aElementOf0(X1,slsdtgt0(xb))
    | sdtasdt0(xb,X2) != X1
    | ~ aElement0(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

cnf(c_0_42,hypothesis,
    sdtasdt0(xb,esk11_0) = xb,
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

cnf(c_0_43,hypothesis,
    aElement0(esk11_0),
    inference(split_conjunct,[status(thm)],[c_0_16]) ).

cnf(c_0_44,negated_conjecture,
    ( sdtpldt0(X1,X2) != xb
    | ~ aElementOf0(X1,slsdtgt0(xb))
    | ~ aElementOf0(X2,slsdtgt0(xa))
    | ~ aElement0(X2)
    | ~ aElement0(X1) ),
    inference(spm,[status(thm)],[c_0_36,c_0_37]) ).

cnf(c_0_45,plain,
    ( sdtpldt0(X1,esk10_0) = X1
    | ~ aElement0(X1) ),
    inference(rw,[status(thm)],[c_0_38,c_0_39]) ).

cnf(c_0_46,hypothesis,
    aElementOf0(esk10_0,slsdtgt0(xa)),
    inference(rw,[status(thm)],[c_0_40,c_0_39]) ).

cnf(c_0_47,hypothesis,
    ( aElementOf0(X1,slsdtgt0(xb))
    | xb != X1 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_42]),c_0_43])]) ).

cnf(c_0_48,negated_conjecture,
    ( X1 != xb
    | ~ aElement0(X1) ),
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_46]),c_0_26])]),c_0_47]) ).

cnf(c_0_49,hypothesis,
    $false,
    inference(spm,[status(thm)],[c_0_48,c_0_25]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem  : RNG121+4 : TPTP v8.1.0. Released v4.0.0.
% 0.04/0.12  % Command  : run_ET %s %d
% 0.12/0.33  % Computer : n027.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Mon May 30 18:46:31 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.22/1.41  # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.22/1.41  # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.22/1.41  # Preprocessing time       : 0.024 s
% 0.22/1.41  
% 0.22/1.41  # Proof found!
% 0.22/1.41  # SZS status Theorem
% 0.22/1.41  # SZS output start CNFRefutation
% See solution above
% 0.22/1.41  # Proof object total steps             : 50
% 0.22/1.41  # Proof object clause steps            : 27
% 0.22/1.41  # Proof object formula steps           : 23
% 0.22/1.41  # Proof object conjectures             : 6
% 0.22/1.41  # Proof object clause conjectures      : 3
% 0.22/1.41  # Proof object formula conjectures     : 3
% 0.22/1.41  # Proof object initial clauses used    : 17
% 0.22/1.41  # Proof object initial formulas used   : 12
% 0.22/1.41  # Proof object generating inferences   : 7
% 0.22/1.41  # Proof object simplifying inferences  : 18
% 0.22/1.41  # Training examples: 0 positive, 0 negative
% 0.22/1.41  # Parsed axioms                        : 53
% 0.22/1.41  # Removed by relevancy pruning/SinE    : 5
% 0.22/1.41  # Initial clauses                      : 189
% 0.22/1.41  # Removed in clause preprocessing      : 4
% 0.22/1.41  # Initial clauses in saturation        : 185
% 0.22/1.41  # Processed clauses                    : 663
% 0.22/1.41  # ...of these trivial                  : 37
% 0.22/1.41  # ...subsumed                          : 200
% 0.22/1.41  # ...remaining for further processing  : 426
% 0.22/1.41  # Other redundant clauses eliminated   : 33
% 0.22/1.41  # Clauses deleted for lack of memory   : 0
% 0.22/1.41  # Backward-subsumed                    : 49
% 0.22/1.41  # Backward-rewritten                   : 42
% 0.22/1.41  # Generated clauses                    : 2316
% 0.22/1.41  # ...of the previous two non-trivial   : 2028
% 0.22/1.41  # Contextual simplify-reflections      : 52
% 0.22/1.41  # Paramodulations                      : 2266
% 0.22/1.41  # Factorizations                       : 2
% 0.22/1.41  # Equation resolutions                 : 47
% 0.22/1.41  # Current number of processed clauses  : 334
% 0.22/1.41  #    Positive orientable unit clauses  : 76
% 0.22/1.41  #    Positive unorientable unit clauses: 0
% 0.22/1.41  #    Negative unit clauses             : 28
% 0.22/1.41  #    Non-unit-clauses                  : 230
% 0.22/1.41  # Current number of unprocessed clauses: 1214
% 0.22/1.41  # ...number of literals in the above   : 5271
% 0.22/1.41  # Current number of archived formulas  : 0
% 0.22/1.41  # Current number of archived clauses   : 92
% 0.22/1.41  # Clause-clause subsumption calls (NU) : 6525
% 0.22/1.41  # Rec. Clause-clause subsumption calls : 3556
% 0.22/1.41  # Non-unit clause-clause subsumptions  : 183
% 0.22/1.41  # Unit Clause-clause subsumption calls : 1348
% 0.22/1.41  # Rewrite failures with RHS unbound    : 0
% 0.22/1.41  # BW rewrite match attempts            : 12
% 0.22/1.41  # BW rewrite match successes           : 12
% 0.22/1.41  # Condensation attempts                : 0
% 0.22/1.41  # Condensation successes               : 0
% 0.22/1.41  # Termbank termtop insertions          : 40806
% 0.22/1.41  
% 0.22/1.41  # -------------------------------------------------
% 0.22/1.41  # User time                : 0.088 s
% 0.22/1.41  # System time              : 0.002 s
% 0.22/1.41  # Total time               : 0.090 s
% 0.22/1.41  # Maximum resident set size: 5208 pages
%------------------------------------------------------------------------------