TSTP Solution File: SET611+3 by Enigma---0.5.1

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : SET611+3 : TPTP v8.1.0. Released v2.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : enigmatic-eprover.py %s %d 1

% Computer : n003.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:12:46 EDT 2022

% Result   : Theorem 11.64s 2.85s
% Output   : CNFRefutation 11.64s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   15
%            Number of leaves      :   15
% Syntax   : Number of clauses     :   59 (  11 unt;  19 nHn;  42 RR)
%            Number of literals    :  120 (  19 equ;  52 neg)
%            Maximal clause size   :    3 (   2 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    5 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   3 con; 0-2 aty)
%            Number of variables   :   99 (  15 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_7,plain,
    ( ~ member(X1,X2)
    | ~ member(X1,difference(X3,X2)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2ru341d0/input.p',i_0_7) ).

cnf(i_0_24,negated_conjecture,
    ( intersection(esk5_0,esk6_0) = empty_set
    | difference(esk5_0,esk6_0) = esk5_0 ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2ru341d0/input.p',i_0_24) ).

cnf(i_0_4,plain,
    ( member(X1,X2)
    | ~ member(X1,intersection(X3,X2)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2ru341d0/input.p',i_0_4) ).

cnf(i_0_22,plain,
    ( empty(X1)
    | member(esk4_1(X1),X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2ru341d0/input.p',i_0_22) ).

cnf(i_0_9,plain,
    ~ member(X1,empty_set),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2ru341d0/input.p',i_0_9) ).

cnf(i_0_1,plain,
    ( X1 = X2
    | member(esk1_2(X1,X2),X2)
    | member(esk1_2(X1,X2),X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2ru341d0/input.p',i_0_1) ).

cnf(i_0_5,plain,
    ( member(X1,X2)
    | ~ member(X1,intersection(X2,X3)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2ru341d0/input.p',i_0_5) ).

cnf(i_0_23,plain,
    ( ~ empty(X1)
    | ~ member(X2,X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2ru341d0/input.p',i_0_23) ).

cnf(i_0_3,plain,
    ( member(X1,intersection(X2,X3))
    | ~ member(X1,X3)
    | ~ member(X1,X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2ru341d0/input.p',i_0_3) ).

cnf(i_0_8,plain,
    ( member(X1,X2)
    | ~ member(X1,difference(X2,X3)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2ru341d0/input.p',i_0_8) ).

cnf(i_0_6,plain,
    ( member(X1,X2)
    | member(X1,difference(X3,X2))
    | ~ member(X1,X3) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2ru341d0/input.p',i_0_6) ).

cnf(i_0_18,plain,
    ( subset(X1,X2)
    | ~ member(esk3_2(X1,X2),X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2ru341d0/input.p',i_0_18) ).

cnf(i_0_19,plain,
    ( subset(X1,X2)
    | member(esk3_2(X1,X2),X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2ru341d0/input.p',i_0_19) ).

cnf(i_0_25,negated_conjecture,
    ( intersection(esk5_0,esk6_0) != empty_set
    | difference(esk5_0,esk6_0) != esk5_0 ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2ru341d0/input.p',i_0_25) ).

cnf(i_0_10,plain,
    ( X1 = X2
    | ~ subset(X2,X1)
    | ~ subset(X1,X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2ru341d0/input.p',i_0_10) ).

cnf(c_0_41,plain,
    ( ~ member(X1,X2)
    | ~ member(X1,difference(X3,X2)) ),
    i_0_7 ).

cnf(c_0_42,negated_conjecture,
    ( intersection(esk5_0,esk6_0) = empty_set
    | difference(esk5_0,esk6_0) = esk5_0 ),
    i_0_24 ).

cnf(c_0_43,plain,
    ( member(X1,X2)
    | ~ member(X1,intersection(X3,X2)) ),
    i_0_4 ).

cnf(c_0_44,plain,
    ( empty(X1)
    | member(esk4_1(X1),X1) ),
    i_0_22 ).

cnf(c_0_45,plain,
    ~ member(X1,empty_set),
    i_0_9 ).

cnf(c_0_46,plain,
    ( X1 = X2
    | member(esk1_2(X1,X2),X2)
    | member(esk1_2(X1,X2),X1) ),
    i_0_1 ).

cnf(c_0_47,negated_conjecture,
    ( intersection(esk5_0,esk6_0) = empty_set
    | ~ member(X1,esk5_0)
    | ~ member(X1,esk6_0) ),
    inference(spm,[status(thm)],[c_0_41,c_0_42]) ).

cnf(c_0_48,plain,
    ( empty(intersection(X1,X2))
    | member(esk4_1(intersection(X1,X2)),X2) ),
    inference(spm,[status(thm)],[c_0_43,c_0_44]) ).

cnf(c_0_49,plain,
    ( member(X1,X2)
    | ~ member(X1,intersection(X2,X3)) ),
    i_0_5 ).

cnf(c_0_50,plain,
    ( ~ empty(X1)
    | ~ member(X2,X1) ),
    i_0_23 ).

cnf(c_0_51,plain,
    ( X1 = empty_set
    | member(esk1_2(X1,empty_set),X1) ),
    inference(spm,[status(thm)],[c_0_45,c_0_46]) ).

cnf(c_0_52,plain,
    ( member(X1,intersection(X2,X3))
    | ~ member(X1,X3)
    | ~ member(X1,X2) ),
    i_0_3 ).

cnf(c_0_53,negated_conjecture,
    ( intersection(esk5_0,esk6_0) = empty_set
    | empty(intersection(X1,esk6_0))
    | ~ member(esk4_1(intersection(X1,esk6_0)),esk5_0) ),
    inference(spm,[status(thm)],[c_0_47,c_0_48]) ).

cnf(c_0_54,plain,
    ( empty(intersection(X1,X2))
    | member(esk4_1(intersection(X1,X2)),X1) ),
    inference(spm,[status(thm)],[c_0_49,c_0_44]) ).

cnf(c_0_55,plain,
    ( X1 = empty_set
    | ~ empty(X1) ),
    inference(spm,[status(thm)],[c_0_50,c_0_51]) ).

cnf(c_0_56,plain,
    ( ~ empty(intersection(X1,X2))
    | ~ member(X3,X2)
    | ~ member(X3,X1) ),
    inference(spm,[status(thm)],[c_0_50,c_0_52]) ).

cnf(c_0_57,plain,
    intersection(esk5_0,esk6_0) = empty_set,
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_53,c_0_54]),c_0_55]) ).

cnf(c_0_58,plain,
    empty(empty_set),
    inference(spm,[status(thm)],[c_0_45,c_0_44]) ).

cnf(c_0_59,plain,
    ( ~ member(X1,esk6_0)
    | ~ member(X1,esk5_0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_58])]) ).

cnf(c_0_60,plain,
    ( member(X1,X2)
    | ~ member(X1,difference(X2,X3)) ),
    i_0_8 ).

cnf(c_0_61,plain,
    ( empty(intersection(esk6_0,X1))
    | ~ member(esk4_1(intersection(esk6_0,X1)),esk5_0) ),
    inference(spm,[status(thm)],[c_0_59,c_0_54]) ).

cnf(c_0_62,plain,
    ( empty(intersection(X1,difference(X2,X3)))
    | member(esk4_1(intersection(X1,difference(X2,X3))),X2) ),
    inference(spm,[status(thm)],[c_0_60,c_0_48]) ).

cnf(c_0_63,plain,
    empty(intersection(esk6_0,difference(esk5_0,X1))),
    inference(spm,[status(thm)],[c_0_61,c_0_62]) ).

cnf(c_0_64,plain,
    ( empty(difference(X1,X2))
    | ~ member(esk4_1(difference(X1,X2)),X2) ),
    inference(spm,[status(thm)],[c_0_41,c_0_44]) ).

cnf(c_0_65,plain,
    ( member(X1,X2)
    | member(X1,difference(X3,X2))
    | ~ member(X1,X3) ),
    i_0_6 ).

cnf(c_0_66,plain,
    ( ~ member(X1,difference(esk5_0,X2))
    | ~ member(X1,esk6_0) ),
    inference(spm,[status(thm)],[c_0_56,c_0_63]) ).

cnf(c_0_67,plain,
    ( empty(difference(X1,difference(X2,X3)))
    | member(esk4_1(difference(X1,difference(X2,X3))),X3)
    | ~ member(esk4_1(difference(X1,difference(X2,X3))),X2) ),
    inference(spm,[status(thm)],[c_0_64,c_0_65]) ).

cnf(c_0_68,plain,
    ( empty(difference(X1,X2))
    | member(esk4_1(difference(X1,X2)),X1) ),
    inference(spm,[status(thm)],[c_0_60,c_0_44]) ).

cnf(c_0_69,plain,
    ( empty(difference(esk5_0,X1))
    | ~ member(esk4_1(difference(esk5_0,X1)),esk6_0) ),
    inference(spm,[status(thm)],[c_0_66,c_0_44]) ).

cnf(c_0_70,plain,
    ( empty(difference(X1,difference(X1,X2)))
    | member(esk4_1(difference(X1,difference(X1,X2))),X2) ),
    inference(spm,[status(thm)],[c_0_67,c_0_68]) ).

cnf(c_0_71,plain,
    empty(difference(esk5_0,difference(esk5_0,esk6_0))),
    inference(spm,[status(thm)],[c_0_69,c_0_70]) ).

cnf(c_0_72,plain,
    ( member(X1,X2)
    | ~ empty(difference(X3,X2))
    | ~ member(X1,X3) ),
    inference(spm,[status(thm)],[c_0_50,c_0_65]) ).

cnf(c_0_73,plain,
    difference(esk5_0,difference(esk5_0,esk6_0)) = empty_set,
    inference(spm,[status(thm)],[c_0_55,c_0_71]) ).

cnf(c_0_74,plain,
    ( subset(X1,X2)
    | ~ member(esk3_2(X1,X2),X2) ),
    i_0_18 ).

cnf(c_0_75,plain,
    ( member(X1,difference(esk5_0,esk6_0))
    | ~ member(X1,esk5_0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_72,c_0_73]),c_0_58])]) ).

cnf(c_0_76,plain,
    ( subset(X1,X2)
    | member(esk3_2(X1,X2),X1) ),
    i_0_19 ).

cnf(c_0_77,plain,
    ( subset(X1,difference(esk5_0,esk6_0))
    | ~ member(esk3_2(X1,difference(esk5_0,esk6_0)),esk5_0) ),
    inference(spm,[status(thm)],[c_0_74,c_0_75]) ).

cnf(c_0_78,plain,
    ( member(esk3_2(difference(X1,X2),X3),X1)
    | subset(difference(X1,X2),X3) ),
    inference(spm,[status(thm)],[c_0_60,c_0_76]) ).

cnf(c_0_79,negated_conjecture,
    ( intersection(esk5_0,esk6_0) != empty_set
    | difference(esk5_0,esk6_0) != esk5_0 ),
    i_0_25 ).

cnf(c_0_80,plain,
    ( X1 = X2
    | ~ subset(X2,X1)
    | ~ subset(X1,X2) ),
    i_0_10 ).

cnf(c_0_81,plain,
    subset(esk5_0,difference(esk5_0,esk6_0)),
    inference(spm,[status(thm)],[c_0_77,c_0_76]) ).

cnf(c_0_82,plain,
    subset(difference(X1,X2),X1),
    inference(spm,[status(thm)],[c_0_74,c_0_78]) ).

cnf(c_0_83,negated_conjecture,
    difference(esk5_0,esk6_0) != esk5_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_79,c_0_57])]) ).

cnf(c_0_84,plain,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_80,c_0_81]),c_0_82])]),c_0_83]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12  % Problem  : SET611+3 : TPTP v8.1.0. Released v2.2.0.
% 0.08/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.34  % Computer : n003.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Sun Jul 10 14:32:16 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.20/0.46  # ENIGMATIC: Selected complete mode:
% 11.64/2.85  # ENIGMATIC: Solved by autoschedule:
% 11.64/2.85  # No SInE strategy applied
% 11.64/2.85  # Trying AutoSched0 for 150 seconds
% 11.64/2.85  # AutoSched0-Mode selected heuristic G_E___205_C45_F1_AE_CS_SP_PI_S0Y
% 11.64/2.85  # and selection function SelectMaxLComplexAvoidPosPred.
% 11.64/2.85  #
% 11.64/2.85  # Preprocessing time       : 0.024 s
% 11.64/2.85  
% 11.64/2.85  # Proof found!
% 11.64/2.85  # SZS status Theorem
% 11.64/2.85  # SZS output start CNFRefutation
% See solution above
% 11.64/2.85  # Training examples: 0 positive, 0 negative
% 11.64/2.85  
% 11.64/2.85  # -------------------------------------------------
% 11.64/2.85  # User time                : 0.501 s
% 11.64/2.85  # System time              : 0.025 s
% 11.64/2.85  # Total time               : 0.526 s
% 11.64/2.85  # Maximum resident set size: 7120 pages
% 11.64/2.85  
%------------------------------------------------------------------------------