TSTP Solution File: SET703+4 by CSE_E---1.5

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : SET703+4 : TPTP v8.1.2. Released v2.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s

% 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 : 300s
% WCLimit  : 300s
% DateTime : Thu Aug 31 14:35:17 EDT 2023

% Result   : Theorem 0.52s 0.64s
% Output   : CNFRefutation 0.52s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   24
%            Number of leaves      :   24
% Syntax   : Number of formulae    :   83 (  12 unt;  17 typ;   0 def)
%            Number of atoms       :  165 (  48 equ)
%            Maximal formula atoms :    7 (   2 avg)
%            Number of connectives :  164 (  65   ~;  81   |;  11   &)
%                                         (   6 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :   10 (   4 avg)
%            Maximal term depth    :    4 (   2 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   24 (  14   >;  10   *;   0   +;   0  <<)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :   14 (  14 usr;   3 con; 0-2 aty)
%            Number of variables   :   80 (   6 sgn;  36   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
tff(decl_22,type,
    subset: ( $i * $i ) > $o ).

tff(decl_23,type,
    member: ( $i * $i ) > $o ).

tff(decl_24,type,
    equal_set: ( $i * $i ) > $o ).

tff(decl_25,type,
    power_set: $i > $i ).

tff(decl_26,type,
    intersection: ( $i * $i ) > $i ).

tff(decl_27,type,
    union: ( $i * $i ) > $i ).

tff(decl_28,type,
    empty_set: $i ).

tff(decl_29,type,
    difference: ( $i * $i ) > $i ).

tff(decl_30,type,
    singleton: $i > $i ).

tff(decl_31,type,
    unordered_pair: ( $i * $i ) > $i ).

tff(decl_32,type,
    sum: $i > $i ).

tff(decl_33,type,
    product: $i > $i ).

tff(decl_34,type,
    esk1_2: ( $i * $i ) > $i ).

tff(decl_35,type,
    esk2_2: ( $i * $i ) > $i ).

tff(decl_36,type,
    esk3_2: ( $i * $i ) > $i ).

tff(decl_37,type,
    esk4_0: $i ).

tff(decl_38,type,
    esk5_0: $i ).

fof(thI41,conjecture,
    ! [X1,X2] : equal_set(union(singleton(X1),singleton(X2)),unordered_pair(X1,X2)),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',thI41) ).

fof(equal_set,axiom,
    ! [X1,X2] :
      ( equal_set(X1,X2)
    <=> ( subset(X1,X2)
        & subset(X2,X1) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET006+0.ax',equal_set) ).

fof(subset,axiom,
    ! [X1,X2] :
      ( subset(X1,X2)
    <=> ! [X3] :
          ( member(X3,X1)
         => member(X3,X2) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET006+0.ax',subset) ).

fof(power_set,axiom,
    ! [X3,X1] :
      ( member(X3,power_set(X1))
    <=> subset(X3,X1) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET006+0.ax',power_set) ).

fof(union,axiom,
    ! [X3,X1,X2] :
      ( member(X3,union(X1,X2))
    <=> ( member(X3,X1)
        | member(X3,X2) ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET006+0.ax',union) ).

fof(singleton,axiom,
    ! [X3,X1] :
      ( member(X3,singleton(X1))
    <=> X3 = X1 ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET006+0.ax',singleton) ).

fof(unordered_pair,axiom,
    ! [X3,X1,X2] :
      ( member(X3,unordered_pair(X1,X2))
    <=> ( X3 = X1
        | X3 = X2 ) ),
    file('/export/starexec/sandbox2/benchmark/Axioms/SET006+0.ax',unordered_pair) ).

fof(c_0_7,negated_conjecture,
    ~ ! [X1,X2] : equal_set(union(singleton(X1),singleton(X2)),unordered_pair(X1,X2)),
    inference(assume_negation,[status(cth)],[thI41]) ).

fof(c_0_8,negated_conjecture,
    ~ equal_set(union(singleton(esk4_0),singleton(esk5_0)),unordered_pair(esk4_0,esk5_0)),
    inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])]) ).

fof(c_0_9,plain,
    ! [X12,X13] :
      ( ( subset(X12,X13)
        | ~ equal_set(X12,X13) )
      & ( subset(X13,X12)
        | ~ equal_set(X12,X13) )
      & ( ~ subset(X12,X13)
        | ~ subset(X13,X12)
        | equal_set(X12,X13) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[equal_set])])]) ).

cnf(c_0_10,negated_conjecture,
    ~ equal_set(union(singleton(esk4_0),singleton(esk5_0)),unordered_pair(esk4_0,esk5_0)),
    inference(split_conjunct,[status(thm)],[c_0_8]) ).

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

fof(c_0_12,plain,
    ! [X6,X7,X8,X9,X10] :
      ( ( ~ subset(X6,X7)
        | ~ member(X8,X6)
        | member(X8,X7) )
      & ( member(esk1_2(X9,X10),X9)
        | subset(X9,X10) )
      & ( ~ member(esk1_2(X9,X10),X10)
        | subset(X9,X10) ) ),
    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)],[subset])])])])])]) ).

