↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : SWV436^4 : 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 : n017.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:44 AM UTC 2026

% Result   : Theorem 0.08s 0.24s
% Output   : CNFRefutation 0.08s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   12
%            Number of leaves      :   17
% Syntax   : Number of formulae    :   63 (  38 unt;   0 typ;   0 def)
%            Number of atoms       :  209 (  29 equ;   0 cnn)
%            Maximal formula atoms :   12 (   3 avg)
%            Number of connectives :  401 (  66   ~;  69   |;   2   &; 245   @)
%                                         (   0 <=>;  19  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   16 (   5 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   45 (  45   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   22 (  19 usr;   4 con; 0-3 aty)
%            Number of variables   :  136 (  56   ^;  80   !;   0   ?; 136   :)

% Comments : 
%------------------------------------------------------------------------------
thf(decl_27,type,
    mfalse: $i > $o ).

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_49,type,
    icl_false: $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,
    admin: $i > $o ).

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

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

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

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

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

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

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

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

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

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.2F4xSBbEQF/E---3.1_510211.p',mbox) ).

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

thf(mfalse,axiom,
    ( mfalse
    = ( ^ [X1: $i] : ~ $true ) ),
    file('/export/starexec/sandbox/tmp/tmp.2F4xSBbEQF/E---3.1_510211.p',mfalse) ).

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

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

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

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

thf(icl_false,axiom,
    ( icl_false
    = ( ^ [Z0: $i] : ~ $true ) ),
    file('/export/starexec/sandbox/tmp/tmp.2F4xSBbEQF/E---3.1_510211.p',icl_false) ).

thf(ax1,axiom,
    iclval @ ( icl_says @ ( icl_impl @ ( icl_princ @ admin ) @ icl_false ) @ ( icl_atom @ deletefile1 ) ),
    file('/export/starexec/sandbox/tmp/tmp.2F4xSBbEQF/E---3.1_510211.p',ax1) ).

thf(ex3,conjecture,
    iclval @ ( icl_atom @ deletefile1 ),
    file('/export/starexec/sandbox/tmp/tmp.2F4xSBbEQF/E---3.1_510211.p',ex3) ).

thf(ax2,axiom,
    iclval @ ( icl_says @ ( icl_princ @ admin ) @ ( icl_says @ ( icl_impl @ ( icl_princ @ bob ) @ ( icl_princ @ admin ) ) @ ( icl_atom @ deletefile1 ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.2F4xSBbEQF/E---3.1_510211.p',ax2) ).

thf(ax3,axiom,
    iclval @ ( icl_says @ ( icl_princ @ bob ) @ ( icl_atom @ deletefile1 ) ),
    file('/export/starexec/sandbox/tmp/tmp.2F4xSBbEQF/E---3.1_510211.p',ax3) ).

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

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

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

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

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,
    ( 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_22,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_23,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_17,c_0_18]),c_0_19]) ).

thf(c_0_24,plain,
    ( mfalse
    = ( ^ [Z0: $i] : ~ $true ) ),
    inference(fof_simplification,[status(thm)],[mfalse]) ).

thf(c_0_25,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_26,plain,
    ( iclval
    = ( ^ [Z0: $i > $o] :
        ! [X28: $i] : ( Z0 @ X28 ) ) ),
    inference(fof_simplification,[status(thm)],[icl_s4_valid]) ).

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

thf(c_0_28,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_21]) ).

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

thf(c_0_30,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_22,c_0_23]),c_0_21]) ).

thf(c_0_31,axiom,
    ( icl_false
    = ( ^ [Z0: $i] : ~ $true ) ),
    inference(apply_def,[status(thm)],[icl_false,c_0_24]) ).

thf(c_0_32,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_25,c_0_19]),c_0_21]) ).

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

thf(c_0_34,plain,
    ! [X38: $i,X37: $i] :
      ( ( rel @ X38 @ X37 )
     => ( ! [X35: $i] :
            ( ( rel @ X37 @ X35 )
           => ( ~ ( admin @ X35 )
              | ~ $true ) )
        | ! [X36: $i] :
            ( ( rel @ X37 @ X36 )
           => ( deletefile1 @ X36 ) ) ) ),
    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)],[ax1,c_0_28]),c_0_29]),c_0_30]),c_0_31]),c_0_32]),c_0_33])]) ).

