TSTP Solution File: NUM541+2 by ET---2.0

View Problem - Process Solution

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

% Computer : n019.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 09:33:35 EDT 2022

% Result   : Theorem 0.23s 1.41s
% Output   : CNFRefutation 0.23s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   43 (   6 unt;   0 def)
%            Number of atoms       :  192 (  31 equ)
%            Maximal formula atoms :   50 (   4 avg)
%            Number of connectives :  231 (  82   ~;  99   |;  36   &)
%                                         (   1 <=>;  13  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   22 (   5 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   4 con; 0-1 aty)
%            Number of variables   :   40 (   0 sgn  24   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(m__,conjecture,
    ( ( ( sdtlseqdt0(szszuzczcdt0(xm),szszuzczcdt0(xn))
        & aElementOf0(xm,slbdtrb0(szszuzczcdt0(xn))) )
     => ( sdtlseqdt0(szszuzczcdt0(xm),xn)
        | aElementOf0(xm,slbdtrb0(xn))
        | xm = xn ) )
    & ( ( ( sdtlseqdt0(szszuzczcdt0(xm),xn)
          & aElementOf0(xm,slbdtrb0(xn)) )
        | xm = xn )
     => ( sdtlseqdt0(szszuzczcdt0(xm),szszuzczcdt0(xn))
        | aElementOf0(xm,slbdtrb0(szszuzczcdt0(xn))) ) ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__) ).

fof(mSuccLess,axiom,
    ! [X1,X2] :
      ( ( aElementOf0(X1,szNzAzT0)
        & aElementOf0(X2,szNzAzT0) )
     => ( sdtlseqdt0(X1,X2)
      <=> sdtlseqdt0(szszuzczcdt0(X1),szszuzczcdt0(X2)) ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mSuccLess) ).

fof(mLessTotal,axiom,
    ! [X1,X2] :
      ( ( aElementOf0(X1,szNzAzT0)
        & aElementOf0(X2,szNzAzT0) )
     => ( sdtlseqdt0(X1,X2)
        | sdtlseqdt0(szszuzczcdt0(X2),X1) ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mLessTotal) ).

fof(m__1936,hypothesis,
    ( aElementOf0(xm,szNzAzT0)
    & aElementOf0(xn,szNzAzT0) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',m__1936) ).

fof(mLessASymm,axiom,
    ! [X1,X2] :
      ( ( aElementOf0(X1,szNzAzT0)
        & aElementOf0(X2,szNzAzT0) )
     => ( ( sdtlseqdt0(X1,X2)
          & sdtlseqdt0(X2,X1) )
       => X1 = X2 ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mLessASymm) ).

fof(mLessTrans,axiom,
    ! [X1,X2,X3] :
      ( ( aElementOf0(X1,szNzAzT0)
        & aElementOf0(X2,szNzAzT0)
        & aElementOf0(X3,szNzAzT0) )
     => ( ( sdtlseqdt0(X1,X2)
          & sdtlseqdt0(X2,X3) )
       => sdtlseqdt0(X1,X3) ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mLessTrans) ).

fof(mLessSucc,axiom,
    ! [X1] :
      ( aElementOf0(X1,szNzAzT0)
     => sdtlseqdt0(X1,szszuzczcdt0(X1)) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mLessSucc) ).

fof(mSuccNum,axiom,
    ! [X1] :
      ( aElementOf0(X1,szNzAzT0)
     => ( aElementOf0(szszuzczcdt0(X1),szNzAzT0)
        & szszuzczcdt0(X1) != sz00 ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mSuccNum) ).

fof(mLessRefl,axiom,
    ! [X1] :
      ( aElementOf0(X1,szNzAzT0)
     => sdtlseqdt0(X1,X1) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',mLessRefl) ).

fof(c_0_9,negated_conjecture,
    ~ ( ( ( sdtlseqdt0(szszuzczcdt0(xm),szszuzczcdt0(xn))
          & aElementOf0(xm,slbdtrb0(szszuzczcdt0(xn))) )
       => ( sdtlseqdt0(szszuzczcdt0(xm),xn)
          | aElementOf0(xm,slbdtrb0(xn))
          | xm = xn ) )
      & ( ( ( sdtlseqdt0(szszuzczcdt0(xm),xn)
            & aElementOf0(xm,slbdtrb0(xn)) )
          | xm = xn )
       => ( sdtlseqdt0(szszuzczcdt0(xm),szszuzczcdt0(xn))
          | aElementOf0(xm,slbdtrb0(szszuzczcdt0(xn))) ) ) ),
    inference(assume_negation,[status(cth)],[m__]) ).

fof(c_0_10,negated_conjecture,
    ( ( sdtlseqdt0(szszuzczcdt0(xm),xn)
      | xm = xn
      | sdtlseqdt0(szszuzczcdt0(xm),szszuzczcdt0(xn)) )
    & ( aElementOf0(xm,slbdtrb0(xn))
      | xm = xn
      | sdtlseqdt0(szszuzczcdt0(xm),szszuzczcdt0(xn)) )
    & ( ~ sdtlseqdt0(szszuzczcdt0(xm),szszuzczcdt0(xn))
      | sdtlseqdt0(szszuzczcdt0(xm),szszuzczcdt0(xn)) )
    & ( ~ aElementOf0(xm,slbdtrb0(szszuzczcdt0(xn)))
      | sdtlseqdt0(szszuzczcdt0(xm),szszuzczcdt0(xn)) )
    & ( sdtlseqdt0(szszuzczcdt0(xm),xn)
      | xm = xn
      | aElementOf0(xm,slbdtrb0(szszuzczcdt0(xn))) )
    & ( aElementOf0(xm,slbdtrb0(xn))
      | xm = xn
      | aElementOf0(xm,slbdtrb0(szszuzczcdt0(xn))) )
    & ( ~ sdtlseqdt0(szszuzczcdt0(xm),szszuzczcdt0(xn))
      | aElementOf0(xm,slbdtrb0(szszuzczcdt0(xn))) )
    & ( ~ aElementOf0(xm,slbdtrb0(szszuzczcdt0(xn)))
      | aElementOf0(xm,slbdtrb0(szszuzczcdt0(xn))) )
    & ( sdtlseqdt0(szszuzczcdt0(xm),xn)
      | xm = xn
      | ~ sdtlseqdt0(szszuzczcdt0(xm),xn) )
    & ( aElementOf0(xm,slbdtrb0(xn))
      | xm = xn
      | ~ sdtlseqdt0(szszuzczcdt0(xm),xn) )
    & ( ~ sdtlseqdt0(szszuzczcdt0(xm),szszuzczcdt0(xn))
      | ~ sdtlseqdt0(szszuzczcdt0(xm),xn) )
    & ( ~ aElementOf0(xm,slbdtrb0(szszuzczcdt0(xn)))
      | ~ sdtlseqdt0(szszuzczcdt0(xm),xn) )
    & ( sdtlseqdt0(szszuzczcdt0(xm),xn)
      | xm = xn
      | ~ aElementOf0(xm,slbdtrb0(xn)) )
    & ( aElementOf0(xm,slbdtrb0(xn))
      | xm = xn
      | ~ aElementOf0(xm,slbdtrb0(xn)) )
    & ( ~ sdtlseqdt0(szszuzczcdt0(xm),szszuzczcdt0(xn))
      | ~ aElementOf0(xm,slbdtrb0(xn)) )
    & ( ~ aElementOf0(xm,slbdtrb0(szszuzczcdt0(xn)))
      | ~ aElementOf0(xm,slbdtrb0(xn)) )
    & ( sdtlseqdt0(szszuzczcdt0(xm),xn)
      | xm = xn
      | xm != xn )
    & ( aElementOf0(xm,slbdtrb0(xn))
      | xm = xn
      | xm != xn )
    & ( ~ sdtlseqdt0(szszuzczcdt0(xm),szszuzczcdt0(xn))
      | xm != xn )
    & ( ~ aElementOf0(xm,slbdtrb0(szszuzczcdt0(xn)))
      | xm != xn ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])]) ).

fof(c_0_11,plain,
    ! [X3,X4] :
      ( ( ~ sdtlseqdt0(X3,X4)
        | sdtlseqdt0(szszuzczcdt0(X3),szszuzczcdt0(X4))
        | ~ aElementOf0(X3,szNzAzT0)
        | ~ aElementOf0(X4,szNzAzT0) )
      & ( ~ sdtlseqdt0(szszuzczcdt0(X3),szszuzczcdt0(X4))
        | sdtlseqdt0(X3,X4)
        | ~ aElementOf0(X3,szNzAzT0)
        | ~ aElementOf0(X4,szNzAzT0) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSuccLess])])]) ).

fof(c_0_12,plain,
    ! [X3,X4] :
      ( ~ aElementOf0(X3,szNzAzT0)
      | ~ aElementOf0(X4,szNzAzT0)
      | sdtlseqdt0(X3,X4)
      | sdtlseqdt0(szszuzczcdt0(X4),X3) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mLessTotal])]) ).

cnf(c_0_13,negated_conjecture,
    ( ~ sdtlseqdt0(szszuzczcdt0(xm),xn)
    | ~ sdtlseqdt0(szszuzczcdt0(xm),szszuzczcdt0(xn)) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_14,plain,
    ( sdtlseqdt0(szszuzczcdt0(X2),szszuzczcdt0(X1))
    | ~ aElementOf0(X1,szNzAzT0)
    | ~ aElementOf0(X2,szNzAzT0)
    | ~ sdtlseqdt0(X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_15,hypothesis,
    aElementOf0(xm,szNzAzT0),
    inference(split_conjunct,[status(thm)],[m__1936]) ).

cnf(c_0_16,hypothesis,
    aElementOf0(xn,szNzAzT0),
    inference(split_conjunct,[status(thm)],[m__1936]) ).

cnf(c_0_17,plain,
    ( sdtlseqdt0(szszuzczcdt0(X1),X2)
    | sdtlseqdt0(X2,X1)
    | ~ aElementOf0(X1,szNzAzT0)
    | ~ aElementOf0(X2,szNzAzT0) ),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

fof(c_0_18,plain,
    ! [X3,X4] :
      ( ~ aElementOf0(X3,szNzAzT0)
      | ~ aElementOf0(X4,szNzAzT0)
      | ~ sdtlseqdt0(X3,X4)
      | ~ sdtlseqdt0(X4,X3)
      | X3 = X4 ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mLessASymm])]) ).

cnf(c_0_19,negated_conjecture,
    ( ~ sdtlseqdt0(szszuzczcdt0(xm),xn)
    | ~ sdtlseqdt0(xm,xn) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_13,c_0_14]),c_0_15]),c_0_16])]) ).