cnf(c_0_13,negated_conjecture,
    ( ~ subset(unordered_pair(esk4_0,esk5_0),union(singleton(esk4_0),singleton(esk5_0)))
    | ~ subset(union(singleton(esk4_0),singleton(esk5_0)),unordered_pair(esk4_0,esk5_0)) ),
    inference(spm,[status(thm)],[c_0_10,c_0_11]) ).

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

fof(c_0_15,plain,
    ! [X14,X15] :
      ( ( ~ member(X14,power_set(X15))
        | subset(X14,X15) )
      & ( ~ subset(X14,X15)
        | member(X14,power_set(X15)) ) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[power_set])]) ).

fof(c_0_16,plain,
    ! [X19,X20,X21] :
      ( ( ~ member(X19,union(X20,X21))
        | member(X19,X20)
        | member(X19,X21) )
      & ( ~ member(X19,X20)
        | member(X19,union(X20,X21)) )
      & ( ~ member(X19,X21)
        | member(X19,union(X20,X21)) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[union])])]) ).

cnf(c_0_17,negated_conjecture,
    ( member(esk1_2(union(singleton(esk4_0),singleton(esk5_0)),unordered_pair(esk4_0,esk5_0)),union(singleton(esk4_0),singleton(esk5_0)))
    | ~ subset(unordered_pair(esk4_0,esk5_0),union(singleton(esk4_0),singleton(esk5_0))) ),
    inference(spm,[status(thm)],[c_0_13,c_0_14]) ).

cnf(c_0_18,plain,
    ( subset(X1,X2)
    | ~ member(X1,power_set(X2)) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

fof(c_0_19,plain,
    ! [X26,X27] :
      ( ( ~ member(X26,singleton(X27))
        | X26 = X27 )
      & ( X26 != X27
        | member(X26,singleton(X27)) ) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[singleton])]) ).

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

cnf(c_0_21,negated_conjecture,
    ( member(esk1_2(union(singleton(esk4_0),singleton(esk5_0)),unordered_pair(esk4_0,esk5_0)),union(singleton(esk4_0),singleton(esk5_0)))
    | ~ member(unordered_pair(esk4_0,esk5_0),power_set(union(singleton(esk4_0),singleton(esk5_0)))) ),
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_22,plain,
    ( X1 = X2
    | ~ member(X1,singleton(X2)) ),
    inference(split_conjunct,[status(thm)],[c_0_19]) ).

cnf(c_0_23,negated_conjecture,
    ( member(esk1_2(union(singleton(esk4_0),singleton(esk5_0)),unordered_pair(esk4_0,esk5_0)),singleton(esk4_0))
    | member(esk1_2(union(singleton(esk4_0),singleton(esk5_0)),unordered_pair(esk4_0,esk5_0)),singleton(esk5_0))
    | ~ member(unordered_pair(esk4_0,esk5_0),power_set(union(singleton(esk4_0),singleton(esk5_0)))) ),
    inference(spm,[status(thm)],[c_0_20,c_0_21]) ).

fof(c_0_24,plain,
    ! [X28,X29,X30] :
      ( ( ~ member(X28,unordered_pair(X29,X30))
        | X28 = X29
        | X28 = X30 )
      & ( X28 != X29
        | member(X28,unordered_pair(X29,X30)) )
      & ( X28 != X30
        | member(X28,unordered_pair(X29,X30)) ) ),
    inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[unordered_pair])])]) ).

cnf(c_0_25,plain,
    ( member(X1,power_set(X2))
    | ~ subset(X1,X2) ),
    inference(split_conjunct,[status(thm)],[c_0_15]) ).

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

