↑ Up

E-SAT---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E-SAT---3.5.1
% Problem  : SWV492+1 : TPTP v9.3.1. Released v4.0.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM

% Computer : n026.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8046.5625MB
% OS       : Linux 6.8.0-71-generic
% CPULimit : 300s
% WCLimit  : 300s
% DateTime : Thu Sep 24 03:02:37 PM UTC 2026

% Result   : Theorem 234.63s 34.58s
% Output   : CNFRefutation 234.63s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   41
%            Number of leaves      :   13
% Syntax   : Number of formulae    :  198 (  23 unt;   0 def)
%            Number of atoms       :  604 ( 195 equ)
%            Maximal formula atoms :   32 (   3 avg)
%            Number of connectives :  586 ( 180   ~; 307   |;  67   &)
%                                         (   4 <=>;  28  =>;   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   :  205 (   3 sgn  87   !;   1   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(int_less_irreflexive,axiom,
    ! [X1,X2] :
      ( int_less(X1,X2)
     => X1 != X2 ),
    file('/export/starexec/sandbox/benchmark/theBenchmark.p',int_less_irreflexive) ).

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

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

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

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

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

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

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

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

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

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

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

fof(c_0_12,plain,
    ! [X1,X2] :
      ( int_less(X1,X2)
     => X1 != X2 ),
    inference(fof_simplification,[status(thm)],[int_less_irreflexive]) ).

fof(c_0_13,plain,
    ! [X25,X26,X28,X29,X30] :
      ( ( int_less(X28,X29)
        | ~ int_less(int_zero,X30)
        | plus(X28,X30) != X29 )
      & ( ~ int_less(X25,X26)
        | int_less(int_zero,esk1_2(X25,X26)) )
      & ( ~ int_less(X25,X26)
        | plus(X25,esk1_2(X25,X26)) = X26 ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[plus_and_inverse])])])])])])]) ).

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

fof(c_0_15,plain,
    ! [X14,X15] :
      ( X14 != X15
      | ~ int_less(X14,X15) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])]) ).

fof(c_0_16,plain,
    ! [X11,X12,X13] :
      ( int_less(X11,X13)
      | ~ int_less(X12,X13)
      | ~ int_less(X11,X12) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[int_less_transitive])])]) ).

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

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

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

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

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

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

fof(c_0_23,plain,
    ! [X38,X39,X40,X41,X42,X43,X44] :
      ( ( ~ epred1_2(X39,X38)
        | a(X44,plus(X44,X43)) = real_zero
        | ~ int_leq(X44,X39)
        | ~ int_leq(int_one,X44)
        | X38 != plus(X39,X43)
        | ~ int_less(int_zero,X43) )
      & ( ~ epred1_2(X39,X38)
        | a(X42,X42) = real_one
        | ~ int_leq(X42,X38)
        | ~ int_leq(int_one,X42) )
      & ( ~ epred1_2(X39,X38)
        | a(plus(X41,X40),X41) = qr(plus(X41,X40),X41)
        | ~ int_leq(X41,X38)
        | ~ int_leq(int_one,X41)
        | X39 != plus(X38,X40)
        | ~ int_less(int_zero,X40) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_18])])])])]) ).

fof(c_0_24,plain,
    ! [X21,X22,X23,X24] :
      ( int_leq(plus(X21,X23),plus(X22,X24))
      | ~ int_leq(X23,X24)
      | ~ int_less(X21,X22) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[plus_and_order1])])]) ).

fof(c_0_25,plain,
    ! [X18,X19] : plus(X18,X19) = plus(X19,X18),
    inference(variable_rename,[status(thm)],[plus_commutative]) ).

fof(c_0_26,negated_conjecture,
    ~ ( ! [X1,X2] :
          ( ( X1 = X2
            & int_leq(X2,n)
            & int_leq(int_one,X1) )
         => a(X1,X2) != real_zero )
      & ! [X1,X2] :
          ( ( int_leq(X2,n)
            & int_less(X1,X2)
            & int_leq(int_one,X1) )
         => a(X1,X2) = real_zero ) ),
    inference(fof_simplification,[status(thm)],[c_0_19]) ).

cnf(c_0_27,plain,
    ~ int_less(X1,X1),
    inference(er,[status(thm)],[c_0_20]) ).

cnf(c_0_28,plain,
    ( ~ int_less(X1,X2)
    | ~ int_less(int_zero,X3)
    | int_less(X1,plus(X2,X3)) ),
    inference(spm,[status(thm)],[c_0_21,c_0_22]) ).

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

fof(c_0_30,plain,
    ! [X9,X10] :
      ( ( int_leq(X9,X10)
        | X9 != X10 )
      & ( int_leq(X9,X10)
        | ~ int_less(X9,X10) )
      & ( X9 = X10
        | int_less(X9,X10)
        | ~ int_leq(X9,X10) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[int_leq])])])]) ).

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

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

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

