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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : ET---2.0
% Problem  : SWV492+1 : TPTP v8.1.0. Released v4.0.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 : Wed Jul 20 18:17:01 EDT 2022

% Result   : Theorem 0.24s 5.43s
% Output   : CNFRefutation 0.24s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   26
%            Number of leaves      :   13
% Syntax   : Number of formulae    :  155 (  21 unt;   0 def)
%            Number of atoms       :  498 ( 125 equ)
%            Maximal formula atoms :   32 (   3 avg)
%            Number of connectives :  528 ( 185   ~; 252   |;  62   &)
%                                         (   4 <=>;  25  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   18 (   4 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :   13 (  13 usr;   9 con; 0-2 aty)
%            Number of variables   :  200 (   6 sgn  84   !;   1   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(plus_and_inverse,axiom,
    ! [X1,X2] :
      ( int_less(X1,X2)
    <=> ? [X3] :
          ( plus(X1,X3) = X2
          & int_less(int_zero,X3) ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',plus_and_inverse) ).

fof(int_less_irreflexive,axiom,
    ! [X1,X2] :
      ( int_less(X1,X2)
     => X1 != X2 ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',int_less_irreflexive) ).

fof(int_less_transitive,axiom,
    ! [X1,X2,X3] :
      ( ( int_less(X1,X2)
        & int_less(X2,X3) )
     => int_less(X1,X3) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',int_less_transitive) ).

fof(plus_and_order1,axiom,
    ! [X4,X5,X6,X7] :
      ( ( int_less(X4,X5)
        & int_leq(X6,X7) )
     => int_leq(plus(X4,X6),plus(X5,X7)) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',plus_and_order1) ).

fof(plus_commutative,axiom,
    ! [X1,X2] : plus(X1,X2) = plus(X2,X1),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',plus_commutative) ).

fof(plus_zero,axiom,
    ! [X1] : plus(X1,int_zero) = X1,
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',plus_zero) ).

fof(int_leq,axiom,
    ! [X1,X2] :
      ( int_leq(X1,X2)
    <=> ( int_less(X1,X2)
        | X1 = X2 ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',int_leq) ).

fof(lti,conjecture,
    ( ! [X1,X2] :
        ( ( int_leq(int_one,X1)
          & int_less(X1,X2)
          & int_leq(X2,n) )
       => a(X1,X2) = real_zero )
    & ! [X1,X2] :
        ( ( int_leq(int_one,X1)
          & int_leq(X2,n)
          & X1 = X2 )
       => a(X1,X2) != real_zero ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',lti) ).

fof(qih,hypothesis,
    ! [X1,X2] :
      ( ( int_leq(int_one,X1)
        & int_leq(X1,n)
        & int_leq(int_one,X2)
        & int_leq(X2,n) )
     => ( ! [X8] :
            ( ( int_less(int_zero,X8)
              & X1 = plus(X2,X8) )
           => ! [X3] :
                ( ( int_leq(int_one,X3)
                  & int_leq(X3,X2) )
               => a(plus(X3,X8),X3) = qr(plus(X3,X8),X3) ) )
        & ! [X3] :
            ( ( int_leq(int_one,X3)
              & int_leq(X3,X2) )
           => a(X3,X3) = real_one )
        & ! [X8] :
            ( ( int_less(int_zero,X8)
              & X2 = plus(X1,X8) )
           => ! [X3] :
                ( ( int_leq(int_one,X3)
                  & int_leq(X3,X1) )
               => a(X3,plus(X3,X8)) = real_zero ) ) ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',qih) ).

fof(int_less_total,axiom,
    ! [X1,X2] :
      ( int_less(X1,X2)
      | int_leq(X2,X1) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',int_less_total) ).

fof(one_successor_of_zero,axiom,
    ! [X1] :
      ( int_less(int_zero,X1)
    <=> int_leq(int_one,X1) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',one_successor_of_zero) ).

fof(real_constants,axiom,
    real_zero != real_one,
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p',real_constants) ).

fof(c_0_12,plain,
    ! [X4,X5,X4,X5,X7] :
      ( ( plus(X4,esk1_2(X4,X5)) = X5
        | ~ int_less(X4,X5) )
      & ( int_less(int_zero,esk1_2(X4,X5))
        | ~ int_less(X4,X5) )
      & ( plus(X4,X7) != X5
        | ~ int_less(int_zero,X7)
        | int_less(X4,X5) ) ),
    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)],[plus_and_inverse])])])])])])]) ).

fof(c_0_13,plain,
    ! [X3,X4] :
      ( ~ int_less(X3,X4)
      | X3 != X4 ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[int_less_irreflexive])]) ).

fof(c_0_14,plain,
    ! [X4,X5,X6] :
      ( ~ int_less(X4,X5)
      | ~ int_less(X5,X6)
      | int_less(X4,X6) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[int_less_transitive])]) ).

cnf(c_0_15,plain,
    ( int_less(X1,X2)
    | ~ int_less(int_zero,X3)
    | plus(X1,X3) != X2 ),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

fof(c_0_16,plain,
    ! [X2,X1] :
      ( epred1_2(X1,X2)
    <=> ( ! [X8] :
            ( ( int_less(int_zero,X8)
              & X1 = plus(X2,X8) )
           => ! [X3] :
                ( ( int_leq(int_one,X3)
                  & int_leq(X3,X2) )
               => a(plus(X3,X8),X3) = qr(plus(X3,X8),X3) ) )
        & ! [X3] :
            ( ( int_leq(int_one,X3)
              & int_leq(X3,X2) )
           => a(X3,X3) = real_one )
        & ! [X8] :
            ( ( int_less(int_zero,X8)
              & X2 = plus(X1,X8) )
           => ! [X3] :
                ( ( int_leq(int_one,X3)
                  & int_leq(X3,X1) )
               => a(X3,plus(X3,X8)) = real_zero ) ) ) ),
    introduced(definition) ).

cnf(c_0_17,plain,
    ( X1 != X2
    | ~ int_less(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_13]) ).

cnf(c_0_18,plain,
    ( int_less(X1,X2)
    | ~ int_less(X3,X2)
    | ~ int_less(X1,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_14]) ).

cnf(c_0_19,plain,
    ( int_less(X1,plus(X1,X2))
    | ~ int_less(int_zero,X2) ),
    inference(er,[status(thm)],[c_0_15]) ).

fof(c_0_20,plain,
    ! [X8,X9,X10,X11] :
      ( ~ int_less(X8,X9)
      | ~ int_leq(X10,X11)
      | int_leq(plus(X8,X10),plus(X9,X11)) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[plus_and_order1])]) ).

fof(c_0_21,plain,
    ! [X3,X4] : plus(X3,X4) = plus(X4,X3),
    inference(variable_rename,[status(thm)],[plus_commutative]) ).

fof(c_0_22,plain,
    ! [X2,X1] :
      ( epred1_2(X1,X2)
     => ( ! [X8] :
            ( ( int_less(int_zero,X8)
              & X1 = plus(X2,X8) )
           => ! [X3] :
                ( ( int_leq(int_one,X3)
                  & int_leq(X3,X2) )
               => a(plus(X3,X8),X3) = qr(plus(X3,X8),X3) ) )
        & ! [X3] :
            ( ( int_leq(int_one,X3)
              & int_leq(X3,X2) )
           => a(X3,X3) = real_one )
        & ! [X8] :
            ( ( int_less(int_zero,X8)
              & X2 = plus(X1,X8) )
           => ! [X3] :
                ( ( int_leq(int_one,X3)
                  & int_leq(X3,X1) )
               => a(X3,plus(X3,X8)) = real_zero ) ) ) ),
    inference(split_equiv,[status(thm)],[c_0_16]) ).

cnf(c_0_23,plain,
    ~ int_less(X1,X1),
    inference(er,[status(thm)],[c_0_17]) ).

cnf(c_0_24,plain,
    ( int_less(X1,plus(X2,X3))
    | ~ int_less(int_zero,X3)
    | ~ int_less(X1,X2) ),
    inference(spm,[status(thm)],[c_0_18,c_0_19]) ).

cnf(c_0_25,plain,
    ( int_leq(plus(X1,X2),plus(X3,X4))
    | ~ int_leq(X2,X4)
    | ~ int_less(X1,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_20]) ).

cnf(c_0_26,plain,
    plus(X1,X2) = plus(X2,X1),
    inference(split_conjunct,[status(thm)],[c_0_21]) ).

fof(c_0_27,plain,
    ! [X2] : plus(X2,int_zero) = X2,
    inference(variable_rename,[status(thm)],[plus_zero]) ).

fof(c_0_28,plain,
    ! [X9,X10,X11,X12,X13,X14,X15] :
      ( ( ~ int_less(int_zero,X11)
        | X10 != plus(X9,X11)
        | ~ int_leq(int_one,X12)
        | ~ int_leq(X12,X9)
        | a(plus(X12,X11),X12) = qr(plus(X12,X11),X12)
        | ~ epred1_2(X10,X9) )
      & ( ~ int_leq(int_one,X13)
        | ~ int_leq(X13,X9)
        | a(X13,X13) = real_one
        | ~ epred1_2(X10,X9) )
      & ( ~ int_less(int_zero,X14)
        | X9 != plus(X10,X14)
        | ~ int_leq(int_one,X15)
        | ~ int_leq(X15,X10)
        | a(X15,plus(X15,X14)) = real_zero
        | ~ epred1_2(X10,X9) ) ),
    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)],[c_0_22])])])])])]) ).

