↑ Up

E---3.5.1.THM-CRf.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : E---3.5.1
% Problem  : SEV001^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:34:31 AM UTC 2026

% Result   : Theorem 201.80s 29.73s
% Output   : CNFRefutation 201.80s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   15
%            Number of leaves      :    1
% Syntax   : Number of formulae    :   47 (  36 unt;   0 typ;   0 def)
%            Number of atoms       :   84 (  83 equ;   0 cnn)
%            Maximal formula atoms :   12 (   1 avg)
%            Number of connectives :  655 (  10   ~;  10   |;  23   &; 608   @)
%                                         (   2 <=>;   2  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   32 (   5 avg)
%            Number of types       :    1 (   1 usr)
%            Number of type conns  :    8 (   8   >;   0   *;   0   +;   0  <<)
%            Number of symbols     :   10 (   8 usr;   7 con; 0-2 aty)
%            Number of variables   :  184 (   0   ^; 184   !;   0   ?; 184   :)

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

thf(decl_23,type,
    esk1_0: a > a > a ).

thf(decl_24,type,
    esk2_0: a > a > a ).

thf(decl_25,type,
    esk3_0: a ).

thf(decl_26,type,
    esk4_0: a ).

thf(decl_27,type,
    esk5_0: a ).

thf(decl_28,type,
    esk6_0: a ).

thf(decl_29,type,
    esk7_0: a ).

thf(decl_30,type,
    esk8_0: a ).

thf(cDISTRIB_THM_pme,conjecture,
    ! [X1: a > a > a,X2: a > a > a] :
      ( ( ! [X3: a] :
            ( ( X1 @ X3 @ X3 )
            = X3 )
        & ! [X3: a] :
            ( ( X2 @ X3 @ X3 )
            = X3 )
        & ! [X3: a,X4: a,X5: a] :
            ( ( X1 @ ( X1 @ X3 @ X4 ) @ X5 )
            = ( X1 @ X3 @ ( X1 @ X4 @ X5 ) ) )
        & ! [X3: a,X4: a,X5: a] :
            ( ( X2 @ ( X2 @ X3 @ X4 ) @ X5 )
            = ( X2 @ X3 @ ( X2 @ X4 @ X5 ) ) )
        & ! [X3: a,X4: a] :
            ( ( X1 @ X3 @ X4 )
            = ( X1 @ X4 @ X3 ) )
        & ! [X3: a,X4: a] :
            ( ( X2 @ X3 @ X4 )
            = ( X2 @ X4 @ X3 ) )
        & ! [X3: a,X4: a] :
            ( ( X1 @ ( X2 @ X3 @ X4 ) @ X4 )
            = X4 )
        & ! [X3: a,X4: a] :
            ( ( X2 @ ( X1 @ X3 @ X4 ) @ X4 )
            = X4 ) )
     => ( ! [X3: a,X4: a,X5: a] :
            ( ( X1 @ X3 @ ( X2 @ X4 @ X5 ) )
            = ( X2 @ ( X1 @ X3 @ X4 ) @ ( X1 @ X3 @ X5 ) ) )
      <=> ! [X3: a,X4: a,X5: a] :
            ( ( X2 @ X3 @ ( X1 @ X4 @ X5 ) )
            = ( X1 @ ( X2 @ X3 @ X4 ) @ ( X2 @ X3 @ X5 ) ) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.s9g5c4Gy0O/E---3.1_833047.p',cDISTRIB_THM_pme) ).

thf(c_0_1,negated_conjecture,
    ~ ! [X1: a > a > a,X2: a > a > a] :
        ( ( ! [X3: a] :
              ( ( X1 @ X3 @ X3 )
              = X3 )
          & ! [X3: a] :
              ( ( X2 @ X3 @ X3 )
              = X3 )
          & ! [X3: a,X4: a,X5: a] :
              ( ( X1 @ ( X1 @ X3 @ X4 ) @ X5 )
              = ( X1 @ X3 @ ( X1 @ X4 @ X5 ) ) )
          & ! [X3: a,X4: a,X5: a] :
              ( ( X2 @ ( X2 @ X3 @ X4 ) @ X5 )
              = ( X2 @ X3 @ ( X2 @ X4 @ X5 ) ) )
          & ! [X3: a,X4: a] :
              ( ( X1 @ X3 @ X4 )
              = ( X1 @ X4 @ X3 ) )
          & ! [X3: a,X4: a] :
              ( ( X2 @ X3 @ X4 )
              = ( X2 @ X4 @ X3 ) )
          & ! [X3: a,X4: a] :
              ( ( X1 @ ( X2 @ X3 @ X4 ) @ X4 )
              = X4 )
          & ! [X3: a,X4: a] :
              ( ( X2 @ ( X1 @ X3 @ X4 ) @ X4 )
              = X4 ) )
       => ( ! [X3: a,X4: a,X5: a] :
              ( ( X1 @ X3 @ ( X2 @ X4 @ X5 ) )
              = ( X2 @ ( X1 @ X3 @ X4 ) @ ( X1 @ X3 @ X5 ) ) )
        <=> ! [X3: a,X4: a,X5: a] :
              ( ( X2 @ X3 @ ( X1 @ X4 @ X5 ) )
              = ( X1 @ ( X2 @ X3 @ X4 ) @ ( X2 @ X3 @ X5 ) ) ) ) ),
    inference(assume_negation,[status(cth)],[cDISTRIB_THM_pme]) ).

thf(c_0_2,negated_conjecture,
    ! [X32: a,X33: a,X34: a,X35: a,X36: a,X37: a,X38: a,X39: a,X40: a,X41: a,X42: a,X43: a,X44: a,X45: a,X46: a,X47: a,X54: a,X55: a,X56: a,X57: a,X58: a,X59: a] :
      ( ( ( esk1_0 @ X32 @ X32 )
        = X32 )
      & ( ( esk2_0 @ X33 @ X33 )
        = X33 )
      & ( ( esk1_0 @ ( esk1_0 @ X34 @ X35 ) @ X36 )
        = ( esk1_0 @ X34 @ ( esk1_0 @ X35 @ X36 ) ) )
      & ( ( esk2_0 @ ( esk2_0 @ X37 @ X38 ) @ X39 )
        = ( esk2_0 @ X37 @ ( esk2_0 @ X38 @ X39 ) ) )
      & ( ( esk1_0 @ X40 @ X41 )
        = ( esk1_0 @ X41 @ X40 ) )
      & ( ( esk2_0 @ X42 @ X43 )
        = ( esk2_0 @ X43 @ X42 ) )
      & ( ( esk1_0 @ ( esk2_0 @ X44 @ X45 ) @ X45 )
        = X45 )
      & ( ( esk2_0 @ ( esk1_0 @ X46 @ X47 ) @ X47 )
        = X47 )
      & ( ( ( esk1_0 @ esk3_0 @ ( esk2_0 @ esk4_0 @ esk5_0 ) )
         != ( esk2_0 @ ( esk1_0 @ esk3_0 @ esk4_0 ) @ ( esk1_0 @ esk3_0 @ esk5_0 ) ) )
        | ( ( esk2_0 @ esk6_0 @ ( esk1_0 @ esk7_0 @ esk8_0 ) )
         != ( esk1_0 @ ( esk2_0 @ esk6_0 @ esk7_0 ) @ ( esk2_0 @ esk6_0 @ esk8_0 ) ) ) )
      & ( ( ( esk1_0 @ X54 @ ( esk2_0 @ X55 @ X56 ) )
          = ( esk2_0 @ ( esk1_0 @ X54 @ X55 ) @ ( esk1_0 @ X54 @ X56 ) ) )
        | ( ( esk2_0 @ X57 @ ( esk1_0 @ X58 @ X59 ) )
          = ( esk1_0 @ ( esk2_0 @ X57 @ X58 ) @ ( esk2_0 @ X57 @ X59 ) ) ) ) ),
    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,
    ! [X3: a,X4: a,X5: a] :
      ( ( esk1_0 @ ( esk1_0 @ X3 @ X4 ) @ X5 )
      = ( esk1_0 @ X3 @ ( esk1_0 @ X4 @ X5 ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_4,negated_conjecture,
    ! [X3: a] :
      ( ( esk1_0 @ X3 @ X3 )
      = X3 ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_5,negated_conjecture,
    ! [X3: a,X4: a] :
      ( ( esk1_0 @ ( esk2_0 @ X3 @ X4 ) @ X4 )
      = X4 ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_6,negated_conjecture,
    ! [X4: a,X3: a] :
      ( ( esk1_0 @ X3 @ X4 )
      = ( esk1_0 @ X4 @ X3 ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_7,negated_conjecture,
    ! [X3: a,X4: a,X5: a,X8: a,X9: a,X10: a] :
      ( ( ( esk1_0 @ X3 @ ( esk2_0 @ X4 @ X5 ) )
        = ( esk2_0 @ ( esk1_0 @ X3 @ X4 ) @ ( esk1_0 @ X3 @ X5 ) ) )
      | ( ( esk2_0 @ X8 @ ( esk1_0 @ X9 @ X10 ) )
        = ( esk1_0 @ ( esk2_0 @ X8 @ X9 ) @ ( esk2_0 @ X8 @ X10 ) ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_8,negated_conjecture,
    ! [X3: a,X4: a] :
      ( ( esk1_0 @ X3 @ ( esk1_0 @ X3 @ X4 ) )
      = ( esk1_0 @ X3 @ X4 ) ),
    inference(spm,[status(thm)],[c_0_3,c_0_4]) ).

thf(c_0_9,negated_conjecture,
    ! [X4: a,X3: a] :
      ( ( esk1_0 @ X3 @ ( esk2_0 @ X4 @ X3 ) )
      = X3 ),
    inference(rw,[status(thm)],[c_0_5,c_0_6]) ).

thf(c_0_10,negated_conjecture,
    ! [X3: a,X4: a] :
      ( ( esk2_0 @ ( esk1_0 @ X3 @ X4 ) @ X4 )
      = X4 ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_11,negated_conjecture,
    ! [X4: a,X3: a] :
      ( ( esk2_0 @ X3 @ X4 )
      = ( esk2_0 @ X4 @ X3 ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_12,negated_conjecture,
    ( ( ( esk1_0 @ esk3_0 @ ( esk2_0 @ esk4_0 @ esk5_0 ) )
     != ( esk2_0 @ ( esk1_0 @ esk3_0 @ esk4_0 ) @ ( esk1_0 @ esk3_0 @ esk5_0 ) ) )
    | ( ( esk2_0 @ esk6_0 @ ( esk1_0 @ esk7_0 @ esk8_0 ) )
     != ( esk1_0 @ ( esk2_0 @ esk6_0 @ esk7_0 ) @ ( esk2_0 @ esk6_0 @ esk8_0 ) ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_13,negated_conjecture,
    ! [X3: a,X4: a,X5: a,X8: a,X9: a,X10: a] :
      ( ( ( esk1_0 @ X3 @ ( esk2_0 @ ( esk1_0 @ X3 @ X4 ) @ X5 ) )
        = ( esk2_0 @ ( esk1_0 @ X3 @ X4 ) @ ( esk1_0 @ X3 @ X5 ) ) )
      | ( ( esk1_0 @ ( esk2_0 @ X8 @ X9 ) @ ( esk2_0 @ X8 @ X10 ) )
        = ( esk2_0 @ X8 @ ( esk1_0 @ X9 @ X10 ) ) ) ),
    inference(spm,[status(thm)],[c_0_7,c_0_8]) ).

thf(c_0_14,negated_conjecture,
    ! [X3: a,X5: a,X4: a] :
      ( ( esk1_0 @ X3 @ ( esk1_0 @ X4 @ ( esk2_0 @ X5 @ ( esk1_0 @ X3 @ X4 ) ) ) )
      = ( esk1_0 @ X3 @ X4 ) ),
    inference(spm,[status(thm)],[c_0_9,c_0_3]) ).

thf(c_0_15,negated_conjecture,
    ! [X3: a,X4: a,X5: a] :
      ( ( esk2_0 @ ( esk2_0 @ X3 @ X4 ) @ X5 )
      = ( esk2_0 @ X3 @ ( esk2_0 @ X4 @ X5 ) ) ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_16,negated_conjecture,
    ! [X3: a] :
      ( ( esk2_0 @ X3 @ X3 )
      = X3 ),
    inference(split_conjunct,[status(thm)],[c_0_2]) ).

thf(c_0_17,negated_conjecture,
    ! [X4: a,X3: a] :
      ( ( esk2_0 @ X3 @ ( esk1_0 @ X4 @ X3 ) )
      = X3 ),
    inference(rw,[status(thm)],[c_0_10,c_0_11]) ).

thf(c_0_18,negated_conjecture,
    ! [X3: a,X4: a,X5: a] :
      ( ( ( esk1_0 @ X3 @ ( esk2_0 @ ( esk1_0 @ X3 @ X4 ) @ X5 ) )
        = ( esk2_0 @ ( esk1_0 @ X3 @ X4 ) @ ( esk1_0 @ X3 @ X5 ) ) )
      | ( ( esk2_0 @ ( esk1_0 @ esk3_0 @ esk4_0 ) @ ( esk1_0 @ esk3_0 @ esk5_0 ) )
       != ( esk1_0 @ esk3_0 @ ( esk2_0 @ esk4_0 @ esk5_0 ) ) ) ),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

thf(c_0_19,negated_conjecture,
    ! [X5: a,X4: a,X3: a] :
      ( ( esk1_0 @ X3 @ ( esk1_0 @ X4 @ ( esk2_0 @ X5 @ ( esk1_0 @ X4 @ X3 ) ) ) )
      = ( esk1_0 @ X4 @ X3 ) ),
    inference(spm,[status(thm)],[c_0_14,c_0_6]) ).

thf(c_0_20,negated_conjecture,
    ! [X3: a,X4: a] :
      ( ( esk2_0 @ X3 @ ( esk2_0 @ X3 @ X4 ) )
      = ( esk2_0 @ X3 @ X4 ) ),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

thf(c_0_21,negated_conjecture,
    ! [X4: a,X3: a] :
      ( ( esk2_0 @ X3 @ ( esk1_0 @ X3 @ X4 ) )
      = X3 ),
    inference(spm,[status(thm)],[c_0_17,c_0_6]) ).

thf(c_0_22,negated_conjecture,
    ! [X3: a,X4: a,X5: a] :
      ( ( ( esk1_0 @ X3 @ ( esk2_0 @ ( esk1_0 @ X4 @ X3 ) @ X5 ) )
        = ( esk2_0 @ ( esk1_0 @ X4 @ X3 ) @ ( esk1_0 @ X3 @ X5 ) ) )
      | ( ( esk2_0 @ ( esk1_0 @ esk3_0 @ esk4_0 ) @ ( esk1_0 @ esk3_0 @ esk5_0 ) )
       != ( esk1_0 @ esk3_0 @ ( esk2_0 @ esk4_0 @ esk5_0 ) ) ) ),
    inference(spm,[status(thm)],[c_0_18,c_0_19]) ).

thf(c_0_23,negated_conjecture,
    ! [X4: a,X3: a] :
      ( ( esk1_0 @ X3 @ ( esk2_0 @ X3 @ X4 ) )
      = X3 ),
    inference(spm,[status(thm)],[c_0_9,c_0_11]) ).

thf(c_0_24,negated_conjecture,
    ! [X3: a,X4: a,X5: a,X8: a,X9: a,X10: a] :
      ( ( ( esk1_0 @ ( esk2_0 @ X3 @ X4 ) @ ( esk2_0 @ X3 @ X5 ) )
        = ( esk2_0 @ X3 @ ( esk1_0 @ ( esk2_0 @ X3 @ X4 ) @ X5 ) ) )
      | ( ( esk2_0 @ ( esk1_0 @ X8 @ X9 ) @ ( esk1_0 @ X8 @ X10 ) )
        = ( esk1_0 @ X8 @ ( esk2_0 @ X9 @ X10 ) ) ) ),
    inference(spm,[status(thm)],[c_0_7,c_0_20]) ).

thf(c_0_25,negated_conjecture,
    ! [X3: a,X4: a,X5: a] :
      ( ( esk2_0 @ X3 @ ( esk2_0 @ X4 @ X5 ) )
      = ( esk2_0 @ X4 @ ( esk2_0 @ X3 @ X5 ) ) ),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_11]),c_0_15]) ).

thf(c_0_26,negated_conjecture,
    ! [X3: a,X5: a,X4: a] :
      ( ( esk2_0 @ X3 @ ( esk2_0 @ X4 @ ( esk1_0 @ ( esk2_0 @ X3 @ X4 ) @ X5 ) ) )
      = ( esk2_0 @ X3 @ X4 ) ),
    inference(spm,[status(thm)],[c_0_15,c_0_21]) ).

thf(c_0_27,negated_conjecture,
    ! [X3: a,X4: a,X5: a] :
      ( ( esk1_0 @ ( esk2_0 @ X3 @ X4 ) @ ( esk2_0 @ X3 @ X5 ) )
      = ( esk2_0 @ X3 @ ( esk1_0 @ ( esk2_0 @ X3 @ X4 ) @ X5 ) ) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]) ).

thf(c_0_28,negated_conjecture,
    ! [X5: a,X4: a,X3: a] :
      ( ( esk2_0 @ X3 @ ( esk2_0 @ X4 @ ( esk1_0 @ ( esk2_0 @ X4 @ X3 ) @ X5 ) ) )
      = ( esk2_0 @ X4 @ X3 ) ),
    inference(spm,[status(thm)],[c_0_25,c_0_26]) ).

thf(c_0_29,negated_conjecture,
    ! [X3: a,X4: a,X5: a] :
      ( ( esk1_0 @ ( esk2_0 @ X3 @ X4 ) @ ( esk2_0 @ X4 @ X5 ) )
      = ( esk2_0 @ X4 @ ( esk1_0 @ ( esk2_0 @ X3 @ X4 ) @ X5 ) ) ),
    inference(spm,[status(thm)],[c_0_27,c_0_28]) ).

thf(c_0_30,negated_conjecture,
    ! [X3: a,X4: a,X5: a] :
      ( ( esk1_0 @ X3 @ ( esk2_0 @ ( esk1_0 @ X3 @ X4 ) @ X5 ) )
      = ( esk2_0 @ ( esk1_0 @ X3 @ X4 ) @ ( esk1_0 @ X3 @ X5 ) ) ),
    inference(spm,[status(thm)],[c_0_29,c_0_21]) ).

thf(c_0_31,negated_conjecture,
    ! [X3: a,X4: a,X5: a] :
      ( ( esk1_0 @ X3 @ ( esk1_0 @ ( esk2_0 @ X4 @ X3 ) @ X5 ) )
      = ( esk1_0 @ X3 @ X5 ) ),
    inference(spm,[status(thm)],[c_0_3,c_0_9]) ).

thf(c_0_32,negated_conjecture,
    ! [X3: a,X5: a,X4: a] :
      ( ( esk1_0 @ X3 @ ( esk2_0 @ X4 @ ( esk1_0 @ X3 @ X5 ) ) )
      = ( esk2_0 @ ( esk1_0 @ X3 @ X5 ) @ ( esk1_0 @ X3 @ X4 ) ) ),
    inference(spm,[status(thm)],[c_0_30,c_0_11]) ).

thf(c_0_33,negated_conjecture,
    ! [X3: a,X4: a] :
      ( ( esk2_0 @ X3 @ ( esk2_0 @ X4 @ X3 ) )
      = ( esk2_0 @ X3 @ X4 ) ),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_17,c_0_23]),c_0_15]) ).

thf(c_0_34,negated_conjecture,
    ! [X3: a,X4: a,X5: a,X8: a,X10: a,X9: a] :
      ( ( ( esk2_0 @ ( esk1_0 @ X3 @ X4 ) @ ( esk1_0 @ X3 @ X5 ) )
        = ( esk1_0 @ X3 @ ( esk2_0 @ X4 @ X5 ) ) )
      | ( ( esk2_0 @ ( esk1_0 @ X8 @ X9 ) @ ( esk1_0 @ X8 @ X10 ) )
        = ( esk1_0 @ X8 @ ( esk2_0 @ X10 @ X9 ) ) ) ),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_7]),c_0_32]) ).

thf(c_0_35,negated_conjecture,
    ! [X4: a,X3: a] :
      ( ( esk1_0 @ X3 @ X4 )
      = ( esk1_0 @ X4 @ X3 ) ),
    c_0_6 ).

thf(c_0_36,negated_conjecture,
    ! [X4: a,X3: a] :
      ( ( esk2_0 @ X3 @ X4 )
      = ( esk2_0 @ X4 @ X3 ) ),
    c_0_11 ).

thf(c_0_37,negated_conjecture,
    ! [X3: a,X4: a,X5: a] :
      ( ( esk1_0 @ ( esk1_0 @ X3 @ X4 ) @ X5 )
      = ( esk1_0 @ X3 @ ( esk1_0 @ X4 @ X5 ) ) ),
    c_0_3 ).

thf(c_0_38,negated_conjecture,
    ! [X3: a,X4: a,X5: a] :
      ( ( esk2_0 @ ( esk2_0 @ X3 @ X4 ) @ X5 )
      = ( esk2_0 @ X3 @ ( esk2_0 @ X4 @ X5 ) ) ),
    c_0_15 ).

thf(c_0_39,negated_conjecture,
    ! [X5: a,X4: a,X3: a] :
      ( ( esk2_0 @ X3 @ ( esk1_0 @ X4 @ ( esk1_0 @ X5 @ X3 ) ) )
      = X3 ),
    inference(spm,[status(thm)],[c_0_17,c_0_3]) ).

thf(c_0_40,negated_conjecture,
    ! [X3: a,X4: a] :
      ( ( esk1_0 @ ( esk2_0 @ X3 @ X4 ) @ ( esk2_0 @ X4 @ X3 ) )
      = ( esk2_0 @ X3 @ X4 ) ),
    inference(spm,[status(thm)],[c_0_9,c_0_33]) ).

thf(c_0_41,negated_conjecture,
    ( ( ( esk2_0 @ ( esk1_0 @ esk3_0 @ esk4_0 ) @ ( esk1_0 @ esk3_0 @ esk5_0 ) )
     != ( esk1_0 @ esk3_0 @ ( esk2_0 @ esk4_0 @ esk5_0 ) ) )
    | ( ( esk2_0 @ esk6_0 @ ( esk1_0 @ esk8_0 @ ( esk2_0 @ esk6_0 @ esk7_0 ) ) )
     != ( esk2_0 @ esk6_0 @ ( esk1_0 @ esk7_0 @ esk8_0 ) ) ) ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_12,c_0_27]),c_0_6]) ).

thf(c_0_42,negated_conjecture,
    ! [X3: a,X5: a,X4: a] :
      ( ( esk2_0 @ ( esk1_0 @ X3 @ X4 ) @ ( esk1_0 @ X3 @ X5 ) )
      = ( esk1_0 @ X3 @ ( esk2_0 @ X5 @ X4 ) ) ),
    inference(ar,[status(thm)],[inference(ef,[status(thm)],[c_0_34]),c_0_35,c_0_36,c_0_37,c_0_38]) ).

thf(c_0_43,negated_conjecture,
    ! [X3: a,X5: a,X4: a] :
      ( ( esk2_0 @ X3 @ ( esk2_0 @ X4 @ ( esk1_0 @ X5 @ ( esk2_0 @ X4 @ X3 ) ) ) )
      = ( esk2_0 @ X3 @ X4 ) ),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_15]) ).

thf(c_0_44,negated_conjecture,
    ( ( esk2_0 @ esk6_0 @ ( esk1_0 @ esk8_0 @ ( esk2_0 @ esk6_0 @ esk7_0 ) ) )
   != ( esk2_0 @ esk6_0 @ ( esk1_0 @ esk7_0 @ esk8_0 ) ) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_41,c_0_42]),c_0_11])]) ).

thf(c_0_45,negated_conjecture,
    ! [X3: a,X4: a,X5: a] :
      ( ( esk2_0 @ X3 @ ( esk1_0 @ X4 @ ( esk2_0 @ X3 @ X5 ) ) )
      = ( esk2_0 @ X3 @ ( esk1_0 @ X4 @ X5 ) ) ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_42]),c_0_15]),c_0_30]),c_0_42]),c_0_15]),c_0_16]) ).

