↑ Up

E---3.5.1.THM-CRf.s

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

% Computer : n008.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:00 AM UTC 2026

% Result   : Theorem 0.22s 0.27s
% Output   : CNFRefutation 0.22s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   20
%            Number of leaves      :   12
% Syntax   : Number of formulae    :   86 (  37 unt;   0 typ;   0 def)
%            Number of atoms       :  317 (  21 equ;   0 cnn)
%            Maximal formula atoms :   80 (   3 avg)
%            Number of connectives :  795 ( 136   ~; 158   |;  27   &; 468   @)
%                                         (   0 <=>;   6  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   39 (   5 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   36 (  36   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   19 (  17 usr;   6 con; 0-3 aty)
%            Number of variables   :  115 (  44   ^;  71   !;   0   ?; 115   :)

% 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_41,type,
    msymmetric: ( $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_s5: $i > $i > $o ).

thf(decl_55,type,
    mbox_s5: ( $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(decl_63,type,
    esk5_0: $i ).

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

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

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

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

thf(mequiv,axiom,
    ( mequiv
    = ( ^ [X6: $i > $o,X7: $i > $o] : ( mand @ ( mimplies @ X6 @ X7 ) @ ( mimplies @ X7 @ X6 ) ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.pISFswxOlK/E---3.1_3420278.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/sandbox2/tmp/tmp.pISFswxOlK/E---3.1_3420278.p',mtransitive) ).

thf(prove,conjecture,
    mvalid @ ( mequiv @ ( mbox_s5 @ ( mor @ ( mnot @ p ) @ ( mbox_s5 @ q ) ) ) @ ( mor @ ( mbox_s5 @ ( mnot @ p ) ) @ ( mbox_s5 @ q ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.pISFswxOlK/E---3.1_3420278.p',prove) ).

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

thf(mbox_s5,axiom,
    ( mbox_s5
    = ( ^ [X6: $i > $o,X3: $i] :
        ! [X14: $i] :
          ( ~ ( rel_s5 @ X3 @ X14 )
          | ( X6 @ X14 ) ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.pISFswxOlK/E---3.1_3420278.p',mbox_s5) ).

thf(msymmetric,axiom,
    ( msymmetric
    = ( ^ [X13: $i > $i > $o] :
        ! [X15: $i,X16: $i] :
          ( ( X13 @ X15 @ X16 )
         => ( X13 @ X16 @ X15 ) ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.pISFswxOlK/E---3.1_3420278.p',msymmetric) ).

thf(a2,axiom,
    mtransitive @ rel_s5,
    file('/export/starexec/sandbox2/tmp/tmp.pISFswxOlK/E---3.1_3420278.p',a2) ).

thf(a3,axiom,
    msymmetric @ rel_s5,
    file('/export/starexec/sandbox2/tmp/tmp.pISFswxOlK/E---3.1_3420278.p',a3) ).

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 @ ( mequiv @ ( mbox_s5 @ ( mor @ ( mnot @ p ) @ ( mbox_s5 @ q ) ) ) @ ( mor @ ( mbox_s5 @ ( mnot @ p ) ) @ ( mbox_s5 @ 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_s5
    = ( ^ [Z0: $i > $o,Z1: $i] :
        ! [X14: $i] :
          ( ~ ( rel_s5 @ Z1 @ X14 )
          | ( Z0 @ X14 ) ) ) ),
    inference(fof_simplification,[status(thm)],[mbox_s5]) ).

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

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

thf(c_0_26,negated_conjecture,
    ~ ! [X32: $i] :
        ~ ( ~ ( ~ ! [X29: $i] :
                    ( ~ ( rel_s5 @ X32 @ X29 )
                    | ~ ( p @ X29 )
                    | ! [X28: $i] :
                        ( ~ ( rel_s5 @ X29 @ X28 )
                        | ( q @ X28 ) ) )
              | ! [X30: $i] :
                  ( ~ ( rel_s5 @ X32 @ X30 )
                  | ~ ( p @ X30 ) )
              | ! [X31: $i] :
                  ( ~ ( rel_s5 @ X32 @ X31 )
                  | ( q @ X31 ) ) )
          | ~ ( ~ ( ! [X30: $i] :
                      ( ~ ( rel_s5 @ X32 @ X30 )
                      | ~ ( p @ X30 ) )
                  | ! [X31: $i] :
                      ( ~ ( rel_s5 @ X32 @ X31 )
                      | ( q @ X31 ) ) )
              | ! [X29: $i] :
                  ( ~ ( rel_s5 @ X32 @ X29 )
                  | ~ ( p @ X29 )
                  | ! [X28: $i] :
                      ( ~ ( rel_s5 @ X29 @ X28 )
                      | ( q @ X28 ) ) ) ) ),
    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)],[c_0_20,c_0_13]),c_0_14]),c_0_21]),c_0_22]),c_0_23])]) ).

thf(c_0_27,plain,
    ! [X26: $i,X27: $i] :
      ( ( rel_s5 @ X26 @ X27 )
     => ( rel_s5 @ X27 @ X26 ) ),
    inference(apply_def,[status(thm)],[a3,c_0_24]) ).

thf(c_0_28,plain,
    ! [X34: $i,X35: $i,X36: $i] :
      ( ~ ( rel_s5 @ X34 @ X35 )
      | ~ ( rel_s5 @ X35 @ X36 )
      | ( rel_s5 @ X34 @ X36 ) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_25])])]) ).

thf(c_0_29,negated_conjecture,
    ! [X40: $i,X41: $i,X44: $i,X45: $i] :
      ( ( ~ ( rel_s5 @ esk1_0 @ X44 )
        | ~ ( p @ X44 )
        | ~ ( rel_s5 @ esk1_0 @ X45 )
        | ( q @ X45 )
        | ~ ( rel_s5 @ esk1_0 @ X40 )
        | ~ ( p @ X40 )
        | ~ ( rel_s5 @ X40 @ X41 )
        | ( q @ X41 ) )
      & ( ( rel_s5 @ esk1_0 @ esk4_0 )
        | ~ ( rel_s5 @ esk1_0 @ X40 )
        | ~ ( p @ X40 )
        | ~ ( rel_s5 @ X40 @ X41 )
        | ( q @ X41 ) )
      & ( ( p @ esk4_0 )
        | ~ ( rel_s5 @ esk1_0 @ X40 )
        | ~ ( p @ X40 )
        | ~ ( rel_s5 @ X40 @ X41 )
        | ( q @ X41 ) )
      & ( ( rel_s5 @ esk4_0 @ esk5_0 )
        | ~ ( rel_s5 @ esk1_0 @ X40 )
        | ~ ( p @ X40 )
        | ~ ( rel_s5 @ X40 @ X41 )
        | ( q @ X41 ) )
      & ( ~ ( q @ esk5_0 )
        | ~ ( rel_s5 @ esk1_0 @ X40 )
        | ~ ( p @ X40 )
        | ~ ( rel_s5 @ X40 @ X41 )
        | ( q @ X41 ) )
      & ( ~ ( rel_s5 @ esk1_0 @ X44 )
        | ~ ( p @ X44 )
        | ~ ( rel_s5 @ esk1_0 @ X45 )
        | ( q @ X45 )
        | ( rel_s5 @ esk1_0 @ esk2_0 ) )
      & ( ( rel_s5 @ esk1_0 @ esk4_0 )
        | ( rel_s5 @ esk1_0 @ esk2_0 ) )
      & ( ( p @ esk4_0 )
        | ( rel_s5 @ esk1_0 @ esk2_0 ) )
      & ( ( rel_s5 @ esk4_0 @ esk5_0 )
        | ( rel_s5 @ esk1_0 @ esk2_0 ) )
      & ( ~ ( q @ esk5_0 )
        | ( rel_s5 @ esk1_0 @ esk2_0 ) )
      & ( ~ ( rel_s5 @ esk1_0 @ X44 )
        | ~ ( p @ X44 )
        | ~ ( rel_s5 @ esk1_0 @ X45 )
        | ( q @ X45 )
        | ( p @ esk2_0 ) )
      & ( ( rel_s5 @ esk1_0 @ esk4_0 )
        | ( p @ esk2_0 ) )
      & ( ( p @ esk4_0 )
        | ( p @ esk2_0 ) )
      & ( ( rel_s5 @ esk4_0 @ esk5_0 )
        | ( p @ esk2_0 ) )
      & ( ~ ( q @ esk5_0 )
        | ( p @ esk2_0 ) )
      & ( ~ ( rel_s5 @ esk1_0 @ X44 )
        | ~ ( p @ X44 )
        | ~ ( rel_s5 @ esk1_0 @ X45 )
        | ( q @ X45 )
        | ( rel_s5 @ esk1_0 @ esk3_0 ) )
      & ( ( rel_s5 @ esk1_0 @ esk4_0 )
        | ( rel_s5 @ esk1_0 @ esk3_0 ) )
      & ( ( p @ esk4_0 )
        | ( rel_s5 @ esk1_0 @ esk3_0 ) )
      & ( ( rel_s5 @ esk4_0 @ esk5_0 )
        | ( rel_s5 @ esk1_0 @ esk3_0 ) )
      & ( ~ ( q @ esk5_0 )
        | ( rel_s5 @ esk1_0 @ esk3_0 ) )
      & ( ~ ( rel_s5 @ esk1_0 @ X44 )
        | ~ ( p @ X44 )
        | ~ ( rel_s5 @ esk1_0 @ X45 )
        | ( q @ X45 )
        | ~ ( q @ esk3_0 ) )
      & ( ( rel_s5 @ esk1_0 @ esk4_0 )
        | ~ ( q @ esk3_0 ) )
      & ( ( p @ esk4_0 )
        | ~ ( q @ esk3_0 ) )
      & ( ( rel_s5 @ esk4_0 @ esk5_0 )
        | ~ ( q @ esk3_0 ) )
      & ( ~ ( q @ esk5_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_26])])])])])]) ).

