↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : SWV431^2 : TPTP v9.3.1. Released v3.6.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM

% Computer : n004.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 : Wed Sep 30 08:39:43 AM UTC 2026

% Result   : Theorem 0.21s 0.27s
% Output   : CNFRefutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   13
%            Number of leaves      :   14
% Syntax   : Number of formulae    :   60 (  41 unt;   0 typ;   0 def)
%            Number of atoms       :  198 (  28 equ;   0 cnn)
%            Maximal formula atoms :   18 (   3 avg)
%            Number of connectives :  421 (  46   ~;  55   |;   9   &; 290   @)
%                                         (   0 <=>;  21  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   17 (   4 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   62 (  62   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   24 (  22 usr;   6 con; 0-3 aty)
%            Number of variables   :  130 (  60   ^;  70   !;   0   ?; 130   :)

% Comments : 
%------------------------------------------------------------------------------
thf(decl_29,type,
    mnot: ( $i > $o ) > $i > $o ).

thf(decl_30,type,
    mor: ( $i > $o ) > ( $i > $o ) > $i > $o ).

thf(decl_32,type,
    mimpl: ( $i > $o ) > ( $i > $o ) > $i > $o ).

thf(decl_34,type,
    mbox: ( $i > $i > $o ) > ( $i > $o ) > $i > $o ).

thf(decl_38,type,
    mvalid: ( $i > $o ) > $o ).

thf(decl_42,type,
    rel: $i > $i > $o ).

thf(decl_43,type,
    icl_atom: ( $i > $o ) > $i > $o ).

thf(decl_44,type,
    icl_princ: ( $i > $o ) > $i > $o ).

thf(decl_47,type,
    icl_impl: ( $i > $o ) > ( $i > $o ) > $i > $o ).

thf(decl_50,type,
    icl_says: ( $i > $o ) > ( $i > $o ) > $i > $o ).

thf(decl_51,type,
    iclval: ( $i > $o ) > $o ).

thf(decl_52,type,
    icl_impl_princ: ( $i > $o ) > ( $i > $o ) > $i > $o ).

thf(decl_53,type,
    a: $i > $o ).

thf(decl_54,type,
    b: $i > $o ).

thf(decl_55,type,
    s: $i > $o ).

thf(decl_56,type,
    esk1_2: ( $i > $o ) > $i > $i ).

thf(decl_57,type,
    esk2_2: ( $i > $o ) > $i > $i ).

thf(decl_58,type,
    esk3_0: $i ).

thf(decl_59,type,
    esk4_0: $i ).

thf(decl_60,type,
    esk5_0: $i ).

thf(decl_61,type,
    esk6_0: $i ).

thf(decl_62,type,
    esk7_0: $i ).

thf(mimpl,axiom,
    ( mimpl
    = ( ^ [X7: $i > $o,X8: $i > $o] : ( mor @ ( mnot @ X7 ) @ X8 ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.PnkuEW9Plk/E---3.1_1479259.p',mimpl) ).

thf(mnot,axiom,
    ( mnot
    = ( ^ [X2: $i > $o,X3: $i] :
          ~ ( X2 @ X3 ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.PnkuEW9Plk/E---3.1_1479259.p',mnot) ).

thf(mor,axiom,
    ( mor
    = ( ^ [X4: $i > $o,X5: $i > $o,X3: $i] :
          ( ( X4 @ X3 )
          | ( X5 @ X3 ) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.PnkuEW9Plk/E---3.1_1479259.p',mor) ).

thf(mbox,axiom,
    ( mbox
    = ( ^ [X10: $i > $i > $o,X11: $i > $o,X1: $i] :
        ! [X12: $i] :
          ( ( X10 @ X1 @ X12 )
         => ( X11 @ X12 ) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.PnkuEW9Plk/E---3.1_1479259.p',mbox) ).

thf(mvalid,axiom,
    ( mvalid
    = ( ^ [X11: $i > $o] :
        ! [X15: $i] : ( X11 @ X15 ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.PnkuEW9Plk/E---3.1_1479259.p',mvalid) ).

thf(icl_atom,axiom,
    ( icl_atom
    = ( ^ [X11: $i > $o] : ( mbox @ rel @ X11 ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.PnkuEW9Plk/E---3.1_1479259.p',icl_atom) ).

thf(icl_impl,axiom,
    ( icl_impl
    = ( ^ [X19: $i > $o,X20: $i > $o] : ( mbox @ rel @ ( mimpl @ X19 @ X20 ) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.PnkuEW9Plk/E---3.1_1479259.p',icl_impl) ).

thf(icl_says,axiom,
    ( icl_says
    = ( ^ [X19: $i > $o,X21: $i > $o] : ( mbox @ rel @ ( mor @ X19 @ X21 ) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.PnkuEW9Plk/E---3.1_1479259.p',icl_says) ).

thf(icl_s4_valid,axiom,
    ( iclval
    = ( ^ [X22: $i > $o] : ( mvalid @ X22 ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.PnkuEW9Plk/E---3.1_1479259.p',icl_s4_valid) ).

thf(icl_impl_princ,axiom,
    ( icl_impl_princ
    = ( ^ [X19: $i > $o,X20: $i > $o] : ( mbox @ rel @ ( mimpl @ X19 @ X20 ) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.PnkuEW9Plk/E---3.1_1479259.p',icl_impl_princ) ).

thf(refl_axiom,axiom,
    ! [X19: $i > $o] : ( mvalid @ ( mimpl @ ( mbox @ rel @ X19 ) @ X19 ) ),
    file('/export/starexec/sandbox/tmp/tmp.PnkuEW9Plk/E---3.1_1479259.p',refl_axiom) ).

thf(speaking_for,conjecture,
    iclval @ ( icl_impl @ ( icl_impl_princ @ ( icl_princ @ a ) @ ( icl_princ @ b ) ) @ ( icl_impl @ ( icl_says @ ( icl_princ @ a ) @ ( icl_atom @ s ) ) @ ( icl_says @ ( icl_princ @ b ) @ ( icl_atom @ s ) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.PnkuEW9Plk/E---3.1_1479259.p',speaking_for) ).

thf(icl_princ,axiom,
    ( icl_princ
    = ( ^ [X11: $i > $o] : X11 ) ),
    file('/export/starexec/sandbox/tmp/tmp.PnkuEW9Plk/E---3.1_1479259.p',icl_princ) ).

thf(trans_axiom,axiom,
    ! [X20: $i > $o] : ( mvalid @ ( mimpl @ ( mbox @ rel @ X20 ) @ ( mbox @ rel @ ( mbox @ rel @ X20 ) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.PnkuEW9Plk/E---3.1_1479259.p',trans_axiom) ).

thf(c_0_14,plain,
    ( mimpl
    = ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
          ( ~ ( Z0 @ Z2 )
          | ( Z1 @ Z2 ) ) ) ),
    inference(fof_simplification,[status(thm)],[mimpl]) ).

thf(c_0_15,plain,
    ( mnot
    = ( ^ [Z0: $i > $o,Z1: $i] :
          ~ ( Z0 @ Z1 ) ) ),
    inference(fof_simplification,[status(thm)],[mnot]) ).

thf(c_0_16,plain,
    ( mor
    = ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
          ( ( Z0 @ Z2 )
          | ( Z1 @ Z2 ) ) ) ),
    inference(fof_simplification,[status(thm)],[mor]) ).

thf(c_0_17,plain,
    ( mimpl
    = ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
          ( ~ ( Z0 @ Z2 )
          | ( Z1 @ Z2 ) ) ) ),
    inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).

thf(c_0_18,plain,
    ( mbox
    = ( ^ [Z0: $i > $i > $o,Z1: $i > $o,Z2: $i] :
        ! [X12: $i] :
          ( ( Z0 @ Z2 @ X12 )
         => ( Z1 @ X12 ) ) ) ),
    inference(fof_simplification,[status(thm)],[mbox]) ).

thf(c_0_19,plain,
    ( mvalid
    = ( ^ [Z0: $i > $o] :
        ! [X15: $i] : ( Z0 @ X15 ) ) ),
    inference(fof_simplification,[status(thm)],[mvalid]) ).

thf(c_0_20,plain,
    ( icl_atom
    = ( ^ [Z0: $i > $o,Z1: $i] :
        ! [X25: $i] :
          ( ( rel @ Z1 @ X25 )
         => ( Z0 @ X25 ) ) ) ),
    inference(fof_simplification,[status(thm)],[icl_atom]) ).

thf(c_0_21,plain,
    ( icl_impl
    = ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
        ! [X26: $i] :
          ( ( rel @ Z2 @ X26 )
         => ( ~ ( Z0 @ X26 )
            | ( Z1 @ X26 ) ) ) ) ),
    inference(fof_simplification,[status(thm)],[icl_impl]) ).

thf(c_0_22,plain,
    ( icl_says
    = ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
        ! [X27: $i] :
          ( ( rel @ Z2 @ X27 )
         => ( ( Z0 @ X27 )
            | ( Z1 @ X27 ) ) ) ) ),
    inference(fof_simplification,[status(thm)],[icl_says]) ).

thf(c_0_23,plain,
    ( iclval
    = ( ^ [Z0: $i > $o] :
        ! [X28: $i] : ( Z0 @ X28 ) ) ),
    inference(fof_simplification,[status(thm)],[icl_s4_valid]) ).

thf(c_0_24,plain,
    ( icl_impl_princ
    = ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
        ! [X29: $i] :
          ( ( rel @ Z2 @ X29 )
         => ( ~ ( Z0 @ X29 )
            | ( Z1 @ X29 ) ) ) ) ),
    inference(fof_simplification,[status(thm)],[icl_impl_princ]) ).

thf(c_0_25,plain,
    ! [X19: $i > $o,X31: $i] :
      ( ~ ! [X30: $i] :
            ( ( rel @ X31 @ X30 )
           => ( X19 @ X30 ) )
      | ( X19 @ X31 ) ),
    inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[refl_axiom,c_0_17]),c_0_18]),c_0_19]) ).

thf(c_0_26,negated_conjecture,
    ~ ( iclval @ ( icl_impl @ ( icl_impl_princ @ ( icl_princ @ a ) @ ( icl_princ @ b ) ) @ ( icl_impl @ ( icl_says @ ( icl_princ @ a ) @ ( icl_atom @ s ) ) @ ( icl_says @ ( icl_princ @ b ) @ ( icl_atom @ s ) ) ) ) ),
    inference(assume_negation,[status(cth)],[speaking_for]) ).

thf(c_0_27,plain,
    ( icl_atom
    = ( ^ [Z0: $i > $o,Z1: $i] :
        ! [X25: $i] :
          ( ( rel @ Z1 @ X25 )
         => ( Z0 @ X25 ) ) ) ),
    inference(apply_def,[status(thm)],[c_0_20,c_0_18]) ).

thf(c_0_28,plain,
    ( icl_princ
    = ( ^ [Z0: $i > $o] : Z0 ) ),
    inference(fof_simplification,[status(thm)],[icl_princ]) ).

thf(c_0_29,plain,
    ( icl_impl
    = ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
        ! [X26: $i] :
          ( ( rel @ Z2 @ X26 )
         => ( ~ ( Z0 @ X26 )
            | ( Z1 @ X26 ) ) ) ) ),
    inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_21,c_0_17]),c_0_18]) ).

thf(c_0_30,plain,
    ( icl_says
    = ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
        ! [X27: $i] :
          ( ( rel @ Z2 @ X27 )
         => ( ( Z0 @ X27 )
            | ( Z1 @ X27 ) ) ) ) ),
    inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_22,c_0_16]),c_0_18]) ).

thf(c_0_31,plain,
    ( iclval
    = ( ^ [Z0: $i > $o] :
        ! [X28: $i] : ( Z0 @ X28 ) ) ),
    inference(apply_def,[status(thm)],[c_0_23,c_0_19]) ).

thf(c_0_32,plain,
    ( icl_impl_princ
    = ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
        ! [X29: $i] :
          ( ( rel @ Z2 @ X29 )
         => ( ~ ( Z0 @ X29 )
            | ( Z1 @ X29 ) ) ) ) ),
    inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_24,c_0_17]),c_0_18]) ).

thf(c_0_33,plain,
    ! [X20: $i > $o,X35: $i] :
      ( ~ ! [X32: $i] :
            ( ( rel @ X35 @ X32 )
           => ( X20 @ X32 ) )
      | ! [X34: $i] :
          ( ( rel @ X35 @ X34 )
         => ! [X33: $i] :
              ( ( rel @ X34 @ X33 )
             => ( X20 @ X33 ) ) ) ),
    inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[trans_axiom,c_0_17]),c_0_18]),c_0_19]) ).

thf(c_0_34,plain,
    ! [X44: $i > $o,X45: $i] :
      ( ( ( rel @ X45 @ ( esk1_2 @ X44 @ X45 ) )
        | ( X44 @ X45 ) )
      & ( ~ ( X44 @ ( esk1_2 @ X44 @ X45 ) )
        | ( X44 @ X45 ) ) ),
    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_25])])])])]) ).

thf(c_0_35,negated_conjecture,
    ~ ! [X43: $i,X42: $i] :
        ( ( rel @ X43 @ X42 )
       => ( ~ ! [X36: $i] :
                ( ( rel @ X42 @ X36 )
               => ( ~ ( a @ X36 )
                  | ( b @ X36 ) ) )
          | ! [X41: $i] :
              ( ( rel @ X42 @ X41 )
             => ( ~ ! [X38: $i] :
                      ( ( rel @ X41 @ X38 )
                     => ( ( a @ X38 )
                        | ! [X37: $i] :
                            ( ( rel @ X38 @ X37 )
                           => ( s @ X37 ) ) ) )
                | ! [X40: $i] :
                    ( ( rel @ X41 @ X40 )
                   => ( ( b @ X40 )
                      | ! [X39: $i] :
                          ( ( rel @ X40 @ X39 )
                         => ( s @ X39 ) ) ) ) ) ) ) ),
    inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_26,c_0_27]),c_0_28]),c_0_29]),c_0_30]),c_0_31]),c_0_32])]) ).