fof(c_0_34,negated_conjecture,
    ( ( a(esk2_0,esk3_0) != real_zero
      | a(esk4_0,esk5_0) = real_zero )
    & ( a(esk2_0,esk3_0) != real_zero
      | esk4_0 = esk5_0 )
    & ( a(esk2_0,esk3_0) != real_zero
      | int_leq(esk5_0,n) )
    & ( a(esk2_0,esk3_0) != real_zero
      | int_leq(int_one,esk4_0) )
    & ( int_leq(esk3_0,n)
      | a(esk4_0,esk5_0) = real_zero )
    & ( int_leq(esk3_0,n)
      | esk4_0 = esk5_0 )
    & ( int_leq(esk3_0,n)
      | int_leq(esk5_0,n) )
    & ( int_leq(esk3_0,n)
      | int_leq(int_one,esk4_0) )
    & ( int_less(esk2_0,esk3_0)
      | a(esk4_0,esk5_0) = real_zero )
    & ( int_less(esk2_0,esk3_0)
      | esk4_0 = esk5_0 )
    & ( int_less(esk2_0,esk3_0)
      | int_leq(esk5_0,n) )
    & ( int_less(esk2_0,esk3_0)
      | int_leq(int_one,esk4_0) )
    & ( int_leq(int_one,esk2_0)
      | a(esk4_0,esk5_0) = real_zero )
    & ( int_leq(int_one,esk2_0)
      | esk4_0 = esk5_0 )
    & ( int_leq(int_one,esk2_0)
      | int_leq(esk5_0,n) )
    & ( int_leq(int_one,esk2_0)
      | int_leq(int_one,esk4_0) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_26])])])])]) ).

cnf(c_0_35,plain,
    ( ~ int_less(int_zero,X2)
    | ~ int_less(plus(X1,X2),X1) ),
    inference(spm,[status(thm)],[c_0_27,c_0_28]) ).

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

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

cnf(c_0_38,plain,
    ( ~ int_leq(X1,X3)
    | ~ int_leq(int_one,X1)
    | ~ int_less(int_zero,X2)
    | ~ epred1_2(X3,plus(X3,X2))
    | a(X1,plus(X1,X2)) = real_zero ),
    inference(er,[status(thm)],[c_0_29]) ).

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

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

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

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

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

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

fof(c_0_45,plain,
    ! [X16,X17] :
      ( int_leq(X17,X16)
      | int_less(X16,X17) ),
    inference(variable_rename,[status(thm)],[int_less_total]) ).

cnf(c_0_46,plain,
    ( ~ int_less(X2,X1)
    | ~ int_less(X1,X2) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_37]) ).

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

cnf(c_0_48,plain,
    int_leq(X1,X1),
    inference(er,[status(thm)],[c_0_39]) ).

fof(c_0_49,hypothesis,
    ! [X32,X33] :
      ( epred1_2(X32,X33)
      | ~ int_leq(X33,n)
      | ~ int_leq(int_one,X33)
      | ~ int_leq(X32,n)
      | ~ int_leq(int_one,X32) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_40])])]) ).

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

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

cnf(c_0_52,negated_conjecture,
    ( int_less(esk3_0,n)
    | n = esk3_0
    | esk4_0 = esk5_0 ),
    inference(spm,[status(thm)],[c_0_43,c_0_44]) ).

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

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

cnf(c_0_55,plain,
    ( ~ int_less(X3,X1)
    | ~ int_less(int_zero,X2)
    | ~ int_less(plus(X1,X2),X3) ),
    inference(spm,[status(thm)],[c_0_46,c_0_28]) ).

cnf(c_0_56,plain,
    ( ~ int_leq(int_one,X1)
    | ~ int_less(X1,X2)
    | ~ epred1_2(X1,X2)
    | a(X1,X2) = real_zero ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_36]),c_0_48])]) ).

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

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

cnf(c_0_59,negated_conjecture,
    ( ~ int_less(X1,esk3_0)
    | int_less(X1,n)
    | esk4_0 = esk5_0
    | n = esk3_0 ),
    inference(spm,[status(thm)],[c_0_21,c_0_52]) ).

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

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

cnf(c_0_62,plain,
    ( int_leq(X2,X1)
    | int_leq(X1,X2) ),
    inference(spm,[status(thm)],[c_0_53,c_0_54]) ).

cnf(c_0_63,plain,
    ( ~ int_less(X3,X1)
    | ~ int_less(X2,X3)
    | ~ int_less(X1,X2) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_36]),c_0_37]) ).

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

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

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

cnf(c_0_67,hypothesis,
    ( ~ int_leq(X1,n)
    | ~ int_leq(X2,n)
    | ~ int_leq(int_one,X1)
    | ~ int_less(X1,X2)
    | a(X1,X2) = real_zero ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_58]) ).

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

cnf(c_0_69,negated_conjecture,
    ( int_less(esk2_0,n)
    | n = esk3_0
    | esk4_0 = esk5_0 ),
    inference(spm,[status(thm)],[c_0_59,c_0_60]) ).

cnf(c_0_70,plain,
    ( ~ int_leq(X1,X3)
    | ~ epred1_2(X2,X3)
    | int_leq(X1,int_one)
    | a(X1,X1) = real_one ),
    inference(spm,[status(thm)],[c_0_61,c_0_62]) ).

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

