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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : ET---2.0
% Problem  : SEU375+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_ET %s %d

% Computer : n004.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 09:19:29 EDT 2022

% Result   : Theorem 0.23s 1.42s
% Output   : CNFRefutation 0.23s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    9
% Syntax   : Number of formulae    :   58 (  26 unt;   0 def)
%            Number of atoms       :  208 (  14 equ)
%            Maximal formula atoms :   16 (   3 avg)
%            Number of connectives :  246 (  96   ~;  82   |;  33   &)
%                                         (   1 <=>;  34  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   20 (   5 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :   14 (  12 usr;   1 prp; 0-3 aty)
%            Number of functors    :    8 (   8 usr;   7 con; 0-1 aty)
%            Number of variables   :   82 (   0 sgn  54   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(t21_yellow_6,conjecture,
    ! [X1] :
      ( one_sorted_str(X1)
     => ! [X2] :
          ( ( ~ empty_carrier(X2)
            & net_str(X2,X1) )
         => ! [X3] :
              ( ( ~ empty_carrier(X3)
                & full_subnetstr(X3,X1,X2)
                & subnetstr(X3,X1,X2) )
             => ! [X4] :
                  ( element(X4,the_carrier(X2))
                 => ! [X5] :
                      ( element(X5,the_carrier(X2))
                     => ! [X6] :
                          ( element(X6,the_carrier(X3))
                         => ! [X7] :
                              ( element(X7,the_carrier(X3))
                             => ( ( X4 = X6
                                  & X5 = X7
                                  & related(X2,X4,X5) )
                               => related(X3,X6,X7) ) ) ) ) ) ) ) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t21_yellow_6) ).

fof(dt_m1_yellow_6,axiom,
    ! [X1,X2] :
      ( ( one_sorted_str(X1)
        & net_str(X2,X1) )
     => ! [X3] :
          ( subnetstr(X3,X1,X2)
         => net_str(X3,X1) ) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',dt_m1_yellow_6) ).

fof(t61_yellow_0,axiom,
    ! [X1] :
      ( rel_str(X1)
     => ! [X2] :
          ( ( full_subrelstr(X2,X1)
            & subrelstr(X2,X1) )
         => ! [X3] :
              ( element(X3,the_carrier(X1))
             => ! [X4] :
                  ( element(X4,the_carrier(X1))
                 => ! [X5] :
                      ( element(X5,the_carrier(X2))
                     => ! [X6] :
                          ( element(X6,the_carrier(X2))
                         => ( ( X5 = X3
                              & X6 = X4
                              & related(X1,X3,X4)
                              & in(X5,the_carrier(X2))
                              & in(X6,the_carrier(X2)) )
                           => related(X2,X5,X6) ) ) ) ) ) ) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t61_yellow_0) ).

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

fof(dt_l1_waybel_0,axiom,
    ! [X1] :
      ( one_sorted_str(X1)
     => ! [X2] :
          ( net_str(X2,X1)
         => rel_str(X2) ) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',dt_l1_waybel_0) ).

fof(d9_yellow_6,axiom,
    ! [X1] :
      ( one_sorted_str(X1)
     => ! [X2] :
          ( net_str(X2,X1)
         => ! [X3] :
              ( subnetstr(X3,X1,X2)
             => ( full_subnetstr(X3,X1,X2)
              <=> ( full_subrelstr(X3,X2)
                  & subrelstr(X3,X2) ) ) ) ) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',d9_yellow_6) ).

fof(fc1_struct_0,axiom,
    ! [X1] :
      ( ( ~ empty_carrier(X1)
        & one_sorted_str(X1) )
     => ~ empty(the_carrier(X1)) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',fc1_struct_0) ).

fof(dt_l1_orders_2,axiom,
    ! [X1] :
      ( rel_str(X1)
     => one_sorted_str(X1) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',dt_l1_orders_2) ).

fof(t2_subset,axiom,
    ! [X1,X2] :
      ( element(X1,X2)
     => ( empty(X2)
        | in(X1,X2) ) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in',t2_subset) ).

fof(c_0_9,negated_conjecture,
    ~ ! [X1] :
        ( one_sorted_str(X1)
       => ! [X2] :
            ( ( ~ empty_carrier(X2)
              & net_str(X2,X1) )
           => ! [X3] :
                ( ( ~ empty_carrier(X3)
                  & full_subnetstr(X3,X1,X2)
                  & subnetstr(X3,X1,X2) )
               => ! [X4] :
                    ( element(X4,the_carrier(X2))
                   => ! [X5] :
                        ( element(X5,the_carrier(X2))
                       => ! [X6] :
                            ( element(X6,the_carrier(X3))
                           => ! [X7] :
                                ( element(X7,the_carrier(X3))
                               => ( ( X4 = X6
                                    & X5 = X7
                                    & related(X2,X4,X5) )
                                 => related(X3,X6,X7) ) ) ) ) ) ) ) ),
    inference(assume_negation,[status(cth)],[t21_yellow_6]) ).

fof(c_0_10,plain,
    ! [X4,X5,X6] :
      ( ~ one_sorted_str(X4)
      | ~ net_str(X5,X4)
      | ~ subnetstr(X6,X4,X5)
      | net_str(X6,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)],[dt_m1_yellow_6])])])])]) ).

fof(c_0_11,negated_conjecture,
    ( one_sorted_str(esk1_0)
    & ~ empty_carrier(esk2_0)
    & net_str(esk2_0,esk1_0)
    & ~ empty_carrier(esk3_0)
    & full_subnetstr(esk3_0,esk1_0,esk2_0)
    & subnetstr(esk3_0,esk1_0,esk2_0)
    & element(esk4_0,the_carrier(esk2_0))
    & element(esk5_0,the_carrier(esk2_0))
    & element(esk6_0,the_carrier(esk3_0))
    & element(esk7_0,the_carrier(esk3_0))
    & esk4_0 = esk6_0
    & esk5_0 = esk7_0
    & related(esk2_0,esk4_0,esk5_0)
    & ~ related(esk3_0,esk6_0,esk7_0) ),
    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_9])])])])])]) ).

