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

View Problem - Process Solution

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

% Computer : n017.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:36 EDT 2022

% Result   : Theorem 7.35s 2.29s
% Output   : CNFRefutation 7.35s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   11
% Syntax   : Number of clauses     :   36 (   9 unt;  15 nHn;  20 RR)
%            Number of literals    :   72 (  33 equ;  24 neg)
%            Maximal clause size   :    3 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   3 con; 0-2 aty)
%            Number of variables   :   46 (  11 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_4,plain,
    ~ member(X1,empty_set),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-y0nd60fc/input.p',i_0_4) ).

cnf(i_0_10,plain,
    ( subset(X1,X2)
    | member(esk1_2(X1,X2),X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-y0nd60fc/input.p',i_0_10) ).

cnf(i_0_1,plain,
    ( member(X1,union(X2,X3))
    | ~ member(X1,X3) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-y0nd60fc/input.p',i_0_1) ).

cnf(i_0_19,negated_conjecture,
    ( esk5_0 = empty_set
    | union(esk4_0,esk5_0) = empty_set ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-y0nd60fc/input.p',i_0_19) ).

cnf(i_0_5,plain,
    ( X1 = X2
    | ~ subset(X2,X1)
    | ~ subset(X1,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-y0nd60fc/input.p',i_0_5) ).

cnf(i_0_2,plain,
    ( member(X1,union(X2,X3))
    | ~ member(X1,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-y0nd60fc/input.p',i_0_2) ).

cnf(i_0_20,negated_conjecture,
    ( empty_set = esk4_0
    | union(esk4_0,esk5_0) = empty_set ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-y0nd60fc/input.p',i_0_20) ).

cnf(i_0_15,plain,
    ( X1 = X2
    | member(esk3_2(X1,X2),X2)
    | member(esk3_2(X1,X2),X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-y0nd60fc/input.p',i_0_15) ).

cnf(i_0_3,plain,
    ( member(X1,X2)
    | member(X1,X3)
    | ~ member(X1,union(X3,X2)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-y0nd60fc/input.p',i_0_3) ).

cnf(i_0_21,negated_conjecture,
    ( empty_set != esk4_0
    | esk5_0 != empty_set
    | union(esk4_0,esk5_0) != empty_set ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-y0nd60fc/input.p',i_0_21) ).

cnf(i_0_8,plain,
    union(X1,X2) = union(X2,X1),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-y0nd60fc/input.p',i_0_8) ).

cnf(c_0_33,plain,
    ~ member(X1,empty_set),
    i_0_4 ).

cnf(c_0_34,plain,
    ( subset(X1,X2)
    | member(esk1_2(X1,X2),X1) ),
    i_0_10 ).

cnf(c_0_35,plain,
    ( member(X1,union(X2,X3))
    | ~ member(X1,X3) ),
    i_0_1 ).

cnf(c_0_36,negated_conjecture,
    ( esk5_0 = empty_set
    | union(esk4_0,esk5_0) = empty_set ),
    i_0_19 ).

cnf(c_0_37,plain,
    ( X1 = X2
    | ~ subset(X2,X1)
    | ~ subset(X1,X2) ),
    i_0_5 ).

cnf(c_0_38,plain,
    subset(empty_set,X1),
    inference(spm,[status(thm)],[c_0_33,c_0_34]) ).

cnf(c_0_39,negated_conjecture,
    ( esk5_0 = empty_set
    | ~ member(X1,esk5_0) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_33]) ).

cnf(c_0_40,plain,
    ( member(X1,union(X2,X3))
    | ~ member(X1,X2) ),
    i_0_2 ).

cnf(c_0_41,negated_conjecture,
    ( empty_set = esk4_0
    | union(esk4_0,esk5_0) = empty_set ),
    i_0_20 ).

cnf(c_0_42,plain,
    ( X1 = X2
    | member(esk3_2(X1,X2),X2)
    | member(esk3_2(X1,X2),X1) ),
    i_0_15 ).

cnf(c_0_43,plain,
    ( X1 = empty_set
    | ~ subset(X1,empty_set) ),
    inference(spm,[status(thm)],[c_0_37,c_0_38]) ).

cnf(c_0_44,plain,
    ( esk5_0 = empty_set
    | subset(esk5_0,X1) ),
    inference(spm,[status(thm)],[c_0_39,c_0_34]) ).

cnf(c_0_45,negated_conjecture,
    ( esk4_0 = empty_set
    | ~ member(X1,esk4_0) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_40,c_0_41]),c_0_33]) ).

cnf(c_0_46,plain,
    ( member(X1,X2)
    | member(X1,X3)
    | ~ member(X1,union(X3,X2)) ),
    i_0_3 ).

cnf(c_0_47,plain,
    ( X1 = empty_set
    | member(esk3_2(X1,empty_set),X1) ),
    inference(spm,[status(thm)],[c_0_33,c_0_42]) ).

cnf(c_0_48,negated_conjecture,
    ( empty_set != esk4_0
    | esk5_0 != empty_set
    | union(esk4_0,esk5_0) != empty_set ),
    i_0_21 ).

cnf(c_0_49,plain,
    esk5_0 = empty_set,
    inference(spm,[status(thm)],[c_0_43,c_0_44]) ).

cnf(c_0_50,plain,
    union(X1,X2) = union(X2,X1),
    i_0_8 ).

cnf(c_0_51,plain,
    ( esk4_0 = empty_set
    | subset(esk4_0,X1) ),
    inference(spm,[status(thm)],[c_0_45,c_0_34]) ).

cnf(c_0_52,plain,
    ( union(X1,X2) = empty_set
    | member(esk3_2(union(X1,X2),empty_set),X1)
    | member(esk3_2(union(X1,X2),empty_set),X2) ),
    inference(spm,[status(thm)],[c_0_46,c_0_47]) ).

cnf(c_0_53,negated_conjecture,
    ( union(empty_set,esk4_0) != empty_set
    | esk4_0 != empty_set ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_48,c_0_49]),c_0_50]),c_0_49])]) ).

cnf(c_0_54,plain,
    esk4_0 = empty_set,
    inference(spm,[status(thm)],[c_0_43,c_0_51]) ).

cnf(c_0_55,plain,
    ( union(X1,X1) = empty_set
    | member(esk3_2(union(X1,X1),empty_set),X1) ),
    inference(ef,[status(thm)],[c_0_52]) ).

cnf(c_0_56,negated_conjecture,
    union(empty_set,empty_set) != empty_set,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_53,c_0_54]),c_0_54])]) ).

cnf(c_0_57,plain,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_33,c_0_55]),c_0_56]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SET600+3 : TPTP v8.1.0. Released v2.2.0.
% 0.03/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.34  % Computer : n017.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 : Sat Jul  9 22:42:04 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.20/0.43  # ENIGMATIC: Selected complete mode:
% 7.35/2.29  # ENIGMATIC: Solved by autoschedule:
% 7.35/2.29  # No SInE strategy applied
% 7.35/2.29  # Trying AutoSched0 for 150 seconds
% 7.35/2.29  # AutoSched0-Mode selected heuristic G_E___205_C45_F1_AE_CS_SP_PI_S0Y
% 7.35/2.29  # and selection function SelectMaxLComplexAvoidPosPred.
% 7.35/2.29  #
% 7.35/2.29  # Preprocessing time       : 0.023 s
% 7.35/2.29  
% 7.35/2.29  # Proof found!
% 7.35/2.29  # SZS status Theorem
% 7.35/2.29  # SZS output start CNFRefutation
% See solution above
% 7.35/2.29  # Training examples: 0 positive, 0 negative
% 7.35/2.29  
% 7.35/2.29  # -------------------------------------------------
% 7.35/2.29  # User time                : 0.026 s
% 7.35/2.29  # System time              : 0.007 s
% 7.35/2.29  # Total time               : 0.033 s
% 7.35/2.29  # Maximum resident set size: 7120 pages
% 7.35/2.29  
%------------------------------------------------------------------------------