fof(c_0_29,plain,
    ! [X3,X4,X3,X4] :
      ( ( ~ int_leq(X3,X4)
        | int_less(X3,X4)
        | X3 = X4 )
      & ( ~ int_less(X3,X4)
        | int_leq(X3,X4) )
      & ( X3 != X4
        | int_leq(X3,X4) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[int_leq])])])])]) ).

cnf(c_0_30,plain,
    ( ~ int_less(plus(X1,X2),X1)
    | ~ int_less(int_zero,X2) ),
    inference(spm,[status(thm)],[c_0_23,c_0_24]) ).

cnf(c_0_31,plain,
    ( plus(X1,esk1_2(X1,X2)) = X2
    | ~ int_less(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_32,plain,
    ( int_less(int_zero,esk1_2(X1,X2))
    | ~ int_less(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_33,plain,
    ( int_leq(plus(X1,X2),plus(X3,X4))
    | ~ int_less(X1,X4)
    | ~ int_leq(X2,X3) ),
    inference(spm,[status(thm)],[c_0_25,c_0_26]) ).

cnf(c_0_34,plain,
    plus(X1,int_zero) = X1,
    inference(split_conjunct,[status(thm)],[c_0_27]) ).

fof(c_0_35,negated_conjecture,
    ~ ( ! [X1,X2] :
          ( ( int_leq(int_one,X1)
            & int_less(X1,X2)
            & int_leq(X2,n) )
         => a(X1,X2) = real_zero )
      & ! [X1,X2] :
          ( ( int_leq(int_one,X1)
            & int_leq(X2,n)
            & X1 = X2 )
         => a(X1,X2) != real_zero ) ),
    inference(assume_negation,[status(cth)],[lti]) ).

cnf(c_0_36,plain,
    ( a(X3,plus(X3,X4)) = real_zero
    | ~ epred1_2(X1,X2)
    | ~ int_leq(X3,X1)
    | ~ int_leq(int_one,X3)
    | X2 != plus(X1,X4)
    | ~ int_less(int_zero,X4) ),
    inference(split_conjunct,[status(thm)],[c_0_28]) ).

cnf(c_0_37,plain,
    ( int_leq(X1,X2)
    | X1 != X2 ),
    inference(split_conjunct,[status(thm)],[c_0_29]) ).

fof(c_0_38,hypothesis,
    ! [X1,X2] :
      ( ( int_leq(int_one,X1)
        & int_leq(X1,n)
        & int_leq(int_one,X2)
        & int_leq(X2,n) )
     => epred1_2(X1,X2) ),
    inference(apply_def,[status(thm)],[qih,c_0_16]) ).

cnf(c_0_39,plain,
    ( ~ int_less(X1,X2)
    | ~ int_less(X2,X1) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]) ).

cnf(c_0_40,plain,
    ( X1 = X2
    | int_less(X1,X2)
    | ~ int_leq(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_29]) ).

cnf(c_0_41,plain,
    ( int_leq(plus(X1,X2),X3)
    | ~ int_less(X1,esk1_2(X4,X3))
    | ~ int_less(X4,X3)
    | ~ int_leq(X2,X4) ),
    inference(spm,[status(thm)],[c_0_33,c_0_31]) ).

cnf(c_0_42,plain,
    plus(int_zero,X1) = X1,
    inference(spm,[status(thm)],[c_0_34,c_0_26]) ).

fof(c_0_43,negated_conjecture,
    ( ( int_leq(int_one,esk4_0)
      | int_leq(int_one,esk2_0) )
    & ( int_leq(esk5_0,n)
      | int_leq(int_one,esk2_0) )
    & ( esk4_0 = esk5_0
      | int_leq(int_one,esk2_0) )
    & ( a(esk4_0,esk5_0) = real_zero
      | int_leq(int_one,esk2_0) )
    & ( int_leq(int_one,esk4_0)
      | int_less(esk2_0,esk3_0) )
    & ( int_leq(esk5_0,n)
      | int_less(esk2_0,esk3_0) )
    & ( esk4_0 = esk5_0
      | int_less(esk2_0,esk3_0) )
    & ( a(esk4_0,esk5_0) = real_zero
      | int_less(esk2_0,esk3_0) )
    & ( int_leq(int_one,esk4_0)
      | int_leq(esk3_0,n) )
    & ( int_leq(esk5_0,n)
      | int_leq(esk3_0,n) )
    & ( esk4_0 = esk5_0
      | int_leq(esk3_0,n) )
    & ( a(esk4_0,esk5_0) = real_zero
      | int_leq(esk3_0,n) )
    & ( int_leq(int_one,esk4_0)
      | a(esk2_0,esk3_0) != real_zero )
    & ( int_leq(esk5_0,n)
      | a(esk2_0,esk3_0) != real_zero )
    & ( esk4_0 = esk5_0
      | a(esk2_0,esk3_0) != real_zero )
    & ( a(esk4_0,esk5_0) = real_zero
      | a(esk2_0,esk3_0) != real_zero ) ),
    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)],[c_0_35])])])])])]) ).

