↑ Up

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

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E-SAT---3.5.1
% Problem  : SEV011^5 : 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 : n005.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:35:48 AM UTC 2026

% Result   : Theorem 196.52s 28.47s
% Output   : CNFRefutation 196.52s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   30
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   72 (  11 unt;   0 typ;   0 def)
%            Number of atoms       :  326 (  16 equ;   0 cnn)
%            Maximal formula atoms :   38 (   4 avg)
%            Number of connectives : 1053 ( 119   ~; 167   |;  26   &; 721   @)
%                                         (   4 <=>;  12  =>;   0  <=;   4 <~>)
%            Maximal formula depth :   29 (   7 avg)
%            Number of types       :    2 (   1 usr)
%            Number of type conns  :   24 (  24   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   11 (   9 usr;   5 con; 0-2 aty)
%            Number of variables   :   94 (   0   ^;  92   !;   2   ?;  94   :)

% Comments : 
%------------------------------------------------------------------------------
thf(decl_sort1,type,
    a: $tType ).

thf(decl_23,type,
    epred1_0: a > a > $o ).

thf(decl_24,type,
    esk1_0: a ).

thf(decl_25,type,
    esk2_1: ( a > $o ) > a ).

thf(decl_26,type,
    esk3_1: ( a > $o ) > a ).

thf(decl_27,type,
    epred2_1: ( a > $o ) > a > $o ).

thf(decl_28,type,
    esk4_1: ( a > $o ) > a ).

thf(decl_31,type,
    esk7_0: a ).

thf(decl_49,type,
    esk25_0: a ).

thf(decl_58,type,
    esk34_0: a ).

thf(cTHM260_B_pme,conjecture,
    ! [X1: a > a > $o] :
      ( ( ! [X2: a] : ( X1 @ X2 @ X2 )
        & ! [X2: a,X3: a] :
            ( ( X1 @ X2 @ X3 )
           => ( X1 @ X3 @ X2 ) )
        & ! [X2: a,X3: a,X4: a] :
            ( ( ( X1 @ X2 @ X3 )
              & ( X1 @ X3 @ X4 ) )
           => ( X1 @ X2 @ X4 ) ) )
     => ! [X2: a] :
        ? [X5: a > $o] :
          ( ! [X6: a] :
              ( ( X5 @ X6 )
             => ! [X3: a] :
                  ( ( X5 @ X3 )
                <=> ( X1 @ X6 @ X3 ) ) )
          & ( X5 @ X2 )
          & ! [X7: a > $o] :
              ( ( ! [X6: a] :
                    ( ( X7 @ X6 )
                   => ! [X3: a] :
                        ( ( X7 @ X3 )
                      <=> ( X1 @ X6 @ X3 ) ) )
                & ( X7 @ X2 ) )
             => ( X7 = X5 ) ) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.j1PsMvG5Px/E---3.1_1772557.p',cTHM260_B_pme) ).

thf(c_0_1,negated_conjecture,
    ~ ! [X1: a > a > $o] :
        ( ( ! [X2: a] : ( X1 @ X2 @ X2 )
          & ! [X2: a,X3: a] :
              ( ( X1 @ X2 @ X3 )
             => ( X1 @ X3 @ X2 ) )
          & ! [X2: a,X3: a,X4: a] :
              ( ( ( X1 @ X2 @ X3 )
                & ( X1 @ X3 @ X4 ) )
             => ( X1 @ X2 @ X4 ) ) )
       => ! [X2: a] :
          ? [X5: a > $o] :
            ( ! [X6: a] :
                ( ( X5 @ X6 )
               => ! [X3: a] :
                    ( ( X5 @ X3 )
                  <=> ( X1 @ X6 @ X3 ) ) )
            & ( X5 @ X2 )
            & ! [X7: a > $o] :
                ( ( ! [X6: a] :
                      ( ( X7 @ X6 )
                     => ! [X3: a] :
                          ( ( X7 @ X3 )
                        <=> ( X1 @ X6 @ X3 ) ) )
                  & ( X7 @ X2 ) )
               => ( X7 = X5 ) ) ) ),
    inference(assume_negation,[status(cth)],[cTHM260_B_pme]) ).

thf(c_0_2,negated_conjecture,
    ! [X23: a,X24: a,X25: a,X26: a,X27: a,X28: a,X30: a > $o,X34: a,X35: a] :
      ( ( epred1_0 @ X23 @ X23 )
      & ( ~ ( epred1_0 @ X24 @ X25 )
        | ( epred1_0 @ X25 @ X24 ) )
      & ( ~ ( epred1_0 @ X26 @ X27 )
        | ~ ( epred1_0 @ X27 @ X28 )
        | ( epred1_0 @ X26 @ X28 ) )
      & ( ~ ( epred2_1 @ X30 @ X35 )
        | ( epred1_0 @ X34 @ X35 )
        | ~ ( epred2_1 @ X30 @ X34 )
        | ( X30 @ ( esk2_1 @ X30 ) )
        | ~ ( X30 @ esk1_0 ) )
      & ( ~ ( epred1_0 @ X34 @ X35 )
        | ( epred2_1 @ X30 @ X35 )
        | ~ ( epred2_1 @ X30 @ X34 )
        | ( X30 @ ( esk2_1 @ X30 ) )
        | ~ ( X30 @ esk1_0 ) )
      & ( ( epred2_1 @ X30 @ esk1_0 )
        | ( X30 @ ( esk2_1 @ X30 ) )
        | ~ ( X30 @ esk1_0 ) )
      & ( ( ( epred2_1 @ X30 )
         != X30 )
        | ( X30 @ ( esk2_1 @ X30 ) )
        | ~ ( X30 @ esk1_0 ) )
      & ( ~ ( epred2_1 @ X30 @ X35 )
        | ( epred1_0 @ X34 @ X35 )
        | ~ ( epred2_1 @ X30 @ X34 )
        | ~ ( X30 @ ( esk3_1 @ X30 ) )
        | ~ ( epred1_0 @ ( esk2_1 @ X30 ) @ ( esk3_1 @ X30 ) )
        | ~ ( X30 @ esk1_0 ) )
      & ( ~ ( epred1_0 @ X34 @ X35 )
        | ( epred2_1 @ X30 @ X35 )
        | ~ ( epred2_1 @ X30 @ X34 )
        | ~ ( X30 @ ( esk3_1 @ X30 ) )
        | ~ ( epred1_0 @ ( esk2_1 @ X30 ) @ ( esk3_1 @ X30 ) )
        | ~ ( X30 @ esk1_0 ) )
      & ( ( epred2_1 @ X30 @ esk1_0 )
        | ~ ( X30 @ ( esk3_1 @ X30 ) )
        | ~ ( epred1_0 @ ( esk2_1 @ X30 ) @ ( esk3_1 @ X30 ) )
        | ~ ( X30 @ esk1_0 ) )
      & ( ( ( epred2_1 @ X30 )
         != X30 )
        | ~ ( X30 @ ( esk3_1 @ X30 ) )
        | ~ ( epred1_0 @ ( esk2_1 @ X30 ) @ ( esk3_1 @ X30 ) )
        | ~ ( X30 @ esk1_0 ) )
      & ( ~ ( epred2_1 @ X30 @ X35 )
        | ( epred1_0 @ X34 @ X35 )
        | ~ ( epred2_1 @ X30 @ X34 )
        | ( X30 @ ( esk3_1 @ X30 ) )
        | ( epred1_0 @ ( esk2_1 @ X30 ) @ ( esk3_1 @ X30 ) )
        | ~ ( X30 @ esk1_0 ) )
      & ( ~ ( epred1_0 @ X34 @ X35 )
        | ( epred2_1 @ X30 @ X35 )
        | ~ ( epred2_1 @ X30 @ X34 )
        | ( X30 @ ( esk3_1 @ X30 ) )
        | ( epred1_0 @ ( esk2_1 @ X30 ) @ ( esk3_1 @ X30 ) )
        | ~ ( X30 @ esk1_0 ) )
      & ( ( epred2_1 @ X30 @ esk1_0 )
        | ( X30 @ ( esk3_1 @ X30 ) )
        | ( epred1_0 @ ( esk2_1 @ X30 ) @ ( esk3_1 @ X30 ) )
        | ~ ( X30 @ esk1_0 ) )
      & ( ( ( epred2_1 @ X30 )
         != X30 )
        | ( X30 @ ( esk3_1 @ X30 ) )
        | ( epred1_0 @ ( esk2_1 @ X30 ) @ ( esk3_1 @ X30 ) )
        | ~ ( X30 @ esk1_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_1])])])])])]) ).