thf(c_0_30,plain,
    ! [X37: $i,X38: $i] :
      ( ~ ( rel_s5 @ X37 @ X38 )
      | ( rel_s5 @ X38 @ X37 ) ),
    inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_27])])]) ).

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

thf(c_0_32,negated_conjecture,
    ( ( rel_s5 @ esk1_0 @ esk4_0 )
    | ( rel_s5 @ esk1_0 @ esk3_0 ) ),
    inference(split_conjunct,[status(thm)],[c_0_29]) ).

thf(c_0_33,plain,
    ! [X3: $i,X14: $i] :
      ( ( rel_s5 @ X14 @ X3 )
      | ~ ( rel_s5 @ X3 @ X14 ) ),
    inference(split_conjunct,[status(thm)],[c_0_30]) ).

thf(c_0_34,negated_conjecture,
    ( ( rel_s5 @ esk1_0 @ esk4_0 )
    | ( rel_s5 @ esk1_0 @ esk2_0 ) ),
    inference(split_conjunct,[status(thm)],[c_0_29]) ).

thf(c_0_35,negated_conjecture,
    ! [X3: $i] :
      ( ( rel_s5 @ esk1_0 @ esk4_0 )
      | ( rel_s5 @ X3 @ esk3_0 )
      | ~ ( rel_s5 @ X3 @ esk1_0 ) ),
    inference(spm,[status(thm)],[c_0_31,c_0_32]) ).

