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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : ET---2.0
% Problem  : SWC225+1 : TPTP v8.1.0. Released v2.4.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_ET %s %d

% Computer : n024.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 20:27:27 EDT 2022

% Result   : Theorem 0.48s 34.65s
% Output   : CNFRefutation 0.48s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   14
%            Number of leaves      :   12
% Syntax   : Number of formulae    :   56 (   6 unt;   0 def)
%            Number of atoms       :  277 (  88 equ)
%            Maximal formula atoms :   48 (   4 avg)
%            Number of connectives :  366 ( 145   ~; 145   |;  48   &)
%                                         (   0 <=>;  28  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   33 (   6 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    7 (   5 usr;   1 prp; 0-2 aty)
%            Number of functors    :   12 (  12 usr;   7 con; 0-3 aty)
%            Number of variables   :  130 (   0 sgn  61   !;  20   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(ax80,axiom,
    ! [X1] :
      ( ssList(X1)
     => ! [X2] :
          ( ssList(X2)
         => ! [X3] :
              ( ssList(X3)
             => ( app(X2,X3) = app(X2,X1)
               => X3 = X1 ) ) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax80) ).

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

fof(ax17,axiom,
    ssList(nil),
    file('/export/starexec/sandbox2/benchmark/Axioms/SWC001+0.ax',ax17) ).

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

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

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

fof(co1,conjecture,
    ! [X1] :
      ( ssList(X1)
     => ! [X2] :
          ( ssList(X2)
         => ! [X3] :
              ( ssList(X3)
             => ! [X4] :
                  ( ~ ssList(X4)
                  | X2 != X4
                  | X1 != X3
                  | nil = X1
                  | ? [X5] :
                      ( ssItem(X5)
                      & ? [X6] :
                          ( ssList(X6)
                          & ? [X7] :
                              ( ssList(X7)
                              & app(app(X6,cons(X5,nil)),X7) = X1
                              & ! [X8] :
                                  ( ~ ssItem(X8)
                                  | ~ memberP(X6,X8)
                                  | ~ memberP(X7,X8)
                                  | ~ leq(X5,X8)
                                  | leq(X8,X5) ) ) ) )
                  | ! [X9] :
                      ( ssList(X9)
                     => ! [X10] :
                          ( ~ ssList(X10)
                          | app(app(X9,X3),X10) != X4
                          | ~ equalelemsP(X3)
                          | ? [X11] :
                              ( ssItem(X11)
                              & ? [X12] :
                                  ( ssList(X12)
                                  & app(X12,cons(X11,nil)) = X9
                                  & ? [X13] :
                                      ( ssList(X13)
                                      & app(cons(X11,nil),X13) = X3 ) ) )
                          | ? [X14] :
                              ( ssItem(X14)
                              & ? [X15] :
                                  ( ssList(X15)
                                  & app(cons(X14,nil),X15) = X10
                                  & ? [X16] :
                                      ( ssList(X16)
                                      & app(X16,cons(X14,nil)) = X3 ) ) ) ) )
                  | ( nil != X4
                    & nil = X3 ) ) ) ) ),
    file('/export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p',co1) ).

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

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

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

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

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

fof(c_0_12,plain,
    ! [X4,X5,X6] :
      ( ~ ssList(X4)
      | ~ ssList(X5)
      | ~ ssList(X6)
      | app(X5,X6) != app(X5,X4)
      | 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)],[ax80])])])])]) ).

fof(c_0_13,plain,
    ! [X2] :
      ( ~ ssList(X2)
      | app(X2,nil) = X2 ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[ax84])]) ).

cnf(c_0_14,plain,
    ( X1 = X2
    | app(X3,X1) != app(X3,X2)
    | ~ ssList(X1)
    | ~ ssList(X3)
    | ~ ssList(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

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

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

fof(c_0_17,plain,
    ! [X4,X5,X6] :
      ( ~ ssList(X4)
      | ~ ssList(X5)
      | ~ ssList(X6)
      | app(app(X4,X5),X6) = app(X4,app(X5,X6)) ),
    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)],[ax82])])])])]) ).

fof(c_0_18,plain,
    ! [X3,X4] :
      ( ~ ssList(X3)
      | ~ ssList(X4)
      | ssList(app(X3,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)],[ax26])])])])]) ).

cnf(c_0_19,plain,
    ( X1 = nil
    | app(X2,X1) != X2
    | ~ ssList(X2)
    | ~ ssList(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14,c_0_15]),c_0_16])]) ).

