↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : SYO463^5 : 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 : n006.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:43:08 AM UTC 2026

% Result   : Theorem 0.21s 0.27s
% Output   : CNFRefutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   17
%            Number of leaves      :   12
% Syntax   : Number of formulae    :   65 (  31 unt;   0 typ;   0 def)
%            Number of atoms       :  212 (  21 equ;   0 cnn)
%            Maximal formula atoms :   31 (   3 avg)
%            Number of connectives :  501 (  99   ~;  92   |;  14   &; 293   @)
%                                         (   0 <=>;   3  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   19 (   4 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   36 (  36   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   18 (  16 usr;   5 con; 0-3 aty)
%            Number of variables   :   96 (  44   ^;  52   !;   0   ?;  96   :)

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

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

thf(decl_27,type,
    mand: ( $i > $o ) > ( $i > $o ) > $i > $o ).

thf(decl_28,type,
    mimplies: ( $i > $o ) > ( $i > $o ) > $i > $o ).

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

thf(decl_40,type,
    mreflexive: ( $i > $i > $o ) > $o ).

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

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

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

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

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

thf(decl_58,type,
    q: $i > $o ).

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

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

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

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

thf(mand,axiom,
    ( mand
    = ( ^ [X6: $i > $o,X7: $i > $o] : ( mnot @ ( mor @ ( mnot @ X6 ) @ ( mnot @ X7 ) ) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.9sN5oTyLLB/E---3.1_1023091.p',mand) ).

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

thf(mor,axiom,
    ( mor
    = ( ^ [X6: $i > $o,X7: $i > $o,X3: $i] :
          ( ( X6 @ X3 )
          | ( X7 @ X3 ) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.9sN5oTyLLB/E---3.1_1023091.p',mor) ).

thf(mimplies,axiom,
    ( mimplies
    = ( ^ [X6: $i > $o,X7: $i > $o] : ( mor @ ( mnot @ X6 ) @ X7 ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.9sN5oTyLLB/E---3.1_1023091.p',mimplies) ).

thf(mequiv,axiom,
    ( mequiv
    = ( ^ [X6: $i > $o,X7: $i > $o] : ( mand @ ( mimplies @ X6 @ X7 ) @ ( mimplies @ X7 @ X6 ) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.9sN5oTyLLB/E---3.1_1023091.p',mequiv) ).

thf(mtransitive,axiom,
    ( mtransitive
    = ( ^ [X13: $i > $i > $o] :
        ! [X15: $i,X16: $i,X17: $i] :
          ( ( ( X13 @ X15 @ X16 )
            & ( X13 @ X16 @ X17 ) )
         => ( X13 @ X15 @ X17 ) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.9sN5oTyLLB/E---3.1_1023091.p',mtransitive) ).

thf(prove,conjecture,
    mvalid @ ( mimplies @ ( mbox_s4 @ ( mequiv @ p @ q ) ) @ ( mbox_s4 @ ( mequiv @ ( mbox_s4 @ p ) @ ( mbox_s4 @ q ) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.9sN5oTyLLB/E---3.1_1023091.p',prove) ).

thf(mvalid,axiom,
    ( mvalid
    = ( ^ [X6: $i > $o] :
        ! [X3: $i] : ( X6 @ X3 ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.9sN5oTyLLB/E---3.1_1023091.p',mvalid) ).

thf(mbox_s4,axiom,
    ( mbox_s4
    = ( ^ [X6: $i > $o,X3: $i] :
        ! [X14: $i] :
          ( ~ ( rel_s4 @ X3 @ X14 )
          | ( X6 @ X14 ) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.9sN5oTyLLB/E---3.1_1023091.p',mbox_s4) ).

thf(a2,axiom,
    mtransitive @ rel_s4,
    file('/export/starexec/sandbox/tmp/tmp.9sN5oTyLLB/E---3.1_1023091.p',a2) ).

thf(mreflexive,axiom,
    ( mreflexive
    = ( ^ [X13: $i > $i > $o] :
        ! [X15: $i] : ( X13 @ X15 @ X15 ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.9sN5oTyLLB/E---3.1_1023091.p',mreflexive) ).

thf(a1,axiom,
    mreflexive @ rel_s4,
    file('/export/starexec/sandbox/tmp/tmp.9sN5oTyLLB/E---3.1_1023091.p',a1) ).

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

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

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

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

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

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

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

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

thf(c_0_20,negated_conjecture,
    ~ ( mvalid @ ( mimplies @ ( mbox_s4 @ ( mequiv @ p @ q ) ) @ ( mbox_s4 @ ( mequiv @ ( mbox_s4 @ p ) @ ( mbox_s4 @ q ) ) ) ) ),
    inference(assume_negation,[status(cth)],[prove]) ).

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

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

thf(c_0_23,plain,
    ( mbox_s4
    = ( ^ [Z0: $i > $o,Z1: $i] :
        ! [X14: $i] :
          ( ~ ( rel_s4 @ Z1 @ X14 )
          | ( Z0 @ X14 ) ) ) ),
    inference(fof_simplification,[status(thm)],[mbox_s4]) ).

thf(c_0_24,plain,
    ! [X23: $i,X24: $i,X25: $i] :
      ( ( ( rel_s4 @ X23 @ X24 )
        & ( rel_s4 @ X24 @ X25 ) )
     => ( rel_s4 @ X23 @ X25 ) ),
    inference(apply_def,[status(thm)],[a2,c_0_19]) ).

thf(c_0_25,negated_conjecture,
    ~ ! [X30: $i] :
        ( ~ ! [X26: $i] :
              ( ~ ( rel_s4 @ X30 @ X26 )
              | ~ ( ~ ( ~ ( p @ X26 )
                      | ( q @ X26 ) )
                  | ~ ( ~ ( q @ X26 )
                      | ( p @ X26 ) ) ) )
        | ! [X29: $i] :
            ( ~ ( rel_s4 @ X30 @ X29 )
            | ~ ( ~ ( ~ ! [X27: $i] :
                          ( ~ ( rel_s4 @ X29 @ X27 )
                          | ( p @ X27 ) )
                    | ! [X28: $i] :
                        ( ~ ( rel_s4 @ X29 @ X28 )
                        | ( q @ X28 ) ) )
                | ~ ( ~ ! [X28: $i] :
                          ( ~ ( rel_s4 @ X29 @ X28 )
                          | ( q @ X28 ) )
                    | ! [X27: $i] :
                        ( ~ ( rel_s4 @ X29 @ X27 )
                        | ( p @ X27 ) ) ) ) ) ),
    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)],[c_0_20,c_0_18]),c_0_21]),c_0_22]),c_0_23])]) ).

thf(c_0_26,plain,
    ! [X32: $i,X33: $i,X34: $i] :
      ( ~ ( rel_s4 @ X32 @ X33 )
      | ~ ( rel_s4 @ X33 @ X34 )
      | ( rel_s4 @ X32 @ X34 ) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_24])])]) ).

thf(c_0_27,negated_conjecture,
    ! [X36: $i,X38: $i,X40: $i] :
      ( ( ~ ( p @ X36 )
        | ( q @ X36 )
        | ~ ( rel_s4 @ esk1_0 @ X36 ) )
      & ( ~ ( q @ X36 )
        | ( p @ X36 )
        | ~ ( rel_s4 @ esk1_0 @ X36 ) )
      & ( rel_s4 @ esk1_0 @ esk2_0 )
      & ( ~ ( rel_s4 @ esk2_0 @ X40 )
        | ( q @ X40 )
        | ~ ( rel_s4 @ esk2_0 @ X38 )
        | ( p @ X38 ) )
      & ( ( rel_s4 @ esk2_0 @ esk4_0 )
        | ~ ( rel_s4 @ esk2_0 @ X38 )
        | ( p @ X38 ) )
      & ( ~ ( p @ esk4_0 )
        | ~ ( rel_s4 @ esk2_0 @ X38 )
        | ( p @ X38 ) )
      & ( ~ ( rel_s4 @ esk2_0 @ X40 )
        | ( q @ X40 )
        | ( rel_s4 @ esk2_0 @ esk3_0 ) )
      & ( ( rel_s4 @ esk2_0 @ esk4_0 )
        | ( rel_s4 @ esk2_0 @ esk3_0 ) )
      & ( ~ ( p @ esk4_0 )
        | ( rel_s4 @ esk2_0 @ esk3_0 ) )
      & ( ~ ( rel_s4 @ esk2_0 @ X40 )
        | ( q @ X40 )
        | ~ ( q @ esk3_0 ) )
      & ( ( rel_s4 @ esk2_0 @ esk4_0 )
        | ~ ( q @ esk3_0 ) )
      & ( ~ ( p @ esk4_0 )
        | ~ ( q @ esk3_0 ) ) ),
    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_25])])])])])]) ).

thf(c_0_28,plain,
    ! [X3: $i,X14: $i,X15: $i] :
      ( ( rel_s4 @ X3 @ X15 )
      | ~ ( rel_s4 @ X3 @ X14 )
      | ~ ( rel_s4 @ X14 @ X15 ) ),
    inference(split_conjunct,[status(thm)],[c_0_26]) ).

thf(c_0_29,negated_conjecture,
    ( ( rel_s4 @ esk2_0 @ esk4_0 )
    | ( rel_s4 @ esk2_0 @ esk3_0 ) ),
    inference(split_conjunct,[status(thm)],[c_0_27]) ).

thf(c_0_30,negated_conjecture,
    ! [X3: $i] :
      ( ( p @ X3 )
      | ~ ( q @ X3 )
      | ~ ( rel_s4 @ esk1_0 @ X3 ) ),
    inference(split_conjunct,[status(thm)],[c_0_27]) ).

thf(c_0_31,negated_conjecture,
    ! [X3: $i] :
      ( ( q @ X3 )
      | ( rel_s4 @ esk2_0 @ esk3_0 )
      | ~ ( rel_s4 @ esk2_0 @ X3 ) ),
    inference(split_conjunct,[status(thm)],[c_0_27]) ).

thf(c_0_32,negated_conjecture,
    ! [X3: $i] :
      ( ( rel_s4 @ esk2_0 @ esk3_0 )
      | ( rel_s4 @ X3 @ esk4_0 )
      | ~ ( rel_s4 @ X3 @ esk2_0 ) ),
    inference(spm,[status(thm)],[c_0_28,c_0_29]) ).

thf(c_0_33,negated_conjecture,
    rel_s4 @ esk1_0 @ esk2_0,
    inference(split_conjunct,[status(thm)],[c_0_27]) ).

thf(c_0_34,negated_conjecture,
    ( ( rel_s4 @ esk2_0 @ esk3_0 )
    | ~ ( p @ esk4_0 ) ),
    inference(split_conjunct,[status(thm)],[c_0_27]) ).

thf(c_0_35,negated_conjecture,
    ! [X3: $i] :
      ( ( rel_s4 @ esk2_0 @ esk3_0 )
      | ( p @ X3 )
      | ~ ( rel_s4 @ esk1_0 @ X3 )
      | ~ ( rel_s4 @ esk2_0 @ X3 ) ),
    inference(spm,[status(thm)],[c_0_30,c_0_31]) ).

thf(c_0_36,negated_conjecture,
    ( ( rel_s4 @ esk1_0 @ esk4_0 )
    | ( rel_s4 @ esk2_0 @ esk3_0 ) ),
    inference(spm,[status(thm)],[c_0_32,c_0_33]) ).

thf(c_0_37,negated_conjecture,
    rel_s4 @ esk2_0 @ esk3_0,
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_29]),c_0_36]) ).

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

thf(c_0_39,negated_conjecture,
    ! [X3: $i] :
      ( ( rel_s4 @ X3 @ esk3_0 )
      | ~ ( rel_s4 @ X3 @ esk2_0 ) ),
    inference(spm,[status(thm)],[c_0_28,c_0_37]) ).

thf(c_0_40,plain,
    ! [X22: $i] : ( rel_s4 @ X22 @ X22 ),
    inference(apply_def,[status(thm)],[a1,c_0_38]) ).

thf(c_0_41,negated_conjecture,
    ! [X3: $i,X14: $i] :
      ( ( rel_s4 @ X3 @ esk3_0 )
      | ~ ( rel_s4 @ X14 @ esk2_0 )
      | ~ ( rel_s4 @ X3 @ X14 ) ),
    inference(spm,[status(thm)],[c_0_28,c_0_39]) ).

thf(c_0_42,plain,
    ! [X31: $i] : ( rel_s4 @ X31 @ X31 ),
    inference(variable_rename,[status(thm)],[c_0_40]) ).

thf(c_0_43,negated_conjecture,
    ! [X3: $i,X14: $i] :
      ( ( q @ X3 )
      | ( p @ X14 )
      | ~ ( rel_s4 @ esk2_0 @ X3 )
      | ~ ( rel_s4 @ esk2_0 @ X14 ) ),
    inference(split_conjunct,[status(thm)],[c_0_27]) ).

thf(c_0_44,negated_conjecture,
    ! [X3: $i] :
      ( ( q @ X3 )
      | ~ ( rel_s4 @ esk2_0 @ X3 )
      | ~ ( q @ esk3_0 ) ),
    inference(split_conjunct,[status(thm)],[c_0_27]) ).

thf(c_0_45,negated_conjecture,
    ! [X3: $i] :
      ( ( q @ X3 )
      | ~ ( p @ X3 )
      | ~ ( rel_s4 @ esk1_0 @ X3 ) ),
    inference(split_conjunct,[status(thm)],[c_0_27]) ).

thf(c_0_46,negated_conjecture,
    ! [X3: $i] :
      ( ( rel_s4 @ X3 @ esk3_0 )
      | ~ ( rel_s4 @ X3 @ esk1_0 ) ),
    inference(spm,[status(thm)],[c_0_41,c_0_33]) ).

thf(c_0_47,plain,
    ! [X3: $i] : ( rel_s4 @ X3 @ X3 ),
    inference(split_conjunct,[status(thm)],[c_0_42]) ).

thf(c_0_48,negated_conjecture,
    ( ( rel_s4 @ esk2_0 @ esk4_0 )
    | ~ ( q @ esk3_0 ) ),
    inference(split_conjunct,[status(thm)],[c_0_27]) ).

thf(c_0_49,negated_conjecture,
    ( ~ ( p @ esk4_0 )
    | ~ ( q @ esk3_0 ) ),
    inference(split_conjunct,[status(thm)],[c_0_27]) ).

thf(c_0_50,negated_conjecture,
    ! [X3: $i] :
      ( ( p @ esk3_0 )
      | ( q @ X3 )
      | ~ ( rel_s4 @ esk2_0 @ X3 ) ),
    inference(spm,[status(thm)],[c_0_43,c_0_37]) ).

thf(c_0_51,negated_conjecture,
    ! [X3: $i] :
      ( ( q @ X3 )
      | ~ ( rel_s4 @ esk1_0 @ esk3_0 )
      | ~ ( rel_s4 @ esk2_0 @ X3 )
      | ~ ( p @ esk3_0 ) ),
    inference(spm,[status(thm)],[c_0_44,c_0_45]) ).

thf(c_0_52,negated_conjecture,
    rel_s4 @ esk1_0 @ esk3_0,
    inference(spm,[status(thm)],[c_0_46,c_0_47]) ).

thf(c_0_53,negated_conjecture,
    ( ( rel_s4 @ esk2_0 @ esk4_0 )
    | ~ ( rel_s4 @ esk1_0 @ esk3_0 )
    | ~ ( p @ esk3_0 ) ),
    inference(spm,[status(thm)],[c_0_48,c_0_45]) ).

thf(c_0_54,negated_conjecture,
    ! [X3: $i] :
      ( ( rel_s4 @ esk2_0 @ esk4_0 )
      | ( p @ X3 )
      | ~ ( rel_s4 @ esk2_0 @ X3 ) ),
    inference(split_conjunct,[status(thm)],[c_0_27]) ).

thf(c_0_55,negated_conjecture,
    ( ~ ( rel_s4 @ esk1_0 @ esk3_0 )
    | ~ ( p @ esk4_0 )
    | ~ ( p @ esk3_0 ) ),
    inference(spm,[status(thm)],[c_0_49,c_0_45]) ).

thf(c_0_56,negated_conjecture,
    ( ( p @ esk3_0 )
    | ~ ( p @ esk4_0 ) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_37])]) ).

thf(c_0_57,negated_conjecture,
    ! [X3: $i] :
      ( ( q @ X3 )
      | ~ ( rel_s4 @ esk2_0 @ X3 ) ),
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_51,c_0_52])]),c_0_50]) ).