thf(c_0_36,negated_conjecture,
    ( ( rel_s5 @ esk1_0 @ esk4_0 )
    | ( rel_s5 @ esk2_0 @ esk1_0 ) ),
    inference(spm,[status(thm)],[c_0_33,c_0_34]) ).

thf(c_0_37,negated_conjecture,
    ! [X3: $i,X14: $i] :
      ( ( q @ X14 )
      | ( rel_s5 @ esk1_0 @ esk3_0 )
      | ~ ( rel_s5 @ esk1_0 @ X3 )
      | ~ ( p @ X3 )
      | ~ ( rel_s5 @ esk1_0 @ X14 ) ),
    inference(split_conjunct,[status(thm)],[c_0_29]) ).

thf(c_0_38,negated_conjecture,
    ( ( p @ esk4_0 )
    | ( rel_s5 @ esk1_0 @ esk3_0 ) ),
    inference(split_conjunct,[status(thm)],[c_0_29]) ).

thf(c_0_39,negated_conjecture,
    ( ( rel_s5 @ esk4_0 @ esk5_0 )
    | ( rel_s5 @ esk1_0 @ esk3_0 ) ),
    inference(split_conjunct,[status(thm)],[c_0_29]) ).

thf(c_0_40,negated_conjecture,
    ! [X3: $i,X14: $i] :
      ( ( rel_s5 @ esk1_0 @ esk4_0 )
      | ( q @ X14 )
      | ~ ( rel_s5 @ esk1_0 @ X3 )
      | ~ ( p @ X3 )
      | ~ ( rel_s5 @ X3 @ X14 ) ),
    inference(split_conjunct,[status(thm)],[c_0_29]) ).

