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

% Computer : n015.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:15:22 EDT 2022

% Result   : Theorem 7.57s 2.44s
% Output   : CNFRefutation 7.57s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :   10
%            Number of leaves      :   12
% Syntax   : Number of clauses     :   40 (  14 unt;  10 nHn;  23 RR)
%            Number of literals    :   85 (  70 equ;  28 neg)
%            Maximal clause size   :    5 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   4 con; 0-2 aty)
%            Number of variables   :   50 (  17 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_7,plain,
    ( X1 = empty_set
    | X1 = singleton(X2)
    | X1 = singleton(X3)
    | X1 = unordered_pair(X3,X2)
    | ~ subset(X1,unordered_pair(X3,X2)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lbarzdmv/lgb.p',i_0_7) ).

cnf(i_0_12,plain,
    ( subset(X1,X2)
    | set_difference(X1,X2) != empty_set ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lbarzdmv/lgb.p',i_0_12) ).

cnf(i_0_4,plain,
    ( subset(X1,unordered_pair(X2,X3))
    | X1 != singleton(X3) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lbarzdmv/lgb.p',i_0_4) ).

cnf(i_0_13,negated_conjecture,
    ( empty_set = esk3_0
    | singleton(esk4_0) = esk3_0
    | singleton(esk5_0) = esk3_0
    | unordered_pair(esk4_0,esk5_0) = esk3_0
    | set_difference(esk3_0,unordered_pair(esk4_0,esk5_0)) = empty_set ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lbarzdmv/lgb.p',i_0_13) ).

cnf(i_0_11,plain,
    ( set_difference(X1,X2) = empty_set
    | ~ subset(X1,X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lbarzdmv/lgb.p',i_0_11) ).

cnf(i_0_10,plain,
    subset(X1,X1),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lbarzdmv/lgb.p',i_0_10) ).

cnf(i_0_14,negated_conjecture,
    ( unordered_pair(esk4_0,esk5_0) != esk3_0
    | set_difference(esk3_0,unordered_pair(esk4_0,esk5_0)) != empty_set ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lbarzdmv/lgb.p',i_0_14) ).

cnf(i_0_1,plain,
    unordered_pair(X1,X2) = unordered_pair(X2,X1),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lbarzdmv/lgb.p',i_0_1) ).

cnf(i_0_15,negated_conjecture,
    ( singleton(esk5_0) != esk3_0
    | set_difference(esk3_0,unordered_pair(esk4_0,esk5_0)) != empty_set ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lbarzdmv/lgb.p',i_0_15) ).

cnf(i_0_6,plain,
    ( subset(X1,unordered_pair(X2,X3))
    | X1 != empty_set ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lbarzdmv/lgb.p',i_0_6) ).

cnf(i_0_16,negated_conjecture,
    ( singleton(esk4_0) != esk3_0
    | set_difference(esk3_0,unordered_pair(esk4_0,esk5_0)) != empty_set ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lbarzdmv/lgb.p',i_0_16) ).

cnf(i_0_17,negated_conjecture,
    ( empty_set != esk3_0
    | set_difference(esk3_0,unordered_pair(esk4_0,esk5_0)) != empty_set ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lbarzdmv/lgb.p',i_0_17) ).

cnf(c_0_30,plain,
    ( X1 = empty_set
    | X1 = singleton(X2)
    | X1 = singleton(X3)
    | X1 = unordered_pair(X3,X2)
    | ~ subset(X1,unordered_pair(X3,X2)) ),
    i_0_7 ).

cnf(c_0_31,plain,
    ( subset(X1,X2)
    | set_difference(X1,X2) != empty_set ),
    i_0_12 ).

cnf(c_0_32,plain,
    ( subset(X1,unordered_pair(X2,X3))
    | X1 != singleton(X3) ),
    i_0_4 ).

cnf(c_0_33,plain,
    ( X1 = unordered_pair(X2,X3)
    | X1 = singleton(X3)
    | X1 = singleton(X2)
    | X1 = empty_set
    | set_difference(X1,unordered_pair(X2,X3)) != empty_set ),
    inference(spm,[status(thm)],[c_0_30,c_0_31]) ).

cnf(c_0_34,negated_conjecture,
    ( empty_set = esk3_0
    | singleton(esk4_0) = esk3_0
    | singleton(esk5_0) = esk3_0
    | unordered_pair(esk4_0,esk5_0) = esk3_0
    | set_difference(esk3_0,unordered_pair(esk4_0,esk5_0)) = empty_set ),
    i_0_13 ).

cnf(c_0_35,plain,
    ( set_difference(X1,X2) = empty_set
    | ~ subset(X1,X2) ),
    i_0_11 ).

cnf(c_0_36,plain,
    subset(X1,X1),
    i_0_10 ).

cnf(c_0_37,plain,
    subset(singleton(X1),unordered_pair(X2,X1)),
    inference(er,[status(thm)],[c_0_32]) ).

cnf(c_0_38,negated_conjecture,
    ( unordered_pair(esk4_0,esk5_0) != esk3_0
    | set_difference(esk3_0,unordered_pair(esk4_0,esk5_0)) != empty_set ),
    i_0_14 ).

cnf(c_0_39,negated_conjecture,
    ( unordered_pair(esk4_0,esk5_0) = esk3_0
    | singleton(esk4_0) = esk3_0
    | singleton(esk5_0) = esk3_0
    | empty_set = esk3_0 ),
    inference(spm,[status(thm)],[c_0_33,c_0_34]) ).

cnf(c_0_40,plain,
    set_difference(X1,X1) = empty_set,
    inference(spm,[status(thm)],[c_0_35,c_0_36]) ).

cnf(c_0_41,plain,
    set_difference(singleton(X1),unordered_pair(X2,X1)) = empty_set,
    inference(spm,[status(thm)],[c_0_35,c_0_37]) ).

cnf(c_0_42,negated_conjecture,
    ( singleton(esk5_0) = esk3_0
    | singleton(esk4_0) = esk3_0
    | empty_set = esk3_0 ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_38,c_0_39]),c_0_40])]) ).

cnf(c_0_43,plain,
    unordered_pair(X1,X2) = unordered_pair(X2,X1),
    i_0_1 ).

cnf(c_0_44,negated_conjecture,
    ( singleton(esk5_0) != esk3_0
    | set_difference(esk3_0,unordered_pair(esk4_0,esk5_0)) != empty_set ),
    i_0_15 ).

cnf(c_0_45,plain,
    ( set_difference(esk3_0,unordered_pair(X1,esk5_0)) = empty_set
    | singleton(esk4_0) = esk3_0
    | empty_set = esk3_0 ),
    inference(spm,[status(thm)],[c_0_41,c_0_42]) ).

cnf(c_0_46,plain,
    set_difference(singleton(X1),unordered_pair(X1,X2)) = empty_set,
    inference(spm,[status(thm)],[c_0_41,c_0_43]) ).

cnf(c_0_47,negated_conjecture,
    ( singleton(esk4_0) = esk3_0
    | empty_set = esk3_0 ),
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_42]) ).

cnf(c_0_48,plain,
    ( subset(X1,unordered_pair(X2,X3))
    | X1 != empty_set ),
    i_0_6 ).

cnf(c_0_49,negated_conjecture,
    ( singleton(esk4_0) != esk3_0
    | set_difference(esk3_0,unordered_pair(esk4_0,esk5_0)) != empty_set ),
    i_0_16 ).

cnf(c_0_50,plain,
    ( set_difference(esk3_0,unordered_pair(esk4_0,X1)) = empty_set
    | empty_set = esk3_0 ),
    inference(spm,[status(thm)],[c_0_46,c_0_47]) ).

cnf(c_0_51,plain,
    subset(empty_set,unordered_pair(X1,X2)),
    inference(er,[status(thm)],[c_0_48]) ).

cnf(c_0_52,negated_conjecture,
    ( empty_set != esk3_0
    | set_difference(esk3_0,unordered_pair(esk4_0,esk5_0)) != empty_set ),
    i_0_17 ).

cnf(c_0_53,negated_conjecture,
    empty_set = esk3_0,
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_49,c_0_50]),c_0_47]) ).

cnf(c_0_54,plain,
    set_difference(empty_set,unordered_pair(X1,X2)) = empty_set,
    inference(spm,[status(thm)],[c_0_35,c_0_51]) ).

cnf(c_0_55,negated_conjecture,
    set_difference(esk3_0,unordered_pair(esk4_0,esk5_0)) != esk3_0,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_52,c_0_53]),c_0_53])]) ).

cnf(c_0_56,plain,
    set_difference(esk3_0,unordered_pair(X1,X2)) = esk3_0,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_54,c_0_53]),c_0_53]) ).

cnf(c_0_57,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_55,c_0_56])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem  : SET931+1 : TPTP v8.1.0. Released v3.2.0.
% 0.12/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.33  % Computer : n015.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 600
% 0.13/0.33  % DateTime : Sun Jul 10 21:56:55 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.19/0.45  # ENIGMATIC: Selected complete mode:
% 7.57/2.44  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.57/2.44  # No SInE strategy applied
% 7.57/2.44  # Trying AutoSched0 for 150 seconds
% 7.57/2.44  # AutoSched0-Mode selected heuristic G_E___208_C12_02_nc_F1_SE_CS_SP_PS_S06DN
% 7.57/2.44  # and selection function SelectNewComplexAHPExceptUniqMaxHorn.
% 7.57/2.44  #
% 7.57/2.44  # Preprocessing time       : 0.023 s
% 7.57/2.44  # Presaturation interreduction done
% 7.57/2.44  
% 7.57/2.44  # Proof found!
% 7.57/2.44  # SZS status Theorem
% 7.57/2.44  # SZS output start CNFRefutation
% See solution above
% 7.57/2.44  # Training examples: 0 positive, 0 negative
% 7.57/2.44  
% 7.57/2.44  # -------------------------------------------------
% 7.57/2.44  # User time                : 0.027 s
% 7.57/2.44  # System time              : 0.005 s
% 7.57/2.44  # Total time               : 0.031 s
% 7.57/2.44  # Maximum resident set size: 7124 pages
% 7.57/2.44  
%------------------------------------------------------------------------------