thf(c_0_58,negated_conjecture,
    ( ( rel_s4 @ esk2_0 @ esk4_0 )
    | ~ ( rel_s4 @ esk1_0 @ esk3_0 ) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_29]) ).

thf(c_0_59,negated_conjecture,
    ~ ( p @ esk4_0 ),
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_55,c_0_52])]),c_0_56]) ).

thf(c_0_60,negated_conjecture,
    ! [X3: $i] :
      ( ( p @ X3 )
      | ~ ( rel_s4 @ esk1_0 @ X3 )
      | ~ ( rel_s4 @ esk2_0 @ X3 ) ),
    inference(spm,[status(thm)],[c_0_30,c_0_57]) ).

thf(c_0_61,negated_conjecture,
    rel_s4 @ esk2_0 @ esk4_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_39]),c_0_33])]) ).

thf(c_0_62,negated_conjecture,
    ~ ( rel_s4 @ esk1_0 @ esk4_0 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_61])]) ).

thf(c_0_63,negated_conjecture,
    ! [X3: $i] :
      ( ( rel_s4 @ X3 @ esk4_0 )
      | ~ ( rel_s4 @ X3 @ esk2_0 ) ),
    inference(spm,[status(thm)],[c_0_28,c_0_61]) ).

thf(c_0_64,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_33])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYO463^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.18  % Computer : n006.cluster.edu
% 0.07/0.18  % Model    : x86_64 x86_64
% 0.07/0.18  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.18  % Memory   : 8046.5625MB
% 0.07/0.18  % OS       : Linux 6.8.0-71-generic
% 0.07/0.18  % CPULimit : 300
% 0.07/0.18  % WCLimit  : 300
% 0.07/0.18  % DateTime : Tue Sep 29 16:59:09 UTC 2026
% 0.07/0.18  % CPUTime  : 
% 0.07/0.18  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.07/0.22  Running higher-order theorem proving
% 0.07/0.24  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.9sN5oTyLLB/E---3.1_1023091.p
% 0.21/0.27  % Version: 3.5.1-ho
% 0.21/0.27  % Preprocessing class: HSMSSMSSMLMNHSN.
% 0.21/0.27  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.27  % Starting ho_unfolding_3 with 1500s (5) cores
% 0.21/0.27  % Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.21/0.27  % Starting almost_fo_3_lam with 300s (1) cores
% 0.21/0.27  % Starting post_as_ho1 with 300s (1) cores
% 0.21/0.27  % almost_fo_3_lam with pid 1023122 completed with status 0
% 0.21/0.27  % Result found by almost_fo_3_lam
% 0.21/0.27  % Preprocessing class: HSMSSMSSMLMNHSN.
% 0.21/0.27  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.27  % Starting ho_unfolding_3 with 1500s (5) cores
% 0.21/0.27  % Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.21/0.27  % Starting almost_fo_3_lam with 300s (1) cores
% 0.21/0.27  % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.21/0.27  % No SInE strategy applied
% 0.21/0.27  % Search class: HGHNF-FFSF00-SHSSMFNN
% 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 1023128 completed with status 0
% 0.21/0.27  % Result found by SubtermCWHack
% 0.21/0.27  % Preprocessing class: HSMSSMSSMLMNHSN.
% 0.21/0.27  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.27  % Starting ho_unfolding_3 with 1500s (5) cores
% 0.21/0.27  % Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.21/0.27  % Starting almost_fo_3_lam with 300s (1) cores
% 0.21/0.27  % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.21/0.27  % No SInE strategy applied
% 0.21/0.27  % Search class: HGHNF-FFSF00-SHSSMFNN
% 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                        : 73
% 0.21/0.27  % Removed by relevancy pruning/SinE    : 0
% 0.21/0.27  % Initial clauses                      : 51
% 0.21/0.27  % Removed in clause preprocessing      : 37
% 0.21/0.27  % Initial clauses in saturation        : 14
% 0.21/0.27  % Processed clauses                    : 54
% 0.21/0.27  % ...of these trivial                  : 0
% 0.21/0.27  % ...subsumed                          : 12
% 0.21/0.27  % ...remaining for further processing  : 42
% 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                    : 9
% 0.21/0.27  % Backward-rewritten                   : 15
% 0.21/0.27  % Generated clauses                    : 59
% 0.21/0.27  % ...of the previous two non-redundant : 49
% 0.21/0.27  % ...aggressively subsumed             : 0
% 0.21/0.27  % Contextual simplify-reflections      : 7
% 0.21/0.27  % Paramodulations                      : 59
% 0.21/0.27  % Factorizations                       : 0
% 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                  : 27
% 0.21/0.27  % ...of those cached                   : 21
% 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  : 18
% 0.21/0.27  %    Positive orientable unit clauses  : 6
% 0.21/0.27  %    Positive unorientable unit clauses: 0
% 0.21/0.27  %    Negative unit clauses             : 2
% 0.21/0.27  %    Non-unit-clauses                  : 10
% 0.21/0.27  % Current number of unprocessed clauses: 7
% 0.21/0.27  % ...number of literals in the above   : 30
% 0.21/0.27  % Current number of archived formulas  : 0
% 0.21/0.27  % Current number of archived clauses   : 24
% 0.21/0.27  % Clause-clause subsumption calls (NU) : 61
% 0.21/0.27  % Rec. Clause-clause subsumption calls : 54
% 0.21/0.27  % Non-unit clause-clause subsumptions  : 24
% 0.21/0.27  % Unit Clause-clause subsumption calls : 8
% 0.21/0.27  % Rewrite failures with RHS unbound    : 0
% 0.21/0.27  % BW rewrite match attempts            : 5
% 0.21/0.27  % BW rewrite match successes           : 4
% 0.21/0.27  % Condensation attempts                : 0
% 0.21/0.27  % Condensation successes               : 0
% 0.21/0.27  % Termbank termtop insertions          : 3810
% 0.21/0.27  % Search garbage collected termcells   : 650
% 0.21/0.27  
% 0.21/0.27  % -------------------------------------------------
% 0.21/0.27  % User time                : 0.008 s
% 0.21/0.27  % System time              : 0.003 s
% 0.21/0.27  % Total time               : 0.011 s
% 0.21/0.27  % Maximum resident set size: 3956 pages
% 0.21/0.27  
% 0.21/0.27  % -------------------------------------------------
% 0.21/0.27  % User time                : 0.010 s
% 0.21/0.27  % System time              : 0.008 s
% 0.21/0.27  % Total time               : 0.018 s
% 0.21/0.27  % Maximum resident set size: 4864 pages
% 0.21/0.27  % E exiting
%------------------------------------------------------------------------------