TSTP Solution File: SEU168+1 by E-SAT---3.1

View Problem - Process Solution

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

% Computer : n016.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:30:42 EDT 2023

% Result   : Theorem 0.16s 0.59s
% Output   : CNFRefutation 0.16s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   29
%            Number of leaves      :    5
% Syntax   : Number of formulae    :   85 (  13 unt;   0 def)
%            Number of atoms       :  346 (   7 equ)
%            Maximal formula atoms :   72 (   4 avg)
%            Number of connectives :  432 ( 171   ~; 195   |;  54   &)
%                                         (   3 <=>;   9  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   23 (   4 avg)
%            Maximal term depth    :    6 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   1 con; 0-2 aty)
%            Number of variables   :  133 (   1 sgn;  51   !;   4   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(t9_tarski,axiom,
    ! [X1] :
    ? [X2] :
      ( in(X1,X2)
      & ! [X3,X4] :
          ( ( in(X3,X2)
            & subset(X4,X3) )
         => in(X4,X2) )
      & ! [X3] :
          ~ ( in(X3,X2)
            & ! [X4] :
                ~ ( in(X4,X2)
                  & ! [X5] :
                      ( subset(X5,X3)
                     => in(X5,X4) ) ) )
      & ! [X3] :
          ~ ( subset(X3,X2)
            & ~ are_equipotent(X3,X2)
            & ~ in(X3,X2) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.lVlcSliAF8/E---3.1_29407.p',t9_tarski) ).

fof(d1_zfmisc_1,axiom,
    ! [X1,X2] :
      ( X2 = powerset(X1)
    <=> ! [X3] :
          ( in(X3,X2)
        <=> subset(X3,X1) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.lVlcSliAF8/E---3.1_29407.p',d1_zfmisc_1) ).

fof(d3_tarski,axiom,
    ! [X1,X2] :
      ( subset(X1,X2)
    <=> ! [X3] :
          ( in(X3,X1)
         => in(X3,X2) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.lVlcSliAF8/E---3.1_29407.p',d3_tarski) ).

fof(t136_zfmisc_1,conjecture,
    ! [X1] :
    ? [X2] :
      ( in(X1,X2)
      & ! [X3,X4] :
          ( ( in(X3,X2)
            & subset(X4,X3) )
         => in(X4,X2) )
      & ! [X3] :
          ( in(X3,X2)
         => in(powerset(X3),X2) )
      & ! [X3] :
          ~ ( subset(X3,X2)
            & ~ are_equipotent(X3,X2)
            & ~ in(X3,X2) ) ),
    file('/export/starexec/sandbox2/tmp/tmp.lVlcSliAF8/E---3.1_29407.p',t136_zfmisc_1) ).

fof(reflexivity_r1_tarski,axiom,
    ! [X1,X2] : subset(X1,X1),
    file('/export/starexec/sandbox2/tmp/tmp.lVlcSliAF8/E---3.1_29407.p',reflexivity_r1_tarski) ).

fof(c_0_5,plain,
    ! [X1] :
    ? [X2] :
      ( in(X1,X2)
      & ! [X3,X4] :
          ( ( in(X3,X2)
            & subset(X4,X3) )
         => in(X4,X2) )
      & ! [X3] :
          ~ ( in(X3,X2)
            & ! [X4] :
                ~ ( in(X4,X2)
                  & ! [X5] :
                      ( subset(X5,X3)
                     => in(X5,X4) ) ) )
      & ! [X3] :
          ~ ( subset(X3,X2)
            & ~ are_equipotent(X3,X2)
            & ~ in(X3,X2) ) ),
    inference(fof_simplification,[status(thm)],[t9_tarski]) ).

fof(c_0_6,plain,
    ! [X8,X9,X10,X11,X12,X13] :
      ( ( ~ in(X10,X9)
        | subset(X10,X8)
        | X9 != powerset(X8) )
      & ( ~ subset(X11,X8)
        | in(X11,X9)
        | X9 != powerset(X8) )
      & ( ~ in(esk1_2(X12,X13),X13)
        | ~ subset(esk1_2(X12,X13),X12)
        | X13 = powerset(X12) )
      & ( in(esk1_2(X12,X13),X13)
        | subset(esk1_2(X12,X13),X12)
        | X13 = powerset(X12) ) ),
    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)],[d1_zfmisc_1])])])])])]) ).