thf(c_0_41,negated_conjecture,
    ( ( rel_s5 @ esk2_0 @ esk3_0 )
    | ( rel_s5 @ esk1_0 @ esk4_0 ) ),
    inference(spm,[status(thm)],[c_0_35,c_0_36]) ).

thf(c_0_42,negated_conjecture,
    ( ( rel_s5 @ esk1_0 @ esk4_0 )
    | ( p @ esk2_0 ) ),
    inference(split_conjunct,[status(thm)],[c_0_29]) ).

thf(c_0_43,negated_conjecture,
    ( ( rel_s5 @ esk1_0 @ esk4_0 )
    | ~ ( q @ esk3_0 ) ),
    inference(split_conjunct,[status(thm)],[c_0_29]) ).

thf(c_0_44,negated_conjecture,
    ( ( rel_s5 @ esk1_0 @ esk3_0 )
    | ~ ( q @ esk5_0 ) ),
    inference(split_conjunct,[status(thm)],[c_0_29]) ).

thf(c_0_45,negated_conjecture,
    ! [X3: $i] :
      ( ( rel_s5 @ esk1_0 @ esk3_0 )
      | ( q @ X3 )
      | ~ ( rel_s5 @ esk1_0 @ X3 ) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_32]) ).

thf(c_0_46,negated_conjecture,
    ! [X3: $i,X14: $i] :
      ( ( q @ X14 )
      | ( rel_s5 @ esk1_0 @ esk2_0 )
      | ~ ( rel_s5 @ esk1_0 @ X3 )
      | ~ ( p @ X3 )
      | ~ ( rel_s5 @ esk1_0 @ X14 ) ),
    inference(split_conjunct,[status(thm)],[c_0_29]) ).

thf(c_0_47,negated_conjecture,
    ( ( p @ esk4_0 )
    | ( rel_s5 @ esk1_0 @ esk2_0 ) ),
    inference(split_conjunct,[status(thm)],[c_0_29]) ).

thf(c_0_48,negated_conjecture,
    ! [X3: $i] :
      ( ( rel_s5 @ esk1_0 @ esk3_0 )
      | ( rel_s5 @ X3 @ esk5_0 )
      | ~ ( rel_s5 @ X3 @ esk4_0 ) ),
    inference(spm,[status(thm)],[c_0_31,c_0_39]) ).

thf(c_0_49,negated_conjecture,
    rel_s5 @ esk1_0 @ esk4_0,
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_42]),c_0_34]),c_0_43]) ).

thf(c_0_50,negated_conjecture,
    ( ( rel_s5 @ esk1_0 @ esk3_0 )
    | ~ ( rel_s5 @ esk1_0 @ esk5_0 ) ),
    inference(spm,[status(thm)],[c_0_44,c_0_45]) ).