fof(c_0_44,plain,
    ! [X3,X4] :
      ( int_less(X3,X4)
      | int_leq(X4,X3) ),
    inference(variable_rename,[status(thm)],[int_less_total]) ).

cnf(c_0_45,plain,
    ( a(X1,plus(X1,esk1_2(X2,X3))) = real_zero
    | ~ epred1_2(X2,X3)
    | ~ int_less(X2,X3)
    | ~ int_leq(int_one,X1)
    | ~ int_leq(X1,X2) ),
    inference(csr,[status(thm)],[inference(er,[status(thm)],[inference(spm,[status(thm)],[c_0_36,c_0_31])]),c_0_32]) ).

cnf(c_0_46,plain,
    int_leq(X1,X1),
    inference(er,[status(thm)],[c_0_37]) ).

fof(c_0_47,hypothesis,
    ! [X3,X4] :
      ( ~ int_leq(int_one,X3)
      | ~ int_leq(X3,n)
      | ~ int_leq(int_one,X4)
      | ~ int_leq(X4,n)
      | epred1_2(X3,X4) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_38])]) ).

cnf(c_0_48,plain,
    ( X1 = X2
    | ~ int_less(X2,X1)
    | ~ int_leq(X1,X2) ),
    inference(spm,[status(thm)],[c_0_39,c_0_40]) ).

cnf(c_0_49,plain,
    ( int_leq(X1,X2)
    | ~ int_less(X3,X2)
    | ~ int_leq(X1,X3) ),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_41,c_0_32]),c_0_42]) ).

cnf(c_0_50,negated_conjecture,
    ( int_less(esk2_0,esk3_0)
    | esk4_0 = esk5_0 ),
    inference(split_conjunct,[status(thm)],[c_0_43]) ).

cnf(c_0_51,plain,
    ( int_leq(X1,X2)
    | int_less(X2,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_44]) ).

fof(c_0_52,plain,
    ! [X2,X2] :
      ( ( ~ int_less(int_zero,X2)
        | int_leq(int_one,X2) )
      & ( ~ int_leq(int_one,X2)
        | int_less(int_zero,X2) ) ),
    inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[one_successor_of_zero])])])]) ).

cnf(c_0_53,negated_conjecture,
    ( int_less(esk2_0,esk3_0)
    | int_leq(esk5_0,n) ),
    inference(split_conjunct,[status(thm)],[c_0_43]) ).

cnf(c_0_54,plain,
    ( a(X1,X2) = real_zero
    | ~ epred1_2(X1,X2)
    | ~ int_less(X1,X2)
    | ~ int_leq(int_one,X1) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_31]),c_0_46])]) ).

cnf(c_0_55,hypothesis,
    ( epred1_2(X1,X2)
    | ~ int_leq(X2,n)
    | ~ int_leq(int_one,X2)
    | ~ int_leq(X1,n)
    | ~ int_leq(int_one,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_47]) ).