cnf(c_0_20,hypothesis,
    ( sdtlseqdt0(szszuzczcdt0(X1),xn)
    | sdtlseqdt0(xn,X1)
    | ~ aElementOf0(X1,szNzAzT0) ),
    inference(spm,[status(thm)],[c_0_17,c_0_16]) ).

cnf(c_0_21,negated_conjecture,
    ( xm != xn
    | ~ sdtlseqdt0(szszuzczcdt0(xm),szszuzczcdt0(xn)) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_22,plain,
    ( sdtlseqdt0(X2,X1)
    | ~ aElementOf0(X1,szNzAzT0)
    | ~ aElementOf0(X2,szNzAzT0)
    | ~ sdtlseqdt0(szszuzczcdt0(X2),szszuzczcdt0(X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_23,negated_conjecture,
    ( sdtlseqdt0(szszuzczcdt0(xm),szszuzczcdt0(xn))
    | xm = xn
    | sdtlseqdt0(szszuzczcdt0(xm),xn) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_24,plain,
    ( X1 = X2
    | ~ sdtlseqdt0(X2,X1)
    | ~ sdtlseqdt0(X1,X2)
    | ~ aElementOf0(X2,szNzAzT0)
    | ~ aElementOf0(X1,szNzAzT0) ),
    inference(split_conjunct,[status(thm)],[c_0_18]) ).

cnf(c_0_25,negated_conjecture,
    ( sdtlseqdt0(xn,xm)
    | ~ sdtlseqdt0(xm,xn) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_15])]) ).

cnf(c_0_26,negated_conjecture,
    ( xn != xm
    | ~ sdtlseqdt0(xm,xn) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_14]),c_0_15]),c_0_16])]) ).

