TSTP Solution File: SET795+4 by E-SAT---3.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : E-SAT---3.1
% Problem  : SET795+4 : TPTP v8.1.2. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_E %s %d THM

% Computer : n023.cluster.edu
% Model    : x86_64 x86_64
% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory   : 8042.1875MB
% OS       : Linux 3.10.0-693.el7.x86_64
% CPULimit : 2400s
% WCLimit  : 300s
% DateTime : Tue Oct 10 19:23:58 EDT 2023

% Result   : Theorem 0.17s 0.46s
% Output   : CNFRefutation 0.17s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :    6
% Syntax   : Number of formulae    :   38 (   9 unt;   0 def)
%            Number of atoms       :  404 (  27 equ)
%            Maximal formula atoms :  256 (  10 avg)
%            Number of connectives :  478 ( 112   ~; 247   |;  99   &)
%                                         (   6 <=>;  14  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   77 (   7 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    8 (   6 usr;   1 prp; 0-4 aty)
%            Number of functors    :   13 (  13 usr;   4 con; 0-4 aty)
%            Number of variables   :  122 (   3 sgn;  69   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(upper_bound,axiom,
    ! [X6,X4,X8] :
      ( upper_bound(X8,X6,X4)
    <=> ! [X3] :
          ( member(X3,X4)
         => apply(X6,X3,X8) ) ),
    file('/export/starexec/sandbox/tmp/tmp.p2P3IAdKVB/E---3.1_8338.p',upper_bound) ).

fof(least_upper_bound,axiom,
    ! [X1,X3,X6,X4] :
      ( least_upper_bound(X1,X3,X6,X4)
    <=> ( member(X1,X3)
        & upper_bound(X1,X6,X3)
        & ! [X8] :
            ( ( member(X8,X4)
              & upper_bound(X8,X6,X3) )
           => apply(X6,X1,X8) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.p2P3IAdKVB/E---3.1_8338.p',least_upper_bound) ).

fof(unordered_pair,axiom,
    ! [X3,X1,X2] :
      ( member(X3,unordered_pair(X1,X2))
    <=> ( X3 = X1
        | X3 = X2 ) ),
    file('/export/starexec/sandbox/tmp/tmp.p2P3IAdKVB/E---3.1_8338.p',unordered_pair) ).

fof(thIV7,conjecture,
    ! [X6,X4,X1,X2] :
      ( ( order(X6,X4)
        & member(X1,X4)
        & member(X2,X4)
        & apply(X6,X1,X2) )
     => least_upper_bound(X2,unordered_pair(X1,X2),X6,X4) ),
    file('/export/starexec/sandbox/tmp/tmp.p2P3IAdKVB/E---3.1_8338.p',thIV7) ).

fof(order,axiom,
    ! [X6,X4] :
      ( order(X6,X4)
    <=> ( ! [X3] :
            ( member(X3,X4)
           => apply(X6,X3,X3) )
        & ! [X3,X5] :
            ( ( member(X3,X4)
              & member(X5,X4) )
           => ( ( apply(X6,X3,X5)
                & apply(X6,X5,X3) )
             => X3 = X5 ) )
        & ! [X3,X5,X7] :
            ( ( member(X3,X4)
              & member(X5,X4)
              & member(X7,X4) )
           => ( ( apply(X6,X3,X5)
                & apply(X6,X5,X7) )
             => apply(X6,X3,X7) ) ) ) ),
    file('/export/starexec/sandbox/tmp/tmp.p2P3IAdKVB/E---3.1_8338.p',order) ).

fof(c_0_5,plain,
    ! [X28,X29,X30,X31,X32,X33,X34] :
      ( ( ~ upper_bound(X30,X28,X29)
        | ~ member(X31,X29)
        | apply(X28,X31,X30) )
      & ( member(esk6_3(X32,X33,X34),X33)
        | upper_bound(X34,X32,X33) )
      & ( ~ apply(X32,esk6_3(X32,X33,X34),X34)
        | upper_bound(X34,X32,X33) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[upper_bound])])])])])]) ).

