TSTP Solution File: SET608+3 by ET---2.0

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : ET---2.0
% Problem  : SET608+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : run_ET %s %d

% Computer : n011.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 : 300s
% WCLimit  : 600s
% DateTime : Tue Jul 19 00:52:27 EDT 2022

% Result   : Theorem 0.40s 34.57s
% Output   : CNFRefutation 0.40s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   25
%            Number of leaves      :    8
% Syntax   : Number of formulae    :  120 (  58 unt;   0 def)
%            Number of atoms       :  224 (  42 equ)
%            Maximal formula atoms :    7 (   1 avg)
%            Number of connectives :  170 (  66   ~;  85   |;  13   &)
%                                         (   5 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   12 (   3 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   2 con; 0-2 aty)
%            Number of variables   :  329 (  61 sgn  53   !;   0   ?)

% Comments : 
%------------------------------------------------------------------------------
fof(difference_defn,axiom,
    ! [X1,X2,X3] :
      ( member(X3,difference(X1,X2))
    <=> ( member(X3,X1)
        & ~ member(X3,X2) ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',difference_defn) ).

fof(subset_defn,axiom,
    ! [X1,X2] :
      ( subset(X1,X2)
    <=> ! [X3] :
          ( member(X3,X1)
         => member(X3,X2) ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',subset_defn) ).

fof(equal_defn,axiom,
    ! [X1,X2] :
      ( X1 = X2
    <=> ( subset(X1,X2)
        & subset(X2,X1) ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',equal_defn) ).

fof(union_defn,axiom,
    ! [X1,X2,X3] :
      ( member(X3,union(X1,X2))
    <=> ( member(X3,X1)
        | member(X3,X2) ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',union_defn) ).

fof(commutativity_of_union,axiom,
    ! [X1,X2] : union(X1,X2) = union(X2,X1),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',commutativity_of_union) ).

fof(intersection_defn,axiom,
    ! [X1,X2,X3] :
      ( member(X3,intersection(X1,X2))
    <=> ( member(X3,X1)
        & member(X3,X2) ) ),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',intersection_defn) ).

fof(commutativity_of_intersection,axiom,
    ! [X1,X2] : intersection(X1,X2) = intersection(X2,X1),
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',commutativity_of_intersection) ).

fof(prove_union_intersection_difference,conjecture,
    ! [X1,X2] : union(intersection(X1,X2),difference(X1,X2)) = X1,
    file('/export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in',prove_union_intersection_difference) ).

fof(c_0_8,plain,
    ! [X4,X5,X6,X4,X5,X6] :
      ( ( member(X6,X4)
        | ~ member(X6,difference(X4,X5)) )
      & ( ~ member(X6,X5)
        | ~ member(X6,difference(X4,X5)) )
      & ( ~ member(X6,X4)
        | member(X6,X5)
        | member(X6,difference(X4,X5)) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(fof_simplification,[status(thm)],[difference_defn])])])])])]) ).

fof(c_0_9,plain,
    ! [X4,X5,X6,X4,X5] :
      ( ( ~ subset(X4,X5)
        | ~ member(X6,X4)
        | member(X6,X5) )
      & ( member(esk1_2(X4,X5),X4)
        | subset(X4,X5) )
      & ( ~ member(esk1_2(X4,X5),X5)
        | subset(X4,X5) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[subset_defn])])])])])])]) ).

cnf(c_0_10,plain,
    ( member(X1,X2)
    | ~ member(X1,difference(X2,X3)) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_11,plain,
    ( subset(X1,X2)
    | member(esk1_2(X1,X2),X1) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

fof(c_0_12,plain,
    ! [X3,X4,X3,X4] :
      ( ( subset(X3,X4)
        | X3 != X4 )
      & ( subset(X4,X3)
        | X3 != X4 )
      & ( ~ subset(X3,X4)
        | ~ subset(X4,X3)
        | X3 = X4 ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[equal_defn])])])])]) ).