cnf(c_0_56,plain,
    ( X1 = X2
    | ~ int_leq(X1,X2)
    | ~ int_leq(X2,X1) ),
    inference(spm,[status(thm)],[c_0_48,c_0_40]) ).

cnf(c_0_57,negated_conjecture,
    ( esk4_0 = esk5_0
    | int_leq(X1,esk3_0)
    | ~ int_leq(X1,esk2_0) ),
    inference(spm,[status(thm)],[c_0_49,c_0_50]) ).

cnf(c_0_58,plain,
    ( int_leq(X1,X2)
    | int_leq(X3,X1)
    | ~ int_leq(X3,X2) ),
    inference(spm,[status(thm)],[c_0_49,c_0_51]) ).

cnf(c_0_59,negated_conjecture,
    ( int_leq(esk3_0,n)
    | esk4_0 = esk5_0 ),
    inference(split_conjunct,[status(thm)],[c_0_43]) ).

cnf(c_0_60,plain,
    ( int_leq(int_one,X1)
    | ~ int_less(int_zero,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_52]) ).

cnf(c_0_61,negated_conjecture,
    ( int_less(X1,esk3_0)
    | int_leq(esk5_0,n)
    | ~ int_less(X1,esk2_0) ),
    inference(spm,[status(thm)],[c_0_18,c_0_53]) ).

cnf(c_0_62,negated_conjecture,
    ( esk4_0 = esk5_0
    | a(esk2_0,esk3_0) != real_zero ),
    inference(split_conjunct,[status(thm)],[c_0_43]) ).

cnf(c_0_63,hypothesis,
    ( a(X1,X2) = real_zero
    | ~ int_less(X1,X2)
    | ~ int_leq(int_one,X1)
    | ~ int_leq(X2,n)
    | ~ int_leq(X1,n) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_49]) ).

cnf(c_0_64,negated_conjecture,
    ( int_leq(int_one,esk2_0)
    | esk4_0 = esk5_0 ),
    inference(split_conjunct,[status(thm)],[c_0_43]) ).

cnf(c_0_65,negated_conjecture,
    ( esk4_0 = esk5_0
    | X1 = esk3_0
    | ~ int_leq(esk3_0,X1)
    | ~ int_leq(X1,esk2_0) ),
    inference(spm,[status(thm)],[c_0_56,c_0_57]) ).

cnf(c_0_66,negated_conjecture,
    ( esk4_0 = esk5_0
    | int_leq(esk3_0,X1)
    | int_leq(X1,n) ),
    inference(spm,[status(thm)],[c_0_58,c_0_59]) ).

cnf(c_0_67,negated_conjecture,
    ( int_less(esk2_0,esk3_0)
    | int_leq(int_one,esk4_0) ),
    inference(split_conjunct,[status(thm)],[c_0_43]) ).

cnf(c_0_68,plain,
    ( a(X3,X3) = real_one
    | ~ epred1_2(X1,X2)
    | ~ int_leq(X3,X2)
    | ~ int_leq(int_one,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_28]) ).

cnf(c_0_69,plain,
    ( int_leq(X1,X2)
    | ~ int_less(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_29]) ).

cnf(c_0_70,negated_conjecture,
    ( int_leq(esk5_0,n)
    | int_leq(int_one,esk3_0)
    | ~ int_less(int_zero,esk2_0) ),
    inference(spm,[status(thm)],[c_0_60,c_0_61]) ).

cnf(c_0_71,plain,
    ( int_less(int_zero,X1)
    | ~ int_leq(int_one,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_52]) ).

cnf(c_0_72,negated_conjecture,
    ( int_leq(int_one,esk2_0)
    | int_leq(esk5_0,n) ),
    inference(split_conjunct,[status(thm)],[c_0_43]) ).

cnf(c_0_73,negated_conjecture,
    ( esk4_0 = esk5_0
    | ~ int_leq(esk2_0,n) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_59]),c_0_64]),c_0_50]) ).

cnf(c_0_74,negated_conjecture,
    ( esk4_0 = esk5_0
    | X1 = esk3_0
    | int_leq(X1,n)
    | ~ int_leq(X1,esk2_0) ),
    inference(spm,[status(thm)],[c_0_65,c_0_66]) ).

cnf(c_0_75,negated_conjecture,
    ( int_less(X1,esk3_0)
    | int_leq(int_one,esk4_0)
    | ~ int_less(X1,esk2_0) ),
    inference(spm,[status(thm)],[c_0_18,c_0_67]) ).

cnf(c_0_76,hypothesis,
    ( a(X1,X1) = real_one
    | ~ int_leq(int_one,X1)
    | ~ int_leq(X2,n)
    | ~ int_leq(X3,n)
    | ~ int_leq(int_one,X2)
    | ~ int_leq(int_one,X3)
    | ~ int_leq(X1,X2) ),
    inference(spm,[status(thm)],[c_0_68,c_0_55]) ).

cnf(c_0_77,plain,
    ( int_leq(X1,X2)
    | int_leq(X2,X1) ),
    inference(spm,[status(thm)],[c_0_69,c_0_51]) ).

cnf(c_0_78,negated_conjecture,
    ( int_leq(int_one,esk3_0)
    | int_leq(esk5_0,n) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_70,c_0_71]),c_0_72]) ).

cnf(c_0_79,negated_conjecture,
    ( esk3_0 = esk2_0
    | esk4_0 = esk5_0 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_74]),c_0_46])]) ).

cnf(c_0_80,negated_conjecture,
    ( int_leq(int_one,esk4_0)
    | int_leq(int_one,esk3_0)
    | ~ int_less(int_zero,esk2_0) ),
    inference(spm,[status(thm)],[c_0_60,c_0_75]) ).

cnf(c_0_81,negated_conjecture,
    ( int_leq(int_one,esk2_0)
    | int_leq(int_one,esk4_0) ),
    inference(split_conjunct,[status(thm)],[c_0_43]) ).