fof(c_0_6,plain,
    ! [X13,X14,X15,X16,X17,X18,X19,X20,X21] :
      ( ( member(X13,X14)
        | ~ least_upper_bound(X13,X14,X15,X16) )
      & ( upper_bound(X13,X15,X14)
        | ~ least_upper_bound(X13,X14,X15,X16) )
      & ( ~ member(X17,X16)
        | ~ upper_bound(X17,X15,X14)
        | apply(X15,X13,X17)
        | ~ least_upper_bound(X13,X14,X15,X16) )
      & ( member(esk5_4(X18,X19,X20,X21),X21)
        | ~ member(X18,X19)
        | ~ upper_bound(X18,X20,X19)
        | least_upper_bound(X18,X19,X20,X21) )
      & ( upper_bound(esk5_4(X18,X19,X20,X21),X20,X19)
        | ~ member(X18,X19)
        | ~ upper_bound(X18,X20,X19)
        | least_upper_bound(X18,X19,X20,X21) )
      & ( ~ apply(X20,X18,esk5_4(X18,X19,X20,X21))
        | ~ member(X18,X19)
        | ~ upper_bound(X18,X20,X19)
        | least_upper_bound(X18,X19,X20,X21) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[least_upper_bound])])])])])]) ).

fof(c_0_7,plain,
    ! [X23,X24,X25] :
      ( ( ~ member(X23,unordered_pair(X24,X25))
        | X23 = X24
        | X23 = X25 )
      & ( X23 != X24
        | member(X23,unordered_pair(X24,X25)) )
      & ( X23 != X25
        | member(X23,unordered_pair(X24,X25)) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[unordered_pair])])]) ).

fof(c_0_8,plain,
    ! [X4,X6] :
      ( epred1_2(X6,X4)
    <=> ( ! [X3] :
            ( member(X3,X4)
           => apply(X6,X3,X3) )
        & ! [X3,X5] :
            ( ( member(X3,X4)
              & member(X5,X4) )
           => ( ( apply(X6,X3,X5)
                & apply(X6,X5,X3) )
             => X3 = X5 ) )
        & ! [X3,X5,X7] :
            ( ( member(X3,X4)
              & member(X5,X4)
              & member(X7,X4) )
           => ( ( apply(X6,X3,X5)
                & apply(X6,X5,X7) )
             => apply(X6,X3,X7) ) ) ) ),
    introduced(definition) ).

fof(c_0_9,negated_conjecture,
    ~ ! [X6,X4,X1,X2] :
        ( ( order(X6,X4)
          & member(X1,X4)
          & member(X2,X4)
          & apply(X6,X1,X2) )
       => least_upper_bound(X2,unordered_pair(X1,X2),X6,X4) ),
    inference(assume_negation,[status(cth)],[thIV7]) ).