thf(c_0_3,negated_conjecture,
    ! [X5: a > $o] :
      ( ( epred2_1 @ X5 @ esk1_0 )
      | ( X5 @ ( esk2_1 @ X5 ) )
      | ~ ( X5 @ esk1_0 ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_4,negated_conjecture,
    ! [X2: a] : ( epred1_0 @ X2 @ X2 ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_5,negated_conjecture,
    ! [X2: a,X3: a] :
      ( ( epred1_0 @ X3 @ X2 )
      | ~ ( epred1_0 @ X2 @ X3 ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_6,negated_conjecture,
    ( ( epred1_0 @ esk1_0 @ ( esk2_1 @ ( epred1_0 @ esk1_0 ) ) )
    | ( epred2_1 @ ( epred1_0 @ esk1_0 ) @ esk1_0 ) ),
    inference(spm,[status(thm)],[c_0_3,c_0_4]) ).

thf(c_0_7,negated_conjecture,
    ! [X5: a > $o] :
      ( ( epred2_1 @ X5 @ esk1_0 )
      | ( X5 @ ( esk3_1 @ X5 ) )
      | ( epred1_0 @ ( esk2_1 @ X5 ) @ ( esk3_1 @ X5 ) )
      | ~ ( X5 @ esk1_0 ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_8,negated_conjecture,
    ! [X2: a,X3: a,X4: a] :
      ( ( epred1_0 @ X2 @ X4 )
      | ~ ( epred1_0 @ X2 @ X3 )
      | ~ ( epred1_0 @ X3 @ X4 ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_9,negated_conjecture,
    ( ( epred1_0 @ ( esk2_1 @ ( epred1_0 @ esk1_0 ) ) @ esk1_0 )
    | ( epred2_1 @ ( epred1_0 @ esk1_0 ) @ esk1_0 ) ),
    inference(spm,[status(thm)],[c_0_5,c_0_6]) ).

thf(c_0_10,negated_conjecture,
    ( ( epred1_0 @ ( esk2_1 @ ( epred1_0 @ esk1_0 ) ) @ ( esk3_1 @ ( epred1_0 @ esk1_0 ) ) )
    | ( epred1_0 @ esk1_0 @ ( esk3_1 @ ( epred1_0 @ esk1_0 ) ) )
    | ( epred2_1 @ ( epred1_0 @ esk1_0 ) @ esk1_0 ) ),
    inference(spm,[status(thm)],[c_0_7,c_0_4]) ).

thf(c_0_11,negated_conjecture,
    ! [X2: a] :
      ( ( epred2_1 @ ( epred1_0 @ esk1_0 ) @ esk1_0 )
      | ( epred1_0 @ X2 @ esk1_0 )
      | ~ ( epred1_0 @ X2 @ ( esk2_1 @ ( epred1_0 @ esk1_0 ) ) ) ),
    inference(spm,[status(thm)],[c_0_8,c_0_9]) ).

thf(c_0_12,negated_conjecture,
    ( ( epred1_0 @ ( esk3_1 @ ( epred1_0 @ esk1_0 ) ) @ ( esk2_1 @ ( epred1_0 @ esk1_0 ) ) )
    | ( epred1_0 @ esk1_0 @ ( esk3_1 @ ( epred1_0 @ esk1_0 ) ) )
    | ( epred2_1 @ ( epred1_0 @ esk1_0 ) @ esk1_0 ) ),
    inference(spm,[status(thm)],[c_0_5,c_0_10]) ).

thf(c_0_13,negated_conjecture,
    ! [X2: a] :
      ( ( epred1_0 @ X2 @ ( esk2_1 @ ( epred1_0 @ esk1_0 ) ) )
      | ( epred2_1 @ ( epred1_0 @ esk1_0 ) @ esk1_0 )
      | ~ ( epred1_0 @ X2 @ esk1_0 ) ),
    inference(spm,[status(thm)],[c_0_8,c_0_6]) ).

thf(c_0_14,negated_conjecture,
    ( ( epred1_0 @ ( esk3_1 @ ( epred1_0 @ esk1_0 ) ) @ esk1_0 )
    | ( epred2_1 @ ( epred1_0 @ esk1_0 ) @ esk1_0 ) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_11,c_0_12]),c_0_5]) ).

thf(c_0_15,negated_conjecture,
    ! [X5: a > $o] :
      ( ( X5 @ ( esk2_1 @ X5 ) )
      | ( ( epred2_1 @ X5 )
       != X5 )
      | ~ ( X5 @ esk1_0 ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_16,negated_conjecture,
    ! [X5: a > $o] :
      ( ( epred2_1 @ X5 @ esk1_0 )
      | ~ ( X5 @ ( esk3_1 @ X5 ) )
      | ~ ( epred1_0 @ ( esk2_1 @ X5 ) @ ( esk3_1 @ X5 ) )
      | ~ ( X5 @ esk1_0 ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_17,negated_conjecture,
    ! [X2: a] :
      ( ( epred1_0 @ ( esk2_1 @ ( epred1_0 @ esk1_0 ) ) @ X2 )
      | ( epred2_1 @ ( epred1_0 @ esk1_0 ) @ esk1_0 )
      | ~ ( epred1_0 @ X2 @ esk1_0 ) ),
    inference(spm,[status(thm)],[c_0_5,c_0_13]) ).

thf(c_0_18,negated_conjecture,
    ( ( epred1_0 @ esk1_0 @ ( esk3_1 @ ( epred1_0 @ esk1_0 ) ) )
    | ( epred2_1 @ ( epred1_0 @ esk1_0 ) @ esk1_0 ) ),
    inference(spm,[status(thm)],[c_0_5,c_0_14]) ).

thf(c_0_19,negated_conjecture,
    ! [X5: a > $o] :
      ( ( X5 @ ( esk2_1 @ X5 ) )
      | ( ( epred2_1 @ X5 @ ( esk4_1 @ X5 ) )
      <~> ( X5 @ ( esk4_1 @ X5 ) ) )
      | ~ ( X5 @ esk1_0 ) ),
    inference(neg_ext,[status(thm)],[c_0_15]) ).

thf(c_0_20,negated_conjecture,
    ! [X2: a,X3: a,X5: a > $o] :
      ( ( epred2_1 @ X5 @ X3 )
      | ( X5 @ ( esk2_1 @ X5 ) )
      | ~ ( epred1_0 @ X2 @ X3 )
      | ~ ( epred2_1 @ X5 @ X2 )
      | ~ ( X5 @ esk1_0 ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_21,negated_conjecture,
    epred2_1 @ ( epred1_0 @ esk1_0 ) @ esk1_0,
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_17]),c_0_4])]),c_0_5]),c_0_18]) ).

thf(c_0_22,negated_conjecture,
    ! [X5: a > $o] :
      ( ( epred2_1 @ X5 @ ( esk4_1 @ X5 ) )
      | ( X5 @ ( esk2_1 @ X5 ) )
      | ( X5 @ ( esk4_1 @ X5 ) )
      | ~ ( X5 @ esk1_0 ) ),
    inference(dynamic_cnf,[status(thm)],[c_0_19]) ).

thf(c_0_23,negated_conjecture,
    ! [X2: a] :
      ( ( epred1_0 @ esk1_0 @ ( esk2_1 @ ( epred1_0 @ esk1_0 ) ) )
      | ( epred2_1 @ ( epred1_0 @ esk1_0 ) @ X2 )
      | ~ ( epred1_0 @ esk1_0 @ X2 ) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_20,c_0_21]),c_0_4])]) ).