thf(c_0_51,negated_conjecture,
    ( ( rel_s5 @ esk4_0 @ esk5_0 )
    | ( rel_s5 @ esk1_0 @ esk2_0 ) ),
    inference(split_conjunct,[status(thm)],[c_0_29]) ).

thf(c_0_52,negated_conjecture,
    ( ( rel_s5 @ esk1_0 @ esk2_0 )
    | ~ ( q @ esk5_0 ) ),
    inference(split_conjunct,[status(thm)],[c_0_29]) ).

thf(c_0_53,negated_conjecture,
    ! [X3: $i] :
      ( ( rel_s5 @ esk1_0 @ esk2_0 )
      | ( q @ X3 )
      | ~ ( rel_s5 @ esk1_0 @ X3 ) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_47]),c_0_34]) ).

thf(c_0_54,negated_conjecture,
    rel_s5 @ esk1_0 @ esk3_0,
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_50]) ).

thf(c_0_55,negated_conjecture,
    ! [X3: $i] :
      ( ( rel_s5 @ esk1_0 @ esk2_0 )
      | ( rel_s5 @ X3 @ esk5_0 )
      | ~ ( rel_s5 @ X3 @ esk4_0 ) ),
    inference(spm,[status(thm)],[c_0_31,c_0_51]) ).

thf(c_0_56,negated_conjecture,
    ( ( rel_s5 @ esk1_0 @ esk2_0 )
    | ~ ( rel_s5 @ esk1_0 @ esk5_0 ) ),
    inference(spm,[status(thm)],[c_0_52,c_0_53]) ).

thf(c_0_57,negated_conjecture,
    ! [X3: $i] :
      ( ( rel_s5 @ X3 @ esk3_0 )
      | ~ ( rel_s5 @ X3 @ esk1_0 ) ),
    inference(spm,[status(thm)],[c_0_31,c_0_54]) ).

thf(c_0_58,negated_conjecture,
    rel_s5 @ esk1_0 @ esk2_0,
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_55,c_0_49]),c_0_56]) ).

thf(c_0_59,negated_conjecture,
    ! [X3: $i] :
      ( ( rel_s5 @ esk3_0 @ X3 )
      | ~ ( rel_s5 @ X3 @ esk1_0 ) ),
    inference(spm,[status(thm)],[c_0_33,c_0_57]) ).

thf(c_0_60,negated_conjecture,
    rel_s5 @ esk2_0 @ esk1_0,
    inference(spm,[status(thm)],[c_0_33,c_0_58]) ).

thf(c_0_61,negated_conjecture,
    ! [X3: $i] :
      ( ( rel_s5 @ X3 @ esk4_0 )
      | ~ ( rel_s5 @ X3 @ esk1_0 ) ),
    inference(spm,[status(thm)],[c_0_31,c_0_49]) ).

thf(c_0_62,negated_conjecture,
    rel_s5 @ esk3_0 @ esk2_0,
    inference(spm,[status(thm)],[c_0_59,c_0_60]) ).

thf(c_0_63,negated_conjecture,
    ! [X3: $i] :
      ( ( rel_s5 @ esk4_0 @ X3 )
      | ~ ( rel_s5 @ X3 @ esk1_0 ) ),
    inference(spm,[status(thm)],[c_0_33,c_0_61]) ).

thf(c_0_64,negated_conjecture,
    rel_s5 @ esk3_0 @ esk1_0,
    inference(spm,[status(thm)],[c_0_33,c_0_54]) ).

thf(c_0_65,negated_conjecture,
    ! [X3: $i,X14: $i] :
      ( ( p @ esk4_0 )
      | ( q @ X14 )
      | ~ ( rel_s5 @ esk1_0 @ X3 )
      | ~ ( p @ X3 )
      | ~ ( rel_s5 @ X3 @ X14 ) ),
    inference(split_conjunct,[status(thm)],[c_0_29]) ).

thf(c_0_66,negated_conjecture,
    rel_s5 @ esk2_0 @ esk3_0,
    inference(spm,[status(thm)],[c_0_33,c_0_62]) ).