thf(c_0_36,plain,
    ! [X47: $i > $o,X48: $i,X50: $i,X51: $i] :
      ( ( ( rel @ X48 @ ( esk2_2 @ X47 @ X48 ) )
        | ~ ( rel @ X48 @ X50 )
        | ~ ( rel @ X50 @ X51 )
        | ( X47 @ X51 ) )
      & ( ~ ( X47 @ ( esk2_2 @ X47 @ X48 ) )
        | ~ ( rel @ X48 @ X50 )
        | ~ ( rel @ X50 @ X51 )
        | ( X47 @ X51 ) ) ),
    inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_33])])])])])]) ).

thf(c_0_37,plain,
    ! [X2: $i > $o,X1: $i] :
      ( ( X2 @ X1 )
      | ~ ( X2 @ ( esk1_2 @ X2 @ X1 ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_34]) ).

thf(c_0_38,plain,
    ! [X2: $i > $o,X1: $i] :
      ( ( rel @ X1 @ ( esk1_2 @ X2 @ X1 ) )
      | ( X2 @ X1 ) ),
    inference(split_conjunct,[status(thm)],[c_0_34]) ).

thf(c_0_39,negated_conjecture,
    ! [X54: $i,X56: $i,X57: $i] :
      ( ( rel @ esk3_0 @ esk4_0 )
      & ( ~ ( rel @ esk4_0 @ X54 )
        | ~ ( a @ X54 )
        | ( b @ X54 ) )
      & ( rel @ esk4_0 @ esk5_0 )
      & ( ~ ( rel @ esk5_0 @ X56 )
        | ( a @ X56 )
        | ~ ( rel @ X56 @ X57 )
        | ( s @ X57 ) )
      & ( rel @ esk5_0 @ esk6_0 )
      & ~ ( b @ esk6_0 )
      & ( rel @ esk6_0 @ esk7_0 )
      & ~ ( s @ esk7_0 ) ),
    inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_35])])])])]) ).