thf(c_0_35,negated_conjecture,
    ~ ( iclval @ ( icl_atom @ deletefile1 ) ),
    inference(assume_negation,[status(cth)],[ex3]) ).

thf(c_0_36,plain,
    ! [X43: $i,X42: $i] :
      ( ( rel @ X43 @ X42 )
     => ( ( admin @ X42 )
        | ! [X41: $i] :
            ( ( rel @ X42 @ X41 )
           => ( ! [X39: $i] :
                  ( ( rel @ X41 @ X39 )
                 => ( ~ ( bob @ X39 )
                    | ( admin @ X39 ) ) )
              | ! [X40: $i] :
                  ( ( rel @ X41 @ X40 )
                 => ( deletefile1 @ X40 ) ) ) ) ) ),
    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)],[ax2,c_0_28]),c_0_29]),c_0_30]),c_0_32]),c_0_33])]) ).

thf(c_0_37,plain,
    ! [X57: $i,X58: $i,X59: $i,X60: $i] :
      ( ~ ( rel @ X57 @ X58 )
      | ~ ( rel @ X58 @ X59 )
      | ~ ( admin @ X59 )
      | ~ $true
      | ~ ( rel @ X58 @ X60 )
      | ( deletefile1 @ X60 ) ),
    inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_34])])])]) ).

thf(c_0_38,plain,
    ! [X46: $i,X45: $i] :
      ( ( rel @ X46 @ X45 )
     => ( ( bob @ X45 )
        | ! [X44: $i] :
            ( ( rel @ X45 @ X44 )
           => ( deletefile1 @ X44 ) ) ) ),
    inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[ax3,c_0_28]),c_0_29]),c_0_32]),c_0_33]) ).

thf(c_0_39,negated_conjecture,
    ~ ! [X48: $i,X47: $i] :
        ( ( rel @ X48 @ X47 )
       => ( deletefile1 @ X47 ) ),
    inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_35,c_0_28]),c_0_33]) ).

thf(c_0_40,plain,
    ! [X19: $i > $o,X30: $i] :
      ( ~ ! [X29: $i] :
            ( ( rel @ X30 @ X29 )
           => ( X19 @ X29 ) )
      | ( X19 @ X30 ) ),
    inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[refl_axiom,c_0_23]),c_0_21]),c_0_27]) ).

thf(c_0_41,plain,
    ! [X61: $i,X62: $i,X63: $i,X64: $i,X65: $i] :
      ( ~ ( rel @ X61 @ X62 )
      | ( admin @ X62 )
      | ~ ( rel @ X62 @ X63 )
      | ~ ( rel @ X63 @ X64 )
      | ~ ( bob @ X64 )
      | ( admin @ X64 )
      | ~ ( rel @ X63 @ X65 )
      | ( deletefile1 @ X65 ) ),
    inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_36])])])]) ).

thf(c_0_42,plain,
    ! [X1: $i,X3: $i,X12: $i,X13: $i] :
      ( ( deletefile1 @ X13 )
      | ~ ( rel @ X1 @ X3 )
      | ~ ( rel @ X3 @ X12 )
      | ~ ( admin @ X12 )
      | ~ $true
      | ~ ( rel @ X3 @ X13 ) ),
    inference(split_conjunct,[status(thm)],[c_0_37]) ).

thf(c_0_43,plain,
    ! [X66: $i,X67: $i,X68: $i] :
      ( ~ ( rel @ X66 @ X67 )
      | ( bob @ X67 )
      | ~ ( rel @ X67 @ X68 )
      | ( deletefile1 @ X68 ) ),
    inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_38])])])]) ).

thf(c_0_44,negated_conjecture,
    ( ( rel @ esk3_0 @ esk4_0 )
    & ~ ( deletefile1 @ esk4_0 ) ),
    inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_39])])])]) ).