cnf(c_0_72,negated_conjecture,
    ( ~ int_less(X1,esk2_0)
    | ~ int_less(esk3_0,X1)
    | int_leq(esk5_0,n) ),
    inference(spm,[status(thm)],[c_0_63,c_0_64]) ).

cnf(c_0_73,negated_conjecture,
    ( int_leq(esk5_0,n)
    | int_less(esk3_0,n)
    | n = esk3_0 ),
    inference(spm,[status(thm)],[c_0_43,c_0_65]) ).

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

cnf(c_0_75,negated_conjecture,
    ( ~ int_leq(esk2_0,n)
    | esk4_0 = esk5_0 ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_66,c_0_67]),c_0_44]),c_0_68]),c_0_60]) ).

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

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

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

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

cnf(c_0_80,negated_conjecture,
    ( ~ int_less(n,esk2_0)
    | int_leq(esk5_0,n)
    | n = esk3_0 ),
    inference(spm,[status(thm)],[c_0_72,c_0_73]) ).

cnf(c_0_81,negated_conjecture,
    ( int_leq(int_one,esk4_0)
    | int_less(esk3_0,n)
    | n = esk3_0 ),
    inference(spm,[status(thm)],[c_0_43,c_0_74]) ).

cnf(c_0_82,negated_conjecture,
    ( esk4_0 = esk5_0
    | n = esk3_0 ),
    inference(spm,[status(thm)],[c_0_75,c_0_76]) ).

cnf(c_0_83,negated_conjecture,
    ( int_leq(esk2_0,esk3_0)
    | esk4_0 = esk5_0 ),
    inference(spm,[status(thm)],[c_0_53,c_0_60]) ).

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

cnf(c_0_85,negated_conjecture,
    ( ~ int_leq(esk2_0,n)
    | int_leq(esk5_0,n) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_67]),c_0_65]),c_0_79]),c_0_64]) ).

cnf(c_0_86,negated_conjecture,
    ( int_leq(esk5_0,n)
    | int_leq(esk2_0,n)
    | n = esk3_0 ),
    inference(spm,[status(thm)],[c_0_80,c_0_54]) ).

fof(c_0_87,plain,
    real_zero != real_one,
    inference(fof_simplification,[status(thm)],[real_constants]) ).

cnf(c_0_88,negated_conjecture,
    ( ~ int_less(X1,esk3_0)
    | int_leq(int_one,esk4_0)
    | int_less(X1,n)
    | n = esk3_0 ),
    inference(spm,[status(thm)],[c_0_21,c_0_81]) ).

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

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

cnf(c_0_91,negated_conjecture,
    esk4_0 = esk5_0,
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_82]),c_0_83]) ).

cnf(c_0_92,hypothesis,
    ( ~ int_leq(X1,n)
    | int_leq(X1,int_one)
    | a(X1,X1) = real_one ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_84,c_0_48]),c_0_71]) ).

cnf(c_0_93,negated_conjecture,
    ( int_leq(esk5_0,n)
    | n = esk3_0 ),
    inference(spm,[status(thm)],[c_0_85,c_0_86]) ).

fof(c_0_94,plain,
    real_zero != real_one,
    inference(fof_nnf,[status(thm)],[c_0_87]) ).

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

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

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

cnf(c_0_98,negated_conjecture,
    ( int_leq(int_one,esk4_0)
    | int_less(esk2_0,n)
    | n = esk3_0 ),
    inference(spm,[status(thm)],[c_0_88,c_0_89]) ).

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

cnf(c_0_100,negated_conjecture,
    ( int_leq(esk5_0,int_one)
    | n = esk3_0
    | a(esk5_0,esk5_0) = real_one ),
    inference(spm,[status(thm)],[c_0_92,c_0_93]) ).

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

cnf(c_0_102,negated_conjecture,
    ( int_leq(esk3_0,n)
    | a(esk5_0,esk5_0) = real_zero ),
    inference(rw,[status(thm)],[c_0_95,c_0_91]) ).

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

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

cnf(c_0_105,negated_conjecture,
    ( a(esk2_0,esk3_0) != real_zero
    | int_leq(int_one,esk5_0) ),
    inference(rw,[status(thm)],[c_0_96,c_0_91]) ).

cnf(c_0_106,negated_conjecture,
    ( int_leq(int_one,esk5_0)
    | int_leq(esk3_0,n) ),
    inference(rw,[status(thm)],[c_0_74,c_0_91]) ).

cnf(c_0_107,negated_conjecture,
    ( int_leq(int_one,esk2_0)
    | int_leq(int_one,esk5_0) ),
    inference(rw,[status(thm)],[c_0_97,c_0_91]) ).

cnf(c_0_108,negated_conjecture,
    ( int_leq(int_one,esk5_0)
    | int_less(esk2_0,esk3_0) ),
    inference(rw,[status(thm)],[c_0_89,c_0_91]) ).