cnf(c_0_82,hypothesis,
    ( a(X1,X1) = real_one
    | int_leq(n,X2)
    | ~ int_leq(int_one,X1)
    | ~ int_leq(X3,n)
    | ~ int_leq(int_one,X2)
    | ~ int_leq(int_one,X3)
    | ~ int_leq(X1,X2) ),
    inference(spm,[status(thm)],[c_0_76,c_0_77]) ).

cnf(c_0_83,negated_conjecture,
    ( a(X1,X1) = real_one
    | int_leq(int_one,esk3_0)
    | ~ int_leq(int_one,esk5_0)
    | ~ int_leq(int_one,X1)
    | ~ int_leq(X2,n)
    | ~ int_leq(int_one,X2)
    | ~ int_leq(X1,esk5_0) ),
    inference(spm,[status(thm)],[c_0_76,c_0_78]) ).

cnf(c_0_84,negated_conjecture,
    ( int_less(esk2_0,esk3_0)
    | a(esk4_0,esk5_0) = real_zero ),
    inference(split_conjunct,[status(thm)],[c_0_43]) ).

cnf(c_0_85,negated_conjecture,
    esk4_0 = esk5_0,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_79]),c_0_23]) ).

cnf(c_0_86,negated_conjecture,
    ( int_leq(int_one,esk3_0)
    | int_leq(int_one,esk4_0) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_71]),c_0_81]) ).

cnf(c_0_87,hypothesis,
    ( a(X1,X1) = real_one
    | int_leq(n,X2)
    | ~ int_leq(int_one,X1)
    | ~ int_leq(int_one,X2)
    | ~ int_leq(X1,X2) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_82,c_0_46]),c_0_58]) ).

cnf(c_0_88,negated_conjecture,
    ( int_leq(esk3_0,n)
    | a(esk4_0,esk5_0) = real_zero ),
    inference(split_conjunct,[status(thm)],[c_0_43]) ).

cnf(c_0_89,negated_conjecture,
    ( int_leq(esk3_0,n)
    | int_leq(int_one,esk4_0) ),
    inference(split_conjunct,[status(thm)],[c_0_43]) ).

cnf(c_0_90,negated_conjecture,
    ( a(X1,X1) = real_one
    | int_leq(int_one,esk3_0)
    | ~ int_leq(int_one,esk5_0)
    | ~ int_leq(int_one,X1)
    | ~ int_leq(X1,esk5_0) ),
    inference(spm,[status(thm)],[c_0_83,c_0_78]) ).

cnf(c_0_91,negated_conjecture,
    ( a(esk5_0,esk5_0) = real_zero
    | int_less(esk2_0,esk3_0) ),
    inference(rw,[status(thm)],[c_0_84,c_0_85]) ).

cnf(c_0_92,plain,
    real_zero != real_one,
    inference(split_conjunct,[status(thm)],[real_constants]) ).

cnf(c_0_93,negated_conjecture,
    ( int_leq(int_one,esk5_0)
    | int_leq(int_one,esk3_0) ),
    inference(rw,[status(thm)],[c_0_86,c_0_85]) ).

cnf(c_0_94,negated_conjecture,
    ( a(X1,X1) = real_one
    | int_leq(int_one,esk2_0)
    | ~ int_leq(int_one,esk5_0)
    | ~ int_leq(int_one,X1)
    | ~ int_leq(X2,n)
    | ~ int_leq(int_one,X2)
    | ~ int_leq(X1,esk5_0) ),
    inference(spm,[status(thm)],[c_0_76,c_0_72]) ).

cnf(c_0_95,negated_conjecture,
    ( int_leq(int_one,esk2_0)
    | a(esk4_0,esk5_0) = real_zero ),
    inference(split_conjunct,[status(thm)],[c_0_43]) ).

cnf(c_0_96,hypothesis,
    ( a(X1,X1) = real_one
    | int_leq(n,X1)
    | ~ int_leq(int_one,X1) ),
    inference(spm,[status(thm)],[c_0_87,c_0_46]) ).

cnf(c_0_97,negated_conjecture,
    ( a(esk5_0,esk5_0) = real_zero
    | int_leq(esk3_0,n) ),
    inference(rw,[status(thm)],[c_0_88,c_0_85]) ).

cnf(c_0_98,negated_conjecture,
    ( int_leq(int_one,esk5_0)
    | int_leq(esk3_0,n) ),
    inference(rw,[status(thm)],[c_0_89,c_0_85]) ).

cnf(c_0_99,negated_conjecture,
    ( int_less(esk2_0,esk3_0)
    | int_leq(int_one,esk3_0) ),
    inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_90,c_0_91]),c_0_46])]),c_0_92]),c_0_93]) ).

cnf(c_0_100,negated_conjecture,
    ( a(X1,X1) = real_one
    | int_leq(int_one,esk2_0)
    | ~ int_leq(int_one,esk5_0)
    | ~ int_leq(int_one,X1)
    | ~ int_leq(X1,esk5_0) ),
    inference(spm,[status(thm)],[c_0_94,c_0_72]) ).

cnf(c_0_101,negated_conjecture,
    ( a(esk5_0,esk5_0) = real_zero
    | int_leq(int_one,esk2_0) ),
    inference(rw,[status(thm)],[c_0_95,c_0_85]) ).

cnf(c_0_102,negated_conjecture,
    ( int_leq(int_one,esk2_0)
    | int_leq(int_one,esk5_0) ),
    inference(rw,[status(thm)],[c_0_81,c_0_85]) ).

cnf(c_0_103,hypothesis,
    ( int_leq(esk3_0,n)
    | int_leq(n,esk5_0) ),
    inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_96,c_0_97]),c_0_92]),c_0_98]) ).

cnf(c_0_104,negated_conjecture,
    ( int_leq(esk3_0,n)
    | int_leq(esk5_0,n) ),
    inference(split_conjunct,[status(thm)],[c_0_43]) ).