thf(c_0_45,plain,
    ! [X49: $i > $o,X50: $i] :
      ( ( ( rel @ X50 @ ( esk1_2 @ X49 @ X50 ) )
        | ( X49 @ X50 ) )
      & ( ~ ( X49 @ ( esk1_2 @ X49 @ X50 ) )
        | ( X49 @ X50 ) ) ),
    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_40])])])])]) ).

thf(c_0_46,plain,
    ! [X1: $i,X3: $i,X13: $i,X12: $i,X15: $i] :
      ( ( admin @ X3 )
      | ( admin @ X13 )
      | ( deletefile1 @ X15 )
      | ~ ( rel @ X1 @ X3 )
      | ~ ( rel @ X3 @ X12 )
      | ~ ( rel @ X12 @ X13 )
      | ~ ( bob @ X13 )
      | ~ ( rel @ X12 @ X15 ) ),
    inference(split_conjunct,[status(thm)],[c_0_41]) ).

thf(c_0_47,plain,
    ! [X1: $i,X13: $i,X12: $i,X3: $i] :
      ( ( deletefile1 @ X13 )
      | ~ ( admin @ X12 )
      | ~ ( rel @ X3 @ X13 )
      | ~ ( rel @ X3 @ X12 )
      | ~ ( rel @ X1 @ X3 ) ),
    inference(cn,[status(thm)],[c_0_42]) ).

thf(c_0_48,plain,
    ! [X1: $i,X3: $i,X12: $i] :
      ( ( bob @ X3 )
      | ( deletefile1 @ X12 )
      | ~ ( rel @ X1 @ X3 )
      | ~ ( rel @ X3 @ X12 ) ),
    inference(split_conjunct,[status(thm)],[c_0_43]) ).

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

thf(c_0_50,negated_conjecture,
    ~ ( deletefile1 @ esk4_0 ),
    inference(split_conjunct,[status(thm)],[c_0_44]) ).

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

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

thf(c_0_53,plain,
    ! [X1: $i,X3: $i,X12: $i,X15: $i,X13: $i] :
      ( ( deletefile1 @ X1 )
      | ( admin @ X3 )
      | ~ ( rel @ X12 @ X1 )
      | ~ ( rel @ X12 @ X13 )
      | ~ ( rel @ X3 @ X12 )
      | ~ ( rel @ X15 @ X3 )
      | ~ ( bob @ X13 ) ),
    inference(csr,[status(thm)],[c_0_46,c_0_47]) ).

thf(c_0_54,negated_conjecture,
    ! [X1: $i] :
      ( ( bob @ esk3_0 )
      | ~ ( rel @ X1 @ esk3_0 ) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_50]) ).

thf(c_0_55,plain,
    ! [X1: $i] : ( rel @ X1 @ X1 ),
    inference(spm,[status(thm)],[c_0_51,c_0_52]) ).

thf(c_0_56,negated_conjecture,
    ! [X1: $i,X12: $i,X3: $i] :
      ( ( admin @ X1 )
      | ~ ( rel @ esk3_0 @ X3 )
      | ~ ( rel @ X1 @ esk3_0 )
      | ~ ( rel @ X12 @ X1 )
      | ~ ( bob @ X3 ) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_49]),c_0_50]) ).

thf(c_0_57,negated_conjecture,
    bob @ esk3_0,
    inference(spm,[status(thm)],[c_0_54,c_0_55]) ).

thf(c_0_58,negated_conjecture,
    ! [X3: $i,X1: $i] :
      ( ~ ( rel @ esk3_0 @ X1 )
      | ~ ( rel @ X3 @ esk3_0 )
      | ~ ( admin @ X1 ) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_47,c_0_49]),c_0_50]) ).

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

thf(c_0_60,negated_conjecture,
    ! [X1: $i] :
      ( ~ ( rel @ X1 @ esk3_0 )
      | ~ ( admin @ esk3_0 ) ),
    inference(spm,[status(thm)],[c_0_58,c_0_55]) ).