thf(c_0_40,plain,
    ! [X1: $i,X2: $i > $o,X3: $i,X12: $i] :
      ( ( rel @ X1 @ ( esk2_2 @ X2 @ X1 ) )
      | ( X2 @ X12 )
      | ~ ( rel @ X1 @ X3 )
      | ~ ( rel @ X3 @ X12 ) ),
    inference(split_conjunct,[status(thm)],[c_0_36]) ).

thf(c_0_41,plain,
    ! [X1: $i] : ( rel @ X1 @ X1 ),
    inference(spm,[status(thm)],[c_0_37,c_0_38]) ).

thf(c_0_42,negated_conjecture,
    rel @ esk5_0 @ esk6_0,
    inference(split_conjunct,[status(thm)],[c_0_39]) ).

thf(c_0_43,plain,
    ! [X1: $i,X2: $i > $o,X3: $i] :
      ( ( rel @ X1 @ ( esk2_2 @ X2 @ X1 ) )
      | ( X2 @ X3 )
      | ~ ( rel @ X1 @ X3 ) ),
    inference(spm,[status(thm)],[c_0_40,c_0_41]) ).

thf(c_0_44,negated_conjecture,
    ! [X2: $i > $o,X1: $i] :
      ( ( rel @ X1 @ ( esk2_2 @ X2 @ X1 ) )
      | ( X2 @ esk6_0 )
      | ~ ( rel @ X1 @ esk5_0 ) ),
    inference(spm,[status(thm)],[c_0_40,c_0_42]) ).