thf(c_0_24,negated_conjecture,
    ( ( epred2_1 @ ( epred1_0 @ esk1_0 ) @ ( esk4_1 @ ( epred1_0 @ esk1_0 ) ) )
    | ( epred1_0 @ esk1_0 @ ( esk2_1 @ ( epred1_0 @ esk1_0 ) ) ) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_4]),c_0_23]) ).

thf(c_0_25,negated_conjecture,
    ! [X5: a > $o] :
      ( ( X5 @ ( esk3_1 @ X5 ) )
      | ( epred1_0 @ ( esk2_1 @ X5 ) @ ( esk3_1 @ X5 ) )
      | ( ( epred2_1 @ X5 )
       != X5 )
      | ~ ( X5 @ esk1_0 ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_26,negated_conjecture,
    ! [X2: a] :
      ( ( epred2_1 @ ( epred1_0 @ esk1_0 ) @ ( esk4_1 @ ( epred1_0 @ esk1_0 ) ) )
      | ( epred1_0 @ X2 @ ( esk2_1 @ ( epred1_0 @ esk1_0 ) ) )
      | ~ ( epred1_0 @ X2 @ esk1_0 ) ),
    inference(spm,[status(thm)],[c_0_8,c_0_24]) ).

thf(c_0_27,negated_conjecture,
    ( ( epred1_0 @ ( esk2_1 @ ( epred1_0 @ esk1_0 ) ) @ ( esk3_1 @ ( epred1_0 @ esk1_0 ) ) )
    | ( epred1_0 @ esk1_0 @ ( esk3_1 @ ( epred1_0 @ esk1_0 ) ) )
    | ( ( epred2_1 @ ( epred1_0 @ esk1_0 ) )
     != ( epred1_0 @ esk1_0 ) ) ),
    inference(spm,[status(thm)],[c_0_25,c_0_4]) ).

thf(c_0_28,negated_conjecture,
    ! [X5: a > $o] :
      ( ( ( epred2_1 @ X5 )
       != X5 )
      | ~ ( X5 @ ( esk3_1 @ X5 ) )
      | ~ ( epred1_0 @ ( esk2_1 @ X5 ) @ ( esk3_1 @ X5 ) )
      | ~ ( X5 @ esk1_0 ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_29,negated_conjecture,
    ! [X2: a] :
      ( ( epred2_1 @ ( epred1_0 @ esk1_0 ) @ ( esk4_1 @ ( epred1_0 @ esk1_0 ) ) )
      | ( epred1_0 @ ( esk2_1 @ ( epred1_0 @ esk1_0 ) ) @ X2 )
      | ~ ( epred1_0 @ X2 @ esk1_0 ) ),
    inference(spm,[status(thm)],[c_0_5,c_0_26]) ).

thf(c_0_30,negated_conjecture,
    ! [X2: a] :
      ( ( epred1_0 @ esk1_0 @ ( esk3_1 @ ( epred1_0 @ esk1_0 ) ) )
      | ( epred1_0 @ X2 @ ( esk3_1 @ ( epred1_0 @ esk1_0 ) ) )
      | ( ( epred2_1 @ ( epred1_0 @ esk1_0 ) )
       != ( epred1_0 @ esk1_0 ) )
      | ~ ( epred1_0 @ X2 @ ( esk2_1 @ ( epred1_0 @ esk1_0 ) ) ) ),
    inference(spm,[status(thm)],[c_0_8,c_0_27]) ).

thf(c_0_31,negated_conjecture,
    ( ( epred2_1 @ ( epred1_0 @ esk1_0 ) @ ( esk4_1 @ ( epred1_0 @ esk1_0 ) ) )
    | ( ( epred2_1 @ ( epred1_0 @ esk1_0 ) )
     != ( epred1_0 @ esk1_0 ) )
    | ~ ( epred1_0 @ esk1_0 @ ( esk3_1 @ ( epred1_0 @ esk1_0 ) ) ) ),
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_29]),c_0_4])]),c_0_5]) ).