cnf(c_0_13,plain,
    ( subset(X1,X2)
    | ~ member(esk1_2(X1,X2),X2) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

cnf(c_0_14,plain,
    ( subset(difference(X1,X2),X3)
    | member(esk1_2(difference(X1,X2),X3),X1) ),
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

cnf(c_0_15,plain,
    ( ~ member(X1,difference(X2,X3))
    | ~ member(X1,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_16,plain,
    ( X1 = X2
    | ~ subset(X2,X1)
    | ~ subset(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_12]) ).

cnf(c_0_17,plain,
    subset(difference(X1,X2),X1),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_18,plain,
    ( subset(difference(X1,X2),X3)
    | ~ member(esk1_2(difference(X1,X2),X3),X2) ),
    inference(spm,[status(thm)],[c_0_15,c_0_11]) ).

cnf(c_0_19,plain,
    ( difference(X1,X2) = X1
    | ~ subset(X1,difference(X1,X2)) ),
    inference(spm,[status(thm)],[c_0_16,c_0_17]) ).

cnf(c_0_20,plain,
    subset(difference(X1,X1),X2),
    inference(spm,[status(thm)],[c_0_18,c_0_14]) ).

cnf(c_0_21,plain,
    ( member(X1,X2)
    | ~ member(X1,X3)
    | ~ subset(X3,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_9]) ).

fof(c_0_22,plain,
    ! [X4,X5,X6,X4,X5,X6] :
      ( ( ~ member(X6,union(X4,X5))
        | member(X6,X4)
        | member(X6,X5) )
      & ( ~ member(X6,X4)
        | member(X6,union(X4,X5)) )
      & ( ~ member(X6,X5)
        | member(X6,union(X4,X5)) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[union_defn])])])])]) ).

cnf(c_0_23,plain,
    difference(difference(X1,X1),X2) = difference(X1,X1),
    inference(spm,[status(thm)],[c_0_19,c_0_20]) ).

cnf(c_0_24,plain,
    ( member(X1,X2)
    | ~ member(X1,difference(X3,X3)) ),
    inference(spm,[status(thm)],[c_0_21,c_0_20]) ).

cnf(c_0_25,plain,
    ( member(X1,X2)
    | member(X1,X3)
    | ~ member(X1,union(X3,X2)) ),
    inference(split_conjunct,[status(thm)],[c_0_22]) ).

cnf(c_0_26,plain,
    ( member(X1,union(X2,X3))
    | ~ member(X1,X3) ),
    inference(split_conjunct,[status(thm)],[c_0_22]) ).

cnf(c_0_27,plain,
    ~ member(X1,difference(X2,X2)),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_23]),c_0_24]) ).

cnf(c_0_28,plain,
    ( subset(union(X1,X2),X3)
    | member(esk1_2(union(X1,X2),X3),X1)
    | member(esk1_2(union(X1,X2),X3),X2) ),
    inference(spm,[status(thm)],[c_0_25,c_0_11]) ).

cnf(c_0_29,plain,
    ( subset(X1,union(X2,X3))
    | ~ member(esk1_2(X1,union(X2,X3)),X3) ),
    inference(spm,[status(thm)],[c_0_13,c_0_26]) ).

fof(c_0_30,plain,
    ! [X3,X4] : union(X3,X4) = union(X4,X3),
    inference(variable_rename,[status(thm)],[commutativity_of_union]) ).

fof(c_0_31,plain,
    ! [X4,X5,X6,X4,X5,X6] :
      ( ( member(X6,X4)
        | ~ member(X6,intersection(X4,X5)) )
      & ( member(X6,X5)
        | ~ member(X6,intersection(X4,X5)) )
      & ( ~ member(X6,X4)
        | ~ member(X6,X5)
        | member(X6,intersection(X4,X5)) ) ),
    inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[intersection_defn])])])])]) ).

cnf(c_0_32,plain,
    ( subset(union(X1,difference(X2,X2)),X3)
    | member(esk1_2(union(X1,difference(X2,X2)),X3),X1) ),
    inference(spm,[status(thm)],[c_0_27,c_0_28]) ).

cnf(c_0_33,plain,
    subset(X1,union(X2,X1)),
    inference(spm,[status(thm)],[c_0_29,c_0_11]) ).

cnf(c_0_34,plain,
    union(X1,X2) = union(X2,X1),
    inference(split_conjunct,[status(thm)],[c_0_30]) ).

cnf(c_0_35,plain,
    ( member(X1,X3)
    | ~ member(X1,intersection(X2,X3)) ),
    inference(split_conjunct,[status(thm)],[c_0_31]) ).