thf(c_0_45,negated_conjecture,
    ! [X1: $i,X3: $i] :
      ( ( a @ X1 )
      | ( s @ X3 )
      | ~ ( rel @ esk5_0 @ X1 )
      | ~ ( rel @ X1 @ X3 ) ),
    inference(split_conjunct,[status(thm)],[c_0_39]) ).

thf(c_0_46,negated_conjecture,
    rel @ esk6_0 @ esk7_0,
    inference(split_conjunct,[status(thm)],[c_0_39]) ).

thf(c_0_47,negated_conjecture,
    ~ ( s @ esk7_0 ),
    inference(split_conjunct,[status(thm)],[c_0_39]) ).

thf(c_0_48,negated_conjecture,
    ! [X4: $i > $o,X2: $i > $o,X1: $i] :
      ( ( rel @ X1 @ ( esk2_2 @ X2 @ X1 ) )
      | ( X2 @ ( esk2_2 @ X4 @ X1 ) )
      | ( X4 @ esk6_0 )
      | ~ ( rel @ X1 @ esk5_0 ) ),
    inference(spm,[status(thm)],[c_0_43,c_0_44]) ).

thf(c_0_49,negated_conjecture,
    rel @ esk4_0 @ esk5_0,
    inference(split_conjunct,[status(thm)],[c_0_39]) ).