fof(c_0_7,plain,
    ! [X15,X16,X17,X18,X19] :
      ( ( ~ subset(X15,X16)
        | ~ in(X17,X15)
        | in(X17,X16) )
      & ( in(esk2_2(X18,X19),X18)
        | subset(X18,X19) )
      & ( ~ in(esk2_2(X18,X19),X19)
        | subset(X18,X19) ) ),
    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)],[d3_tarski])])])])])]) ).

fof(c_0_8,plain,
    ! [X28,X30,X31,X32,X34,X35] :
      ( in(X28,esk8_1(X28))
      & ( ~ in(X30,esk8_1(X28))
        | ~ subset(X31,X30)
        | in(X31,esk8_1(X28)) )
      & ( in(esk9_2(X28,X32),esk8_1(X28))
        | ~ in(X32,esk8_1(X28)) )
      & ( ~ subset(X34,X32)
        | in(X34,esk9_2(X28,X32))
        | ~ in(X32,esk8_1(X28)) )
      & ( ~ subset(X35,esk8_1(X28))
        | are_equipotent(X35,esk8_1(X28))
        | in(X35,esk8_1(X28)) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_5])])])])]) ).

cnf(c_0_9,plain,
    ( subset(X1,X3)
    | ~ in(X1,X2)
    | X2 != powerset(X3) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_10,plain,
    ( subset(X1,X2)
    | ~ in(esk2_2(X1,X2),X2) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_11,plain,
    ( in(X1,esk9_2(X3,X2))
    | ~ subset(X1,X2)
    | ~ in(X2,esk8_1(X3)) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_12,plain,
    ( subset(X1,X2)
    | ~ in(X1,powerset(X2)) ),
    inference(er,[status(thm)],[c_0_9]) ).

cnf(c_0_13,plain,
    ( in(esk2_2(X1,X2),X1)
    | subset(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

fof(c_0_14,negated_conjecture,
    ~ ! [X1] :
      ? [X2] :
        ( in(X1,X2)
        & ! [X3,X4] :
            ( ( in(X3,X2)
              & subset(X4,X3) )
           => in(X4,X2) )
        & ! [X3] :
            ( in(X3,X2)
           => in(powerset(X3),X2) )
        & ! [X3] :
            ~ ( subset(X3,X2)
              & ~ are_equipotent(X3,X2)
              & ~ in(X3,X2) ) ),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t136_zfmisc_1])]) ).

cnf(c_0_15,plain,
    ( in(X3,esk8_1(X2))
    | ~ in(X1,esk8_1(X2))
    | ~ subset(X3,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_16,plain,
    ( in(esk9_2(X1,X2),esk8_1(X1))
    | ~ in(X2,esk8_1(X1)) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_17,plain,
    ( subset(X1,esk9_2(X2,X3))
    | ~ subset(esk2_2(X1,esk9_2(X2,X3)),X3)
    | ~ in(X3,esk8_1(X2)) ),
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_18,plain,
    ( subset(esk2_2(powerset(X1),X2),X1)
    | subset(powerset(X1),X2) ),
    inference(spm,[status(thm)],[c_0_12,c_0_13]) ).

fof(c_0_19,negated_conjecture,
    ! [X23] :
      ( ( subset(esk7_1(X23),X23)
        | in(esk6_1(X23),X23)
        | in(esk4_1(X23),X23)
        | ~ in(esk3_0,X23) )
      & ( ~ are_equipotent(esk7_1(X23),X23)
        | in(esk6_1(X23),X23)
        | in(esk4_1(X23),X23)
        | ~ in(esk3_0,X23) )
      & ( ~ in(esk7_1(X23),X23)
        | in(esk6_1(X23),X23)
        | in(esk4_1(X23),X23)
        | ~ in(esk3_0,X23) )
      & ( subset(esk7_1(X23),X23)
        | ~ in(powerset(esk6_1(X23)),X23)
        | in(esk4_1(X23),X23)
        | ~ in(esk3_0,X23) )
      & ( ~ are_equipotent(esk7_1(X23),X23)
        | ~ in(powerset(esk6_1(X23)),X23)
        | in(esk4_1(X23),X23)
        | ~ in(esk3_0,X23) )
      & ( ~ in(esk7_1(X23),X23)
        | ~ in(powerset(esk6_1(X23)),X23)
        | in(esk4_1(X23),X23)
        | ~ in(esk3_0,X23) )
      & ( subset(esk7_1(X23),X23)
        | in(esk6_1(X23),X23)
        | subset(esk5_1(X23),esk4_1(X23))
        | ~ in(esk3_0,X23) )
      & ( ~ are_equipotent(esk7_1(X23),X23)
        | in(esk6_1(X23),X23)
        | subset(esk5_1(X23),esk4_1(X23))
        | ~ in(esk3_0,X23) )
      & ( ~ in(esk7_1(X23),X23)
        | in(esk6_1(X23),X23)
        | subset(esk5_1(X23),esk4_1(X23))
        | ~ in(esk3_0,X23) )
      & ( subset(esk7_1(X23),X23)
        | ~ in(powerset(esk6_1(X23)),X23)
        | subset(esk5_1(X23),esk4_1(X23))
        | ~ in(esk3_0,X23) )
      & ( ~ are_equipotent(esk7_1(X23),X23)
        | ~ in(powerset(esk6_1(X23)),X23)
        | subset(esk5_1(X23),esk4_1(X23))
        | ~ in(esk3_0,X23) )
      & ( ~ in(esk7_1(X23),X23)
        | ~ in(powerset(esk6_1(X23)),X23)
        | subset(esk5_1(X23),esk4_1(X23))
        | ~ in(esk3_0,X23) )
      & ( subset(esk7_1(X23),X23)
        | in(esk6_1(X23),X23)
        | ~ in(esk5_1(X23),X23)
        | ~ in(esk3_0,X23) )
      & ( ~ are_equipotent(esk7_1(X23),X23)
        | in(esk6_1(X23),X23)
        | ~ in(esk5_1(X23),X23)
        | ~ in(esk3_0,X23) )
      & ( ~ in(esk7_1(X23),X23)
        | in(esk6_1(X23),X23)
        | ~ in(esk5_1(X23),X23)
        | ~ in(esk3_0,X23) )
      & ( subset(esk7_1(X23),X23)
        | ~ in(powerset(esk6_1(X23)),X23)
        | ~ in(esk5_1(X23),X23)
        | ~ in(esk3_0,X23) )
      & ( ~ are_equipotent(esk7_1(X23),X23)
        | ~ in(powerset(esk6_1(X23)),X23)
        | ~ in(esk5_1(X23),X23)
        | ~ in(esk3_0,X23) )
      & ( ~ in(esk7_1(X23),X23)
        | ~ in(powerset(esk6_1(X23)),X23)
        | ~ in(esk5_1(X23),X23)
        | ~ in(esk3_0,X23) ) ),
    inference(distribute,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_14])])])]) ).