thf(c_0_67,negated_conjecture,
    ( ( p @ esk4_0 )
    | ( p @ esk2_0 ) ),
    inference(split_conjunct,[status(thm)],[c_0_29]) ).

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

thf(c_0_69,negated_conjecture,
    ! [X3: $i,X14: $i] :
      ( ( rel_s5 @ esk4_0 @ esk5_0 )
      | ( q @ X14 )
      | ~ ( rel_s5 @ esk1_0 @ X3 )
      | ~ ( p @ X3 )
      | ~ ( rel_s5 @ X3 @ X14 ) ),
    inference(split_conjunct,[status(thm)],[c_0_29]) ).

thf(c_0_70,negated_conjecture,
    rel_s5 @ esk4_0 @ esk3_0,
    inference(spm,[status(thm)],[c_0_63,c_0_64]) ).

thf(c_0_71,negated_conjecture,
    p @ esk4_0,
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_66]),c_0_58])]),c_0_67]),c_0_68]) ).

thf(c_0_72,negated_conjecture,
    ( ( rel_s5 @ esk4_0 @ esk5_0 )
    | ~ ( q @ esk3_0 ) ),
    inference(split_conjunct,[status(thm)],[c_0_29]) ).

thf(c_0_73,negated_conjecture,
    ! [X15: $i,X3: $i,X14: $i,X16: $i] :
      ( ( q @ X14 )
      | ( q @ X16 )
      | ~ ( rel_s5 @ esk1_0 @ X3 )
      | ~ ( p @ X3 )
      | ~ ( rel_s5 @ esk1_0 @ X14 )
      | ~ ( rel_s5 @ esk1_0 @ X15 )
      | ~ ( p @ X15 )
      | ~ ( rel_s5 @ X15 @ X16 ) ),
    inference(split_conjunct,[status(thm)],[c_0_29]) ).

thf(c_0_74,negated_conjecture,
    ! [X3: $i,X14: $i] :
      ( ( q @ X14 )
      | ~ ( rel_s5 @ esk1_0 @ X3 )
      | ~ ( p @ X3 )
      | ~ ( rel_s5 @ esk1_0 @ X14 )
      | ~ ( q @ esk3_0 ) ),
    inference(split_conjunct,[status(thm)],[c_0_29]) ).

thf(c_0_75,negated_conjecture,
    rel_s5 @ esk4_0 @ esk1_0,
    inference(spm,[status(thm)],[c_0_33,c_0_49]) ).

thf(c_0_76,negated_conjecture,
    rel_s5 @ esk4_0 @ esk5_0,
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_70]),c_0_49])]),c_0_71])]),c_0_72]) ).

thf(c_0_77,negated_conjecture,
    ! [X3: $i,X14: $i] :
      ( ( q @ X3 )
      | ~ ( rel_s5 @ esk1_0 @ X3 )
      | ~ ( rel_s5 @ esk1_0 @ X14 )
      | ~ ( p @ X14 ) ),
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_73,c_0_70]),c_0_49])]),c_0_71])]),c_0_74]) ).

thf(c_0_78,negated_conjecture,
    ! [X3: $i] :
      ( ( rel_s5 @ X3 @ esk1_0 )
      | ~ ( rel_s5 @ X3 @ esk4_0 ) ),
    inference(spm,[status(thm)],[c_0_31,c_0_75]) ).

thf(c_0_79,negated_conjecture,
    rel_s5 @ esk5_0 @ esk4_0,
    inference(spm,[status(thm)],[c_0_33,c_0_76]) ).

thf(c_0_80,negated_conjecture,
    ( ~ ( q @ esk5_0 )
    | ~ ( q @ esk3_0 ) ),
    inference(split_conjunct,[status(thm)],[c_0_29]) ).

thf(c_0_81,negated_conjecture,
    ! [X3: $i] :
      ( ( q @ X3 )
      | ~ ( rel_s5 @ esk1_0 @ X3 ) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_71]),c_0_49])]) ).