cnf(c_0_109,negated_conjecture,
    ( int_leq(esk2_0,n)
    | int_leq(int_one,esk4_0)
    | n = esk3_0 ),
    inference(spm,[status(thm)],[c_0_53,c_0_98]) ).

cnf(c_0_110,negated_conjecture,
    ( int_leq(esk5_0,int_one)
    | int_less(esk2_0,esk3_0)
    | n = esk3_0 ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_99,c_0_100]),c_0_101]) ).

cnf(c_0_111,negated_conjecture,
    ( int_leq(esk3_0,n)
    | int_leq(esk5_0,int_one)
    | n = esk3_0 ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_102,c_0_100]),c_0_101]) ).

cnf(c_0_112,negated_conjecture,
    ( a(esk2_0,esk3_0) != real_zero
    | a(esk5_0,esk5_0) = real_zero ),
    inference(rw,[status(thm)],[c_0_103,c_0_91]) ).

cnf(c_0_113,negated_conjecture,
    ( int_leq(int_one,esk2_0)
    | a(esk5_0,esk5_0) = real_zero ),
    inference(rw,[status(thm)],[c_0_104,c_0_91]) ).

cnf(c_0_114,hypothesis,
    ( ~ int_leq(esk2_0,n)
    | int_leq(int_one,esk5_0) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_105,c_0_67]),c_0_106]),c_0_107]),c_0_108]) ).

cnf(c_0_115,negated_conjecture,
    ( int_leq(int_one,esk5_0)
    | int_leq(esk2_0,n)
    | n = esk3_0 ),
    inference(rw,[status(thm)],[c_0_109,c_0_91]) ).

cnf(c_0_116,negated_conjecture,
    ( int_leq(X1,n)
    | int_leq(esk3_0,X1)
    | int_leq(esk5_0,n) ),
    inference(spm,[status(thm)],[c_0_71,c_0_65]) ).

cnf(c_0_117,negated_conjecture,
    ( ~ int_less(X1,esk2_0)
    | ~ int_less(esk3_0,X1)
    | int_leq(esk5_0,int_one)
    | n = esk3_0 ),
    inference(spm,[status(thm)],[c_0_63,c_0_110]) ).

cnf(c_0_118,negated_conjecture,
    ( int_leq(esk5_0,int_one)
    | int_less(esk3_0,n)
    | n = esk3_0 ),
    inference(spm,[status(thm)],[c_0_43,c_0_111]) ).

cnf(c_0_119,hypothesis,
    ( ~ int_leq(esk2_0,n)
    | a(esk5_0,esk5_0) = real_zero ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_112,c_0_67]),c_0_102]),c_0_113]),c_0_99]) ).

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

cnf(c_0_121,negated_conjecture,
    ( ~ int_less(X1,esk2_0)
    | int_leq(esk5_0,n)
    | int_less(X1,esk3_0) ),
    inference(spm,[status(thm)],[c_0_21,c_0_64]) ).

cnf(c_0_122,negated_conjecture,
    ( int_leq(X1,n)
    | int_leq(esk5_0,n)
    | int_less(esk3_0,X1)
    | esk3_0 = X1 ),
    inference(spm,[status(thm)],[c_0_43,c_0_116]) ).

cnf(c_0_123,negated_conjecture,
    ( ~ int_less(n,esk2_0)
    | int_leq(esk5_0,int_one)
    | n = esk3_0 ),
    inference(spm,[status(thm)],[c_0_117,c_0_118]) ).

cnf(c_0_124,hypothesis,
    ( ~ int_leq(esk2_0,n)
    | int_leq(esk5_0,int_one)
    | n = esk3_0 ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_119,c_0_100]),c_0_101]) ).

cnf(c_0_125,negated_conjecture,
    ( int_less(int_one,esk5_0)
    | esk5_0 = int_one
    | n = esk3_0 ),
    inference(spm,[status(thm)],[c_0_43,c_0_120]) ).

cnf(c_0_126,negated_conjecture,
    ( int_leq(esk5_0,n)
    | esk3_0 = esk2_0 ),
    inference(csr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_121,c_0_122]),c_0_27]),c_0_85]) ).

cnf(c_0_127,negated_conjecture,
    ( int_leq(esk5_0,int_one)
    | n = esk3_0 ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_123,c_0_54]),c_0_124]) ).

cnf(c_0_128,negated_conjecture,
    ( ~ int_less(esk5_0,int_one)
    | n = esk3_0
    | esk5_0 = int_one ),
    inference(spm,[status(thm)],[c_0_46,c_0_125]) ).

cnf(c_0_129,negated_conjecture,
    ( int_leq(esk2_0,esk3_0)
    | int_leq(int_one,esk4_0) ),
    inference(spm,[status(thm)],[c_0_53,c_0_89]) ).

cnf(c_0_130,negated_conjecture,
    ( int_leq(esk5_0,int_one)
    | esk3_0 = esk2_0
    | a(esk5_0,esk5_0) = real_one ),
    inference(spm,[status(thm)],[c_0_92,c_0_126]) ).

cnf(c_0_131,negated_conjecture,
    ( esk5_0 = int_one
    | n = esk3_0 ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_127]),c_0_128]) ).