thf(c_0_32,negated_conjecture,
    ! [X2: a,X3: a,X5: a > $o] :
      ( ( epred1_0 @ X3 @ X2 )
      | ( X5 @ ( esk2_1 @ X5 ) )
      | ~ ( epred2_1 @ X5 @ X2 )
      | ~ ( epred2_1 @ X5 @ X3 )
      | ~ ( X5 @ esk1_0 ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_33,negated_conjecture,
    ! [X5: a > $o] :
      ( ( X5 @ ( esk2_1 @ X5 ) )
      | ~ ( epred2_1 @ X5 @ ( esk4_1 @ X5 ) )
      | ~ ( X5 @ ( esk4_1 @ X5 ) )
      | ~ ( X5 @ esk1_0 ) ),
    inference(dynamic_cnf,[status(thm)],[c_0_19]) ).

thf(c_0_34,negated_conjecture,
    ( ( epred2_1 @ ( epred1_0 @ esk1_0 ) @ ( esk4_1 @ ( epred1_0 @ esk1_0 ) ) )
    | ( ( epred2_1 @ ( epred1_0 @ esk1_0 ) )
     != ( epred1_0 @ esk1_0 ) ) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_24]),c_0_31]) ).

thf(c_0_35,negated_conjecture,
    ! [X2: a] :
      ( ( epred1_0 @ esk1_0 @ ( esk2_1 @ ( epred1_0 @ esk1_0 ) ) )
      | ( epred1_0 @ esk1_0 @ X2 )
      | ~ ( epred2_1 @ ( epred1_0 @ esk1_0 ) @ X2 ) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32,c_0_21]),c_0_4])]) ).