cnf(c_0_20,plain,
    ( app(app(X1,X2),X3) = app(X1,app(X2,X3))
    | ~ ssList(X3)
    | ~ ssList(X2)
    | ~ ssList(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_17]) ).

cnf(c_0_21,plain,
    ( ssList(app(X1,X2))
    | ~ ssList(X2)
    | ~ ssList(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_18]) ).

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

cnf(c_0_23,plain,
    ( X1 = nil
    | app(X2,app(X3,X1)) != app(X2,X3)
    | ~ ssList(X1)
    | ~ ssList(X3)
    | ~ ssList(X2) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_19,c_0_20]),c_0_21]) ).

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

cnf(c_0_25,plain,
    ( X1 = nil
    | app(X2,X1) != app(X2,nil)
    | ~ ssList(X1)
    | ~ ssList(X2) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_23,c_0_24]),c_0_16])]) ).

fof(c_0_26,negated_conjecture,
    ~ ! [X1] :
        ( ssList(X1)
       => ! [X2] :
            ( ssList(X2)
           => ! [X3] :
                ( ssList(X3)
               => ! [X4] :
                    ( ~ ssList(X4)
                    | X2 != X4
                    | X1 != X3
                    | nil = X1
                    | ? [X5] :
                        ( ssItem(X5)
                        & ? [X6] :
                            ( ssList(X6)
                            & ? [X7] :
                                ( ssList(X7)
                                & app(app(X6,cons(X5,nil)),X7) = X1
                                & ! [X8] :
                                    ( ~ ssItem(X8)
                                    | ~ memberP(X6,X8)
                                    | ~ memberP(X7,X8)
                                    | ~ leq(X5,X8)
                                    | leq(X8,X5) ) ) ) )
                    | ! [X9] :
                        ( ssList(X9)
                       => ! [X10] :
                            ( ~ ssList(X10)
                            | app(app(X9,X3),X10) != X4
                            | ~ equalelemsP(X3)
                            | ? [X11] :
                                ( ssItem(X11)
                                & ? [X12] :
                                    ( ssList(X12)
                                    & app(X12,cons(X11,nil)) = X9
                                    & ? [X13] :
                                        ( ssList(X13)
                                        & app(cons(X11,nil),X13) = X3 ) ) )
                            | ? [X14] :
                                ( ssItem(X14)
                                & ? [X15] :
                                    ( ssList(X15)
                                    & app(cons(X14,nil),X15) = X10
                                    & ? [X16] :
                                        ( ssList(X16)
                                        & app(X16,cons(X14,nil)) = X3 ) ) ) ) )
                    | ( nil != X4
                      & nil = X3 ) ) ) ) ),
    inference(assume_negation,[status(cth)],[co1]) ).

cnf(c_0_27,plain,
    ( X1 = nil
    | X1 != app(nil,nil)
    | ~ ssList(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_25,c_0_24]),c_0_16])]) ).

fof(c_0_28,plain,
    ! [X2] :
      ( ~ ssItem(X2)
      | ~ memberP(nil,X2) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[ax38])])]) ).

fof(c_0_29,negated_conjecture,
    ! [X21,X22,X23,X27,X28,X29,X30,X31,X32] :
      ( ssList(esk1_0)
      & ssList(esk2_0)
      & ssList(esk3_0)
      & ssList(esk4_0)
      & esk2_0 = esk4_0
      & esk1_0 = esk3_0
      & nil != esk1_0
      & ( ssItem(esk5_3(X21,X22,X23))
        | ~ ssList(X23)
        | app(app(X22,cons(X21,nil)),X23) != esk1_0
        | ~ ssList(X22)
        | ~ ssItem(X21) )
      & ( memberP(X22,esk5_3(X21,X22,X23))
        | ~ ssList(X23)
        | app(app(X22,cons(X21,nil)),X23) != esk1_0
        | ~ ssList(X22)
        | ~ ssItem(X21) )
      & ( memberP(X23,esk5_3(X21,X22,X23))
        | ~ ssList(X23)
        | app(app(X22,cons(X21,nil)),X23) != esk1_0
        | ~ ssList(X22)
        | ~ ssItem(X21) )
      & ( leq(X21,esk5_3(X21,X22,X23))
        | ~ ssList(X23)
        | app(app(X22,cons(X21,nil)),X23) != esk1_0
        | ~ ssList(X22)
        | ~ ssItem(X21) )
      & ( ~ leq(esk5_3(X21,X22,X23),X21)
        | ~ ssList(X23)
        | app(app(X22,cons(X21,nil)),X23) != esk1_0
        | ~ ssList(X22)
        | ~ ssItem(X21) )
      & ssList(esk6_0)
      & ssList(esk7_0)
      & app(app(esk6_0,esk3_0),esk7_0) = esk4_0
      & equalelemsP(esk3_0)
      & ( ~ ssItem(X27)
        | ~ ssList(X28)
        | app(X28,cons(X27,nil)) != esk6_0
        | ~ ssList(X29)
        | app(cons(X27,nil),X29) != esk3_0 )
      & ( ~ ssItem(X30)
        | ~ ssList(X31)
        | app(cons(X30,nil),X31) != esk7_0
        | ~ ssList(X32)
        | app(X32,cons(X30,nil)) != esk3_0 )
      & ( nil = esk4_0
        | nil != esk3_0 ) ),
    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)],[c_0_26])])])])])])])]) ).