cnf(c_0_36,plain,
    subset(union(X1,difference(X2,X2)),X1),
    inference(spm,[status(thm)],[c_0_13,c_0_32]) ).

cnf(c_0_37,plain,
    subset(X1,union(X1,X2)),
    inference(spm,[status(thm)],[c_0_33,c_0_34]) ).

cnf(c_0_38,plain,
    ( subset(difference(X1,union(X2,X3)),X4)
    | ~ member(esk1_2(difference(X1,union(X2,X3)),X4),X3) ),
    inference(spm,[status(thm)],[c_0_18,c_0_26]) ).

cnf(c_0_39,plain,
    ( subset(intersection(X1,X2),X3)
    | member(esk1_2(intersection(X1,X2),X3),X2) ),
    inference(spm,[status(thm)],[c_0_35,c_0_11]) ).

cnf(c_0_40,plain,
    ( member(X1,X2)
    | ~ member(X1,intersection(X2,X3)) ),
    inference(split_conjunct,[status(thm)],[c_0_31]) ).

cnf(c_0_41,plain,
    union(X1,difference(X2,X2)) = X1,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_36]),c_0_37])]) ).

cnf(c_0_42,plain,
    subset(difference(X1,union(X2,X1)),X3),
    inference(spm,[status(thm)],[c_0_38,c_0_14]) ).

cnf(c_0_43,plain,
    ( subset(intersection(X1,difference(X2,X3)),X4)
    | ~ member(esk1_2(intersection(X1,difference(X2,X3)),X4),X3) ),
    inference(spm,[status(thm)],[c_0_15,c_0_39]) ).

cnf(c_0_44,plain,
    ( subset(intersection(X1,X2),X3)
    | member(esk1_2(intersection(X1,X2),X3),X1) ),
    inference(spm,[status(thm)],[c_0_40,c_0_11]) ).