cnf(c_0_10,plain,
    ( apply(X2,X4,X1)
    | ~ upper_bound(X1,X2,X3)
    | ~ member(X4,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_11,plain,
    ( upper_bound(esk5_4(X1,X2,X3,X4),X3,X2)
    | least_upper_bound(X1,X2,X3,X4)
    | ~ member(X1,X2)
    | ~ upper_bound(X1,X3,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_12,plain,
    ( X1 = X2
    | X1 = X3
    | ~ member(X1,unordered_pair(X2,X3)) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_13,plain,
    ( member(esk6_3(X1,X2,X3),X2)
    | upper_bound(X3,X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

fof(c_0_14,axiom,
    ! [X6,X4] :
      ( order(X6,X4)
    <=> epred1_2(X6,X4) ),
    inference(apply_def,[status(thm)],[order,c_0_8]) ).

fof(c_0_15,negated_conjecture,
    ( order(esk1_0,esk2_0)
    & member(esk3_0,esk2_0)
    & member(esk4_0,esk2_0)
    & apply(esk1_0,esk3_0,esk4_0)
    & ~ least_upper_bound(esk4_0,unordered_pair(esk3_0,esk4_0),esk1_0,esk2_0) ),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_9])])]) ).

cnf(c_0_16,plain,
    ( least_upper_bound(X2,X3,X1,X4)
    | ~ apply(X1,X2,esk5_4(X2,X3,X1,X4))
    | ~ member(X2,X3)
    | ~ upper_bound(X2,X1,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_17,plain,
    ( least_upper_bound(X1,X2,X3,X4)
    | apply(X3,X5,esk5_4(X1,X2,X3,X4))
    | ~ upper_bound(X1,X3,X2)
    | ~ member(X5,X2)
    | ~ member(X1,X2) ),
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_18,plain,
    ( member(X1,unordered_pair(X3,X2))
    | X1 != X2 ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_19,plain,
    ( upper_bound(X3,X1,X2)
    | ~ apply(X1,esk6_3(X1,X2,X3),X3) ),
    inference(split_conjunct,[status(thm)],[c_0_5]) ).

cnf(c_0_20,plain,
    ( esk6_3(X1,unordered_pair(X2,X3),X4) = X2
    | esk6_3(X1,unordered_pair(X2,X3),X4) = X3
    | upper_bound(X4,X1,unordered_pair(X2,X3)) ),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

fof(c_0_21,plain,
    ! [X26,X27] :
      ( ( ~ order(X26,X27)
        | epred1_2(X26,X27) )
      & ( ~ epred1_2(X26,X27)
        | order(X26,X27) ) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])]) ).

cnf(c_0_22,negated_conjecture,
    ~ least_upper_bound(esk4_0,unordered_pair(esk3_0,esk4_0),esk1_0,esk2_0),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_23,plain,
    ( least_upper_bound(X1,X2,X3,X4)
    | ~ upper_bound(X1,X3,X2)
    | ~ member(X1,X2) ),
    inference(spm,[status(thm)],[c_0_16,c_0_17]) ).

cnf(c_0_24,plain,
    member(X1,unordered_pair(X2,X1)),
    inference(er,[status(thm)],[c_0_18]) ).

cnf(c_0_25,plain,
    ( esk6_3(X1,unordered_pair(X2,X3),X4) = X2
    | upper_bound(X4,X1,unordered_pair(X2,X3))
    | ~ apply(X1,X3,X4) ),
    inference(spm,[status(thm)],[c_0_19,c_0_20]) ).

fof(c_0_26,plain,
    ! [X36,X37,X38,X39,X40,X41,X42,X43,X44,X45] :
      ( ( ~ member(X38,X36)
        | apply(X37,X38,X38)
        | ~ epred1_2(X37,X36) )
      & ( ~ member(X39,X36)
        | ~ member(X40,X36)
        | ~ apply(X37,X39,X40)
        | ~ apply(X37,X40,X39)
        | X39 = X40
        | ~ epred1_2(X37,X36) )
      & ( ~ member(X41,X36)
        | ~ member(X42,X36)
        | ~ member(X43,X36)
        | ~ apply(X37,X41,X42)
        | ~ apply(X37,X42,X43)
        | apply(X37,X41,X43)
        | ~ epred1_2(X37,X36) )
      & ( member(esk10_2(X44,X45),X44)
        | member(esk8_2(X44,X45),X44)
        | member(esk7_2(X44,X45),X44)
        | epred1_2(X45,X44) )
      & ( member(esk11_2(X44,X45),X44)
        | member(esk8_2(X44,X45),X44)
        | member(esk7_2(X44,X45),X44)
        | epred1_2(X45,X44) )
      & ( member(esk12_2(X44,X45),X44)
        | member(esk8_2(X44,X45),X44)
        | member(esk7_2(X44,X45),X44)
        | epred1_2(X45,X44) )
      & ( apply(X45,esk10_2(X44,X45),esk11_2(X44,X45))
        | member(esk8_2(X44,X45),X44)
        | member(esk7_2(X44,X45),X44)
        | epred1_2(X45,X44) )
      & ( apply(X45,esk11_2(X44,X45),esk12_2(X44,X45))
        | member(esk8_2(X44,X45),X44)
        | member(esk7_2(X44,X45),X44)
        | epred1_2(X45,X44) )
      & ( ~ apply(X45,esk10_2(X44,X45),esk12_2(X44,X45))
        | member(esk8_2(X44,X45),X44)
        | member(esk7_2(X44,X45),X44)
        | epred1_2(X45,X44) )
      & ( member(esk10_2(X44,X45),X44)
        | member(esk9_2(X44,X45),X44)
        | member(esk7_2(X44,X45),X44)
        | epred1_2(X45,X44) )
      & ( member(esk11_2(X44,X45),X44)
        | member(esk9_2(X44,X45),X44)
        | member(esk7_2(X44,X45),X44)
        | epred1_2(X45,X44) )
      & ( member(esk12_2(X44,X45),X44)
        | member(esk9_2(X44,X45),X44)
        | member(esk7_2(X44,X45),X44)
        | epred1_2(X45,X44) )
      & ( apply(X45,esk10_2(X44,X45),esk11_2(X44,X45))
        | member(esk9_2(X44,X45),X44)
        | member(esk7_2(X44,X45),X44)
        | epred1_2(X45,X44) )
      & ( apply(X45,esk11_2(X44,X45),esk12_2(X44,X45))
        | member(esk9_2(X44,X45),X44)
        | member(esk7_2(X44,X45),X44)
        | epred1_2(X45,X44) )
      & ( ~ apply(X45,esk10_2(X44,X45),esk12_2(X44,X45))
        | member(esk9_2(X44,X45),X44)
        | member(esk7_2(X44,X45),X44)
        | epred1_2(X45,X44) )
      & ( member(esk10_2(X44,X45),X44)
        | apply(X45,esk8_2(X44,X45),esk9_2(X44,X45))
        | member(esk7_2(X44,X45),X44)
        | epred1_2(X45,X44) )
      & ( member(esk11_2(X44,X45),X44)
        | apply(X45,esk8_2(X44,X45),esk9_2(X44,X45))
        | member(esk7_2(X44,X45),X44)
        | epred1_2(X45,X44) )
      & ( member(esk12_2(X44,X45),X44)
        | apply(X45,esk8_2(X44,X45),esk9_2(X44,X45))
        | member(esk7_2(X44,X45),X44)
        | epred1_2(X45,X44) )
      & ( apply(X45,esk10_2(X44,X45),esk11_2(X44,X45))
        | apply(X45,esk8_2(X44,X45),esk9_2(X44,X45))
        | member(esk7_2(X44,X45),X44)
        | epred1_2(X45,X44) )
      & ( apply(X45,esk11_2(X44,X45),esk12_2(X44,X45))
        | apply(X45,esk8_2(X44,X45),esk9_2(X44,X45))
        | member(esk7_2(X44,X45),X44)
        | epred1_2(X45,X44) )
      & ( ~ apply(X45,esk10_2(X44,X45),esk12_2(X44,X45))
        | apply(X45,esk8_2(X44,X45),esk9_2(X44,X45))
        | member(esk7_2(X44,X45),X44)
        | epred1_2(X45,X44) )
      & ( member(esk10_2(X44,X45),X44)
        | apply(X45,esk9_2(X44,X45),esk8_2(X44,X45))
        | member(esk7_2(X44,X45),X44)
        | epred1_2(X45,X44) )
      & ( member(esk11_2(X44,X45),X44)
        | apply(X45,esk9_2(X44,X45),esk8_2(X44,X45))
        | member(esk7_2(X44,X45),X44)
        | epred1_2(X45,X44) )
      & ( member(esk12_2(X44,X45),X44)
        | apply(X45,esk9_2(X44,X45),esk8_2(X44,X45))
        | member(esk7_2(X44,X45),X44)
        | epred1_2(X45,X44) )
      & ( apply(X45,esk10_2(X44,X45),esk11_2(X44,X45))
        | apply(X45,esk9_2(X44,X45),esk8_2(X44,X45))
        | member(esk7_2(X44,X45),X44)
        | epred1_2(X45,X44) )
      & ( apply(X45,esk11_2(X44,X45),esk12_2(X44,X45))
        | apply(X45,esk9_2(X44,X45),esk8_2(X44,X45))
        | member(esk7_2(X44,X45),X44)
        | epred1_2(X45,X44) )
      & ( ~ apply(X45,esk10_2(X44,X45),esk12_2(X44,X45))
        | apply(X45,esk9_2(X44,X45),esk8_2(X44,X45))
        | member(esk7_2(X44,X45),X44)
        | epred1_2(X45,X44) )
      & ( member(esk10_2(X44,X45),X44)
        | esk8_2(X44,X45) != esk9_2(X44,X45)
        | member(esk7_2(X44,X45),X44)
        | epred1_2(X45,X44) )
      & ( member(esk11_2(X44,X45),X44)
        | esk8_2(X44,X45) != esk9_2(X44,X45)
        | member(esk7_2(X44,X45),X44)
        | epred1_2(X45,X44) )
      & ( member(esk12_2(X44,X45),X44)
        | esk8_2(X44,X45) != esk9_2(X44,X45)
        | member(esk7_2(X44,X45),X44)
        | epred1_2(X45,X44) )
      & ( apply(X45,esk10_2(X44,X45),esk11_2(X44,X45))
        | esk8_2(X44,X45) != esk9_2(X44,X45)
        | member(esk7_2(X44,X45),X44)
        | epred1_2(X45,X44) )
      & ( apply(X45,esk11_2(X44,X45),esk12_2(X44,X45))
        | esk8_2(X44,X45) != esk9_2(X44,X45)
        | member(esk7_2(X44,X45),X44)
        | epred1_2(X45,X44) )
      & ( ~ apply(X45,esk10_2(X44,X45),esk12_2(X44,X45))
        | esk8_2(X44,X45) != esk9_2(X44,X45)
        | member(esk7_2(X44,X45),X44)
        | epred1_2(X45,X44) )
      & ( member(esk10_2(X44,X45),X44)
        | member(esk8_2(X44,X45),X44)
        | ~ apply(X45,esk7_2(X44,X45),esk7_2(X44,X45))
        | epred1_2(X45,X44) )
      & ( member(esk11_2(X44,X45),X44)
        | member(esk8_2(X44,X45),X44)
        | ~ apply(X45,esk7_2(X44,X45),esk7_2(X44,X45))
        | epred1_2(X45,X44) )
      & ( member(esk12_2(X44,X45),X44)
        | member(esk8_2(X44,X45),X44)
        | ~ apply(X45,esk7_2(X44,X45),esk7_2(X44,X45))
        | epred1_2(X45,X44) )
      & ( apply(X45,esk10_2(X44,X45),esk11_2(X44,X45))
        | member(esk8_2(X44,X45),X44)
        | ~ apply(X45,esk7_2(X44,X45),esk7_2(X44,X45))
        | epred1_2(X45,X44) )
      & ( apply(X45,esk11_2(X44,X45),esk12_2(X44,X45))
        | member(esk8_2(X44,X45),X44)
        | ~ apply(X45,esk7_2(X44,X45),esk7_2(X44,X45))
        | epred1_2(X45,X44) )
      & ( ~ apply(X45,esk10_2(X44,X45),esk12_2(X44,X45))
        | member(esk8_2(X44,X45),X44)
        | ~ apply(X45,esk7_2(X44,X45),esk7_2(X44,X45))
        | epred1_2(X45,X44) )
      & ( member(esk10_2(X44,X45),X44)
        | member(esk9_2(X44,X45),X44)
        | ~ apply(X45,esk7_2(X44,X45),esk7_2(X44,X45))
        | epred1_2(X45,X44) )
      & ( member(esk11_2(X44,X45),X44)
        | member(esk9_2(X44,X45),X44)
        | ~ apply(X45,esk7_2(X44,X45),esk7_2(X44,X45))
        | epred1_2(X45,X44) )
      & ( member(esk12_2(X44,X45),X44)
        | member(esk9_2(X44,X45),X44)
        | ~ apply(X45,esk7_2(X44,X45),esk7_2(X44,X45))
        | epred1_2(X45,X44) )
      & ( apply(X45,esk10_2(X44,X45),esk11_2(X44,X45))
        | member(esk9_2(X44,X45),X44)
        | ~ apply(X45,esk7_2(X44,X45),esk7_2(X44,X45))
        | epred1_2(X45,X44) )
      & ( apply(X45,esk11_2(X44,X45),esk12_2(X44,X45))
        | member(esk9_2(X44,X45),X44)
        | ~ apply(X45,esk7_2(X44,X45),esk7_2(X44,X45))
        | epred1_2(X45,X44) )
      & ( ~ apply(X45,esk10_2(X44,X45),esk12_2(X44,X45))
        | member(esk9_2(X44,X45),X44)
        | ~ apply(X45,esk7_2(X44,X45),esk7_2(X44,X45))
        | epred1_2(X45,X44) )
      & ( member(esk10_2(X44,X45),X44)
        | apply(X45,esk8_2(X44,X45),esk9_2(X44,X45))
        | ~ apply(X45,esk7_2(X44,X45),esk7_2(X44,X45))
        | epred1_2(X45,X44) )
      & ( member(esk11_2(X44,X45),X44)
        | apply(X45,esk8_2(X44,X45),esk9_2(X44,X45))
        | ~ apply(X45,esk7_2(X44,X45),esk7_2(X44,X45))
        | epred1_2(X45,X44) )
      & ( member(esk12_2(X44,X45),X44)
        | apply(X45,esk8_2(X44,X45),esk9_2(X44,X45))
        | ~ apply(X45,esk7_2(X44,X45),esk7_2(X44,X45))
        | epred1_2(X45,X44) )
      & ( apply(X45,esk10_2(X44,X45),esk11_2(X44,X45))
        | apply(X45,esk8_2(X44,X45),esk9_2(X44,X45))
        | ~ apply(X45,esk7_2(X44,X45),esk7_2(X44,X45))
        | epred1_2(X45,X44) )
      & ( apply(X45,esk11_2(X44,X45),esk12_2(X44,X45))
        | apply(X45,esk8_2(X44,X45),esk9_2(X44,X45))
        | ~ apply(X45,esk7_2(X44,X45),esk7_2(X44,X45))
        | epred1_2(X45,X44) )
      & ( ~ apply(X45,esk10_2(X44,X45),esk12_2(X44,X45))
        | apply(X45,esk8_2(X44,X45),esk9_2(X44,X45))
        | ~ apply(X45,esk7_2(X44,X45),esk7_2(X44,X45))
        | epred1_2(X45,X44) )
      & ( member(esk10_2(X44,X45),X44)
        | apply(X45,esk9_2(X44,X45),esk8_2(X44,X45))
        | ~ apply(X45,esk7_2(X44,X45),esk7_2(X44,X45))
        | epred1_2(X45,X44) )
      & ( member(esk11_2(X44,X45),X44)
        | apply(X45,esk9_2(X44,X45),esk8_2(X44,X45))
        | ~ apply(X45,esk7_2(X44,X45),esk7_2(X44,X45))
        | epred1_2(X45,X44) )
      & ( member(esk12_2(X44,X45),X44)
        | apply(X45,esk9_2(X44,X45),esk8_2(X44,X45))
        | ~ apply(X45,esk7_2(X44,X45),esk7_2(X44,X45))
        | epred1_2(X45,X44) )
      & ( apply(X45,esk10_2(X44,X45),esk11_2(X44,X45))
        | apply(X45,esk9_2(X44,X45),esk8_2(X44,X45))
        | ~ apply(X45,esk7_2(X44,X45),esk7_2(X44,X45))
        | epred1_2(X45,X44) )
      & ( apply(X45,esk11_2(X44,X45),esk12_2(X44,X45))
        | apply(X45,esk9_2(X44,X45),esk8_2(X44,X45))
        | ~ apply(X45,esk7_2(X44,X45),esk7_2(X44,X45))
        | epred1_2(X45,X44) )
      & ( ~ apply(X45,esk10_2(X44,X45),esk12_2(X44,X45))
        | apply(X45,esk9_2(X44,X45),esk8_2(X44,X45))
        | ~ apply(X45,esk7_2(X44,X45),esk7_2(X44,X45))
        | epred1_2(X45,X44) )
      & ( member(esk10_2(X44,X45),X44)
        | esk8_2(X44,X45) != esk9_2(X44,X45)
        | ~ apply(X45,esk7_2(X44,X45),esk7_2(X44,X45))
        | epred1_2(X45,X44) )
      & ( member(esk11_2(X44,X45),X44)
        | esk8_2(X44,X45) != esk9_2(X44,X45)
        | ~ apply(X45,esk7_2(X44,X45),esk7_2(X44,X45))
        | epred1_2(X45,X44) )
      & ( member(esk12_2(X44,X45),X44)
        | esk8_2(X44,X45) != esk9_2(X44,X45)
        | ~ apply(X45,esk7_2(X44,X45),esk7_2(X44,X45))
        | epred1_2(X45,X44) )
      & ( apply(X45,esk10_2(X44,X45),esk11_2(X44,X45))
        | esk8_2(X44,X45) != esk9_2(X44,X45)
        | ~ apply(X45,esk7_2(X44,X45),esk7_2(X44,X45))
        | epred1_2(X45,X44) )
      & ( apply(X45,esk11_2(X44,X45),esk12_2(X44,X45))
        | esk8_2(X44,X45) != esk9_2(X44,X45)
        | ~ apply(X45,esk7_2(X44,X45),esk7_2(X44,X45))
        | epred1_2(X45,X44) )
      & ( ~ apply(X45,esk10_2(X44,X45),esk12_2(X44,X45))
        | esk8_2(X44,X45) != esk9_2(X44,X45)
        | ~ apply(X45,esk7_2(X44,X45),esk7_2(X44,X45))
        | epred1_2(X45,X44) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_8])])])])])]) ).