fof(c_0_30,plain,
    ! [X3,X4] :
      ( ~ ssList(X3)
      | ~ ssItem(X4)
      | ssList(cons(X4,X3)) ),
    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)],[ax16])])])])]) ).

fof(c_0_31,plain,
    ! [X4,X5,X6] :
      ( ~ ssList(X4)
      | ~ ssList(X5)
      | ~ ssItem(X6)
      | cons(X6,app(X5,X4)) = app(cons(X6,X5),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)],[ax27])])])])]) ).

cnf(c_0_32,plain,
    ( app(nil,nil) = nil
    | ~ ssList(app(nil,nil)) ),
    inference(er,[status(thm)],[c_0_27]) ).

cnf(c_0_33,plain,
    ( ~ memberP(nil,X1)
    | ~ ssItem(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_28]) ).

cnf(c_0_34,negated_conjecture,
    ( memberP(X2,esk5_3(X1,X2,X3))
    | ~ ssItem(X1)
    | ~ ssList(X2)
    | app(app(X2,cons(X1,nil)),X3) != esk1_0
    | ~ ssList(X3) ),
    inference(split_conjunct,[status(thm)],[c_0_29]) ).

cnf(c_0_35,plain,
    ( ssList(cons(X1,X2))
    | ~ ssItem(X1)
    | ~ ssList(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_30]) ).

cnf(c_0_36,plain,
    ( cons(X1,app(X2,X3)) = app(cons(X1,X2),X3)
    | ~ ssItem(X1)
    | ~ ssList(X2)
    | ~ ssList(X3) ),
    inference(split_conjunct,[status(thm)],[c_0_31]) ).

cnf(c_0_37,plain,
    app(nil,nil) = nil,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_21]),c_0_16])]) ).

cnf(c_0_38,negated_conjecture,
    ( app(app(nil,cons(X1,nil)),X2) != esk1_0
    | ~ ssList(X2)
    | ~ ssItem(esk5_3(X1,nil,X2))
    | ~ ssItem(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_16])]) ).

cnf(c_0_39,negated_conjecture,
    ( ssItem(esk5_3(X1,X2,X3))
    | ~ ssItem(X1)
    | ~ ssList(X2)
    | app(app(X2,cons(X1,nil)),X3) != esk1_0
    | ~ ssList(X3) ),
    inference(split_conjunct,[status(thm)],[c_0_29]) ).

cnf(c_0_40,plain,
    ( ssList(app(cons(X1,X2),X3))
    | ~ ssList(X3)
    | ~ ssList(X2)
    | ~ ssItem(X1) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_21]) ).

cnf(c_0_41,plain,
    ( app(cons(X1,nil),nil) = cons(X1,nil)
    | ~ ssItem(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_37]),c_0_16])]) ).

cnf(c_0_42,negated_conjecture,
    ( app(app(nil,cons(X1,nil)),X2) != esk1_0
    | ~ ssList(X2)
    | ~ ssItem(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_16])]) ).

cnf(c_0_43,plain,
    ( ssList(cons(X1,nil))
    | ~ ssItem(X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_16])]) ).

fof(c_0_44,plain,
    ! [X3,X4] :
      ( ~ ssList(X3)
      | ~ ssItem(X4)
      | cons(X4,X3) = app(cons(X4,nil),X3) ),
    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)],[ax81])])])])]) ).

cnf(c_0_45,negated_conjecture,
    ( app(cons(X1,nil),X2) != esk1_0
    | ~ ssList(X2)
    | ~ ssItem(X1) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_24]),c_0_43]) ).

cnf(c_0_46,plain,
    ( cons(X1,X2) = app(cons(X1,nil),X2)
    | ~ ssItem(X1)
    | ~ ssList(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_44]) ).