cnf(c_0_45,plain,
    ( member(X1,difference(X2,X3))
    | member(X1,X3)
    | ~ member(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

cnf(c_0_46,plain,
    ( member(X1,intersection(X2,X3))
    | ~ member(X1,X3)
    | ~ member(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_31]) ).

cnf(c_0_47,plain,
    subset(difference(X1,X2),union(X3,X1)),
    inference(spm,[status(thm)],[c_0_29,c_0_14]) ).

cnf(c_0_48,plain,
    union(difference(X1,X1),X2) = X2,
    inference(spm,[status(thm)],[c_0_34,c_0_41]) ).

cnf(c_0_49,plain,
    difference(difference(X1,union(X2,X1)),X3) = difference(X1,union(X2,X1)),
    inference(spm,[status(thm)],[c_0_19,c_0_42]) ).

cnf(c_0_50,plain,
    subset(intersection(X1,difference(X2,X1)),X3),
    inference(spm,[status(thm)],[c_0_43,c_0_44]) ).

cnf(c_0_51,plain,
    ( subset(X1,difference(X2,X3))
    | member(esk1_2(X1,difference(X2,X3)),X3)
    | ~ member(esk1_2(X1,difference(X2,X3)),X2) ),
    inference(spm,[status(thm)],[c_0_13,c_0_45]) ).

cnf(c_0_52,plain,
    ( subset(X1,intersection(X2,X3))
    | ~ member(esk1_2(X1,intersection(X2,X3)),X3)
    | ~ member(esk1_2(X1,intersection(X2,X3)),X2) ),
    inference(spm,[status(thm)],[c_0_13,c_0_46]) ).

cnf(c_0_53,plain,
    subset(difference(X1,X2),union(X1,X3)),
    inference(spm,[status(thm)],[c_0_47,c_0_34]) ).

cnf(c_0_54,plain,
    union(difference(X1,union(X2,X1)),X3) = X3,
    inference(spm,[status(thm)],[c_0_48,c_0_49]) ).

cnf(c_0_55,plain,
    difference(intersection(X1,difference(X2,X1)),X3) = intersection(X1,difference(X2,X1)),
    inference(spm,[status(thm)],[c_0_19,c_0_50]) ).

cnf(c_0_56,plain,
    ( subset(X1,difference(X1,X2))
    | member(esk1_2(X1,difference(X1,X2)),X2) ),
    inference(spm,[status(thm)],[c_0_51,c_0_11]) ).

cnf(c_0_57,plain,
    ( subset(X1,intersection(X2,X1))
    | ~ member(esk1_2(X1,intersection(X2,X1)),X2) ),
    inference(spm,[status(thm)],[c_0_52,c_0_11]) ).

fof(c_0_58,plain,
    ! [X3,X4] : intersection(X3,X4) = intersection(X4,X3),
    inference(variable_rename,[status(thm)],[commutativity_of_intersection]) ).

cnf(c_0_59,plain,
    ( union(X1,X2) = difference(X1,X3)
    | ~ subset(union(X1,X2),difference(X1,X3)) ),
    inference(spm,[status(thm)],[c_0_16,c_0_53]) ).

cnf(c_0_60,plain,
    union(intersection(X1,difference(X2,X1)),X3) = X3,
    inference(spm,[status(thm)],[c_0_54,c_0_55]) ).

cnf(c_0_61,plain,
    ( subset(intersection(X1,X2),intersection(X3,X1))
    | ~ member(esk1_2(intersection(X1,X2),intersection(X3,X1)),X3) ),
    inference(spm,[status(thm)],[c_0_52,c_0_44]) ).

cnf(c_0_62,plain,
    ( subset(intersection(X1,difference(X2,X3)),X4)
    | member(esk1_2(intersection(X1,difference(X2,X3)),X4),X2) ),
    inference(spm,[status(thm)],[c_0_10,c_0_39]) ).

cnf(c_0_63,plain,
    subset(X1,difference(X1,difference(X2,X2))),
    inference(spm,[status(thm)],[c_0_27,c_0_56]) ).

cnf(c_0_64,plain,
    ( subset(difference(difference(X1,X2),X3),X4)
    | member(esk1_2(difference(difference(X1,X2),X3),X4),X1) ),
    inference(spm,[status(thm)],[c_0_10,c_0_14]) ).

cnf(c_0_65,plain,
    ( subset(X1,intersection(union(X2,X3),X1))
    | ~ member(esk1_2(X1,intersection(union(X2,X3),X1)),X3) ),
    inference(spm,[status(thm)],[c_0_57,c_0_26]) ).

cnf(c_0_66,plain,
    intersection(X1,X2) = intersection(X2,X1),
    inference(split_conjunct,[status(thm)],[c_0_58]) ).

cnf(c_0_67,plain,
    subset(intersection(X1,X2),X2),
    inference(spm,[status(thm)],[c_0_13,c_0_39]) ).

cnf(c_0_68,plain,
    ( subset(difference(X1,intersection(X2,X3)),X4)
    | ~ member(esk1_2(difference(X1,intersection(X2,X3)),X4),X3)
    | ~ member(esk1_2(difference(X1,intersection(X2,X3)),X4),X2) ),
    inference(spm,[status(thm)],[c_0_18,c_0_46]) ).

cnf(c_0_69,plain,
    ( X1 = intersection(X2,difference(X3,X2))
    | ~ subset(X1,intersection(X2,difference(X3,X2))) ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_59,c_0_60]),c_0_55]),c_0_55]) ).

cnf(c_0_70,plain,
    subset(intersection(X1,difference(X2,X3)),intersection(X2,X1)),
    inference(spm,[status(thm)],[c_0_61,c_0_62]) ).

cnf(c_0_71,plain,
    difference(X1,difference(X2,X2)) = X1,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_63]),c_0_17])]) ).

cnf(c_0_72,plain,
    subset(difference(difference(X1,X2),X1),X3),
    inference(spm,[status(thm)],[c_0_18,c_0_64]) ).

cnf(c_0_73,plain,
    subset(X1,intersection(X1,union(X2,X1))),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_65,c_0_11]),c_0_66]) ).

cnf(c_0_74,plain,
    subset(intersection(X1,X2),X1),
    inference(spm,[status(thm)],[c_0_67,c_0_66]) ).

cnf(c_0_75,plain,
    ( subset(difference(X1,intersection(X2,X1)),X3)
    | ~ member(esk1_2(difference(X1,intersection(X2,X1)),X3),X2) ),
    inference(spm,[status(thm)],[c_0_68,c_0_14]) ).