cnf(c_0_20,plain,
    ( in(X1,esk8_1(X2))
    | ~ subset(X1,esk9_2(X2,X3))
    | ~ in(X3,esk8_1(X2)) ),
    inference(spm,[status(thm)],[c_0_15,c_0_16]) ).

cnf(c_0_21,plain,
    ( subset(powerset(X1),esk9_2(X2,X1))
    | ~ in(X1,esk8_1(X2)) ),
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_22,negated_conjecture,
    ( subset(esk7_1(X1),X1)
    | in(esk4_1(X1),X1)
    | ~ in(powerset(esk6_1(X1)),X1)
    | ~ in(esk3_0,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_19]) ).

cnf(c_0_23,plain,
    ( in(powerset(X1),esk8_1(X2))
    | ~ in(X1,esk8_1(X2)) ),
    inference(spm,[status(thm)],[c_0_20,c_0_21]) ).

cnf(c_0_24,negated_conjecture,
    ( subset(esk7_1(X1),X1)
    | in(esk6_1(X1),X1)
    | in(esk4_1(X1),X1)
    | ~ in(esk3_0,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_19]) ).

cnf(c_0_25,negated_conjecture,
    ( subset(esk7_1(esk8_1(X1)),esk8_1(X1))
    | in(esk4_1(esk8_1(X1)),esk8_1(X1))
    | ~ in(esk3_0,esk8_1(X1)) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_22,c_0_23]),c_0_24]) ).

cnf(c_0_26,plain,
    in(X1,esk8_1(X1)),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_27,negated_conjecture,
    ( subset(esk7_1(X1),X1)
    | subset(esk5_1(X1),esk4_1(X1))
    | ~ in(powerset(esk6_1(X1)),X1)
    | ~ in(esk3_0,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_19]) ).

cnf(c_0_28,negated_conjecture,
    ( subset(esk7_1(X1),X1)
    | in(esk6_1(X1),X1)
    | subset(esk5_1(X1),esk4_1(X1))
    | ~ in(esk3_0,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_19]) ).