thf(c_0_36,negated_conjecture,
    ( ( epred1_0 @ esk1_0 @ ( esk2_1 @ ( epred1_0 @ esk1_0 ) ) )
    | ( ( epred2_1 @ ( epred1_0 @ esk1_0 ) )
     != ( epred1_0 @ esk1_0 ) )
    | ~ ( epred1_0 @ esk1_0 @ ( esk4_1 @ ( epred1_0 @ esk1_0 ) ) ) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_34]),c_0_4])]) ).

thf(c_0_37,negated_conjecture,
    ( ( epred1_0 @ esk1_0 @ ( esk2_1 @ ( epred1_0 @ esk1_0 ) ) )
    | ( ( epred2_1 @ ( epred1_0 @ esk1_0 ) )
     != ( epred1_0 @ esk1_0 ) ) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_34]),c_0_36]) ).

thf(c_0_38,negated_conjecture,
    ( ( epred1_0 @ esk1_0 @ ( esk2_1 @ ( epred1_0 @ esk1_0 ) ) )
    | ( ( epred2_1 @ ( epred1_0 @ esk1_0 ) @ esk25_0 )
    <~> ( epred1_0 @ esk1_0 @ esk25_0 ) ) ),
    inference(neg_ext,[status(thm)],[c_0_37]) ).

thf(c_0_39,negated_conjecture,
    ( ( epred1_0 @ esk1_0 @ ( esk2_1 @ ( epred1_0 @ esk1_0 ) ) )
    | ( epred2_1 @ ( epred1_0 @ esk1_0 ) @ esk25_0 ) ),
    inference(csr,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_38]),c_0_23]) ).

thf(c_0_40,negated_conjecture,
    ! [X2: a,X3: a,X5: a > $o] :
      ( ( epred2_1 @ X5 @ X3 )
      | ( X5 @ ( esk3_1 @ X5 ) )
      | ( epred1_0 @ ( esk2_1 @ X5 ) @ ( esk3_1 @ X5 ) )
      | ~ ( epred1_0 @ X2 @ X3 )
      | ~ ( epred2_1 @ X5 @ X2 )
      | ~ ( X5 @ esk1_0 ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_41,negated_conjecture,
    epred1_0 @ esk1_0 @ ( esk2_1 @ ( epred1_0 @ esk1_0 ) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_38]),c_0_35]),c_0_39]) ).

thf(c_0_42,negated_conjecture,
    ! [X2: a,X3: a,X5: a > $o] :
      ( ( epred1_0 @ X3 @ X2 )
      | ( X5 @ ( esk3_1 @ X5 ) )
      | ( epred1_0 @ ( esk2_1 @ X5 ) @ ( esk3_1 @ X5 ) )
      | ~ ( epred2_1 @ X5 @ X2 )
      | ~ ( epred2_1 @ X5 @ X3 )
      | ~ ( X5 @ esk1_0 ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_43,negated_conjecture,
    ( ( epred1_0 @ ( esk2_1 @ ( epred1_0 @ esk1_0 ) ) @ ( esk3_1 @ ( epred1_0 @ esk1_0 ) ) )
    | ( epred1_0 @ esk1_0 @ ( esk3_1 @ ( epred1_0 @ esk1_0 ) ) )
    | ( ( epred2_1 @ ( epred1_0 @ esk1_0 ) @ esk7_0 )
    <~> ( epred1_0 @ esk1_0 @ esk7_0 ) ) ),
    inference(neg_ext,[status(thm)],[c_0_27]) ).

thf(c_0_44,negated_conjecture,
    ! [X2: a] :
      ( ( epred1_0 @ ( esk2_1 @ ( epred1_0 @ esk1_0 ) ) @ ( esk3_1 @ ( epred1_0 @ esk1_0 ) ) )
      | ( epred1_0 @ esk1_0 @ ( esk3_1 @ ( epred1_0 @ esk1_0 ) ) )
      | ( epred2_1 @ ( epred1_0 @ esk1_0 ) @ X2 )
      | ~ ( epred1_0 @ esk1_0 @ X2 ) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_21]),c_0_4])]) ).

thf(c_0_45,negated_conjecture,
    ! [X2: a] :
      ( ( epred1_0 @ X2 @ ( esk2_1 @ ( epred1_0 @ esk1_0 ) ) )
      | ~ ( epred1_0 @ X2 @ esk1_0 ) ),
    inference(spm,[status(thm)],[c_0_8,c_0_41]) ).

thf(c_0_46,negated_conjecture,
    ! [X2: a] :
      ( ( epred1_0 @ ( esk2_1 @ ( epred1_0 @ esk1_0 ) ) @ ( esk3_1 @ ( epred1_0 @ esk1_0 ) ) )
      | ( epred1_0 @ esk1_0 @ ( esk3_1 @ ( epred1_0 @ esk1_0 ) ) )
      | ( epred1_0 @ esk1_0 @ X2 )
      | ~ ( epred2_1 @ ( epred1_0 @ esk1_0 ) @ X2 ) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_21]),c_0_4])]) ).

thf(c_0_47,negated_conjecture,
    ( ( epred1_0 @ ( esk2_1 @ ( epred1_0 @ esk1_0 ) ) @ ( esk3_1 @ ( epred1_0 @ esk1_0 ) ) )
    | ( epred1_0 @ esk1_0 @ ( esk3_1 @ ( epred1_0 @ esk1_0 ) ) )
    | ( epred2_1 @ ( epred1_0 @ esk1_0 ) @ esk7_0 ) ),
    inference(csr,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_43]),c_0_44]) ).