cnf(c_0_27,negated_conjecture,
    ( esk1_2(union(singleton(esk4_0),singleton(esk5_0)),unordered_pair(esk4_0,esk5_0)) = esk5_0
    | member(esk1_2(union(singleton(esk4_0),singleton(esk5_0)),unordered_pair(esk4_0,esk5_0)),singleton(esk4_0))
    | ~ member(unordered_pair(esk4_0,esk5_0),power_set(union(singleton(esk4_0),singleton(esk5_0)))) ),
    inference(spm,[status(thm)],[c_0_22,c_0_23]) ).

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

cnf(c_0_29,plain,
    ( member(esk1_2(X1,X2),X1)
    | member(X1,power_set(X2)) ),
    inference(spm,[status(thm)],[c_0_25,c_0_14]) ).

cnf(c_0_30,negated_conjecture,
    ( ~ member(esk1_2(union(singleton(esk4_0),singleton(esk5_0)),unordered_pair(esk4_0,esk5_0)),unordered_pair(esk4_0,esk5_0))
    | ~ subset(unordered_pair(esk4_0,esk5_0),union(singleton(esk4_0),singleton(esk5_0))) ),
    inference(spm,[status(thm)],[c_0_13,c_0_26]) ).

cnf(c_0_31,negated_conjecture,
    ( esk1_2(union(singleton(esk4_0),singleton(esk5_0)),unordered_pair(esk4_0,esk5_0)) = esk5_0
    | esk1_2(union(singleton(esk4_0),singleton(esk5_0)),unordered_pair(esk4_0,esk5_0)) = esk4_0
    | ~ member(unordered_pair(esk4_0,esk5_0),power_set(union(singleton(esk4_0),singleton(esk5_0)))) ),
    inference(spm,[status(thm)],[c_0_22,c_0_27]) ).

cnf(c_0_32,plain,
    ( esk1_2(unordered_pair(X1,X2),X3) = X1
    | esk1_2(unordered_pair(X1,X2),X3) = X2
    | member(unordered_pair(X1,X2),power_set(X3)) ),
    inference(spm,[status(thm)],[c_0_28,c_0_29]) ).

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

cnf(c_0_34,negated_conjecture,
    ( ~ member(esk1_2(union(singleton(esk4_0),singleton(esk5_0)),unordered_pair(esk4_0,esk5_0)),unordered_pair(esk4_0,esk5_0))
    | ~ member(unordered_pair(esk4_0,esk5_0),power_set(union(singleton(esk4_0),singleton(esk5_0)))) ),
    inference(spm,[status(thm)],[c_0_30,c_0_18]) ).

cnf(c_0_35,negated_conjecture,
    ( esk1_2(unordered_pair(esk4_0,esk5_0),union(singleton(esk4_0),singleton(esk5_0))) = esk5_0
    | esk1_2(unordered_pair(esk4_0,esk5_0),union(singleton(esk4_0),singleton(esk5_0))) = esk4_0
    | esk1_2(union(singleton(esk4_0),singleton(esk5_0)),unordered_pair(esk4_0,esk5_0)) = esk4_0
    | esk1_2(union(singleton(esk4_0),singleton(esk5_0)),unordered_pair(esk4_0,esk5_0)) = esk5_0 ),
    inference(spm,[status(thm)],[c_0_31,c_0_32]) ).

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

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

cnf(c_0_38,negated_conjecture,
    ( esk1_2(union(singleton(esk4_0),singleton(esk5_0)),unordered_pair(esk4_0,esk5_0)) = esk4_0
    | esk1_2(unordered_pair(esk4_0,esk5_0),union(singleton(esk4_0),singleton(esk5_0))) = esk4_0
    | esk1_2(unordered_pair(esk4_0,esk5_0),union(singleton(esk4_0),singleton(esk5_0))) = esk5_0 ),
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_35]),c_0_36])]),c_0_32]) ).

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

cnf(c_0_40,plain,
    ( member(X1,power_set(X2))
    | ~ member(esk1_2(X1,X2),X2) ),
    inference(spm,[status(thm)],[c_0_25,c_0_26]) ).

cnf(c_0_41,negated_conjecture,
    ( esk1_2(unordered_pair(esk4_0,esk5_0),union(singleton(esk4_0),singleton(esk5_0))) = esk5_0
    | esk1_2(unordered_pair(esk4_0,esk5_0),union(singleton(esk4_0),singleton(esk5_0))) = esk4_0 ),
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_34,c_0_38]),c_0_39])]),c_0_32]) ).

cnf(c_0_42,negated_conjecture,
    ( esk1_2(unordered_pair(esk4_0,esk5_0),union(singleton(esk4_0),singleton(esk5_0))) = esk4_0
    | member(unordered_pair(esk4_0,esk5_0),power_set(union(singleton(esk4_0),singleton(esk5_0))))
    | ~ member(esk5_0,union(singleton(esk4_0),singleton(esk5_0))) ),
    inference(spm,[status(thm)],[c_0_40,c_0_41]) ).