cnf(c_0_27,plain,
    ( epred1_2(X1,X2)
    | ~ order(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_21]) ).

cnf(c_0_28,negated_conjecture,
    order(esk1_0,esk2_0),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_29,negated_conjecture,
    ~ upper_bound(esk4_0,esk1_0,unordered_pair(esk3_0,esk4_0)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24])]) ).

cnf(c_0_30,plain,
    ( upper_bound(X1,X2,unordered_pair(X3,X4))
    | ~ apply(X2,X3,X1)
    | ~ apply(X2,X4,X1) ),
    inference(spm,[status(thm)],[c_0_19,c_0_25]) ).

cnf(c_0_31,negated_conjecture,
    apply(esk1_0,esk3_0,esk4_0),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_32,plain,
    ( apply(X3,X1,X1)
    | ~ member(X1,X2)
    | ~ epred1_2(X3,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_26]) ).

cnf(c_0_33,negated_conjecture,
    epred1_2(esk1_0,esk2_0),
    inference(spm,[status(thm)],[c_0_27,c_0_28]) ).

cnf(c_0_34,negated_conjecture,
    ~ apply(esk1_0,esk4_0,esk4_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_29,c_0_30]),c_0_31])]) ).

cnf(c_0_35,negated_conjecture,
    ( apply(esk1_0,X1,X1)
    | ~ member(X1,esk2_0) ),
    inference(spm,[status(thm)],[c_0_32,c_0_33]) ).