thf(c_0_48,negated_conjecture,
    ! [X2: a] :
      ( ( epred1_0 @ ( esk2_1 @ ( epred1_0 @ esk1_0 ) ) @ X2 )
      | ~ ( epred1_0 @ X2 @ esk1_0 ) ),
    inference(spm,[status(thm)],[c_0_5,c_0_45]) ).

thf(c_0_49,negated_conjecture,
    epred1_0 @ ( esk2_1 @ ( epred1_0 @ esk1_0 ) ) @ esk1_0,
    inference(spm,[status(thm)],[c_0_5,c_0_41]) ).

thf(c_0_50,negated_conjecture,
    ( ( epred1_0 @ ( esk2_1 @ ( epred1_0 @ esk1_0 ) ) @ ( esk3_1 @ ( epred1_0 @ esk1_0 ) ) )
    | ( epred1_0 @ esk1_0 @ ( esk3_1 @ ( epred1_0 @ esk1_0 ) ) ) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(dynamic_cnf,[status(thm)],[c_0_43]),c_0_46]),c_0_47]) ).

thf(c_0_51,negated_conjecture,
    ! [X2: a,X3: a] :
      ( ( epred1_0 @ X2 @ X3 )
      | ~ ( epred1_0 @ X2 @ ( esk2_1 @ ( epred1_0 @ esk1_0 ) ) )
      | ~ ( epred1_0 @ X3 @ esk1_0 ) ),
    inference(spm,[status(thm)],[c_0_8,c_0_48]) ).

thf(c_0_52,negated_conjecture,
    ! [X2: a] :
      ( ( epred1_0 @ X2 @ esk1_0 )
      | ~ ( epred1_0 @ X2 @ ( esk2_1 @ ( epred1_0 @ esk1_0 ) ) ) ),
    inference(spm,[status(thm)],[c_0_8,c_0_49]) ).

thf(c_0_53,negated_conjecture,
    ( ( epred1_0 @ ( esk3_1 @ ( epred1_0 @ esk1_0 ) ) @ ( esk2_1 @ ( epred1_0 @ esk1_0 ) ) )
    | ( epred1_0 @ esk1_0 @ ( esk3_1 @ ( epred1_0 @ esk1_0 ) ) ) ),
    inference(spm,[status(thm)],[c_0_5,c_0_50]) ).

thf(c_0_54,negated_conjecture,
    ! [X3: a,X2: a] :
      ( ( epred1_0 @ X2 @ X3 )
      | ~ ( epred1_0 @ X3 @ esk1_0 )
      | ~ ( epred1_0 @ X2 @ esk1_0 ) ),
    inference(spm,[status(thm)],[c_0_51,c_0_45]) ).

thf(c_0_55,negated_conjecture,
    epred1_0 @ ( esk3_1 @ ( epred1_0 @ esk1_0 ) ) @ esk1_0,
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_5]) ).

thf(c_0_56,negated_conjecture,
    ( ( epred1_0 @ esk1_0 @ ( esk3_1 @ ( epred1_0 @ esk1_0 ) ) )
    | ( ( epred2_1 @ ( epred1_0 @ esk1_0 ) )
     != ( epred1_0 @ esk1_0 ) ) ),
    inference(spm,[status(thm)],[c_0_30,c_0_37]) ).

thf(c_0_57,negated_conjecture,
    ! [X2: a,X3: a,X5: a > $o] :
      ( ( epred1_0 @ X3 @ X2 )
      | ~ ( epred2_1 @ X5 @ X2 )
      | ~ ( epred2_1 @ X5 @ X3 )
      | ~ ( X5 @ ( esk3_1 @ X5 ) )
      | ~ ( epred1_0 @ ( esk2_1 @ X5 ) @ ( esk3_1 @ X5 ) )
      | ~ ( X5 @ esk1_0 ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_58,negated_conjecture,
    ! [X2: a] :
      ( ( epred1_0 @ X2 @ ( esk3_1 @ ( epred1_0 @ esk1_0 ) ) )
      | ~ ( epred1_0 @ X2 @ esk1_0 ) ),
    inference(spm,[status(thm)],[c_0_54,c_0_55]) ).

thf(c_0_59,negated_conjecture,
    epred1_0 @ esk1_0 @ ( esk3_1 @ ( epred1_0 @ esk1_0 ) ),
    inference(spm,[status(thm)],[c_0_5,c_0_55]) ).

thf(c_0_60,negated_conjecture,
    ( ( epred2_1 @ ( epred1_0 @ esk1_0 ) )
   != ( epred1_0 @ esk1_0 ) ),
    inference(csr,[status(thm)],[inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_28,c_0_48]),c_0_4])]),c_0_5]),c_0_56]) ).

thf(c_0_61,negated_conjecture,
    ! [X2: a,X3: a] :
      ( ( epred1_0 @ X2 @ X3 )
      | ~ ( epred2_1 @ ( epred1_0 @ esk1_0 ) @ X2 )
      | ~ ( epred2_1 @ ( epred1_0 @ esk1_0 ) @ X3 ) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_59]),c_0_4]),c_0_49])]) ).

thf(c_0_62,negated_conjecture,
    ( ( epred2_1 @ ( epred1_0 @ esk1_0 ) @ esk34_0 )
  <~> ( epred1_0 @ esk1_0 @ esk34_0 ) ),
    inference(neg_ext,[status(thm)],[c_0_60]) ).