cnf(c_0_43,plain,
    ( member(X1,singleton(X2))
    | X1 != X2 ),
    inference(split_conjunct,[status(thm)],[c_0_19]) ).

cnf(c_0_44,negated_conjecture,
    ( ~ member(esk1_2(unordered_pair(esk4_0,esk5_0),union(singleton(esk4_0),singleton(esk5_0))),union(singleton(esk4_0),singleton(esk5_0)))
    | ~ member(esk1_2(union(singleton(esk4_0),singleton(esk5_0)),unordered_pair(esk4_0,esk5_0)),unordered_pair(esk4_0,esk5_0)) ),
    inference(spm,[status(thm)],[c_0_30,c_0_26]) ).

cnf(c_0_45,negated_conjecture,
    ( esk1_2(unordered_pair(esk4_0,esk5_0),union(singleton(esk4_0),singleton(esk5_0))) = esk4_0
    | esk1_2(union(singleton(esk4_0),singleton(esk5_0)),unordered_pair(esk4_0,esk5_0)) = esk4_0
    | esk1_2(union(singleton(esk4_0),singleton(esk5_0)),unordered_pair(esk4_0,esk5_0)) = esk5_0
    | ~ member(esk5_0,union(singleton(esk4_0),singleton(esk5_0))) ),
    inference(spm,[status(thm)],[c_0_31,c_0_42]) ).

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

cnf(c_0_47,plain,
    member(X1,singleton(X1)),
    inference(er,[status(thm)],[c_0_43]) ).

cnf(c_0_48,negated_conjecture,
    ( esk1_2(unordered_pair(esk4_0,esk5_0),union(singleton(esk4_0),singleton(esk5_0))) = esk4_0
    | ~ member(esk1_2(union(singleton(esk4_0),singleton(esk5_0)),unordered_pair(esk4_0,esk5_0)),unordered_pair(esk4_0,esk5_0))
    | ~ member(esk5_0,union(singleton(esk4_0),singleton(esk5_0))) ),
    inference(spm,[status(thm)],[c_0_44,c_0_41]) ).

cnf(c_0_49,negated_conjecture,
    ( esk1_2(union(singleton(esk4_0),singleton(esk5_0)),unordered_pair(esk4_0,esk5_0)) = esk5_0
    | esk1_2(union(singleton(esk4_0),singleton(esk5_0)),unordered_pair(esk4_0,esk5_0)) = esk4_0
    | esk1_2(unordered_pair(esk4_0,esk5_0),union(singleton(esk4_0),singleton(esk5_0))) = esk4_0 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_47])]) ).

cnf(c_0_50,negated_conjecture,
    ( esk1_2(union(singleton(esk4_0),singleton(esk5_0)),unordered_pair(esk4_0,esk5_0)) = esk4_0
    | esk1_2(unordered_pair(esk4_0,esk5_0),union(singleton(esk4_0),singleton(esk5_0))) = esk4_0
    | ~ member(esk5_0,union(singleton(esk4_0),singleton(esk5_0))) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_49]),c_0_36])]) ).

cnf(c_0_51,negated_conjecture,
    ( esk1_2(unordered_pair(esk4_0,esk5_0),union(singleton(esk4_0),singleton(esk5_0))) = esk4_0
    | esk1_2(union(singleton(esk4_0),singleton(esk5_0)),unordered_pair(esk4_0,esk5_0)) = esk4_0 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_50,c_0_46]),c_0_47])]) ).

cnf(c_0_52,negated_conjecture,
    ( esk1_2(unordered_pair(esk4_0,esk5_0),union(singleton(esk4_0),singleton(esk5_0))) = esk4_0
    | ~ member(esk5_0,union(singleton(esk4_0),singleton(esk5_0))) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_48,c_0_51]),c_0_39])]) ).

cnf(c_0_53,negated_conjecture,
    esk1_2(unordered_pair(esk4_0,esk5_0),union(singleton(esk4_0),singleton(esk5_0))) = esk4_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_46]),c_0_47])]) ).

cnf(c_0_54,negated_conjecture,
    ( ~ member(union(singleton(esk4_0),singleton(esk5_0)),power_set(unordered_pair(esk4_0,esk5_0)))
    | ~ subset(unordered_pair(esk4_0,esk5_0),union(singleton(esk4_0),singleton(esk5_0))) ),
    inference(spm,[status(thm)],[c_0_13,c_0_18]) ).