fof(c_0_27,plain,
    ! [X4,X5,X6] :
      ( ~ aElementOf0(X4,szNzAzT0)
      | ~ aElementOf0(X5,szNzAzT0)
      | ~ aElementOf0(X6,szNzAzT0)
      | ~ sdtlseqdt0(X4,X5)
      | ~ sdtlseqdt0(X5,X6)
      | sdtlseqdt0(X4,X6) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mLessTrans])]) ).

cnf(c_0_28,negated_conjecture,
    ( xn = xm
    | sdtlseqdt0(szszuzczcdt0(xm),xn)
    | sdtlseqdt0(xm,xn) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_15]),c_0_16])]) ).

cnf(c_0_29,negated_conjecture,
    ~ sdtlseqdt0(xm,xn),
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_16]),c_0_15])]),c_0_26]) ).

cnf(c_0_30,plain,
    ( sdtlseqdt0(X1,X2)
    | ~ sdtlseqdt0(X3,X2)
    | ~ sdtlseqdt0(X1,X3)
    | ~ aElementOf0(X2,szNzAzT0)
    | ~ aElementOf0(X3,szNzAzT0)
    | ~ aElementOf0(X1,szNzAzT0) ),
    inference(split_conjunct,[status(thm)],[c_0_27]) ).

cnf(c_0_31,negated_conjecture,
    ( xn = xm
    | sdtlseqdt0(szszuzczcdt0(xm),xn) ),
    inference(sr,[status(thm)],[c_0_28,c_0_29]) ).