cnf(c_0_132,negated_conjecture,
    ( int_leq(int_one,esk5_0)
    | int_leq(esk2_0,esk3_0) ),
    inference(rw,[status(thm)],[c_0_129,c_0_91]) ).

cnf(c_0_133,hypothesis,
    ( ~ int_leq(esk2_0,n)
    | int_leq(esk5_0,int_one)
    | esk3_0 = esk2_0 ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_119,c_0_130]),c_0_101]) ).

cnf(c_0_134,negated_conjecture,
    ( int_leq(esk5_0,int_one)
    | int_less(esk2_0,esk3_0)
    | esk3_0 = esk2_0 ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_99,c_0_130]),c_0_101]) ).

cnf(c_0_135,hypothesis,
    ( int_leq(int_one,esk5_0)
    | esk5_0 = int_one ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_114,c_0_131]),c_0_132]) ).

cnf(c_0_136,negated_conjecture,
    ( ~ int_leq(esk2_0,esk3_0)
    | int_leq(esk5_0,int_one)
    | esk3_0 = esk2_0
    | esk5_0 = int_one ),
    inference(spm,[status(thm)],[c_0_133,c_0_131]) ).

cnf(c_0_137,negated_conjecture,
    ( int_leq(esk2_0,esk3_0)
    | int_leq(esk5_0,int_one)
    | esk3_0 = esk2_0 ),
    inference(spm,[status(thm)],[c_0_53,c_0_134]) ).

cnf(c_0_138,hypothesis,
    ( int_less(int_one,esk5_0)
    | esk5_0 = int_one ),
    inference(spm,[status(thm)],[c_0_43,c_0_135]) ).

cnf(c_0_139,negated_conjecture,
    ( int_leq(esk5_0,int_one)
    | esk5_0 = int_one
    | esk3_0 = esk2_0 ),
    inference(spm,[status(thm)],[c_0_136,c_0_137]) ).

cnf(c_0_140,hypothesis,
    ( ~ int_less(esk5_0,int_one)
    | esk5_0 = int_one ),
    inference(spm,[status(thm)],[c_0_46,c_0_138]) ).

cnf(c_0_141,negated_conjecture,
    ( esk5_0 = int_one
    | esk3_0 = esk2_0 ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_139]),c_0_140]) ).

cnf(c_0_142,negated_conjecture,
    ( int_leq(esk5_0,n)
    | esk5_0 = int_one ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_64,c_0_141]),c_0_27]) ).

cnf(c_0_143,hypothesis,
    ( int_leq(esk5_0,int_one)
    | esk5_0 = int_one
    | a(esk5_0,esk5_0) = real_one ),
    inference(spm,[status(thm)],[c_0_92,c_0_142]) ).

cnf(c_0_144,hypothesis,
    ( ~ int_leq(esk2_0,n)
    | int_leq(esk5_0,int_one)
    | esk5_0 = int_one ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_119,c_0_143]),c_0_101]) ).

cnf(c_0_145,plain,
    ( ~ int_leq(int_one,X2)
    | ~ epred1_2(X1,X2)
    | a(int_one,int_one) = real_one ),
    inference(spm,[status(thm)],[c_0_61,c_0_48]) ).

cnf(c_0_146,negated_conjecture,
    ( ~ int_leq(esk2_0,esk3_0)
    | int_leq(esk5_0,int_one)
    | esk5_0 = int_one ),
    inference(spm,[status(thm)],[c_0_144,c_0_131]) ).

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

cnf(c_0_148,hypothesis,
    ( ~ int_leq(int_one,X2)
    | ~ int_leq(X2,n)
    | ~ int_leq(X1,n)
    | ~ int_leq(int_one,X1)
    | a(int_one,int_one) = real_one ),
    inference(spm,[status(thm)],[c_0_145,c_0_57]) ).

cnf(c_0_149,negated_conjecture,
    ( int_leq(esk5_0,int_one)
    | esk5_0 = int_one ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_146,c_0_141]),c_0_48])]) ).

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

cnf(c_0_151,hypothesis,
    ( ~ int_leq(int_one,X1)
    | ~ int_leq(X1,n)
    | n = esk3_0
    | a(int_one,int_one) = real_one ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_148,c_0_120]),c_0_93]) ).

cnf(c_0_152,negated_conjecture,
    esk5_0 = int_one,
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_149]),c_0_140]) ).

cnf(c_0_153,plain,
    ( ~ int_less(X1,X2)
    | int_leq(int_one,esk1_2(X1,X2)) ),
    inference(spm,[status(thm)],[c_0_150,c_0_37]) ).

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

cnf(c_0_155,negated_conjecture,
    ( n = esk3_0
    | a(int_one,int_one) = real_one ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_151,c_0_93]),c_0_120]) ).

cnf(c_0_156,negated_conjecture,
    ( int_leq(esk3_0,n)
    | a(int_one,int_one) = real_zero ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_102,c_0_152]),c_0_152]) ).

cnf(c_0_157,plain,
    ( ~ int_less(X1,X2)
    | int_less(int_one,esk1_2(X1,X2))
    | esk1_2(X1,X2) = int_one ),
    inference(spm,[status(thm)],[c_0_43,c_0_153]) ).