fof(c_0_12,plain,
    ! [X7,X8,X9,X10,X11,X12] :
      ( ~ rel_str(X7)
      | ~ full_subrelstr(X8,X7)
      | ~ subrelstr(X8,X7)
      | ~ element(X9,the_carrier(X7))
      | ~ element(X10,the_carrier(X7))
      | ~ element(X11,the_carrier(X8))
      | ~ element(X12,the_carrier(X8))
      | X11 != X9
      | X12 != X10
      | ~ related(X7,X9,X10)
      | ~ in(X11,the_carrier(X8))
      | ~ in(X12,the_carrier(X8))
      | related(X8,X11,X12) ),
    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)],[t61_yellow_0])])])])]) ).

fof(c_0_13,plain,
    ! [X3,X4] :
      ( ~ in(X3,X4)
      | element(X3,X4) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t1_subset])]) ).

fof(c_0_14,plain,
    ! [X3,X4] :
      ( ~ one_sorted_str(X3)
      | ~ net_str(X4,X3)
      | rel_str(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)],[dt_l1_waybel_0])])])])]) ).

cnf(c_0_15,plain,
    ( net_str(X1,X2)
    | ~ subnetstr(X1,X2,X3)
    | ~ net_str(X3,X2)
    | ~ one_sorted_str(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_10]) ).