cnf(c_0_76,plain,
    intersection(difference(X1,X2),difference(X2,X3)) = intersection(X2,difference(X1,X2)),
    inference(spm,[status(thm)],[c_0_69,c_0_70]) ).

cnf(c_0_77,plain,
    difference(X1,intersection(X2,difference(X3,X2))) = X1,
    inference(spm,[status(thm)],[c_0_71,c_0_55]) ).

cnf(c_0_78,plain,
    difference(difference(difference(X1,X2),X1),X3) = difference(difference(X1,X2),X1),
    inference(spm,[status(thm)],[c_0_19,c_0_72]) ).

cnf(c_0_79,plain,
    ( member(X1,union(X2,X3))
    | ~ member(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_22]) ).

cnf(c_0_80,plain,
    ( subset(union(X1,difference(X2,X3)),X4)
    | member(esk1_2(union(X1,difference(X2,X3)),X4),X1)
    | member(esk1_2(union(X1,difference(X2,X3)),X4),X2) ),
    inference(spm,[status(thm)],[c_0_10,c_0_28]) ).

cnf(c_0_81,plain,
    intersection(X1,union(X2,X1)) = X1,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_73]),c_0_74])]) ).

cnf(c_0_82,plain,
    ( subset(difference(X1,X2),X3)
    | ~ member(esk1_2(difference(X1,X2),X3),difference(X4,X1)) ),
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_75,c_0_76]),c_0_77]),c_0_77]) ).

cnf(c_0_83,plain,
    difference(X1,difference(difference(X2,X3),X2)) = X1,
    inference(spm,[status(thm)],[c_0_71,c_0_78]) ).

cnf(c_0_84,plain,
    ( subset(X1,union(X2,X3))
    | ~ member(esk1_2(X1,union(X2,X3)),X2) ),
    inference(spm,[status(thm)],[c_0_13,c_0_79]) ).

cnf(c_0_85,plain,
    ( subset(union(X1,difference(X1,X2)),X3)
    | member(esk1_2(union(X1,difference(X1,X2)),X3),X1) ),
    inference(ef,[status(thm)],[c_0_80]) ).

cnf(c_0_86,plain,
    intersection(X1,union(X1,X2)) = X1,
    inference(spm,[status(thm)],[c_0_81,c_0_34]) ).

cnf(c_0_87,plain,
    ( subset(difference(X1,difference(X2,X3)),X4)
    | member(esk1_2(difference(X1,difference(X2,X3)),X4),X3)
    | ~ member(esk1_2(difference(X1,difference(X2,X3)),X4),X2) ),
    inference(spm,[status(thm)],[c_0_18,c_0_45]) ).

cnf(c_0_88,plain,
    ( subset(X1,X2)
    | ~ member(esk1_2(X1,X2),difference(X3,X1)) ),
    inference(spm,[status(thm)],[c_0_82,c_0_83]) ).

cnf(c_0_89,plain,
    ( subset(X1,union(X2,union(X3,X4)))
    | ~ member(esk1_2(X1,union(X2,union(X3,X4))),X4) ),
    inference(spm,[status(thm)],[c_0_29,c_0_26]) ).

cnf(c_0_90,plain,
    ( subset(union(X1,X2),union(X1,X3))
    | member(esk1_2(union(X1,X2),union(X1,X3)),X2) ),
    inference(spm,[status(thm)],[c_0_84,c_0_28]) ).

cnf(c_0_91,plain,
    subset(union(X1,difference(X1,X2)),X1),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_85]),c_0_86]) ).

cnf(c_0_92,plain,
    ( subset(difference(X1,X2),intersection(X3,X1))
    | ~ member(esk1_2(difference(X1,X2),intersection(X3,X1)),X3) ),
    inference(spm,[status(thm)],[c_0_52,c_0_14]) ).

cnf(c_0_93,plain,
    ( subset(difference(X1,difference(X1,X2)),X3)
    | member(esk1_2(difference(X1,difference(X1,X2)),X3),X2) ),
    inference(spm,[status(thm)],[c_0_87,c_0_14]) ).