cnf(c_0_29,negated_conjecture,
    ( subset(esk7_1(esk8_1(esk3_0)),esk8_1(esk3_0))
    | in(esk4_1(esk8_1(esk3_0)),esk8_1(esk3_0)) ),
    inference(spm,[status(thm)],[c_0_25,c_0_26]) ).

cnf(c_0_30,negated_conjecture,
    ( subset(esk5_1(esk8_1(X1)),esk4_1(esk8_1(X1)))
    | subset(esk7_1(esk8_1(X1)),esk8_1(X1))
    | ~ in(esk3_0,esk8_1(X1)) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_23]),c_0_28]) ).

cnf(c_0_31,negated_conjecture,
    ( subset(esk7_1(X1),X1)
    | ~ in(powerset(esk6_1(X1)),X1)
    | ~ in(esk5_1(X1),X1)
    | ~ in(esk3_0,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_19]) ).

cnf(c_0_32,negated_conjecture,
    ( subset(esk7_1(X1),X1)
    | in(esk6_1(X1),X1)
    | ~ in(esk5_1(X1),X1)
    | ~ in(esk3_0,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_19]) ).

cnf(c_0_33,negated_conjecture,
    ( subset(esk7_1(esk8_1(esk3_0)),esk8_1(esk3_0))
    | in(X1,esk8_1(esk3_0))
    | ~ subset(X1,esk4_1(esk8_1(esk3_0))) ),
    inference(spm,[status(thm)],[c_0_15,c_0_29]) ).

cnf(c_0_34,negated_conjecture,
    ( subset(esk5_1(esk8_1(esk3_0)),esk4_1(esk8_1(esk3_0)))
    | subset(esk7_1(esk8_1(esk3_0)),esk8_1(esk3_0)) ),
    inference(spm,[status(thm)],[c_0_30,c_0_26]) ).

cnf(c_0_35,negated_conjecture,
    ( subset(esk7_1(esk8_1(X1)),esk8_1(X1))
    | ~ in(esk5_1(esk8_1(X1)),esk8_1(X1))
    | ~ in(esk3_0,esk8_1(X1)) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_23]),c_0_32]) ).

cnf(c_0_36,negated_conjecture,
    ( subset(esk7_1(esk8_1(esk3_0)),esk8_1(esk3_0))
    | in(esk5_1(esk8_1(esk3_0)),esk8_1(esk3_0)) ),
    inference(spm,[status(thm)],[c_0_33,c_0_34]) ).

cnf(c_0_37,plain,
    ( are_equipotent(X1,esk8_1(X2))
    | in(X1,esk8_1(X2))
    | ~ subset(X1,esk8_1(X2)) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_38,negated_conjecture,
    subset(esk7_1(esk8_1(esk3_0)),esk8_1(esk3_0)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_26])]) ).

cnf(c_0_39,negated_conjecture,
    ( in(esk4_1(X1),X1)
    | ~ are_equipotent(esk7_1(X1),X1)
    | ~ in(powerset(esk6_1(X1)),X1)
    | ~ in(esk3_0,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_19]) ).

cnf(c_0_40,negated_conjecture,
    ( are_equipotent(esk7_1(esk8_1(esk3_0)),esk8_1(esk3_0))
    | in(esk7_1(esk8_1(esk3_0)),esk8_1(esk3_0)) ),
    inference(spm,[status(thm)],[c_0_37,c_0_38]) ).

cnf(c_0_41,negated_conjecture,
    ( in(esk7_1(esk8_1(esk3_0)),esk8_1(esk3_0))
    | in(esk4_1(esk8_1(esk3_0)),esk8_1(esk3_0))
    | ~ in(powerset(esk6_1(esk8_1(esk3_0))),esk8_1(esk3_0)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_39,c_0_40]),c_0_26])]) ).

cnf(c_0_42,negated_conjecture,
    ( ~ are_equipotent(esk7_1(X1),X1)
    | ~ in(powerset(esk6_1(X1)),X1)
    | ~ in(esk5_1(X1),X1)
    | ~ in(esk3_0,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_19]) ).

cnf(c_0_43,negated_conjecture,
    ( in(esk6_1(X1),X1)
    | in(esk4_1(X1),X1)
    | ~ are_equipotent(esk7_1(X1),X1)
    | ~ in(esk3_0,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_19]) ).

cnf(c_0_44,negated_conjecture,
    ( in(esk4_1(esk8_1(esk3_0)),esk8_1(esk3_0))
    | in(esk7_1(esk8_1(esk3_0)),esk8_1(esk3_0))
    | ~ in(esk6_1(esk8_1(esk3_0)),esk8_1(esk3_0)) ),
    inference(spm,[status(thm)],[c_0_41,c_0_23]) ).