thf(c_0_50,negated_conjecture,
    ! [X1: $i] :
      ( ( b @ X1 )
      | ~ ( rel @ esk4_0 @ X1 )
      | ~ ( a @ X1 ) ),
    inference(split_conjunct,[status(thm)],[c_0_39]) ).

thf(c_0_51,negated_conjecture,
    a @ esk6_0,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_42])]),c_0_47]) ).

thf(c_0_52,negated_conjecture,
    ~ ( b @ esk6_0 ),
    inference(split_conjunct,[status(thm)],[c_0_39]) ).

thf(c_0_53,negated_conjecture,
    ! [X2: $i > $o,X4: $i > $o] :
      ( ( rel @ esk4_0 @ ( esk2_2 @ X2 @ esk4_0 ) )
      | ( X2 @ ( esk2_2 @ X4 @ esk4_0 ) )
      | ( X4 @ esk6_0 ) ),
    inference(spm,[status(thm)],[c_0_48,c_0_49]) ).

thf(c_0_54,negated_conjecture,
    ~ ( rel @ esk4_0 @ esk6_0 ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_51]),c_0_52]) ).

thf(c_0_55,plain,
    ! [X1: $i,X2: $i > $o,X3: $i,X12: $i] :
      ( ( X2 @ X12 )
      | ~ ( X2 @ ( esk2_2 @ X2 @ X1 ) )
      | ~ ( rel @ X1 @ X3 )
      | ~ ( rel @ X3 @ X12 ) ),
    inference(split_conjunct,[status(thm)],[c_0_36]) ).