thf(c_0_63,negated_conjecture,
    ! [X2: a] :
      ( ( epred1_0 @ esk1_0 @ X2 )
      | ~ ( epred2_1 @ ( epred1_0 @ esk1_0 ) @ X2 ) ),
    inference(spm,[status(thm)],[c_0_61,c_0_21]) ).

thf(c_0_64,negated_conjecture,
    ( ( epred2_1 @ ( epred1_0 @ esk1_0 ) @ esk34_0 )
    | ( epred1_0 @ esk1_0 @ esk34_0 ) ),
    inference(dynamic_cnf,[status(thm)],[c_0_62]) ).

thf(c_0_65,negated_conjecture,
    ! [X2: a,X3: a,X5: a > $o] :
      ( ( epred2_1 @ X5 @ X3 )
      | ~ ( epred1_0 @ X2 @ X3 )
      | ~ ( epred2_1 @ X5 @ X2 )
      | ~ ( X5 @ ( esk3_1 @ X5 ) )
      | ~ ( epred1_0 @ ( esk2_1 @ X5 ) @ ( esk3_1 @ X5 ) )
      | ~ ( X5 @ esk1_0 ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_66,negated_conjecture,
    ( ~ ( epred2_1 @ ( epred1_0 @ esk1_0 ) @ esk34_0 )
    | ~ ( epred1_0 @ esk1_0 @ esk34_0 ) ),
    inference(dynamic_cnf,[status(thm)],[c_0_62]) ).

thf(c_0_67,negated_conjecture,
    epred1_0 @ esk1_0 @ esk34_0,
    inference(spm,[status(thm)],[c_0_63,c_0_64]) ).

thf(c_0_68,negated_conjecture,
    ! [X3: a,X2: a] :
      ( ( epred2_1 @ ( epred1_0 @ esk1_0 ) @ X2 )
      | ~ ( epred2_1 @ ( epred1_0 @ esk1_0 ) @ X3 )
      | ~ ( epred1_0 @ X3 @ X2 ) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_58]),c_0_59]),c_0_4]),c_0_49])]) ).

thf(c_0_69,negated_conjecture,
    ~ ( epred2_1 @ ( epred1_0 @ esk1_0 ) @ esk34_0 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_66,c_0_67])]) ).

thf(c_0_70,negated_conjecture,
    ! [X2: a] :
      ( ( epred2_1 @ ( epred1_0 @ esk1_0 ) @ X2 )
      | ~ ( epred1_0 @ esk1_0 @ X2 ) ),
    inference(spm,[status(thm)],[c_0_68,c_0_21]) ).