cnf(c_0_158,negated_conjecture,
    ( int_leq(esk5_0,n)
    | int_less(int_zero,esk3_0) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_121,c_0_154]),c_0_79]) ).

cnf(c_0_159,negated_conjecture,
    ( int_leq(esk3_0,n)
    | n = esk3_0 ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_155,c_0_156]),c_0_101]) ).

cnf(c_0_160,negated_conjecture,
    ( int_leq(esk5_0,n)
    | int_less(int_one,esk1_2(int_zero,esk3_0))
    | esk1_2(int_zero,esk3_0) = int_one ),
    inference(spm,[status(thm)],[c_0_157,c_0_158]) ).

cnf(c_0_161,plain,
    ( ~ int_less(int_zero,X1)
    | esk1_2(int_zero,X1) = X1 ),
    inference(spm,[status(thm)],[c_0_36,c_0_51]) ).

cnf(c_0_162,negated_conjecture,
    ( int_less(esk3_0,n)
    | n = esk3_0 ),
    inference(spm,[status(thm)],[c_0_43,c_0_159]) ).

cnf(c_0_163,negated_conjecture,
    ( int_less(esk2_0,esk3_0)
    | a(int_one,int_one) = real_zero ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_99,c_0_152]),c_0_152]) ).

cnf(c_0_164,negated_conjecture,
    ( int_leq(esk5_0,n)
    | int_less(int_one,esk3_0)
    | esk3_0 = int_one ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_160,c_0_161]),c_0_158]) ).

cnf(c_0_165,hypothesis,
    ( ~ int_leq(int_one,X2)
    | ~ int_leq(X2,n)
    | ~ int_leq(X1,n)
    | int_leq(X1,int_one)
    | a(int_one,int_one) = real_one ),
    inference(spm,[status(thm)],[c_0_148,c_0_62]) ).

cnf(c_0_166,negated_conjecture,
    ( ~ int_less(X1,esk3_0)
    | int_less(X1,n)
    | n = esk3_0 ),
    inference(spm,[status(thm)],[c_0_21,c_0_162]) ).

cnf(c_0_167,negated_conjecture,
    ( int_less(esk2_0,esk3_0)
    | n = esk3_0 ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_155,c_0_163]),c_0_101]) ).

cnf(c_0_168,hypothesis,
    ( ~ int_leq(esk2_0,n)
    | a(int_one,int_one) = real_zero ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_119,c_0_152]),c_0_152]) ).

cnf(c_0_169,negated_conjecture,
    ( ~ int_less(X1,int_one)
    | int_leq(esk5_0,n)
    | int_less(X1,esk3_0)
    | esk3_0 = int_one ),
    inference(spm,[status(thm)],[c_0_21,c_0_164]) ).

cnf(c_0_170,hypothesis,
    ( ~ int_leq(int_one,X1)
    | ~ int_leq(X1,n)
    | int_leq(n,int_one)
    | a(int_one,int_one) = real_one ),
    inference(spm,[status(thm)],[c_0_165,c_0_48]) ).

cnf(c_0_171,negated_conjecture,
    ( int_less(esk2_0,n)
    | n = esk3_0 ),
    inference(spm,[status(thm)],[c_0_166,c_0_167]) ).

cnf(c_0_172,negated_conjecture,
    ( ~ int_leq(esk2_0,n)
    | n = esk3_0 ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_155,c_0_168]),c_0_101]) ).

cnf(c_0_173,negated_conjecture,
    ( int_leq(esk5_0,n)
    | int_leq(int_one,n)
    | esk3_0 = int_one ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_169,c_0_122]),c_0_27]) ).

cnf(c_0_174,hypothesis,
    ( int_leq(n,int_one)
    | a(int_one,int_one) = real_one ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_170,c_0_48]),c_0_62]) ).

cnf(c_0_175,negated_conjecture,
    n = esk3_0,
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_171]),c_0_172]) ).

cnf(c_0_176,negated_conjecture,
    ( int_leq(int_one,n)
    | esk3_0 = int_one ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_173,c_0_152])]) ).

cnf(c_0_177,plain,
    ( int_leq(int_one,X1)
    | int_leq(X1,int_zero) ),
    inference(spm,[status(thm)],[c_0_150,c_0_54]) ).

cnf(c_0_178,hypothesis,
    ( int_leq(esk3_0,int_one)
    | a(int_one,int_one) = real_one ),
    inference(rw,[status(thm)],[c_0_174,c_0_175]) ).

cnf(c_0_179,hypothesis,
    ( ~ int_leq(esk2_0,n)
    | int_leq(n,int_one) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_174,c_0_168]),c_0_101]) ).

cnf(c_0_180,negated_conjecture,
    ( int_less(int_one,n)
    | n = int_one
    | esk3_0 = int_one ),
    inference(spm,[status(thm)],[c_0_43,c_0_176]) ).