fof(c_0_32,plain,
    ! [X2] :
      ( ~ aElementOf0(X2,szNzAzT0)
      | sdtlseqdt0(X2,szszuzczcdt0(X2)) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mLessSucc])]) ).

cnf(c_0_33,negated_conjecture,
    ( xn = xm
    | sdtlseqdt0(X1,xn)
    | ~ sdtlseqdt0(X1,szszuzczcdt0(xm))
    | ~ aElementOf0(szszuzczcdt0(xm),szNzAzT0)
    | ~ aElementOf0(X1,szNzAzT0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_16])]) ).

cnf(c_0_34,plain,
    ( sdtlseqdt0(X1,szszuzczcdt0(X1))
    | ~ aElementOf0(X1,szNzAzT0) ),
    inference(split_conjunct,[status(thm)],[c_0_32]) ).

fof(c_0_35,plain,
    ! [X2] :
      ( ( aElementOf0(szszuzczcdt0(X2),szNzAzT0)
        | ~ aElementOf0(X2,szNzAzT0) )
      & ( szszuzczcdt0(X2) != sz00
        | ~ aElementOf0(X2,szNzAzT0) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mSuccNum])])]) ).

cnf(c_0_36,negated_conjecture,
    ( xn = xm
    | ~ aElementOf0(szszuzczcdt0(xm),szNzAzT0) ),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_15])]),c_0_29]) ).

cnf(c_0_37,plain,
    ( aElementOf0(szszuzczcdt0(X1),szNzAzT0)
    | ~ aElementOf0(X1,szNzAzT0) ),
    inference(split_conjunct,[status(thm)],[c_0_35]) ).

cnf(c_0_38,negated_conjecture,
    xn = xm,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_15])]) ).

fof(c_0_39,plain,
    ! [X2] :
      ( ~ aElementOf0(X2,szNzAzT0)
      | sdtlseqdt0(X2,X2) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[mLessRefl])]) ).

cnf(c_0_40,negated_conjecture,
    ~ sdtlseqdt0(xm,xm),
    inference(rw,[status(thm)],[c_0_29,c_0_38]) ).

cnf(c_0_41,plain,
    ( sdtlseqdt0(X1,X1)
    | ~ aElementOf0(X1,szNzAzT0) ),
    inference(split_conjunct,[status(thm)],[c_0_39]) ).