cnf(c_0_105,hypothesis,
    ( a(X1,X1) = real_one
    | ~ int_leq(int_one,n)
    | ~ int_leq(int_one,X1)
    | ~ int_leq(X2,n)
    | ~ int_leq(int_one,X2)
    | ~ int_leq(X1,n) ),
    inference(spm,[status(thm)],[c_0_76,c_0_46]) ).

cnf(c_0_106,negated_conjecture,
    ( int_leq(int_one,esk3_0)
    | int_leq(X1,esk3_0)
    | ~ int_leq(X1,esk2_0) ),
    inference(spm,[status(thm)],[c_0_49,c_0_99]) ).

cnf(c_0_107,negated_conjecture,
    int_leq(int_one,esk2_0),
    inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_100,c_0_101]),c_0_46])]),c_0_92]),c_0_102]) ).

cnf(c_0_108,negated_conjecture,
    ( a(esk4_0,esk5_0) = real_zero
    | a(esk2_0,esk3_0) != real_zero ),
    inference(split_conjunct,[status(thm)],[c_0_43]) ).

cnf(c_0_109,negated_conjecture,
    ( int_leq(int_one,esk4_0)
    | a(esk2_0,esk3_0) != real_zero ),
    inference(split_conjunct,[status(thm)],[c_0_43]) ).

cnf(c_0_110,plain,
    ( X1 = X2
    | int_less(X3,X2)
    | ~ int_less(X3,X1)
    | ~ int_leq(X1,X2) ),
    inference(spm,[status(thm)],[c_0_18,c_0_40]) ).

cnf(c_0_111,hypothesis,
    ( n = esk5_0
    | int_leq(esk3_0,n) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_103]),c_0_104]) ).

cnf(c_0_112,hypothesis,
    ( a(X1,X1) = real_one
    | ~ int_leq(int_one,n)
    | ~ int_leq(int_one,X1)
    | ~ int_leq(X1,n) ),
    inference(spm,[status(thm)],[c_0_105,c_0_46]) ).

cnf(c_0_113,negated_conjecture,
    ( int_less(esk2_0,esk3_0)
    | int_leq(int_one,esk5_0) ),
    inference(rw,[status(thm)],[c_0_67,c_0_85]) ).

cnf(c_0_114,plain,
    ( X1 = X2
    | int_leq(X3,X2)
    | ~ int_leq(X3,X1)
    | ~ int_leq(X1,X2) ),
    inference(spm,[status(thm)],[c_0_49,c_0_40]) ).

cnf(c_0_115,negated_conjecture,
    int_leq(int_one,esk3_0),
    inference(spm,[status(thm)],[c_0_106,c_0_107]) ).

cnf(c_0_116,negated_conjecture,
    ( a(esk5_0,esk5_0) = real_zero
    | a(esk2_0,esk3_0) != real_zero ),
    inference(rw,[status(thm)],[c_0_108,c_0_85]) ).

cnf(c_0_117,negated_conjecture,
    ( int_leq(int_one,esk4_0)
    | ~ int_leq(esk2_0,n) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_109,c_0_63]),c_0_89]),c_0_81]),c_0_67]) ).

cnf(c_0_118,hypothesis,
    ( n = esk5_0
    | n = esk3_0
    | int_less(X1,n)
    | ~ int_less(X1,esk3_0) ),
    inference(spm,[status(thm)],[c_0_110,c_0_111]) ).

cnf(c_0_119,hypothesis,
    ( int_less(esk2_0,esk3_0)
    | ~ int_leq(int_one,n) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_112,c_0_91]),c_0_92]),c_0_53]),c_0_113]) ).

cnf(c_0_120,negated_conjecture,
    ( esk3_0 = X1
    | int_leq(int_one,X1)
    | ~ int_leq(esk3_0,X1) ),
    inference(spm,[status(thm)],[c_0_114,c_0_115]) ).

cnf(c_0_121,hypothesis,
    ( a(esk5_0,esk5_0) = real_zero
    | ~ int_leq(esk2_0,n) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_116,c_0_63]),c_0_107])]),c_0_97]),c_0_91]) ).

cnf(c_0_122,negated_conjecture,
    ( int_leq(int_one,esk5_0)
    | ~ int_leq(esk2_0,n) ),
    inference(rw,[status(thm)],[c_0_117,c_0_85]) ).

cnf(c_0_123,negated_conjecture,
    ( int_leq(esk5_0,n)
    | a(esk2_0,esk3_0) != real_zero ),
    inference(split_conjunct,[status(thm)],[c_0_43]) ).

cnf(c_0_124,hypothesis,
    ( n = esk3_0
    | n = esk5_0
    | ~ int_less(n,esk3_0) ),
    inference(spm,[status(thm)],[c_0_23,c_0_118]) ).

cnf(c_0_125,hypothesis,
    ( int_less(X1,esk3_0)
    | ~ int_less(X1,esk2_0)
    | ~ int_leq(int_one,n) ),
    inference(spm,[status(thm)],[c_0_18,c_0_119]) ).

cnf(c_0_126,hypothesis,
    ( n = esk5_0
    | n = esk3_0
    | int_leq(int_one,n) ),
    inference(spm,[status(thm)],[c_0_120,c_0_111]) ).

cnf(c_0_127,hypothesis,
    ( int_leq(n,esk5_0)
    | ~ int_leq(esk2_0,n) ),
    inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_96,c_0_121]),c_0_92]),c_0_122]) ).

cnf(c_0_128,negated_conjecture,
    ( int_leq(esk5_0,n)
    | ~ int_leq(esk2_0,n) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_123,c_0_63]),c_0_104]),c_0_72]),c_0_53]) ).

cnf(c_0_129,hypothesis,
    ( int_less(esk2_0,esk3_0)
    | int_leq(n,esk5_0) ),
    inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_96,c_0_91]),c_0_92]),c_0_113]) ).