cnf(c_0_181,hypothesis,
    ( ~ int_leq(int_one,X2)
    | ~ int_leq(X2,n)
    | ~ int_leq(X1,n)
    | int_leq(X1,int_zero)
    | a(int_one,int_one) = real_one ),
    inference(spm,[status(thm)],[c_0_148,c_0_177]) ).

cnf(c_0_182,negated_conjecture,
    ( int_leq(esk3_0,int_one)
    | int_less(esk2_0,esk3_0) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_163,c_0_178]),c_0_101]) ).

cnf(c_0_183,hypothesis,
    ( ~ int_leq(esk2_0,esk3_0)
    | int_leq(esk3_0,int_one) ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_179,c_0_175]),c_0_175]) ).

cnf(c_0_184,negated_conjecture,
    ( ~ int_less(n,int_one)
    | esk3_0 = int_one
    | n = int_one ),
    inference(spm,[status(thm)],[c_0_46,c_0_180]) ).

cnf(c_0_185,hypothesis,
    ( ~ int_leq(int_one,X1)
    | ~ int_leq(X1,n)
    | int_leq(n,int_zero)
    | a(int_one,int_one) = real_one ),
    inference(spm,[status(thm)],[c_0_181,c_0_48]) ).

cnf(c_0_186,negated_conjecture,
    int_leq(esk3_0,int_one),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_182]),c_0_183]) ).

cnf(c_0_187,negated_conjecture,
    ( ~ int_less(esk3_0,int_one)
    | esk3_0 = int_one ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_184,c_0_175]),c_0_175])]) ).

cnf(c_0_188,hypothesis,
    ( int_leq(n,int_zero)
    | a(int_one,int_one) = real_one ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_185,c_0_48]),c_0_177]) ).

cnf(c_0_189,negated_conjecture,
    esk3_0 = int_one,
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_186]),c_0_187]) ).

cnf(c_0_190,plain,
    ~ int_leq(int_one,int_zero),
    inference(spm,[status(thm)],[c_0_27,c_0_154]) ).

cnf(c_0_191,hypothesis,
    ( ~ int_leq(esk2_0,n)
    | int_leq(n,int_zero) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_188,c_0_168]),c_0_101]) ).

cnf(c_0_192,negated_conjecture,
    ( int_less(esk2_0,int_one)
    | a(int_one,int_one) = real_zero ),
    inference(rw,[status(thm)],[c_0_163,c_0_189]) ).

cnf(c_0_193,hypothesis,
    a(int_one,int_one) = real_one,
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_188,c_0_175]),c_0_189]),c_0_190]) ).

cnf(c_0_194,hypothesis,
    ( ~ int_leq(esk2_0,esk3_0)
    | int_leq(esk3_0,int_zero) ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_191,c_0_175]),c_0_175]) ).

cnf(c_0_195,negated_conjecture,
    int_less(esk2_0,int_one),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_192,c_0_193]),c_0_101]) ).

cnf(c_0_196,hypothesis,
    ~ int_leq(esk2_0,int_one),
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_194,c_0_189]),c_0_189]),c_0_190]) ).