cnf(c_0_42,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_15])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : NUM541+2 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13  % Command  : run_ET %s %d
% 0.13/0.34  % Computer : n019.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  : 600
% 0.13/0.34  % DateTime : Fri Jul  8 01:07:38 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.23/1.41  # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.41  # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.41  # Preprocessing time       : 0.022 s
% 0.23/1.41  
% 0.23/1.41  # Proof found!
% 0.23/1.41  # SZS status Theorem
% 0.23/1.41  # SZS output start CNFRefutation
% See solution above
% 0.23/1.41  # Proof object total steps             : 43
% 0.23/1.41  # Proof object clause steps            : 25
% 0.23/1.41  # Proof object formula steps           : 18
% 0.23/1.41  # Proof object conjectures             : 17
% 0.23/1.41  # Proof object clause conjectures      : 14
% 0.23/1.41  # Proof object formula conjectures     : 3
% 0.23/1.41  # Proof object initial clauses used    : 13
% 0.23/1.41  # Proof object initial formulas used   : 9
% 0.23/1.41  # Proof object generating inferences   : 10
% 0.23/1.41  # Proof object simplifying inferences  : 26
% 0.23/1.41  # Training examples: 0 positive, 0 negative
% 0.23/1.41  # Parsed axioms                        : 54
% 0.23/1.41  # Removed by relevancy pruning/SinE    : 5
% 0.23/1.41  # Initial clauses                      : 103
% 0.23/1.41  # Removed in clause preprocessing      : 11
% 0.23/1.41  # Initial clauses in saturation        : 92
% 0.23/1.41  # Processed clauses                    : 205
% 0.23/1.41  # ...of these trivial                  : 6
% 0.23/1.41  # ...subsumed                          : 39
% 0.23/1.41  # ...remaining for further processing  : 160
% 0.23/1.41  # Other redundant clauses eliminated   : 11
% 0.23/1.41  # Clauses deleted for lack of memory   : 0
% 0.23/1.41  # Backward-subsumed                    : 23
% 0.23/1.41  # Backward-rewritten                   : 29
% 0.23/1.41  # Generated clauses                    : 343
% 0.23/1.41  # ...of the previous two non-trivial   : 302
% 0.23/1.41  # Contextual simplify-reflections      : 35
% 0.23/1.41  # Paramodulations                      : 314
% 0.23/1.41  # Factorizations                       : 0
% 0.23/1.41  # Equation resolutions                 : 27
% 0.23/1.41  # Current number of processed clauses  : 104
% 0.23/1.41  #    Positive orientable unit clauses  : 10
% 0.23/1.41  #    Positive unorientable unit clauses: 0
% 0.23/1.41  #    Negative unit clauses             : 5
% 0.23/1.41  #    Non-unit-clauses                  : 89
% 0.23/1.41  # Current number of unprocessed clauses: 162
% 0.23/1.41  # ...number of literals in the above   : 874
% 0.23/1.41  # Current number of archived formulas  : 0
% 0.23/1.41  # Current number of archived clauses   : 54
% 0.23/1.41  # Clause-clause subsumption calls (NU) : 5553
% 0.23/1.41  # Rec. Clause-clause subsumption calls : 1455
% 0.23/1.41  # Non-unit clause-clause subsumptions  : 83
% 0.23/1.41  # Unit Clause-clause subsumption calls : 186
% 0.23/1.41  # Rewrite failures with RHS unbound    : 0
% 0.23/1.41  # BW rewrite match attempts            : 1
% 0.23/1.41  # BW rewrite match successes           : 1
% 0.23/1.41  # Condensation attempts                : 0
% 0.23/1.41  # Condensation successes               : 0
% 0.23/1.41  # Termbank termtop insertions          : 11825
% 0.23/1.41  
% 0.23/1.41  # -------------------------------------------------
% 0.23/1.41  # User time                : 0.049 s
% 0.23/1.41  # System time              : 0.003 s
% 0.23/1.41  # Total time               : 0.052 s
% 0.23/1.41  # Maximum resident set size: 3468 pages
%------------------------------------------------------------------------------