cnf(c_0_45,negated_conjecture,
    ( in(esk7_1(esk8_1(esk3_0)),esk8_1(esk3_0))
    | ~ in(powerset(esk6_1(esk8_1(esk3_0))),esk8_1(esk3_0))
    | ~ in(esk5_1(esk8_1(esk3_0)),esk8_1(esk3_0)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_40]),c_0_26])]) ).

cnf(c_0_46,negated_conjecture,
    ( in(esk4_1(X1),X1)
    | ~ in(esk7_1(X1),X1)
    | ~ in(powerset(esk6_1(X1)),X1)
    | ~ in(esk3_0,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_19]) ).

cnf(c_0_47,negated_conjecture,
    ( in(esk6_1(X1),X1)
    | in(esk4_1(X1),X1)
    | ~ in(esk7_1(X1),X1)
    | ~ in(esk3_0,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_19]) ).

cnf(c_0_48,negated_conjecture,
    ( in(esk7_1(esk8_1(esk3_0)),esk8_1(esk3_0))
    | in(esk4_1(esk8_1(esk3_0)),esk8_1(esk3_0)) ),
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_43,c_0_40]),c_0_26])]),c_0_44]) ).

cnf(c_0_49,negated_conjecture,
    ( in(esk6_1(X1),X1)
    | subset(esk5_1(X1),esk4_1(X1))
    | ~ are_equipotent(esk7_1(X1),X1)
    | ~ in(esk3_0,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_19]) ).

cnf(c_0_50,negated_conjecture,
    ( in(esk6_1(X1),X1)
    | ~ are_equipotent(esk7_1(X1),X1)
    | ~ in(esk5_1(X1),X1)
    | ~ in(esk3_0,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_19]) ).

cnf(c_0_51,negated_conjecture,
    ( in(esk7_1(esk8_1(esk3_0)),esk8_1(esk3_0))
    | ~ in(esk5_1(esk8_1(esk3_0)),esk8_1(esk3_0))
    | ~ in(esk6_1(esk8_1(esk3_0)),esk8_1(esk3_0)) ),
    inference(spm,[status(thm)],[c_0_45,c_0_23]) ).

cnf(c_0_52,negated_conjecture,
    ( in(esk4_1(esk8_1(X1)),esk8_1(X1))
    | ~ in(esk7_1(esk8_1(X1)),esk8_1(X1))
    | ~ in(esk3_0,esk8_1(X1)) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_23]),c_0_47]) ).

cnf(c_0_53,negated_conjecture,
    ( in(esk7_1(esk8_1(esk3_0)),esk8_1(esk3_0))
    | in(X1,esk8_1(esk3_0))
    | ~ subset(X1,esk4_1(esk8_1(esk3_0))) ),
    inference(spm,[status(thm)],[c_0_15,c_0_48]) ).

cnf(c_0_54,negated_conjecture,
    ( subset(esk5_1(esk8_1(esk3_0)),esk4_1(esk8_1(esk3_0)))
    | in(esk7_1(esk8_1(esk3_0)),esk8_1(esk3_0))
    | in(esk6_1(esk8_1(esk3_0)),esk8_1(esk3_0)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_40]),c_0_26])]) ).

cnf(c_0_55,negated_conjecture,
    ( in(esk7_1(esk8_1(esk3_0)),esk8_1(esk3_0))
    | ~ in(esk5_1(esk8_1(esk3_0)),esk8_1(esk3_0)) ),
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_40]),c_0_26])]),c_0_51]) ).

cnf(c_0_56,negated_conjecture,
    ( in(X1,esk8_1(X2))
    | ~ subset(X1,esk4_1(esk8_1(X2)))
    | ~ in(esk7_1(esk8_1(X2)),esk8_1(X2))
    | ~ in(esk3_0,esk8_1(X2)) ),
    inference(spm,[status(thm)],[c_0_15,c_0_52]) ).

cnf(c_0_57,negated_conjecture,
    ( in(esk6_1(esk8_1(esk3_0)),esk8_1(esk3_0))
    | in(esk7_1(esk8_1(esk3_0)),esk8_1(esk3_0)) ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_55]) ).

cnf(c_0_58,negated_conjecture,
    ( in(esk6_1(X1),X1)
    | subset(esk5_1(X1),esk4_1(X1))
    | ~ in(esk7_1(X1),X1)
    | ~ in(esk3_0,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_19]) ).