thf(c_0_82,negated_conjecture,
    rel_s5 @ esk5_0 @ esk1_0,
    inference(spm,[status(thm)],[c_0_78,c_0_79]) ).

thf(c_0_83,negated_conjecture,
    ~ ( q @ esk5_0 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_81]),c_0_54])]) ).

thf(c_0_84,negated_conjecture,
    rel_s5 @ esk1_0 @ esk5_0,
    inference(spm,[status(thm)],[c_0_33,c_0_82]) ).

thf(c_0_85,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_83,c_0_81]),c_0_84])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SYO443^1 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.04  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.18  % Computer : n008.cluster.edu
% 0.08/0.18  % Model    : x86_64 x86_64
% 0.08/0.18  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.08/0.18  % Memory   : 8046.5625MB
% 0.08/0.18  % OS       : Linux 6.8.0-71-generic
% 0.08/0.18  % CPULimit : 300
% 0.08/0.18  % WCLimit  : 300
% 0.08/0.18  % DateTime : Tue Sep 29 16:52:39 UTC 2026
% 0.08/0.18  % CPUTime  : 
% 0.08/0.18  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.08/0.22  Running higher-order theorem proving
% 0.08/0.24  Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.pISFswxOlK/E---3.1_3420278.p
% 0.22/0.27  % Version: 3.5.1-ho
% 0.22/0.27  % Preprocessing class: HSMSSMSSMLMNHSN.
% 0.22/0.27  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.27  % Starting ho_unfolding_3 with 1500s (5) cores
% 0.22/0.27  % Starting ehoh_best2_full_lfho with 300s (1) cores
% 0.22/0.27  % Starting almost_fo_3_lam with 300s (1) cores
% 0.22/0.27  % Starting post_as_ho1 with 300s (1) cores
% 0.22/0.27  % ho_unfolding_3 with pid 3420301 completed with status 0
% 0.22/0.27  % Result found by ho_unfolding_3
% 0.22/0.27  % Preprocessing class: HSMSSMSSMLMNHSN.
% 0.22/0.27  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.27  % Starting ho_unfolding_3 with 1500s (5) cores
% 0.22/0.27  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.22/0.27  % No SInE strategy applied
% 0.22/0.27  % Search class: HGHNF-FFMM00-SHSSMFNN
% 0.22/0.27  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.27  % Starting SubtermCWHack with 136s (1) cores
% 0.22/0.27  % Starting ho_unfolding_3 with 151s (1) cores
% 0.22/0.27  % Starting sh5l with 136s (1) cores
% 0.22/0.27  % Starting ehoh_best_sine_rwall with 136s (1) cores
% 0.22/0.27  % Starting lpo1_def_fix with 136s (1) cores
% 0.22/0.27  % SubtermCWHack with pid 3420307 completed with status 0
% 0.22/0.27  % Result found by SubtermCWHack
% 0.22/0.27  % Preprocessing class: HSMSSMSSMLMNHSN.
% 0.22/0.27  % Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.27  % Starting ho_unfolding_3 with 1500s (5) cores
% 0.22/0.27  % (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 0.22/0.27  % No SInE strategy applied
% 0.22/0.27  % Search class: HGHNF-FFMM00-SHSSMFNN
% 0.22/0.27  % Scheduled 7 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.27  % Starting SubtermCWHack with 136s (1) cores
% 0.22/0.27  % Preprocessing time       : 0.001 s
% 0.22/0.27  
% 0.22/0.27  % Proof found!
% 0.22/0.27  % SZS status Theorem
% 0.22/0.27  % SZS output start CNFRefutation
% See solution above
% 0.22/0.27  % Parsed axioms                        : 74
% 0.22/0.27  % Removed by relevancy pruning/SinE    : 0
% 0.22/0.27  % Initial clauses                      : 65
% 0.22/0.27  % Removed in clause preprocessing      : 37
% 0.22/0.27  % Initial clauses in saturation        : 28
% 0.22/0.27  % Processed clauses                    : 174
% 0.22/0.27  % ...of these trivial                  : 2
% 0.22/0.27  % ...subsumed                          : 63
% 0.22/0.27  % ...remaining for further processing  : 109
% 0.22/0.27  % Other redundant clauses eliminated   : 0
% 0.22/0.27  % Clauses deleted for lack of memory   : 0
% 0.22/0.27  % Backward-subsumed                    : 17
% 0.22/0.27  % Backward-rewritten                   : 46
% 0.22/0.27  % Generated clauses                    : 344
% 0.22/0.27  % ...of the previous two non-redundant : 238
% 0.22/0.27  % ...aggressively subsumed             : 0
% 0.22/0.27  % Contextual simplify-reflections      : 21
% 0.22/0.27  % Paramodulations                      : 344
% 0.22/0.27  % Factorizations                       : 0
% 0.22/0.27  % NegExts                              : 0
% 0.22/0.27  % Equation resolutions                 : 0
% 0.22/0.27  % Disequality decompositions           : 0
% 0.22/0.27  % Total rewrite steps                  : 187
% 0.22/0.27  % ...of those cached                   : 160
% 0.22/0.27  % Propositional unsat checks           : 0
% 0.22/0.27  %    Propositional check models        : 0
% 0.22/0.27  %    Propositional check unsatisfiable : 0
% 0.22/0.27  %    Propositional clauses             : 0
% 0.22/0.27  %    Propositional clauses after purity: 0
% 0.22/0.27  %    Propositional unsat core size     : 0
% 0.22/0.27  %    Propositional preprocessing time  : 0.000
% 0.22/0.27  %    Propositional encoding time       : 0.000
% 0.22/0.27  %    Propositional solver time         : 0.000
% 0.22/0.27  %    Success case prop preproc time    : 0.000
% 0.22/0.27  %    Success case prop encoding time   : 0.000
% 0.22/0.27  %    Success case prop solver time     : 0.000
% 0.22/0.27  % Current number of processed clauses  : 46
% 0.22/0.27  %    Positive orientable unit clauses  : 23
% 0.22/0.27  %    Positive unorientable unit clauses: 0
% 0.22/0.27  %    Negative unit clauses             : 1
% 0.22/0.27  %    Non-unit-clauses                  : 22
% 0.22/0.27  % Current number of unprocessed clauses: 52
% 0.22/0.27  % ...number of literals in the above   : 249
% 0.22/0.27  % Current number of archived formulas  : 0
% 0.22/0.27  % Current number of archived clauses   : 63
% 0.22/0.27  % Clause-clause subsumption calls (NU) : 556
% 0.22/0.27  % Rec. Clause-clause subsumption calls : 458
% 0.22/0.27  % Non-unit clause-clause subsumptions  : 96
% 0.22/0.27  % Unit Clause-clause subsumption calls : 25
% 0.22/0.27  % Rewrite failures with RHS unbound    : 0
% 0.22/0.27  % BW rewrite match attempts            : 7
% 0.22/0.27  % BW rewrite match successes           : 7
% 0.22/0.27  % Condensation attempts                : 0
% 0.22/0.27  % Condensation successes               : 0
% 0.22/0.27  % Termbank termtop insertions          : 7724
% 0.22/0.27  % Search garbage collected termcells   : 704
% 0.22/0.27  
% 0.22/0.27  % -------------------------------------------------
% 0.22/0.27  % User time                : 0.011 s
% 0.22/0.27  % System time              : 0.003 s
% 0.22/0.27  % Total time               : 0.014 s
% 0.22/0.27  % Maximum resident set size: 3700 pages
% 0.22/0.27  
% 0.22/0.27  % -------------------------------------------------
% 0.22/0.27  % User time                : 0.031 s
% 0.22/0.27  % System time              : 0.013 s
% 0.22/0.27  % Total time               : 0.044 s
% 0.22/0.27  % Maximum resident set size: 4864 pages
% 0.22/0.27  % E exiting
%------------------------------------------------------------------------------