thf(c_0_61,negated_conjecture,
    ! [X1: $i] :
      ~ ( rel @ X1 @ esk3_0 ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_55]),c_0_60]) ).

thf(c_0_62,negated_conjecture,
    $false,
    inference(spm,[status(thm)],[c_0_61,c_0_55]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.02  % Problem  : SWV436^4 : TPTP v9.3.1. Released v3.6.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.17  % Computer : n017.cluster.edu
% 0.08/0.17  % Model    : x86_64 x86_64
% 0.08/0.17  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.17  % Memory   : 8046.5625MB
% 0.08/0.17  % OS       : Linux 6.8.0-71-generic
% 0.08/0.17  % CPULimit : 300
% 0.08/0.17  % WCLimit  : 300
% 0.08/0.17  % DateTime : Tue Sep 29 15:59:22 UTC 2026
% 0.08/0.17  % CPUTime  : 
% 0.08/0.17  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.21  Running higher-order theorem proving
% 0.08/0.22  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.2F4xSBbEQF/E---3.1_510211.p
% 0.08/0.24  % Version: 3.5.1-ho
% 0.08/0.24  % Preprocessing class: HSMSSMSSMLSNHSN.
% 0.08/0.24  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.24  % Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.08/0.24  % Starting post_as_ho3 with 300s (1) cores
% 0.08/0.24  % Starting post_as_ho11 with 300s (1) cores
% 0.08/0.24  % Starting full_lambda_8 with 300s (1) cores
% 0.08/0.24  % new_ho_10_cnf2 with pid 510224 completed with status 0
% 0.08/0.24  % Result found by new_ho_10_cnf2
% 0.08/0.24  % Preprocessing class: HSMSSMSSMLSNHSN.
% 0.08/0.24  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.24  % Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.08/0.24  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.08/0.24  % No SInE strategy applied
% 0.08/0.24  % Search class: HGUNF-FFSF22-SHSSMSBN
% 0.08/0.24  % partial match(1): HGUNF-FFSS22-SHSSMSBN
% 0.08/0.24  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.08/0.24  % Starting SubtermCWHack with 136s (1) cores
% 0.08/0.24  % Starting new_ho_10_cnf2 with 151s (1) cores
% 0.08/0.24  % Starting sh5l with 136s (1) cores
% 0.08/0.24  % Starting ehoh_best_sine_rwall with 136s (1) cores
% 0.08/0.24  % Starting lpo1_def_fix with 136s (1) cores
% 0.08/0.24  % lpo1_def_fix with pid 510232 completed with status 0
% 0.08/0.24  % Result found by lpo1_def_fix
% 0.08/0.24  % Preprocessing class: HSMSSMSSMLSNHSN.
% 0.08/0.24  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.08/0.24  % Starting new_ho_10_cnf2 with 1500s (5) cores
% 0.08/0.24  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.08/0.24  % No SInE strategy applied
% 0.08/0.24  % Search class: HGUNF-FFSF22-SHSSMSBN
% 0.08/0.24  % partial match(1): HGUNF-FFSS22-SHSSMSBN
% 0.08/0.24  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.08/0.24  % Starting SubtermCWHack with 136s (1) cores
% 0.08/0.24  % Starting new_ho_10_cnf2 with 151s (1) cores
% 0.08/0.24  % Starting sh5l with 136s (1) cores
% 0.08/0.24  % Starting ehoh_best_sine_rwall with 136s (1) cores
% 0.08/0.24  % Starting lpo1_def_fix with 136s (1) cores
% 0.08/0.24  % Preprocessing time       : 0.001 s
% 0.08/0.24  % Presaturation interreduction done
% 0.08/0.24  
% 0.08/0.24  % Proof found!
% 0.08/0.24  % SZS status Theorem
% 0.08/0.24  % SZS output start CNFRefutation
% See solution above
% 0.08/0.24  % Parsed axioms                        : 63
% 0.08/0.24  % Removed by relevancy pruning/SinE    : 0
% 0.08/0.24  % Initial clauses                      : 42
% 0.08/0.24  % Removed in clause preprocessing      : 33
% 0.08/0.24  % Initial clauses in saturation        : 9
% 0.08/0.24  % Processed clauses                    : 44
% 0.08/0.24  % ...of these trivial                  : 0
% 0.08/0.24  % ...subsumed                          : 3
% 0.08/0.24  % ...remaining for further processing  : 41
% 0.08/0.24  % Other redundant clauses eliminated   : 0
% 0.08/0.24  % Clauses deleted for lack of memory   : 0
% 0.08/0.24  % Backward-subsumed                    : 11
% 0.08/0.24  % Backward-rewritten                   : 1
% 0.08/0.24  % Generated clauses                    : 62
% 0.08/0.24  % ...of the previous two non-redundant : 53
% 0.08/0.24  % ...aggressively subsumed             : 0
% 0.08/0.24  % Contextual simplify-reflections      : 2
% 0.08/0.24  % Paramodulations                      : 52
% 0.08/0.24  % Factorizations                       : 0
% 0.08/0.24  % NegExts                              : 0
% 0.08/0.24  % Equation resolutions                 : 0
% 0.08/0.24  % Disequality decompositions           : 0
% 0.08/0.24  % Total rewrite steps                  : 5
% 0.08/0.24  % ...of those cached                   : 2
% 0.08/0.24  % Propositional unsat checks           : 0
% 0.08/0.24  %    Propositional check models        : 0
% 0.08/0.24  %    Propositional check unsatisfiable : 0
% 0.08/0.24  %    Propositional clauses             : 0
% 0.08/0.24  %    Propositional clauses after purity: 0
% 0.08/0.24  %    Propositional unsat core size     : 0
% 0.08/0.24  %    Propositional preprocessing time  : 0.000
% 0.08/0.24  %    Propositional encoding time       : 0.000
% 0.08/0.24  %    Propositional solver time         : 0.000
% 0.08/0.24  %    Success case prop preproc time    : 0.000
% 0.08/0.24  %    Success case prop encoding time   : 0.000
% 0.08/0.24  %    Success case prop solver time     : 0.000
% 0.08/0.24  % Current number of processed clauses  : 20
% 0.08/0.24  %    Positive orientable unit clauses  : 5
% 0.08/0.24  %    Positive unorientable unit clauses: 0
% 0.08/0.24  %    Negative unit clauses             : 3
% 0.08/0.24  %    Non-unit-clauses                  : 12
% 0.08/0.24  % Current number of unprocessed clauses: 27
% 0.08/0.24  % ...number of literals in the above   : 108
% 0.08/0.24  % Current number of archived formulas  : 0
% 0.08/0.24  % Current number of archived clauses   : 21
% 0.08/0.24  % Clause-clause subsumption calls (NU) : 98
% 0.08/0.24  % Rec. Clause-clause subsumption calls : 40
% 0.08/0.24  % Non-unit clause-clause subsumptions  : 6
% 0.08/0.24  % Unit Clause-clause subsumption calls : 15
% 0.08/0.24  % Rewrite failures with RHS unbound    : 0
% 0.08/0.24  % BW rewrite match attempts            : 6
% 0.08/0.24  % BW rewrite match successes           : 1
% 0.08/0.24  % Condensation attempts                : 0
% 0.08/0.24  % Condensation successes               : 0
% 0.08/0.24  % Termbank termtop insertions          : 4228
% 0.08/0.24  % Search garbage collected termcells   : 833
% 0.08/0.24  
% 0.08/0.24  % -------------------------------------------------
% 0.08/0.24  % User time                : 0.006 s
% 0.08/0.24  % System time              : 0.001 s
% 0.08/0.24  % Total time               : 0.007 s
% 0.08/0.24  % Maximum resident set size: 3684 pages
% 0.08/0.24  
% 0.08/0.24  % -------------------------------------------------
% 0.08/0.24  % User time                : 0.026 s
% 0.08/0.24  % System time              : 0.012 s
% 0.08/0.24  % Total time               : 0.038 s
% 0.08/0.24  % Maximum resident set size: 4864 pages
% 0.08/0.24  % E exiting
%------------------------------------------------------------------------------