cnf(c_0_59,negated_conjecture,
    ( in(esk6_1(esk8_1(esk3_0)),esk8_1(esk3_0))
    | in(X1,esk8_1(esk3_0))
    | ~ subset(X1,esk4_1(esk8_1(esk3_0))) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_26])]) ).

cnf(c_0_60,negated_conjecture,
    ( subset(esk5_1(esk8_1(esk3_0)),esk4_1(esk8_1(esk3_0)))
    | in(esk6_1(esk8_1(esk3_0)),esk8_1(esk3_0)) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_57]),c_0_26])]) ).

cnf(c_0_61,plain,
    ( in(X1,esk8_1(X2))
    | ~ subset(X1,powerset(X3))
    | ~ in(X3,esk8_1(X2)) ),
    inference(spm,[status(thm)],[c_0_15,c_0_23]) ).

cnf(c_0_62,negated_conjecture,
    ( in(esk6_1(X1),X1)
    | ~ in(esk7_1(X1),X1)
    | ~ in(esk5_1(X1),X1)
    | ~ in(esk3_0,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_19]) ).

cnf(c_0_63,negated_conjecture,
    ( in(esk5_1(esk8_1(esk3_0)),esk8_1(esk3_0))
    | in(esk6_1(esk8_1(esk3_0)),esk8_1(esk3_0)) ),
    inference(spm,[status(thm)],[c_0_59,c_0_60]) ).

cnf(c_0_64,plain,
    ( subset(powerset(powerset(X1)),X2)
    | in(esk2_2(powerset(powerset(X1)),X2),esk8_1(X3))
    | ~ in(X1,esk8_1(X3)) ),
    inference(spm,[status(thm)],[c_0_61,c_0_18]) ).

cnf(c_0_65,negated_conjecture,
    in(esk6_1(esk8_1(esk3_0)),esk8_1(esk3_0)),
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_62,c_0_63]),c_0_26])]),c_0_57]) ).

cnf(c_0_66,negated_conjecture,
    ( subset(powerset(powerset(esk6_1(esk8_1(esk3_0)))),X1)
    | in(esk2_2(powerset(powerset(esk6_1(esk8_1(esk3_0)))),X1),esk8_1(esk3_0)) ),
    inference(spm,[status(thm)],[c_0_64,c_0_65]) ).

cnf(c_0_67,plain,
    ( in(X3,X2)
    | ~ subset(X1,X2)
    | ~ in(X3,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_7]) ).

cnf(c_0_68,negated_conjecture,
    subset(powerset(powerset(esk6_1(esk8_1(esk3_0)))),esk8_1(esk3_0)),
    inference(spm,[status(thm)],[c_0_10,c_0_66]) ).

cnf(c_0_69,plain,
    ( in(X1,X3)
    | ~ subset(X1,X2)
    | X3 != powerset(X2) ),
    inference(split_conjunct,[status(thm)],[c_0_6]) ).

cnf(c_0_70,negated_conjecture,
    ( in(X1,esk8_1(esk3_0))
    | ~ in(X1,powerset(powerset(esk6_1(esk8_1(esk3_0))))) ),
    inference(spm,[status(thm)],[c_0_67,c_0_68]) ).

cnf(c_0_71,plain,
    ( in(X1,powerset(X2))
    | ~ subset(X1,X2) ),
    inference(er,[status(thm)],[c_0_69]) ).

fof(c_0_72,plain,
    ! [X21] : subset(X21,X21),
    inference(variable_rename,[status(thm)],[inference(fof_simplification,[status(thm)],[reflexivity_r1_tarski])]) ).

cnf(c_0_73,negated_conjecture,
    ( in(X1,esk8_1(esk3_0))
    | ~ subset(X1,powerset(esk6_1(esk8_1(esk3_0)))) ),
    inference(spm,[status(thm)],[c_0_70,c_0_71]) ).

cnf(c_0_74,plain,
    subset(X1,X1),
    inference(split_conjunct,[status(thm)],[c_0_72]) ).

cnf(c_0_75,negated_conjecture,
    in(powerset(esk6_1(esk8_1(esk3_0))),esk8_1(esk3_0)),
    inference(spm,[status(thm)],[c_0_73,c_0_74]) ).

cnf(c_0_76,negated_conjecture,
    in(esk4_1(esk8_1(esk3_0)),esk8_1(esk3_0)),
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_46,c_0_75]),c_0_26])]),c_0_48]) ).