thf(c_0_46,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_44,c_0_45]),c_0_6])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.03  % Problem  : SEV001^5 : TPTP v9.3.1. Released v4.0.0.
% 0.00/0.05  % Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.18  % Computer : n006.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 14:57:24 UTC 2026
% 0.08/0.18  % CPUTime  : 
% 0.08/0.18  Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 300 THM
% 0.08/0.22  Running higher-order theorem proving
% 0.08/0.23  Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.s9g5c4Gy0O/E---3.1_833047.p
% 201.80/29.73  % Version: 3.5.1-ho
% 201.80/29.73  % Preprocessing class: HSSSSMSSSSSNSSA.
% 201.80/29.73  % Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 201.80/29.73  % Starting post_as_ho12 with 300s (1) cores
% 201.80/29.73  % Starting new_bool_9 with 300s (1) cores
% 201.80/29.73  % Starting post_as_ho1 with 300s (1) cores
% 201.80/29.73  % Starting post_as_ho4 with 300s (1) cores
% 201.80/29.73  % Starting post_as_ho2 with 300s (1) cores
% 201.80/29.73  % Starting ehoh_best2_full_lfho with 300s (1) cores
% 201.80/29.73  % Starting full_lambda_10 with 300s (1) cores
% 201.80/29.73  % Starting new_ho_8 with 300s (1) cores
% 201.80/29.73  % post_as_ho12 with pid 833060 completed with status 0
% 201.80/29.73  % Result found by post_as_ho12
% 201.80/29.73  % Preprocessing class: HSSSSMSSSSSNSSA.
% 201.80/29.73  % Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 201.80/29.73  % Starting post_as_ho12 with 300s (1) cores
% 201.80/29.73  % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 201.80/29.73  % No SInE strategy applied
% 201.80/29.73  % Search class: HGHPM-FFSF00-SSSFFFNN
% 201.80/29.73  % partial match(2): HGHNF-FFSF00-SSSFFFNN
% 201.80/29.73  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 201.80/29.73  % Starting SubtermCWHack with 28s (1) cores
% 201.80/29.73  % SubtermCWHack with pid 833070 completed with status 8
% 201.80/29.73  % Starting post_as_ho12 with 31s (1) cores
% 201.80/29.73  % post_as_ho12 with pid 833076 completed with status 0
% 201.80/29.73  % Result found by post_as_ho12
% 201.80/29.73  % Preprocessing class: HSSSSMSSSSSNSSA.
% 201.80/29.73  % Scheduled 8 strats onto 8 cores with 300 seconds (2400 total)
% 201.80/29.73  % Starting post_as_ho12 with 300s (1) cores
% 201.80/29.73  % (lift_lambdas = 0, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
% 201.80/29.73  % No SInE strategy applied
% 201.80/29.73  % Search class: HGHPM-FFSF00-SSSFFFNN
% 201.80/29.73  % partial match(2): HGHNF-FFSF00-SSSFFFNN
% 201.80/29.73  % Scheduled 7 strats onto 1 cores with 300 seconds (300 total)
% 201.80/29.73  % Starting SubtermCWHack with 28s (1) cores
% 201.80/29.73  % SubtermCWHack with pid 833070 completed with status 8
% 201.80/29.73  % Starting post_as_ho12 with 31s (1) cores
% 201.80/29.73  % Preprocessing time       : 0.001 s
% 201.80/29.73  % Presaturation interreduction done
% 201.80/29.73  
% 201.80/29.73  % Proof found!
% 201.80/29.73  % SZS status Theorem
% 201.80/29.73  % SZS output start CNFRefutation
% See solution above
% 201.80/29.73  % Parsed axioms                        : 2
% 201.80/29.73  % Removed by relevancy pruning/SinE    : 0
% 201.80/29.73  % Initial clauses                      : 11
% 201.80/29.73  % Removed in clause preprocessing      : 1
% 201.80/29.73  % Initial clauses in saturation        : 10
% 201.80/29.73  % Processed clauses                    : 1405
% 201.80/29.73  % ...of these trivial                  : 493
% 201.80/29.73  % ...subsumed                          : 723
% 201.80/29.73  % ...remaining for further processing  : 189
% 201.80/29.73  % Other redundant clauses eliminated   : 0
% 201.80/29.73  % Clauses deleted for lack of memory   : 0
% 201.80/29.73  % Backward-subsumed                    : 17
% 201.80/29.73  % Backward-rewritten                   : 75
% 201.80/29.73  % Generated clauses                    : 43559
% 201.80/29.73  % ...of the previous two non-redundant : 33691
% 201.80/29.73  % ...aggressively subsumed             : 0
% 201.80/29.73  % Contextual simplify-reflections      : 1
% 201.80/29.73  % Paramodulations                      : 43551
% 201.80/29.73  % Factorizations                       : 8
% 201.80/29.73  % NegExts                              : 0
% 201.80/29.73  % Equation resolutions                 : 0
% 201.80/29.73  % Disequality decompositions           : 0
% 201.80/29.73  % Total rewrite steps                  : 61819
% 201.80/29.73  % ...of those cached                   : 52796
% 201.80/29.73  % Propositional unsat checks           : 0
% 201.80/29.73  %    Propositional check models        : 0
% 201.80/29.73  %    Propositional check unsatisfiable : 0
% 201.80/29.73  %    Propositional clauses             : 0
% 201.80/29.73  %    Propositional clauses after purity: 0
% 201.80/29.73  %    Propositional unsat core size     : 0
% 201.80/29.73  %    Propositional preprocessing time  : 0.000
% 201.80/29.73  %    Propositional encoding time       : 0.000
% 201.80/29.73  %    Propositional solver time         : 0.000
% 201.80/29.73  %    Success case prop preproc time    : 0.000
% 201.80/29.73  %    Success case prop encoding time   : 0.000
% 201.80/29.73  %    Success case prop solver time     : 0.000
% 201.80/29.73  % Current number of processed clauses  : 87
% 201.80/29.73  %    Positive orientable unit clauses  : 62
% 201.80/29.73  %    Positive unorientable unit clauses: 9
% 201.80/29.73  %    Negative unit clauses             : 0
% 201.80/29.73  %    Non-unit-clauses                  : 16
% 201.80/29.73  % Current number of unprocessed clauses: 32238
% 201.80/29.73  % ...number of literals in the above   : 66150
% 201.80/29.73  % Current number of archived formulas  : 0
% 201.80/29.73  % Current number of archived clauses   : 102
% 201.80/29.73  % Clause-clause subsumption calls (NU) : 1107
% 201.80/29.73  % Rec. Clause-clause subsumption calls : 1103
% 201.80/29.73  % Non-unit clause-clause subsumptions  : 80
% 201.80/29.73  % Unit Clause-clause subsumption calls : 1526
% 201.80/29.73  % Rewrite failures with RHS unbound    : 0
% 201.80/29.73  % BW rewrite match attempts            : 805
% 201.80/29.73  % BW rewrite match successes           : 357
% 201.80/29.73  % Condensation attempts                : 0
% 201.80/29.73  % Condensation successes               : 0
% 201.80/29.73  % Termbank termtop insertions          : 3130643
% 201.80/29.73  % Search garbage collected termcells   : 466
% 201.80/29.73  
% 201.80/29.73  % -------------------------------------------------
% 201.80/29.73  % User time                : 28.726 s
% 201.80/29.73  % System time              : 0.733 s
% 201.80/29.73  % Total time               : 29.459 s
% 201.80/29.73  % Maximum resident set size: 3584 pages
% 201.80/29.73  
% 201.80/29.73  % -------------------------------------------------
% 201.80/29.73  % User time                : 28.731 s
% 201.80/29.73  % System time              : 0.737 s
% 201.80/29.73  % Total time               : 29.468 s
% 201.80/29.73  % Maximum resident set size: 4864 pages
% 201.80/29.73  % E exiting
%------------------------------------------------------------------------------