cnf(c_0_16,negated_conjecture,
    subnetstr(esk3_0,esk1_0,esk2_0),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_17,negated_conjecture,
    net_str(esk2_0,esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_18,negated_conjecture,
    one_sorted_str(esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_19,plain,
    ( related(X1,X2,X3)
    | ~ in(X3,the_carrier(X1))
    | ~ in(X2,the_carrier(X1))
    | ~ related(X4,X5,X6)
    | X3 != X6
    | X2 != X5
    | ~ element(X3,the_carrier(X1))
    | ~ element(X2,the_carrier(X1))
    | ~ element(X6,the_carrier(X4))
    | ~ element(X5,the_carrier(X4))
    | ~ subrelstr(X1,X4)
    | ~ full_subrelstr(X1,X4)
    | ~ rel_str(X4) ),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_20,plain,
    ( element(X1,X2)
    | ~ in(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

cnf(c_0_21,negated_conjecture,
    related(esk2_0,esk4_0,esk5_0),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_22,negated_conjecture,
    esk5_0 = esk7_0,
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_23,negated_conjecture,
    element(esk5_0,the_carrier(esk2_0)),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_24,plain,
    ( rel_str(X1)
    | ~ net_str(X1,X2)
    | ~ one_sorted_str(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

fof(c_0_25,plain,
    ! [X4,X5,X6] :
      ( ( full_subrelstr(X6,X5)
        | ~ full_subnetstr(X6,X4,X5)
        | ~ subnetstr(X6,X4,X5)
        | ~ net_str(X5,X4)
        | ~ one_sorted_str(X4) )
      & ( subrelstr(X6,X5)
        | ~ full_subnetstr(X6,X4,X5)
        | ~ subnetstr(X6,X4,X5)
        | ~ net_str(X5,X4)
        | ~ one_sorted_str(X4) )
      & ( ~ full_subrelstr(X6,X5)
        | ~ subrelstr(X6,X5)
        | full_subnetstr(X6,X4,X5)
        | ~ subnetstr(X6,X4,X5)
        | ~ net_str(X5,X4)
        | ~ one_sorted_str(X4) ) ),
    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)],[d9_yellow_6])])])])])]) ).

fof(c_0_26,plain,
    ! [X2] :
      ( empty_carrier(X2)
      | ~ one_sorted_str(X2)
      | ~ empty(the_carrier(X2)) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[fc1_struct_0])])]) ).

fof(c_0_27,plain,
    ! [X2] :
      ( ~ rel_str(X2)
      | one_sorted_str(X2) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[dt_l1_orders_2])]) ).

cnf(c_0_28,negated_conjecture,
    net_str(esk3_0,esk1_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]),c_0_18])]) ).

cnf(c_0_29,plain,
    ( related(X1,X2,X3)
    | ~ related(X4,X2,X3)
    | ~ element(X3,the_carrier(X4))
    | ~ element(X2,the_carrier(X4))
    | ~ subrelstr(X1,X4)
    | ~ full_subrelstr(X1,X4)
    | ~ rel_str(X4)
    | ~ in(X3,the_carrier(X1))
    | ~ in(X2,the_carrier(X1)) ),
    inference(er,[status(thm)],[inference(er,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[c_0_19,c_0_20]),c_0_20])])]) ).

cnf(c_0_30,negated_conjecture,
    related(esk2_0,esk4_0,esk7_0),
    inference(rw,[status(thm)],[c_0_21,c_0_22]) ).

cnf(c_0_31,negated_conjecture,
    element(esk7_0,the_carrier(esk2_0)),
    inference(rw,[status(thm)],[c_0_23,c_0_22]) ).

cnf(c_0_32,negated_conjecture,
    element(esk4_0,the_carrier(esk2_0)),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_33,negated_conjecture,
    rel_str(esk2_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_17]),c_0_18])]) ).

cnf(c_0_34,plain,
    ( full_subrelstr(X3,X2)
    | ~ one_sorted_str(X1)
    | ~ net_str(X2,X1)
    | ~ subnetstr(X3,X1,X2)
    | ~ full_subnetstr(X3,X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_25]) ).