cnf(c_0_77,negated_conjecture,
    ( ~ in(esk7_1(X1),X1)
    | ~ in(powerset(esk6_1(X1)),X1)
    | ~ in(esk5_1(X1),X1)
    | ~ in(esk3_0,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_19]) ).

cnf(c_0_78,negated_conjecture,
    ( in(X1,esk8_1(esk3_0))
    | ~ subset(X1,esk4_1(esk8_1(esk3_0))) ),
    inference(spm,[status(thm)],[c_0_15,c_0_76]) ).

cnf(c_0_79,negated_conjecture,
    ( subset(esk5_1(X1),esk4_1(X1))
    | ~ in(esk7_1(X1),X1)
    | ~ in(powerset(esk6_1(X1)),X1)
    | ~ in(esk3_0,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_19]) ).

cnf(c_0_80,negated_conjecture,
    ~ in(esk5_1(esk8_1(esk3_0)),esk8_1(esk3_0)),
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_77,c_0_75]),c_0_26])]),c_0_55]) ).

cnf(c_0_81,negated_conjecture,
    ( subset(esk5_1(X1),esk4_1(X1))
    | ~ are_equipotent(esk7_1(X1),X1)
    | ~ in(powerset(esk6_1(X1)),X1)
    | ~ in(esk3_0,X1) ),
    inference(split_conjunct,[status(thm)],[c_0_19]) ).

cnf(c_0_82,negated_conjecture,
    ~ in(esk7_1(esk8_1(esk3_0)),esk8_1(esk3_0)),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_79]),c_0_75]),c_0_26])]),c_0_80]) ).

cnf(c_0_83,negated_conjecture,
    ~ are_equipotent(esk7_1(esk8_1(esk3_0)),esk8_1(esk3_0)),
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_78,c_0_81]),c_0_75]),c_0_26])]),c_0_80]) ).