cnf(c_0_55,negated_conjecture,
    ( member(unordered_pair(esk4_0,esk5_0),power_set(union(singleton(esk4_0),singleton(esk5_0))))
    | ~ member(esk4_0,union(singleton(esk4_0),singleton(esk5_0))) ),
    inference(spm,[status(thm)],[c_0_40,c_0_53]) ).

cnf(c_0_56,negated_conjecture,
    ( ~ member(esk1_2(unordered_pair(esk4_0,esk5_0),union(singleton(esk4_0),singleton(esk5_0))),union(singleton(esk4_0),singleton(esk5_0)))
    | ~ member(union(singleton(esk4_0),singleton(esk5_0)),power_set(unordered_pair(esk4_0,esk5_0))) ),
    inference(spm,[status(thm)],[c_0_54,c_0_26]) ).

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

cnf(c_0_58,negated_conjecture,
    ( esk1_2(union(singleton(esk4_0),singleton(esk5_0)),unordered_pair(esk4_0,esk5_0)) = esk4_0
    | esk1_2(union(singleton(esk4_0),singleton(esk5_0)),unordered_pair(esk4_0,esk5_0)) = esk5_0
    | ~ member(esk4_0,union(singleton(esk4_0),singleton(esk5_0))) ),
    inference(spm,[status(thm)],[c_0_31,c_0_55]) ).

cnf(c_0_59,negated_conjecture,
    ( ~ member(esk1_2(unordered_pair(esk4_0,esk5_0),union(singleton(esk4_0),singleton(esk5_0))),singleton(esk4_0))
    | ~ member(union(singleton(esk4_0),singleton(esk5_0)),power_set(unordered_pair(esk4_0,esk5_0))) ),
    inference(spm,[status(thm)],[c_0_56,c_0_57]) ).

cnf(c_0_60,negated_conjecture,
    ( ~ member(esk1_2(union(singleton(esk4_0),singleton(esk5_0)),unordered_pair(esk4_0,esk5_0)),unordered_pair(esk4_0,esk5_0))
    | ~ member(esk1_2(unordered_pair(esk4_0,esk5_0),union(singleton(esk4_0),singleton(esk5_0))),singleton(esk4_0)) ),
    inference(spm,[status(thm)],[c_0_44,c_0_57]) ).

cnf(c_0_61,negated_conjecture,
    ( esk1_2(union(singleton(esk4_0),singleton(esk5_0)),unordered_pair(esk4_0,esk5_0)) = esk5_0
    | esk1_2(union(singleton(esk4_0),singleton(esk5_0)),unordered_pair(esk4_0,esk5_0)) = esk4_0 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_58,c_0_57]),c_0_47])]) ).

cnf(c_0_62,negated_conjecture,
    ~ member(union(singleton(esk4_0),singleton(esk5_0)),power_set(unordered_pair(esk4_0,esk5_0))),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_59,c_0_53]),c_0_47])]) ).

cnf(c_0_63,negated_conjecture,
    ~ member(esk1_2(union(singleton(esk4_0),singleton(esk5_0)),unordered_pair(esk4_0,esk5_0)),unordered_pair(esk4_0,esk5_0)),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_60,c_0_53]),c_0_47])]) ).

cnf(c_0_64,negated_conjecture,
    esk1_2(union(singleton(esk4_0),singleton(esk5_0)),unordered_pair(esk4_0,esk5_0)) = esk4_0,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_61]),c_0_36])]),c_0_62]) ).

cnf(c_0_65,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_63,c_0_64]),c_0_39])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem    : SET703+4 : TPTP v8.1.2. Released v2.2.0.
% 0.03/0.13  % Command    : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.14/0.34  % Computer : n023.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    : 300
% 0.14/0.34  % DateTime   : Sat Aug 26 15:59:41 EDT 2023
% 0.14/0.34  % CPUTime  : 
% 0.21/0.54  start to proof: theBenchmark
% 0.52/0.64  % Version  : CSE_E---1.5
% 0.52/0.64  % Problem  : theBenchmark.p
% 0.52/0.64  % Proof found
% 0.52/0.64  % SZS status Theorem for theBenchmark.p
% 0.52/0.64  % SZS output start Proof
% See solution above
% 0.52/0.64  % Total time : 0.086000 s
% 0.52/0.64  % SZS output end Proof
% 0.52/0.64  % Total time : 0.088000 s
%------------------------------------------------------------------------------