cnf(c_0_35,negated_conjecture,
    full_subnetstr(esk3_0,esk1_0,esk2_0),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_36,plain,
    ( subrelstr(X3,X2)
    | ~ one_sorted_str(X1)
    | ~ net_str(X2,X1)
    | ~ subnetstr(X3,X1,X2)
    | ~ full_subnetstr(X3,X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_25]) ).

cnf(c_0_37,negated_conjecture,
    ~ related(esk3_0,esk6_0,esk7_0),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_38,negated_conjecture,
    esk4_0 = esk6_0,
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_39,negated_conjecture,
    ~ empty_carrier(esk3_0),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_40,plain,
    ( empty_carrier(X1)
    | ~ empty(the_carrier(X1))
    | ~ one_sorted_str(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_26]) ).

cnf(c_0_41,plain,
    ( one_sorted_str(X1)
    | ~ rel_str(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_27]) ).

cnf(c_0_42,negated_conjecture,
    rel_str(esk3_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_28]),c_0_18])]) ).

cnf(c_0_43,negated_conjecture,
    ( related(X1,esk4_0,esk7_0)
    | ~ subrelstr(X1,esk2_0)
    | ~ full_subrelstr(X1,esk2_0)
    | ~ in(esk7_0,the_carrier(X1))
    | ~ in(esk4_0,the_carrier(X1)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31]),c_0_32]),c_0_33])]) ).

cnf(c_0_44,negated_conjecture,
    full_subrelstr(esk3_0,esk2_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_16]),c_0_17]),c_0_18])]) ).

cnf(c_0_45,negated_conjecture,
    subrelstr(esk3_0,esk2_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_35]),c_0_16]),c_0_17]),c_0_18])]) ).

cnf(c_0_46,negated_conjecture,
    ~ related(esk3_0,esk4_0,esk7_0),
    inference(rw,[status(thm)],[c_0_37,c_0_38]) ).

fof(c_0_47,plain,
    ! [X3,X4] :
      ( ~ element(X3,X4)
      | empty(X4)
      | in(X3,X4) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[t2_subset])]) ).

cnf(c_0_48,negated_conjecture,
    ( ~ one_sorted_str(esk3_0)
    | ~ empty(the_carrier(esk3_0)) ),
    inference(spm,[status(thm)],[c_0_39,c_0_40]) ).

cnf(c_0_49,negated_conjecture,
    one_sorted_str(esk3_0),
    inference(spm,[status(thm)],[c_0_41,c_0_42]) ).

cnf(c_0_50,negated_conjecture,
    ( ~ in(esk7_0,the_carrier(esk3_0))
    | ~ in(esk4_0,the_carrier(esk3_0)) ),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_44]),c_0_45])]),c_0_46]) ).

cnf(c_0_51,plain,
    ( in(X1,X2)
    | empty(X2)
    | ~ element(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_47]) ).

cnf(c_0_52,negated_conjecture,
    element(esk7_0,the_carrier(esk3_0)),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_53,negated_conjecture,
    ~ empty(the_carrier(esk3_0)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_48,c_0_49])]) ).

cnf(c_0_54,negated_conjecture,
    element(esk6_0,the_carrier(esk3_0)),
    inference(split_conjunct,[status(thm)],[c_0_11]) ).

cnf(c_0_55,negated_conjecture,
    ~ in(esk4_0,the_carrier(esk3_0)),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_52])]),c_0_53]) ).

cnf(c_0_56,negated_conjecture,
    element(esk4_0,the_carrier(esk3_0)),
    inference(rw,[status(thm)],[c_0_54,c_0_38]) ).