cnf(c_0_84,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[c_0_40,c_0_82]),c_0_83]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09  % Problem    : SEU168+1 : TPTP v8.1.2. Released v3.3.0.
% 0.00/0.10  % Command    : run_E %s %d THM
% 0.10/0.30  % Computer : n016.cluster.edu
% 0.10/0.30  % Model    : x86_64 x86_64
% 0.10/0.30  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.10/0.30  % Memory   : 8042.1875MB
% 0.10/0.30  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.10/0.30  % CPULimit   : 2400
% 0.10/0.30  % WCLimit    : 300
% 0.10/0.30  % DateTime   : Mon Oct  2 09:47:36 EDT 2023
% 0.10/0.31  % CPUTime    : 
% 0.16/0.40  Running first-order model finding
% 0.16/0.41  Running: /export/starexec/sandbox2/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/sandbox2/tmp/tmp.lVlcSliAF8/E---3.1_29407.p
% 0.16/0.59  # Version: 3.1pre001
% 0.16/0.59  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.59  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.59  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.59  # Starting new_bool_3 with 300s (1) cores
% 0.16/0.59  # Starting new_bool_1 with 300s (1) cores
% 0.16/0.59  # Starting sh5l with 300s (1) cores
% 0.16/0.59  # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 29484 completed with status 0
% 0.16/0.59  # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.16/0.59  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.59  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.59  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.59  # No SInE strategy applied
% 0.16/0.59  # Search class: FGHSS-FFMF21-SFFFFFNN
% 0.16/0.59  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.59  # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.16/0.59  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.16/0.59  # Starting new_bool_3 with 136s (1) cores
% 0.16/0.59  # Starting new_bool_1 with 136s (1) cores
% 0.16/0.59  # Starting sh5l with 136s (1) cores
% 0.16/0.59  # G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with pid 29489 completed with status 0
% 0.16/0.59  # Result found by G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN
% 0.16/0.59  # Preprocessing class: FSMSSMSSSSSNFFN.
% 0.16/0.59  # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.16/0.59  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 1500s (5) cores
% 0.16/0.59  # No SInE strategy applied
% 0.16/0.59  # Search class: FGHSS-FFMF21-SFFFFFNN
% 0.16/0.59  # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.16/0.59  # Starting SAT001_MinMin_p005000_rr_RG with 811s (1) cores
% 0.16/0.59  # Starting G-E--_208_C18_F1_SE_CS_SOS_SP_PS_S5PRR_RG_S04AN with 151s (1) cores
% 0.16/0.59  # Preprocessing time       : 0.001 s
% 0.16/0.59  # Presaturation interreduction done
% 0.16/0.59  
% 0.16/0.59  # Proof found!
% 0.16/0.59  # SZS status Theorem
% 0.16/0.59  # SZS output start CNFRefutation
% See solution above
% 0.16/0.59  # Parsed axioms                        : 7
% 0.16/0.59  # Removed by relevancy pruning/SinE    : 0
% 0.16/0.59  # Initial clauses                      : 33
% 0.16/0.59  # Removed in clause preprocessing      : 1
% 0.16/0.59  # Initial clauses in saturation        : 32
% 0.16/0.59  # Processed clauses                    : 1260
% 0.16/0.59  # ...of these trivial                  : 0
% 0.16/0.59  # ...subsumed                          : 415
% 0.16/0.59  # ...remaining for further processing  : 844
% 0.16/0.59  # Other redundant clauses eliminated   : 2
% 0.16/0.59  # Clauses deleted for lack of memory   : 0
% 0.16/0.59  # Backward-subsumed                    : 80
% 0.16/0.59  # Backward-rewritten                   : 16
% 0.16/0.59  # Generated clauses                    : 3109
% 0.16/0.59  # ...of the previous two non-redundant : 3078
% 0.16/0.59  # ...aggressively subsumed             : 0
% 0.16/0.59  # Contextual simplify-reflections      : 11
% 0.16/0.59  # Paramodulations                      : 3098
% 0.16/0.59  # Factorizations                       : 8
% 0.16/0.59  # NegExts                              : 0
% 0.16/0.59  # Equation resolutions                 : 2
% 0.16/0.59  # Total rewrite steps                  : 117
% 0.16/0.59  # Propositional unsat checks           : 0
% 0.16/0.59  #    Propositional check models        : 0
% 0.16/0.59  #    Propositional check unsatisfiable : 0
% 0.16/0.59  #    Propositional clauses             : 0
% 0.16/0.59  #    Propositional clauses after purity: 0
% 0.16/0.59  #    Propositional unsat core size     : 0
% 0.16/0.59  #    Propositional preprocessing time  : 0.000
% 0.16/0.59  #    Propositional encoding time       : 0.000
% 0.16/0.59  #    Propositional solver time         : 0.000
% 0.16/0.59  #    Success case prop preproc time    : 0.000
% 0.16/0.59  #    Success case prop encoding time   : 0.000
% 0.16/0.59  #    Success case prop solver time     : 0.000
% 0.16/0.59  # Current number of processed clauses  : 713
% 0.16/0.59  #    Positive orientable unit clauses  : 17
% 0.16/0.59  #    Positive unorientable unit clauses: 0
% 0.16/0.59  #    Negative unit clauses             : 44
% 0.16/0.59  #    Non-unit-clauses                  : 652
% 0.16/0.59  # Current number of unprocessed clauses: 1839
% 0.16/0.59  # ...number of literals in the above   : 8315
% 0.16/0.59  # Current number of archived formulas  : 0
% 0.16/0.59  # Current number of archived clauses   : 129
% 0.16/0.59  # Clause-clause subsumption calls (NU) : 138643
% 0.16/0.59  # Rec. Clause-clause subsumption calls : 54529
% 0.16/0.59  # Non-unit clause-clause subsumptions  : 436
% 0.16/0.59  # Unit Clause-clause subsumption calls : 4098
% 0.16/0.59  # Rewrite failures with RHS unbound    : 0
% 0.16/0.59  # BW rewrite match attempts            : 25
% 0.16/0.59  # BW rewrite match successes           : 6
% 0.16/0.59  # Condensation attempts                : 0
% 0.16/0.59  # Condensation successes               : 0
% 0.16/0.59  # Termbank termtop insertions          : 85413
% 0.16/0.59  
% 0.16/0.59  # -------------------------------------------------
% 0.16/0.59  # User time                : 0.170 s
% 0.16/0.59  # System time              : 0.009 s
% 0.16/0.59  # Total time               : 0.178 s
% 0.16/0.59  # Maximum resident set size: 1756 pages
% 0.16/0.59  
% 0.16/0.59  # -------------------------------------------------
% 0.16/0.59  # User time                : 0.866 s
% 0.16/0.59  # System time              : 0.016 s
% 0.16/0.59  # Total time               : 0.883 s
% 0.16/0.59  # Maximum resident set size: 1676 pages
% 0.16/0.59  % E---3.1 exiting
%------------------------------------------------------------------------------