fof(c_0_47,plain,
    ! [X4] :
      ( ( ssList(esk8_1(X4))
        | nil = X4
        | ~ ssList(X4) )
      & ( ssItem(esk9_1(X4))
        | nil = X4
        | ~ ssList(X4) )
      & ( cons(esk9_1(X4),esk8_1(X4)) = X4
        | nil = X4
        | ~ ssList(X4) ) ),
    inference(distribute,[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)],[ax20])])])])])]) ).

cnf(c_0_48,negated_conjecture,
    ( cons(X1,X2) != esk1_0
    | ~ ssList(X2)
    | ~ ssItem(X1) ),
    inference(spm,[status(thm)],[c_0_45,c_0_46]) ).

cnf(c_0_49,plain,
    ( nil = X1
    | cons(esk9_1(X1),esk8_1(X1)) = X1
    | ~ ssList(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_47]) ).

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

cnf(c_0_51,plain,
    ( nil = X1
    | ssList(esk8_1(X1))
    | ~ ssList(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_47]) ).

cnf(c_0_52,negated_conjecture,
    ( nil = X1
    | X1 != esk1_0
    | ~ ssList(X1) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_50]),c_0_51]) ).

cnf(c_0_53,negated_conjecture,
    ssList(esk1_0),
    inference(split_conjunct,[status(thm)],[c_0_29]) ).

cnf(c_0_54,negated_conjecture,
    nil != esk1_0,
    inference(split_conjunct,[status(thm)],[c_0_29]) ).