cnf(c_0_57,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_51]),c_0_56])]),c_0_53]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13  % Problem  : SEU375+1 : TPTP v8.1.0. Released v3.3.0.
% 0.12/0.13  % Command  : run_ET %s %d
% 0.13/0.35  % Computer : n004.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 600
% 0.13/0.35  % DateTime : Mon Jun 20 11:52:23 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.23/1.42  # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.23/1.42  # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.23/1.42  # Preprocessing time       : 0.017 s
% 0.23/1.42  
% 0.23/1.42  # Proof found!
% 0.23/1.42  # SZS status Theorem
% 0.23/1.42  # SZS output start CNFRefutation
% See solution above
% 0.23/1.42  # Proof object total steps             : 58
% 0.23/1.42  # Proof object clause steps            : 39
% 0.23/1.42  # Proof object formula steps           : 19
% 0.23/1.42  # Proof object conjectures             : 32
% 0.23/1.42  # Proof object clause conjectures      : 29
% 0.23/1.42  # Proof object formula conjectures     : 3
% 0.23/1.42  # Proof object initial clauses used    : 22
% 0.23/1.42  # Proof object initial formulas used   : 9
% 0.23/1.42  # Proof object generating inferences   : 11
% 0.23/1.42  # Proof object simplifying inferences  : 38
% 0.23/1.42  # Training examples: 0 positive, 0 negative
% 0.23/1.42  # Parsed axioms                        : 40
% 0.23/1.42  # Removed by relevancy pruning/SinE    : 17
% 0.23/1.42  # Initial clauses                      : 41
% 0.23/1.42  # Removed in clause preprocessing      : 0
% 0.23/1.42  # Initial clauses in saturation        : 41
% 0.23/1.42  # Processed clauses                    : 83
% 0.23/1.42  # ...of these trivial                  : 0
% 0.23/1.42  # ...subsumed                          : 2
% 0.23/1.42  # ...remaining for further processing  : 81
% 0.23/1.42  # Other redundant clauses eliminated   : 2
% 0.23/1.42  # Clauses deleted for lack of memory   : 0
% 0.23/1.42  # Backward-subsumed                    : 0
% 0.23/1.42  # Backward-rewritten                   : 1
% 0.23/1.42  # Generated clauses                    : 55
% 0.23/1.42  # ...of the previous two non-trivial   : 50
% 0.23/1.42  # Contextual simplify-reflections      : 2
% 0.23/1.42  # Paramodulations                      : 54
% 0.23/1.42  # Factorizations                       : 0
% 0.23/1.42  # Equation resolutions                 : 2
% 0.23/1.42  # Current number of processed clauses  : 79
% 0.23/1.42  #    Positive orientable unit clauses  : 26
% 0.23/1.42  #    Positive unorientable unit clauses: 0
% 0.23/1.42  #    Negative unit clauses             : 9
% 0.23/1.42  #    Non-unit-clauses                  : 44
% 0.23/1.42  # Current number of unprocessed clauses: 8
% 0.23/1.42  # ...number of literals in the above   : 27
% 0.23/1.42  # Current number of archived formulas  : 0
% 0.23/1.42  # Current number of archived clauses   : 1
% 0.23/1.42  # Clause-clause subsumption calls (NU) : 345
% 0.23/1.42  # Rec. Clause-clause subsumption calls : 175
% 0.23/1.42  # Non-unit clause-clause subsumptions  : 4
% 0.23/1.42  # Unit Clause-clause subsumption calls : 21
% 0.23/1.42  # Rewrite failures with RHS unbound    : 0
% 0.23/1.42  # BW rewrite match attempts            : 1
% 0.23/1.42  # BW rewrite match successes           : 1
% 0.23/1.42  # Condensation attempts                : 0
% 0.23/1.42  # Condensation successes               : 0
% 0.23/1.42  # Termbank termtop insertions          : 3228
% 0.23/1.42  
% 0.23/1.42  # -------------------------------------------------
% 0.23/1.42  # User time                : 0.017 s
% 0.23/1.42  # System time              : 0.004 s
% 0.23/1.42  # Total time               : 0.021 s
% 0.23/1.42  # Maximum resident set size: 3036 pages
%------------------------------------------------------------------------------