cnf(c_0_94,plain,
    ( subset(intersection(X1,X2),difference(X1,X3))
    | member(esk1_2(intersection(X1,X2),difference(X1,X3)),X3) ),
    inference(spm,[status(thm)],[c_0_51,c_0_44]) ).

cnf(c_0_95,plain,
    subset(X1,difference(X1,difference(X2,X1))),
    inference(spm,[status(thm)],[c_0_88,c_0_56]) ).

cnf(c_0_96,plain,
    subset(union(X1,X2),union(X1,union(X3,X2))),
    inference(spm,[status(thm)],[c_0_89,c_0_90]) ).

cnf(c_0_97,plain,
    union(X1,difference(X1,X2)) = X1,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_91]),c_0_37])]) ).

cnf(c_0_98,plain,
    subset(difference(X1,difference(X1,X2)),intersection(X2,X1)),
    inference(spm,[status(thm)],[c_0_92,c_0_93]) ).

cnf(c_0_99,plain,
    subset(intersection(X1,difference(X2,X3)),difference(X1,X3)),
    inference(spm,[status(thm)],[c_0_43,c_0_94]) ).

cnf(c_0_100,plain,
    difference(X1,difference(X2,X1)) = X1,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_95]),c_0_17])]) ).

cnf(c_0_101,plain,
    subset(union(X1,difference(X2,X3)),union(X1,X2)),
    inference(spm,[status(thm)],[c_0_96,c_0_97]) ).

cnf(c_0_102,plain,
    subset(difference(X1,difference(X1,X2)),intersection(X1,X2)),
    inference(spm,[status(thm)],[c_0_98,c_0_66]) ).

cnf(c_0_103,plain,
    subset(intersection(X1,X2),difference(X1,difference(X3,X2))),
    inference(spm,[status(thm)],[c_0_99,c_0_100]) ).

cnf(c_0_104,plain,
    ( union(X1,difference(X2,X3)) = union(X1,X2)
    | ~ subset(union(X1,X2),union(X1,difference(X2,X3))) ),
    inference(spm,[status(thm)],[c_0_16,c_0_101]) ).

cnf(c_0_105,plain,
    difference(X1,difference(X1,X2)) = intersection(X1,X2),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_102]),c_0_103])]) ).

cnf(c_0_106,plain,
    ( subset(X1,union(X2,difference(X3,X4)))
    | member(esk1_2(X1,union(X2,difference(X3,X4))),X4)
    | ~ member(esk1_2(X1,union(X2,difference(X3,X4))),X3) ),
    inference(spm,[status(thm)],[c_0_29,c_0_45]) ).

cnf(c_0_107,plain,
    subset(difference(X1,X2),intersection(X1,difference(X1,X2))),
    inference(spm,[status(thm)],[c_0_57,c_0_14]) ).

fof(c_0_108,negated_conjecture,
    ~ ! [X1,X2] : union(intersection(X1,X2),difference(X1,X2)) = X1,
    inference(assume_negation,[status(cth)],[prove_union_intersection_difference]) ).

cnf(c_0_109,plain,
    ( union(X1,difference(X2,X3)) = union(X2,X1)
    | ~ subset(union(X2,X1),union(X1,difference(X2,X3))) ),
    inference(spm,[status(thm)],[c_0_104,c_0_34]) ).

cnf(c_0_110,plain,
    union(X1,intersection(X1,X2)) = X1,
    inference(spm,[status(thm)],[c_0_97,c_0_105]) ).

cnf(c_0_111,plain,
    ( subset(X1,union(X2,difference(X1,X3)))
    | member(esk1_2(X1,union(X2,difference(X1,X3))),X3) ),
    inference(spm,[status(thm)],[c_0_106,c_0_11]) ).

cnf(c_0_112,plain,
    intersection(X1,difference(X1,X2)) = difference(X1,X2),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_16,c_0_107]),c_0_67])]) ).

fof(c_0_113,negated_conjecture,
    union(intersection(esk3_0,esk4_0),difference(esk3_0,esk4_0)) != esk3_0,
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_108])])]) ).

cnf(c_0_114,plain,
    ( union(intersection(X1,X2),difference(X1,X3)) = X1
    | ~ subset(X1,union(intersection(X1,X2),difference(X1,X3))) ),
    inference(spm,[status(thm)],[c_0_109,c_0_110]) ).