cnf(c_0_55,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_54]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.13  % Problem  : SWC225+1 : TPTP v8.1.0. Released v2.4.0.
% 0.10/0.13  % Command  : run_ET %s %d
% 0.14/0.35  % Computer : n024.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  : 600
% 0.14/0.35  % DateTime : Sun Jun 12 07:38:04 EDT 2022
% 0.14/0.35  % CPUTime  : 
% 0.41/23.42  eprover: CPU time limit exceeded, terminating
% 0.41/23.42  eprover: CPU time limit exceeded, terminating
% 0.41/23.43  eprover: CPU time limit exceeded, terminating
% 0.41/23.43  eprover: CPU time limit exceeded, terminating
% 0.48/34.65  # Running protocol protocol_eprover_63dc1b1eb7d762c2f3686774d32795976f981b97 for 23 seconds:
% 0.48/34.65  
% 0.48/34.65  # Failure: Resource limit exceeded (time)
% 0.48/34.65  # OLD status Res
% 0.48/34.65  # Preprocessing time       : 0.026 s
% 0.48/34.65  # Running protocol protocol_eprover_f6eb5f7f05126ea361481ae651a4823314e3d740 for 23 seconds:
% 0.48/34.65  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,02,20000,1.0)
% 0.48/34.65  # Preprocessing time       : 0.012 s
% 0.48/34.65  
% 0.48/34.65  # Proof found!
% 0.48/34.65  # SZS status Theorem
% 0.48/34.65  # SZS output start CNFRefutation
% See solution above
% 0.48/34.65  # Proof object total steps             : 56
% 0.48/34.65  # Proof object clause steps            : 32
% 0.48/34.65  # Proof object formula steps           : 24
% 0.48/34.65  # Proof object conjectures             : 13
% 0.48/34.65  # Proof object clause conjectures      : 10
% 0.48/34.65  # Proof object formula conjectures     : 3
% 0.48/34.65  # Proof object initial clauses used    : 17
% 0.48/34.65  # Proof object initial formulas used   : 12
% 0.48/34.65  # Proof object generating inferences   : 15
% 0.48/34.65  # Proof object simplifying inferences  : 22
% 0.48/34.65  # Training examples: 0 positive, 0 negative
% 0.48/34.65  # Parsed axioms                        : 96
% 0.48/34.65  # Removed by relevancy pruning/SinE    : 63
% 0.48/34.65  # Initial clauses                      : 73
% 0.48/34.65  # Removed in clause preprocessing      : 0
% 0.48/34.65  # Initial clauses in saturation        : 73
% 0.48/34.65  # Processed clauses                    : 36105
% 0.48/34.65  # ...of these trivial                  : 121
% 0.48/34.65  # ...subsumed                          : 32796
% 0.48/34.65  # ...remaining for further processing  : 3188
% 0.48/34.65  # Other redundant clauses eliminated   : 11
% 0.48/34.65  # Clauses deleted for lack of memory   : 0
% 0.48/34.65  # Backward-subsumed                    : 519
% 0.48/34.65  # Backward-rewritten                   : 23
% 0.48/34.65  # Generated clauses                    : 85577
% 0.48/34.65  # ...of the previous two non-trivial   : 84630
% 0.48/34.65  # Contextual simplify-reflections      : 49630
% 0.48/34.65  # Paramodulations                      : 85489
% 0.48/34.65  # Factorizations                       : 0
% 0.48/34.65  # Equation resolutions                 : 44
% 0.48/34.65  # Current number of processed clauses  : 2632
% 0.48/34.65  #    Positive orientable unit clauses  : 32
% 0.48/34.65  #    Positive unorientable unit clauses: 0
% 0.48/34.65  #    Negative unit clauses             : 18
% 0.48/34.65  #    Non-unit-clauses                  : 2582
% 0.48/34.65  # Current number of unprocessed clauses: 39182
% 0.48/34.65  # ...number of literals in the above   : 319199
% 0.48/34.65  # Current number of archived formulas  : 0
% 0.48/34.65  # Current number of archived clauses   : 542
% 0.48/34.65  # Clause-clause subsumption calls (NU) : 20150343
% 0.48/34.65  # Rec. Clause-clause subsumption calls : 867680
% 0.48/34.65  # Non-unit clause-clause subsumptions  : 78394
% 0.48/34.65  # Unit Clause-clause subsumption calls : 3786
% 0.48/34.65  # Rewrite failures with RHS unbound    : 0
% 0.48/34.65  # BW rewrite match attempts            : 19
% 0.48/34.65  # BW rewrite match successes           : 19
% 0.48/34.65  # Condensation attempts                : 0
% 0.48/34.65  # Condensation successes               : 0
% 0.48/34.65  # Termbank termtop insertions          : 2065944
% 0.48/34.65  
% 0.48/34.65  # -------------------------------------------------
% 0.48/34.65  # User time                : 11.105 s
% 0.48/34.65  # System time              : 0.025 s
% 0.48/34.65  # Total time               : 11.130 s
% 0.48/34.65  # Maximum resident set size: 43712 pages
% 0.48/46.43  eprover: CPU time limit exceeded, terminating
% 0.48/46.44  eprover: CPU time limit exceeded, terminating
% 0.48/46.44  eprover: CPU time limit exceeded, terminating
% 0.48/46.45  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.48/46.45  eprover: No such file or directory
% 0.48/46.45  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.48/46.45  eprover: No such file or directory
% 0.48/46.46  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.48/46.46  eprover: No such file or directory
% 0.48/46.46  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.48/46.46  eprover: No such file or directory
% 0.48/46.46  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.48/46.46  eprover: No such file or directory
% 0.48/46.46  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.48/46.46  eprover: No such file or directory
% 0.48/46.47  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.48/46.47  eprover: No such file or directory
% 0.48/46.47  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.48/46.47  eprover: No such file or directory
% 0.48/46.47  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.48/46.47  eprover: No such file or directory
% 0.48/46.47  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.48/46.47  eprover: No such file or directory
% 0.48/46.47  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.48/46.47  eprover: No such file or directory
% 0.48/46.47  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.48/46.47  eprover: No such file or directory
% 0.48/46.48  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.48/46.48  eprover: No such file or directory
% 0.48/46.48  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.48/46.48  eprover: No such file or directory
% 0.48/46.48  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.48/46.48  eprover: No such file or directory
% 0.48/46.48  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.48/46.48  eprover: No such file or directory
% 0.48/46.48  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.48/46.48  eprover: No such file or directory
% 0.48/46.48  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.48/46.48  eprover: No such file or directory
% 0.48/46.49  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.48/46.49  eprover: No such file or directory
% 0.48/46.49  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.48/46.49  eprover: No such file or directory
% 0.48/46.49  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.48/46.49  eprover: No such file or directory
% 0.48/46.49  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.48/46.49  eprover: No such file or directory
% 0.48/46.49  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.48/46.49  eprover: No such file or directory
% 0.48/46.49  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.48/46.49  eprover: No such file or directory
% 0.48/46.49  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.48/46.49  eprover: No such file or directory
% 0.48/46.49  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.48/46.49  eprover: No such file or directory
% 0.48/46.50  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.48/46.50  eprover: No such file or directory
% 0.48/46.50  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.48/46.50  eprover: No such file or directory
% 0.48/46.50  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.48/46.50  eprover: No such file or directory
% 0.48/46.50  eprover: Cannot stat file /export/starexec/sandbox2/solver/bin/../tmp/theBenchmark.p
% 0.48/46.50  eprover: No such file or directory
%------------------------------------------------------------------------------