thf(c_0_71,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_70]),c_0_67])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SEV011^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.06/0.18  % Computer : n005.cluster.edu
% 0.06/0.18  % Model    : x86_64 x86_64
% 0.06/0.18  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.06/0.18  % Memory   : 8046.5625MB
% 0.06/0.18  % OS       : Linux 6.8.0-71-generic
% 0.06/0.18  % CPULimit : 300
% 0.06/0.18  % WCLimit  : 300
% 0.06/0.18  % DateTime : Tue Sep 29 14:59:46 UTC 2026
% 0.06/0.18  % CPUTime  : 
% 0.06/0.18  Running run_E /export/starexec/sandbox2/benchmark/theBenchmark.p 300 THM
% 0.06/0.21  Running higher-order theorem proving
% 0.06/0.23  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.j1PsMvG5Px/E---3.1_1772557.p
% 196.52/28.47  % Version: 3.5.1-ho
% 196.52/28.47  % Preprocessing class: HSSSSMSSSSSNSSA.
% 196.52/28.47  % Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 196.52/28.47  % Starting post_as_ho12 with 300s (1) cores
% 196.52/28.47  % Starting new_bool_9 with 300s (1) cores
% 196.52/28.47  % Starting post_as_ho1 with 300s (1) cores
% 196.52/28.47  % Starting post_as_ho4 with 300s (1) cores
% 196.52/28.47  % Starting post_as_ho2 with 300s (1) cores
% 196.52/28.47  % Starting ehoh_best2_full_lfho with 300s (1) cores
% 196.52/28.47  % Starting full_lambda_10 with 300s (1) cores
% 196.52/28.47  % Starting new_ho_8 with 300s (1) cores
% 196.52/28.47  % post_as_ho2 with pid 1772574 completed with status 0
% 196.52/28.47  % Result found by post_as_ho2
% 196.52/28.47  % Preprocessing class: HSSSSMSSSSSNSSA.
% 196.52/28.47  % Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 196.52/28.47  % Starting post_as_ho12 with 300s (1) cores
% 196.52/28.47  % Starting new_bool_9 with 300s (1) cores
% 196.52/28.47  % Starting post_as_ho1 with 300s (1) cores
% 196.52/28.47  % Starting post_as_ho4 with 300s (1) cores
% 196.52/28.47  % Starting post_as_ho2 with 300s (1) cores
% 196.52/28.47  % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 196.52/28.47  % No SInE strategy applied
% 196.52/28.47  % Search class: HGHSF-FFSF11-SSSFFMBN
% 196.52/28.47  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 196.52/28.47  % Starting SubtermCWHack with 28s (1) cores
% 196.52/28.47  % SubtermCWHack with pid 1772583 completed with status 8
% 196.52/28.47  % Starting post_as_ho2 with 31s (1) cores
% 196.52/28.47  % post_as_ho2 with pid 1772710 completed with status 0
% 196.52/28.47  % Result found by post_as_ho2
% 196.52/28.47  % Preprocessing class: HSSSSMSSSSSNSSA.
% 196.52/28.47  % Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 196.52/28.47  % Starting post_as_ho12 with 300s (1) cores
% 196.52/28.47  % Starting new_bool_9 with 300s (1) cores
% 196.52/28.47  % Starting post_as_ho1 with 300s (1) cores
% 196.52/28.47  % Starting post_as_ho4 with 300s (1) cores
% 196.52/28.47  % Starting post_as_ho2 with 300s (1) cores
% 196.52/28.47  % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 196.52/28.47  % No SInE strategy applied
% 196.52/28.47  % Search class: HGHSF-FFSF11-SSSFFMBN
% 196.52/28.47  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 196.52/28.47  % Starting SubtermCWHack with 28s (1) cores
% 196.52/28.47  % SubtermCWHack with pid 1772583 completed with status 8
% 196.52/28.47  % Starting post_as_ho2 with 31s (1) cores
% 196.52/28.47  % Preprocessing time       : 0.002 s
% 196.52/28.47  % Presaturation interreduction done
% 196.52/28.47  
% 196.52/28.47  % Proof found!
% 196.52/28.47  % SZS status Theorem
% 196.52/28.47  % SZS output start CNFRefutation
% See solution above
% 196.52/28.47  % Parsed axioms                        : 2
% 196.52/28.47  % Removed by relevancy pruning/SinE    : 0
% 196.52/28.47  % Initial clauses                      : 16
% 196.52/28.47  % Removed in clause preprocessing      : 1
% 196.52/28.47  % Initial clauses in saturation        : 15
% 196.52/28.47  % Processed clauses                    : 373
% 196.52/28.47  % ...of these trivial                  : 16
% 196.52/28.47  % ...subsumed                          : 150
% 196.52/28.47  % ...remaining for further processing  : 207
% 196.52/28.47  % Other redundant clauses eliminated   : 0
% 196.52/28.47  % Clauses deleted for lack of memory   : 0
% 196.52/28.47  % Backward-subsumed                    : 65
% 196.52/28.47  % Backward-rewritten                   : 14
% 196.52/28.47  % Generated clauses                    : 1038
% 196.52/28.47  % ...of the previous two non-redundant : 649
% 196.52/28.47  % ...aggressively subsumed             : 0
% 196.52/28.47  % Contextual simplify-reflections      : 23
% 196.52/28.47  % Paramodulations                      : 962
% 196.52/28.47  % Factorizations                       : 0
% 196.52/28.47  % NegExts                              : 34
% 196.52/28.47  % Equation resolutions                 : 6
% 196.52/28.47  % Disequality decompositions           : 0
% 196.52/28.47  % Total rewrite steps                  : 624
% 196.52/28.47  % ...of those cached                   : 604
% 196.52/28.47  % Propositional unsat checks           : 0
% 196.52/28.47  %    Propositional check models        : 0
% 196.52/28.47  %    Propositional check unsatisfiable : 0
% 196.52/28.47  %    Propositional clauses             : 0
% 196.52/28.47  %    Propositional clauses after purity: 0
% 196.52/28.47  %    Propositional unsat core size     : 0
% 196.52/28.47  %    Propositional preprocessing time  : 0.000
% 196.52/28.47  %    Propositional encoding time       : 0.000
% 196.52/28.47  %    Propositional solver time         : 0.000
% 196.52/28.47  %    Success case prop preproc time    : 0.000
% 196.52/28.47  %    Success case prop encoding time   : 0.000
% 196.52/28.47  %    Success case prop solver time     : 0.000
% 196.52/28.47  % Current number of processed clauses  : 95
% 196.52/28.47  %    Positive orientable unit clauses  : 12
% 196.52/28.47  %    Positive unorientable unit clauses: 0
% 196.52/28.47  %    Negative unit clauses             : 2
% 196.52/28.47  %    Non-unit-clauses                  : 81
% 196.52/28.47  % Current number of unprocessed clauses: 219
% 196.52/28.47  % ...number of literals in the above   : 914
% 196.52/28.47  % Current number of archived formulas  : 0
% 196.52/28.47  % Current number of archived clauses   : 112
% 196.52/28.47  % Clause-clause subsumption calls (NU) : 2952
% 196.52/28.47  % Rec. Clause-clause subsumption calls : 2270
% 196.52/28.47  % Non-unit clause-clause subsumptions  : 206
% 196.52/28.47  % Unit Clause-clause subsumption calls : 130
% 196.52/28.47  % Rewrite failures with RHS unbound    : 0
% 196.52/28.47  % BW rewrite match attempts            : 6
% 196.52/28.47  % BW rewrite match successes           : 6
% 196.52/28.47  % Condensation attempts                : 0
% 196.52/28.47  % Condensation successes               : 0
% 196.52/28.47  % Termbank termtop insertions          : 49082
% 196.52/28.47  % Search garbage collected termcells   : 479
% 196.52/28.47  
% 196.52/28.47  % -------------------------------------------------
% 196.52/28.47  % User time                : 27.745 s
% 196.52/28.47  % System time              : 0.366 s
% 196.52/28.47  % Total time               : 28.112 s
% 196.52/28.47  % Maximum resident set size: 3584 pages
% 196.52/28.47  
% 196.52/28.47  % -------------------------------------------------
% 196.52/28.47  % User time                : 27.748 s
% 196.52/28.47  % System time              : 0.373 s
% 196.52/28.47  % Total time               : 28.121 s
% 196.52/28.47  % Maximum resident set size: 4864 pages
% 196.52/28.47  % E exiting
%------------------------------------------------------------------------------