cnf(c_0_36,negated_conjecture,
    member(esk4_0,esk2_0),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

cnf(c_0_37,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.10  % Problem    : SET795+4 : TPTP v8.1.2. Released v3.2.0.
% 0.10/0.12  % Command    : run_E %s %d THM
% 0.11/0.33  % Computer : n023.cluster.edu
% 0.11/0.33  % Model    : x86_64 x86_64
% 0.11/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33  % Memory   : 8042.1875MB
% 0.11/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33  % CPULimit   : 2400
% 0.11/0.33  % WCLimit    : 300
% 0.11/0.33  % DateTime   : Mon Oct  2 17:08:22 EDT 2023
% 0.11/0.33  % CPUTime    : 
% 0.17/0.43  Running first-order model finding
% 0.17/0.43  Running: /export/starexec/sandbox/solver/bin/eprover --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --satauto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.p2P3IAdKVB/E---3.1_8338.p
% 0.17/0.46  # Version: 3.1pre001
% 0.17/0.46  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.46  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.46  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.46  # Starting new_bool_3 with 300s (1) cores
% 0.17/0.46  # Starting new_bool_1 with 300s (1) cores
% 0.17/0.46  # Starting sh5l with 300s (1) cores
% 0.17/0.46  # new_bool_1 with pid 8424 completed with status 0
% 0.17/0.46  # Result found by new_bool_1
% 0.17/0.46  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.46  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.46  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.46  # Starting new_bool_3 with 300s (1) cores
% 0.17/0.46  # Starting new_bool_1 with 300s (1) cores
% 0.17/0.46  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.46  # Search class: FGUSF-FFLS32-SFFFFFNN
% 0.17/0.46  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.46  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.17/0.46  # SAT001_MinMin_p005000_rr_RG with pid 8426 completed with status 0
% 0.17/0.46  # Result found by SAT001_MinMin_p005000_rr_RG
% 0.17/0.46  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.17/0.46  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.17/0.46  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.17/0.46  # Starting new_bool_3 with 300s (1) cores
% 0.17/0.46  # Starting new_bool_1 with 300s (1) cores
% 0.17/0.46  # SinE strategy is GSinE(CountFormulas,hypos,1.5,,3,20000,1.0)
% 0.17/0.46  # Search class: FGUSF-FFLS32-SFFFFFNN
% 0.17/0.46  # Scheduled 5 strats onto 1 cores with 300 seconds (300 total)
% 0.17/0.46  # Starting SAT001_MinMin_p005000_rr_RG with 181s (1) cores
% 0.17/0.46  # Preprocessing time       : 0.001 s
% 0.17/0.46  # Presaturation interreduction done
% 0.17/0.46  
% 0.17/0.46  # Proof found!
% 0.17/0.46  # SZS status Theorem
% 0.17/0.46  # SZS output start CNFRefutation
% See solution above
% 0.17/0.46  # Parsed axioms                        : 22
% 0.17/0.46  # Removed by relevancy pruning/SinE    : 17
% 0.17/0.46  # Initial clauses                      : 82
% 0.17/0.46  # Removed in clause preprocessing      : 0
% 0.17/0.46  # Initial clauses in saturation        : 82
% 0.17/0.46  # Processed clauses                    : 211
% 0.17/0.46  # ...of these trivial                  : 0
% 0.17/0.46  # ...subsumed                          : 5
% 0.17/0.46  # ...remaining for further processing  : 206
% 0.17/0.46  # Other redundant clauses eliminated   : 4
% 0.17/0.46  # Clauses deleted for lack of memory   : 0
% 0.17/0.46  # Backward-subsumed                    : 5
% 0.17/0.46  # Backward-rewritten                   : 0
% 0.17/0.46  # Generated clauses                    : 220
% 0.17/0.46  # ...of the previous two non-redundant : 195
% 0.17/0.46  # ...aggressively subsumed             : 0
% 0.17/0.46  # Contextual simplify-reflections      : 1
% 0.17/0.46  # Paramodulations                      : 214
% 0.17/0.46  # Factorizations                       : 2
% 0.17/0.46  # NegExts                              : 0
% 0.17/0.46  # Equation resolutions                 : 4
% 0.17/0.46  # Total rewrite steps                  : 12
% 0.17/0.46  # Propositional unsat checks           : 0
% 0.17/0.46  #    Propositional check models        : 0
% 0.17/0.46  #    Propositional check unsatisfiable : 0
% 0.17/0.46  #    Propositional clauses             : 0
% 0.17/0.46  #    Propositional clauses after purity: 0
% 0.17/0.46  #    Propositional unsat core size     : 0
% 0.17/0.46  #    Propositional preprocessing time  : 0.000
% 0.17/0.46  #    Propositional encoding time       : 0.000
% 0.17/0.46  #    Propositional solver time         : 0.000
% 0.17/0.46  #    Success case prop preproc time    : 0.000
% 0.17/0.46  #    Success case prop encoding time   : 0.000
% 0.17/0.46  #    Success case prop solver time     : 0.000
% 0.17/0.46  # Current number of processed clauses  : 117
% 0.17/0.46  #    Positive orientable unit clauses  : 7
% 0.17/0.46  #    Positive unorientable unit clauses: 0
% 0.17/0.46  #    Negative unit clauses             : 3
% 0.17/0.46  #    Non-unit-clauses                  : 107
% 0.17/0.46  # Current number of unprocessed clauses: 148
% 0.17/0.46  # ...number of literals in the above   : 1070
% 0.17/0.46  # Current number of archived formulas  : 0
% 0.17/0.46  # Current number of archived clauses   : 87
% 0.17/0.46  # Clause-clause subsumption calls (NU) : 3544
% 0.17/0.46  # Rec. Clause-clause subsumption calls : 1315
% 0.17/0.46  # Non-unit clause-clause subsumptions  : 11
% 0.17/0.46  # Unit Clause-clause subsumption calls : 2
% 0.17/0.46  # Rewrite failures with RHS unbound    : 0
% 0.17/0.46  # BW rewrite match attempts            : 4
% 0.17/0.46  # BW rewrite match successes           : 0
% 0.17/0.46  # Condensation attempts                : 0
% 0.17/0.46  # Condensation successes               : 0
% 0.17/0.46  # Termbank termtop insertions          : 11602
% 0.17/0.46  
% 0.17/0.46  # -------------------------------------------------
% 0.17/0.46  # User time                : 0.018 s
% 0.17/0.46  # System time              : 0.002 s
% 0.17/0.46  # Total time               : 0.020 s
% 0.17/0.46  # Maximum resident set size: 1900 pages
% 0.17/0.46  
% 0.17/0.46  # -------------------------------------------------
% 0.17/0.46  # User time                : 0.019 s
% 0.17/0.46  # System time              : 0.003 s
% 0.17/0.46  # Total time               : 0.023 s
% 0.17/0.46  # Maximum resident set size: 1732 pages
% 0.17/0.46  % E---3.1 exiting
%------------------------------------------------------------------------------