cnf(c_0_130,hypothesis,
    ( n = esk5_0
    | n = esk3_0
    | ~ int_less(n,esk2_0) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_124,c_0_125]),c_0_126]) ).

cnf(c_0_131,hypothesis,
    ( n = esk5_0
    | ~ int_leq(esk2_0,n) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_127]),c_0_128]) ).

cnf(c_0_132,hypothesis,
    ( int_leq(n,esk5_0)
    | int_leq(esk2_0,esk3_0) ),
    inference(spm,[status(thm)],[c_0_69,c_0_129]) ).

cnf(c_0_133,negated_conjecture,
    ( int_leq(esk5_0,n)
    | int_leq(esk2_0,esk3_0) ),
    inference(spm,[status(thm)],[c_0_69,c_0_53]) ).

cnf(c_0_134,hypothesis,
    ( ~ int_leq(int_one,n)
    | ~ int_leq(esk2_0,n) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_112,c_0_121]),c_0_92]),c_0_128]),c_0_122]) ).

cnf(c_0_135,hypothesis,
    ( n = esk3_0
    | n = esk5_0 ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_130,c_0_51]),c_0_131]) ).

cnf(c_0_136,hypothesis,
    ( n = esk5_0
    | int_leq(esk2_0,esk3_0) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_132]),c_0_133]) ).

cnf(c_0_137,hypothesis,
    ( int_leq(esk3_0,n)
    | ~ int_leq(int_one,n) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_112,c_0_97]),c_0_92]),c_0_104]),c_0_98]) ).

cnf(c_0_138,hypothesis,
    n = esk5_0,
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_134,c_0_135]),c_0_115])]),c_0_136]) ).

cnf(c_0_139,hypothesis,
    ( int_leq(esk3_0,esk5_0)
    | ~ int_leq(int_one,esk5_0) ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_137,c_0_138]),c_0_138]) ).

cnf(c_0_140,negated_conjecture,
    ( int_leq(int_one,esk4_0)
    | int_leq(X1,esk3_0)
    | ~ int_leq(X1,esk2_0) ),
    inference(spm,[status(thm)],[c_0_49,c_0_67]) ).

cnf(c_0_141,hypothesis,
    ( ~ int_leq(int_one,esk5_0)
    | ~ int_leq(esk2_0,esk5_0) ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_134,c_0_138]),c_0_138]) ).

cnf(c_0_142,negated_conjecture,
    ( int_leq(int_one,esk4_0)
    | int_leq(esk2_0,esk3_0) ),
    inference(spm,[status(thm)],[c_0_69,c_0_67]) ).

cnf(c_0_143,negated_conjecture,
    int_leq(esk3_0,esk5_0),
    inference(csr,[status(thm)],[inference(rw,[status(thm)],[c_0_98,c_0_138]),c_0_139]) ).

cnf(c_0_144,hypothesis,
    ( int_leq(X1,esk3_0)
    | ~ int_leq(int_one,n)
    | ~ int_leq(X1,esk2_0) ),
    inference(spm,[status(thm)],[c_0_49,c_0_119]) ).

cnf(c_0_145,negated_conjecture,
    ( int_leq(int_one,esk5_0)
    | int_leq(X1,esk3_0)
    | ~ int_leq(X1,esk2_0) ),
    inference(rw,[status(thm)],[c_0_140,c_0_85]) ).

cnf(c_0_146,negated_conjecture,
    ~ int_leq(esk2_0,esk5_0),
    inference(csr,[status(thm)],[inference(rw,[status(thm)],[c_0_122,c_0_138]),c_0_141]) ).

cnf(c_0_147,hypothesis,
    ( int_leq(esk2_0,esk3_0)
    | ~ int_leq(int_one,n) ),
    inference(spm,[status(thm)],[c_0_69,c_0_119]) ).

cnf(c_0_148,negated_conjecture,
    ( int_leq(esk2_0,esk3_0)
    | int_leq(int_one,esk5_0) ),
    inference(rw,[status(thm)],[c_0_142,c_0_85]) ).

cnf(c_0_149,negated_conjecture,
    ( esk3_0 = esk5_0
    | ~ int_leq(esk5_0,esk3_0) ),
    inference(spm,[status(thm)],[c_0_56,c_0_143]) ).

cnf(c_0_150,hypothesis,
    ( int_leq(X1,esk3_0)
    | ~ int_leq(X1,esk2_0) ),
    inference(csr,[status(thm)],[inference(rw,[status(thm)],[c_0_144,c_0_138]),c_0_145]) ).

cnf(c_0_151,negated_conjecture,
    int_leq(esk5_0,esk2_0),
    inference(spm,[status(thm)],[c_0_146,c_0_77]) ).

cnf(c_0_152,hypothesis,
    int_leq(esk2_0,esk3_0),
    inference(csr,[status(thm)],[inference(rw,[status(thm)],[c_0_147,c_0_138]),c_0_148]) ).

cnf(c_0_153,negated_conjecture,
    esk3_0 = esk5_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_149,c_0_150]),c_0_151])]) ).