thf(c_0_56,negated_conjecture,
    rel @ esk4_0 @ ( esk2_2 @ ( rel @ esk4_0 ) @ esk4_0 ),
    inference(sr,[status(thm)],[inference(ef,[status(thm)],[c_0_53]),c_0_54]) ).

thf(c_0_57,negated_conjecture,
    ! [X3: $i,X1: $i] :
      ( ( rel @ esk4_0 @ X1 )
      | ~ ( rel @ esk4_0 @ X3 )
      | ~ ( rel @ X3 @ X1 ) ),
    inference(spm,[status(thm)],[c_0_55,c_0_56]) ).

thf(c_0_58,negated_conjecture,
    ! [X1: $i] :
      ( ( rel @ esk4_0 @ X1 )
      | ~ ( rel @ esk5_0 @ X1 ) ),
    inference(spm,[status(thm)],[c_0_57,c_0_49]) ).

thf(c_0_59,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_42]),c_0_54]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SWV431^2 : TPTP v9.3.1. Released v3.6.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.17  % Computer : n004.cluster.edu
% 0.09/0.17  % Model    : x86_64 x86_64
% 0.09/0.17  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.17  % Memory   : 8046.5625MB
% 0.09/0.17  % OS       : Linux 6.8.0-71-generic
% 0.09/0.17  % CPULimit : 300
% 0.09/0.17  % WCLimit  : 300
% 0.09/0.17  % DateTime : Tue Sep 29 16:03:21 UTC 2026
% 0.09/0.17  % CPUTime  : 
% 0.09/0.17  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.09/0.21  Running higher-order theorem proving
% 0.09/0.23  Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.PnkuEW9Plk/E---3.1_1479259.p
% 0.21/0.27  % Version: 3.5.1-ho
% 0.21/0.27  % Preprocessing class: HSMSSMSSMLSNHSN.
% 0.21/0.27  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.27  % Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.21/0.27  % Starting post_as_ho3 with 300s (1) cores
% 0.21/0.27  % Starting post_as_ho11 with 300s (1) cores
% 0.21/0.27  % Starting full_lambda_8 with 300s (1) cores
% 0.21/0.27  % post_as_ho3 with pid 1479273 completed with status 0
% 0.21/0.27  % Result found by post_as_ho3
% 0.21/0.27  % Preprocessing class: HSMSSMSSMLSNHSN.
% 0.21/0.27  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.27  % Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.21/0.27  % Starting post_as_ho3 with 300s (1) cores
% 0.21/0.27  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.21/0.27  % No SInE strategy applied
% 0.21/0.27  % Search class: HGUNF-FFSS22-SHSSMSBN
% 0.21/0.27  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.27  % Starting SubtermCWHack with 28s (1) cores
% 0.21/0.27  % SubtermCWHack with pid 1479276 completed with status 0
% 0.21/0.27  % Result found by SubtermCWHack
% 0.21/0.27  % Preprocessing class: HSMSSMSSMLSNHSN.
% 0.21/0.27  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.27  % Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.21/0.27  % Starting post_as_ho3 with 300s (1) cores
% 0.21/0.27  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.21/0.27  % No SInE strategy applied
% 0.21/0.27  % Search class: HGUNF-FFSS22-SHSSMSBN
% 0.21/0.27  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.27  % Starting SubtermCWHack with 28s (1) cores
% 0.21/0.27  % Preprocessing time       : 0.001 s
% 0.21/0.27  
% 0.21/0.27  % Proof found!
% 0.21/0.27  % SZS status Theorem
% 0.21/0.27  % SZS output start CNFRefutation
% See solution above
% 0.21/0.27  % Parsed axioms                        : 62
% 0.21/0.27  % Removed by relevancy pruning/SinE    : 0
% 0.21/0.27  % Initial clauses                      : 46
% 0.21/0.27  % Removed in clause preprocessing      : 34
% 0.21/0.27  % Initial clauses in saturation        : 12
% 0.21/0.27  % Processed clauses                    : 116
% 0.21/0.27  % ...of these trivial                  : 1
% 0.21/0.27  % ...subsumed                          : 19
% 0.21/0.27  % ...remaining for further processing  : 96
% 0.21/0.27  % Other redundant clauses eliminated   : 0
% 0.21/0.27  % Clauses deleted for lack of memory   : 0
% 0.21/0.27  % Backward-subsumed                    : 2
% 0.21/0.27  % Backward-rewritten                   : 14
% 0.21/0.27  % Generated clauses                    : 856
% 0.21/0.27  % ...of the previous two non-redundant : 820
% 0.21/0.27  % ...aggressively subsumed             : 0
% 0.21/0.27  % Contextual simplify-reflections      : 0
% 0.21/0.27  % Paramodulations                      : 836
% 0.21/0.27  % Factorizations                       : 20
% 0.21/0.27  % NegExts                              : 0
% 0.21/0.27  % Equation resolutions                 : 0
% 0.21/0.27  % Disequality decompositions           : 0
% 0.21/0.27  % Total rewrite steps                  : 72
% 0.21/0.27  % ...of those cached                   : 56
% 0.21/0.27  % Propositional unsat checks           : 0
% 0.21/0.27  %    Propositional check models        : 0
% 0.21/0.27  %    Propositional check unsatisfiable : 0
% 0.21/0.27  %    Propositional clauses             : 0
% 0.21/0.27  %    Propositional clauses after purity: 0
% 0.21/0.27  %    Propositional unsat core size     : 0
% 0.21/0.27  %    Propositional preprocessing time  : 0.000
% 0.21/0.27  %    Propositional encoding time       : 0.000
% 0.21/0.27  %    Propositional solver time         : 0.000
% 0.21/0.27  %    Success case prop preproc time    : 0.000
% 0.21/0.27  %    Success case prop encoding time   : 0.000
% 0.21/0.27  %    Success case prop solver time     : 0.000
% 0.21/0.27  % Current number of processed clauses  : 80
% 0.21/0.27  %    Positive orientable unit clauses  : 10
% 0.21/0.27  %    Positive unorientable unit clauses: 0
% 0.21/0.27  %    Negative unit clauses             : 3
% 0.21/0.27  %    Non-unit-clauses                  : 67
% 0.21/0.27  % Current number of unprocessed clauses: 664
% 0.21/0.27  % ...number of literals in the above   : 3396
% 0.21/0.27  % Current number of archived formulas  : 0
% 0.21/0.27  % Current number of archived clauses   : 16
% 0.21/0.27  % Clause-clause subsumption calls (NU) : 886
% 0.21/0.27  % Rec. Clause-clause subsumption calls : 635
% 0.21/0.27  % Non-unit clause-clause subsumptions  : 19
% 0.21/0.27  % Unit Clause-clause subsumption calls : 12
% 0.21/0.27  % Rewrite failures with RHS unbound    : 0
% 0.21/0.27  % BW rewrite match attempts            : 9
% 0.21/0.27  % BW rewrite match successes           : 3
% 0.21/0.27  % Condensation attempts                : 0
% 0.21/0.27  % Condensation successes               : 0
% 0.21/0.27  % Termbank termtop insertions          : 19310
% 0.21/0.27  % Search garbage collected termcells   : 797
% 0.21/0.27  
% 0.21/0.27  % -------------------------------------------------
% 0.21/0.27  % User time                : 0.014 s
% 0.21/0.27  % System time              : 0.003 s
% 0.21/0.27  % Total time               : 0.017 s
% 0.21/0.27  % Maximum resident set size: 3684 pages
% 0.21/0.27  
% 0.21/0.27  % -------------------------------------------------
% 0.21/0.27  % User time                : 0.018 s
% 0.21/0.27  % System time              : 0.006 s
% 0.21/0.27  % Total time               : 0.024 s
% 0.21/0.27  % Maximum resident set size: 4864 pages
% 0.21/0.27  % E exiting
%------------------------------------------------------------------------------