cnf(c_0_197,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_195]),c_0_196]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SWV492+1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.36  % Computer : n026.cluster.edu
% 0.11/0.36  % Model    : x86_64 x86_64
% 0.11/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.36  % Memory   : 8046.5625MB
% 0.11/0.36  % OS       : Linux 6.8.0-71-generic
% 0.11/0.36  % CPULimit : 300
% 0.11/0.36  % WCLimit  : 300
% 0.11/0.36  % DateTime : Mon Sep 21 08:57:06 UTC 2026
% 0.11/0.36  % CPUTime  : 
% 0.11/0.37  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.11/0.41  Running first-order theorem proving
% 0.11/0.41  Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 234.63/34.58  % Version: 3.5.1
% 234.63/34.58  % Preprocessing class: FSMSSMSSSSSNFFN.
% 234.63/34.58  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 234.63/34.58  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 234.63/34.58  % Starting new_bool_3 with 300s (1) cores
% 234.63/34.58  % Starting new_bool_1 with 300s (1) cores
% 234.63/34.58  % Starting sh5l with 300s (1) cores
% 234.63/34.58  % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1894680 completed with status 0
% 234.63/34.58  % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 234.63/34.58  % Preprocessing class: FSMSSMSSSSSNFFN.
% 234.63/34.58  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 234.63/34.58  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 234.63/34.58  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 234.63/34.58  % No SInE strategy applied
% 234.63/34.58  % Search class: FGHSS-FFMM22-SFFFFFNN
% 234.63/34.58  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 234.63/34.58  % Starting SubtermCWHack with 136s (1) cores
% 234.63/34.58  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 234.63/34.58  % Starting G-E--_208_C18_F1_SE_CS_SP_PS_S5PRR_S0Y with 136s (1) cores
% 234.63/34.58  % Starting new_bool_3 with 136s (1) cores
% 234.63/34.58  % Starting new_bool_1 with 136s (1) cores
% 234.63/34.58  % G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 1894687 completed with status 0
% 234.63/34.58  % Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 234.63/34.58  % Preprocessing class: FSMSSMSSSSSNFFN.
% 234.63/34.58  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 234.63/34.58  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 234.63/34.58  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 234.63/34.58  % No SInE strategy applied
% 234.63/34.58  % Search class: FGHSS-FFMM22-SFFFFFNN
% 234.63/34.58  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 234.63/34.58  % Starting SubtermCWHack with 136s (1) cores
% 234.63/34.58  % Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 234.63/34.58  % Preprocessing time       : 0.002 s
% 234.63/34.58  % Presaturation interreduction done
% 234.63/34.58  
% 234.63/34.58  % Proof found!
% 234.63/34.58  % SZS status Theorem
% 234.63/34.58  % SZS output start CNFRefutation
% See solution above
% 234.63/34.58  % Parsed axioms                        : 13
% 234.63/34.58  % Removed by relevancy pruning/SinE    : 0
% 234.63/34.58  % Initial clauses                      : 36
% 234.63/34.58  % Removed in clause preprocessing      : 0
% 234.63/34.58  % Initial clauses in saturation        : 36
% 234.63/34.58  % Processed clauses                    : 35720
% 234.63/34.58  % ...of these trivial                  : 88
% 234.63/34.58  % ...subsumed                          : 28786
% 234.63/34.58  % ...remaining for further processing  : 6846
% 234.63/34.58  % Other redundant clauses eliminated   : 5
% 234.63/34.58  % Clauses deleted for lack of memory   : 0
% 234.63/34.58  % Backward-subsumed                    : 822
% 234.63/34.58  % Backward-rewritten                   : 3190
% 234.63/34.58  % Generated clauses                    : 1049125
% 234.63/34.58  % ...of the previous two non-redundant : 937683
% 234.63/34.58  % ...aggressively subsumed             : 0
% 234.63/34.58  % Contextual simplify-reflections      : 152
% 234.63/34.58  % Paramodulations                      : 1048920
% 234.63/34.58  % Factorizations                       : 200
% 234.63/34.58  % NegExts                              : 0
% 234.63/34.58  % Equation resolutions                 : 5
% 234.63/34.58  % Disequality decompositions           : 0
% 234.63/34.58  % Total rewrite steps                  : 222976
% 234.63/34.58  % ...of those cached                   : 222776
% 234.63/34.58  % Propositional unsat checks           : 1
% 234.63/34.58  %    Propositional check models        : 0
% 234.63/34.58  %    Propositional check unsatisfiable : 0
% 234.63/34.58  %    Propositional clauses             : 0
% 234.63/34.58  %    Propositional clauses after purity: 0
% 234.63/34.58  %    Propositional unsat core size     : 0
% 234.63/34.58  %    Propositional preprocessing time  : 0.000
% 234.63/34.58  %    Propositional encoding time       : 0.950
% 234.63/34.58  %    Propositional solver time         : 0.127
% 234.63/34.58  %    Success case prop preproc time    : 0.000
% 234.63/34.58  %    Success case prop encoding time   : 0.000
% 234.63/34.58  %    Success case prop solver time     : 0.000
% 234.63/34.58  % Current number of processed clauses  : 2793
% 234.63/34.58  %    Positive orientable unit clauses  : 15
% 234.63/34.58  %    Positive unorientable unit clauses: 1
% 234.63/34.58  %    Negative unit clauses             : 6
% 234.63/34.58  %    Non-unit-clauses                  : 2771
% 234.63/34.58  % Current number of unprocessed clauses: 888916
% 234.63/34.58  % ...number of literals in the above   : 5281233
% 234.63/34.58  % Current number of archived formulas  : 0
% 234.63/34.58  % Current number of archived clauses   : 4048
% 234.63/34.58  % Clause-clause subsumption calls (NU) : 2890413
% 234.63/34.58  % Rec. Clause-clause subsumption calls : 784932
% 234.63/34.58  % Non-unit clause-clause subsumptions  : 27258
% 234.63/34.58  % Unit Clause-clause subsumption calls : 7408
% 234.63/34.58  % Rewrite failures with RHS unbound    : 0
% 234.63/34.58  % BW rewrite match attempts            : 17
% 234.63/34.58  % BW rewrite match successes           : 14
% 234.63/34.58  % Condensation attempts                : 0
% 234.63/34.58  % Condensation successes               : 0
% 234.63/34.58  % Termbank termtop insertions          : 19064973
% 234.63/34.58  % Search garbage collected termcells   : 453
% 234.63/34.58  
% 234.63/34.58  % -------------------------------------------------
% 234.63/34.58  % User time                : 32.470 s
% 234.63/34.58  % System time              : 1.048 s
% 234.63/34.58  % Total time               : 33.518 s
% 234.63/34.58  % Maximum resident set size: 3648 pages
% 234.63/34.58  
% 234.63/34.58  % -------------------------------------------------
% 234.63/34.58  % User time                : 160.742 s
% 234.63/34.58  % System time              : 5.715 s
% 234.63/34.58  % Total time               : 166.458 s
% 234.63/34.58  % Maximum resident set size: 4608 pages
% 234.63/34.58  % E exiting
%------------------------------------------------------------------------------