cnf(c_0_154,hypothesis,
    $false,
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_152,c_0_153]),c_0_146]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.12  % Problem  : SWV492+1 : TPTP v8.1.0. Released v4.0.0.
% 0.10/0.13  % Command  : run_ET %s %d
% 0.13/0.34  % Computer : n024.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 : Thu Jun 16 03:40:48 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.24/5.43  # Running protocol protocol_eprover_63dc1b1eb7d762c2f3686774d32795976f981b97 for 23 seconds:
% 0.24/5.43  # Preprocessing time       : 0.015 s
% 0.24/5.43  
% 0.24/5.43  # Proof found!
% 0.24/5.43  # SZS status Theorem
% 0.24/5.43  # SZS output start CNFRefutation
% See solution above
% 0.24/5.43  # Proof object total steps             : 155
% 0.24/5.43  # Proof object clause steps            : 127
% 0.24/5.43  # Proof object formula steps           : 28
% 0.24/5.43  # Proof object conjectures             : 62
% 0.24/5.43  # Proof object clause conjectures      : 59
% 0.24/5.43  # Proof object formula conjectures     : 3
% 0.24/5.43  # Proof object initial clauses used    : 34
% 0.24/5.43  # Proof object initial formulas used   : 12
% 0.24/5.43  # Proof object generating inferences   : 73
% 0.24/5.43  # Proof object simplifying inferences  : 86
% 0.24/5.43  # Training examples: 0 positive, 0 negative
% 0.24/5.43  # Parsed axioms                        : 13
% 0.24/5.43  # Removed by relevancy pruning/SinE    : 0
% 0.24/5.43  # Initial clauses                      : 36
% 0.24/5.43  # Removed in clause preprocessing      : 0
% 0.24/5.43  # Initial clauses in saturation        : 36
% 0.24/5.43  # Processed clauses                    : 13776
% 0.24/5.43  # ...of these trivial                  : 222
% 0.24/5.43  # ...subsumed                          : 10797
% 0.24/5.43  # ...remaining for further processing  : 2757
% 0.24/5.43  # Other redundant clauses eliminated   : 80
% 0.24/5.43  # Clauses deleted for lack of memory   : 73696
% 0.24/5.43  # Backward-subsumed                    : 535
% 0.24/5.43  # Backward-rewritten                   : 1504
% 0.24/5.43  # Generated clauses                    : 265820
% 0.24/5.43  # ...of the previous two non-trivial   : 248164
% 0.24/5.43  # Contextual simplify-reflections      : 19213
% 0.24/5.43  # Paramodulations                      : 265625
% 0.24/5.43  # Factorizations                       : 109
% 0.24/5.43  # Equation resolutions                 : 86
% 0.24/5.43  # Current number of processed clauses  : 716
% 0.24/5.43  #    Positive orientable unit clauses  : 11
% 0.24/5.43  #    Positive unorientable unit clauses: 1
% 0.24/5.43  #    Negative unit clauses             : 5
% 0.24/5.43  #    Non-unit-clauses                  : 699
% 0.24/5.43  # Current number of unprocessed clauses: 20001
% 0.24/5.43  # ...number of literals in the above   : 129474
% 0.24/5.43  # Current number of archived formulas  : 0
% 0.24/5.43  # Current number of archived clauses   : 2039
% 0.24/5.43  # Clause-clause subsumption calls (NU) : 1175136
% 0.24/5.43  # Rec. Clause-clause subsumption calls : 307721
% 0.24/5.43  # Non-unit clause-clause subsumptions  : 30344
% 0.24/5.43  # Unit Clause-clause subsumption calls : 2539
% 0.24/5.43  # Rewrite failures with RHS unbound    : 0
% 0.24/5.43  # BW rewrite match attempts            : 28
% 0.24/5.43  # BW rewrite match successes           : 13
% 0.24/5.43  # Condensation attempts                : 0
% 0.24/5.43  # Condensation successes               : 0
% 0.24/5.43  # Termbank termtop insertions          : 4245883
% 0.24/5.43  
% 0.24/5.43  # -------------------------------------------------
% 0.24/5.43  # User time                : 4.635 s
% 0.24/5.43  # System time              : 0.085 s
% 0.24/5.43  # Total time               : 4.720 s
% 0.24/5.43  # Maximum resident set size: 126660 pages
% 0.24/23.40  eprover: CPU time limit exceeded, terminating
% 0.24/23.41  eprover: CPU time limit exceeded, terminating
% 0.24/23.41  eprover: CPU time limit exceeded, terminating
% 0.24/23.42  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.42  eprover: No such file or directory
% 0.24/23.42  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.42  eprover: No such file or directory
% 0.24/23.42  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.42  eprover: No such file or directory
% 0.24/23.42  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.42  eprover: No such file or directory
% 0.24/23.43  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.43  eprover: No such file or directory
% 0.24/23.43  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.43  eprover: No such file or directory
% 0.24/23.43  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.43  eprover: No such file or directory
% 0.24/23.43  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.43  eprover: No such file or directory
% 0.24/23.43  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.43  eprover: No such file or directory
% 0.24/23.44  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.44  eprover: No such file or directory
% 0.24/23.44  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.44  eprover: No such file or directory
% 0.24/23.44  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.44  eprover: No such file or directory
% 0.24/23.44  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.44  eprover: No such file or directory
% 0.24/23.44  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.44  eprover: No such file or directory
% 0.24/23.44  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.44  eprover: No such file or directory
% 0.24/23.45  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.45  eprover: No such file or directory
% 0.24/23.45  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.45  eprover: No such file or directory
% 0.24/23.45  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.45  eprover: No such file or directory
% 0.24/23.45  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.45  eprover: No such file or directory
% 0.24/23.45  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.45  eprover: No such file or directory
% 0.24/23.45  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.45  eprover: No such file or directory
% 0.24/23.45  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.45  eprover: No such file or directory
% 0.24/23.46  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.46  eprover: No such file or directory
% 0.24/23.46  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.46  eprover: No such file or directory
% 0.24/23.46  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.46  eprover: No such file or directory
% 0.24/23.46  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.46  eprover: No such file or directory
% 0.24/23.46  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.46  eprover: No such file or directory
% 0.24/23.47  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.47  eprover: No such file or directory
% 0.24/23.47  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.47  eprover: No such file or directory
% 0.24/23.47  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.24/23.47  eprover: No such file or directory
% 0.24/23.47  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.47  eprover: No such file or directory
% 0.24/23.48  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.48  eprover: No such file or directory
% 0.24/23.48  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.24/23.48  eprover: No such file or directory
%------------------------------------------------------------------------------