cnf(c_0_115,plain,
    subset(X1,union(X2,difference(X1,X2))),
    inference(spm,[status(thm)],[c_0_84,c_0_111]) ).

cnf(c_0_116,plain,
    difference(X1,intersection(X1,X2)) = difference(X1,X2),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_105,c_0_105]),c_0_112]) ).

cnf(c_0_117,negated_conjecture,
    union(intersection(esk3_0,esk4_0),difference(esk3_0,esk4_0)) != esk3_0,
    inference(split_conjunct,[status(thm)],[c_0_113]) ).

cnf(c_0_118,plain,
    union(intersection(X1,X2),difference(X1,X2)) = X1,
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_114,c_0_115]),c_0_116]) ).

cnf(c_0_119,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_117,c_0_118])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SET608+3 : TPTP v8.1.0. Released v2.2.0.
% 0.07/0.13  % Command  : run_ET %s %d
% 0.14/0.34  % Computer : n011.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 600
% 0.14/0.34  % DateTime : Sun Jul 10 07:11:11 EDT 2022
% 0.14/0.34  % CPUTime  : 
% 0.35/23.40  eprover: CPU time limit exceeded, terminating
% 0.35/23.41  eprover: CPU time limit exceeded, terminating
% 0.35/23.41  eprover: CPU time limit exceeded, terminating
% 0.35/23.43  eprover: CPU time limit exceeded, terminating
% 0.40/34.57  # Running protocol protocol_eprover_4a02c828a8cc55752123edbcc1ad40e453c11447 for 23 seconds:
% 0.40/34.57  
% 0.40/34.57  # Failure: Resource limit exceeded (time)
% 0.40/34.57  # OLD status Res
% 0.40/34.57  # SinE strategy is GSinE(CountFormulas,hypos,1.4,,04,100,1.0)
% 0.40/34.57  # Preprocessing time       : 0.015 s
% 0.40/34.57  # Running protocol protocol_eprover_f171197f65f27d1ba69648a20c844832c84a5dd7 for 23 seconds:
% 0.40/34.57  # Preprocessing time       : 0.009 s
% 0.40/34.57  
% 0.40/34.57  # Proof found!
% 0.40/34.57  # SZS status Theorem
% 0.40/34.57  # SZS output start CNFRefutation
% See solution above
% 0.40/34.57  # Proof object total steps             : 120
% 0.40/34.57  # Proof object clause steps            : 103
% 0.40/34.57  # Proof object formula steps           : 17
% 0.40/34.57  # Proof object conjectures             : 5
% 0.40/34.57  # Proof object clause conjectures      : 2
% 0.40/34.57  # Proof object formula conjectures     : 3
% 0.40/34.57  # Proof object initial clauses used    : 16
% 0.40/34.57  # Proof object initial formulas used   : 8
% 0.40/34.57  # Proof object generating inferences   : 86
% 0.40/34.57  # Proof object simplifying inferences  : 25
% 0.40/34.57  # Training examples: 0 positive, 0 negative
% 0.40/34.57  # Parsed axioms                        : 10
% 0.40/34.57  # Removed by relevancy pruning/SinE    : 0
% 0.40/34.57  # Initial clauses                      : 23
% 0.40/34.57  # Removed in clause preprocessing      : 2
% 0.40/34.57  # Initial clauses in saturation        : 21
% 0.40/34.57  # Processed clauses                    : 33276
% 0.40/34.57  # ...of these trivial                  : 1336
% 0.40/34.57  # ...subsumed                          : 29493
% 0.40/34.57  # ...remaining for further processing  : 2447
% 0.40/34.57  # Other redundant clauses eliminated   : 2
% 0.40/34.57  # Clauses deleted for lack of memory   : 691784
% 0.40/34.57  # Backward-subsumed                    : 54
% 0.40/34.57  # Backward-rewritten                   : 100
% 0.40/34.57  # Generated clauses                    : 968468
% 0.40/34.57  # ...of the previous two non-trivial   : 858309
% 0.40/34.57  # Contextual simplify-reflections      : 2083
% 0.40/34.57  # Paramodulations                      : 966218
% 0.40/34.57  # Factorizations                       : 2248
% 0.40/34.57  # Equation resolutions                 : 2
% 0.40/34.57  # Current number of processed clauses  : 2291
% 0.40/34.57  #    Positive orientable unit clauses  : 436
% 0.40/34.57  #    Positive unorientable unit clauses: 21
% 0.40/34.57  #    Negative unit clauses             : 108
% 0.40/34.57  #    Non-unit-clauses                  : 1726
% 0.40/34.57  # Current number of unprocessed clauses: 107624
% 0.40/34.57  # ...number of literals in the above   : 233498
% 0.40/34.57  # Current number of archived formulas  : 0
% 0.40/34.57  # Current number of archived clauses   : 154
% 0.40/34.57  # Clause-clause subsumption calls (NU) : 434551
% 0.40/34.57  # Rec. Clause-clause subsumption calls : 277829
% 0.40/34.57  # Non-unit clause-clause subsumptions  : 7338
% 0.40/34.57  # Unit Clause-clause subsumption calls : 63545
% 0.40/34.57  # Rewrite failures with RHS unbound    : 1885
% 0.40/34.57  # BW rewrite match attempts            : 5343
% 0.40/34.57  # BW rewrite match successes           : 227
% 0.40/34.57  # Condensation attempts                : 0
% 0.40/34.57  # Condensation successes               : 0
% 0.40/34.57  # Termbank termtop insertions          : 17918911
% 0.40/34.57  
% 0.40/34.57  # -------------------------------------------------
% 0.40/34.57  # User time                : 10.771 s
% 0.40/34.57  # System time              : 0.115 s
% 0.40/34.57  # Total time               : 10.886 s
% 0.40/34.57  # Maximum resident set size: 141080 pages
% 0.40/46.43  eprover: CPU time limit exceeded, terminating
% 0.40/46.44  eprover: CPU time limit exceeded, terminating
% 0.40/46.45  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.40/46.45  eprover: No such file or directory
% 0.40/46.45  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.40/46.45  eprover: No such file or directory
% 0.40/46.45  eprover: CPU time limit exceeded, terminating
% 0.40/46.46  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.40/46.46  eprover: No such file or directory
% 0.40/46.46  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.40/46.46  eprover: No such file or directory
% 0.40/46.46  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.40/46.46  eprover: No such file or directory
% 0.40/46.46  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.40/46.46  eprover: No such file or directory
% 0.40/46.46  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.40/46.46  eprover: No such file or directory
% 0.40/46.47  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.40/46.47  eprover: No such file or directory
% 0.40/46.47  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.40/46.47  eprover: No such file or directory
% 0.40/46.47  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.40/46.47  eprover: No such file or directory
% 0.40/46.47  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.40/46.47  eprover: No such file or directory
% 0.40/46.47  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.40/46.47  eprover: No such file or directory
% 0.40/46.47  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.40/46.47  eprover: No such file or directory
% 0.40/46.48  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.40/46.48  eprover: No such file or directory
% 0.40/46.48  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.40/46.48  eprover: No such file or directory
% 0.40/46.48  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.40/46.48  eprover: No such file or directory
% 0.40/46.48  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.40/46.48  eprover: No such file or directory
% 0.40/46.48  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.40/46.48  eprover: No such file or directory
% 0.40/46.48  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.40/46.48  eprover: No such file or directory
% 0.40/46.49  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.40/46.49  eprover: No such file or directory
% 0.40/46.49  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.40/46.49  eprover: No such file or directory
% 0.40/46.49  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.40/46.49  eprover: No such file or directory
% 0.40/46.49  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p.mepo_128.in
% 0.40/46.49  eprover: No such file or directory
% 0.40/46.49  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.40/46.49  eprover: No such file or directory
% 0.40/46.49  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.40/46.49  eprover: No such file or directory
% 0.40/46.50  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.40/46.50  eprover: No such file or directory
% 0.40/46.50  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.40/46.50  eprover: No such file or directory
% 0.40/46.50  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.40/46.50  eprover: No such file or directory
% 0.40/46.50  eprover: Cannot stat file /export/starexec/sandbox/solver/bin/../tmp/theBenchmark.p
% 0.40/46.50  eprover: No such file or directory
%------------------------------------------------------------------------------