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

% Computer : n010.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:13:05 EDT 2022

% Result   : Theorem 8.29s 2.44s
% Output   : CNFRefutation 8.29s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    9
% Syntax   : Number of clauses     :   26 (  24 unt;   0 nHn;  13 RR)
%            Number of literals    :   28 (  18 equ;   4 neg)
%            Maximal clause size   :    2 (   1 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    3 (   1 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   4 con; 0-2 aty)
%            Number of variables   :   29 (   2 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_4,plain,
    union(intersection(X1,X2),intersection(X1,X3)) = intersection(X1,union(X2,X3)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cfdgsj06/lgb.p',i_0_4) ).

cnf(i_0_19,plain,
    intersection(X1,X2) = intersection(X2,X1),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cfdgsj06/lgb.p',i_0_19) ).

cnf(i_0_28,negated_conjecture,
    intersection(esk4_0,esk6_0) = empty_set,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cfdgsj06/lgb.p',i_0_28) ).

cnf(i_0_29,negated_conjecture,
    subset(esk4_0,union(esk5_0,esk6_0)),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cfdgsj06/lgb.p',i_0_29) ).

cnf(i_0_18,plain,
    union(X1,X2) = union(X2,X1),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cfdgsj06/lgb.p',i_0_18) ).

cnf(i_0_3,plain,
    union(X1,empty_set) = X1,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cfdgsj06/lgb.p',i_0_3) ).

cnf(i_0_2,plain,
    ( intersection(X1,X2) = X1
    | ~ subset(X1,X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cfdgsj06/lgb.p',i_0_2) ).

cnf(i_0_1,plain,
    subset(intersection(X1,X2),X1),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cfdgsj06/lgb.p',i_0_1) ).

cnf(i_0_27,negated_conjecture,
    ~ subset(esk4_0,esk5_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-cfdgsj06/lgb.p',i_0_27) ).

cnf(c_0_39,plain,
    union(intersection(X1,X2),intersection(X1,X3)) = intersection(X1,union(X2,X3)),
    i_0_4 ).

cnf(c_0_40,plain,
    intersection(X1,X2) = intersection(X2,X1),
    i_0_19 ).

cnf(c_0_41,negated_conjecture,
    intersection(esk4_0,esk6_0) = empty_set,
    i_0_28 ).

cnf(c_0_42,negated_conjecture,
    subset(esk4_0,union(esk5_0,esk6_0)),
    i_0_29 ).

cnf(c_0_43,plain,
    union(X1,X2) = union(X2,X1),
    i_0_18 ).

cnf(c_0_44,plain,
    union(intersection(X1,X2),intersection(X3,X1)) = intersection(X1,union(X2,X3)),
    inference(spm,[status(thm)],[c_0_39,c_0_40]) ).

cnf(c_0_45,negated_conjecture,
    intersection(esk6_0,esk4_0) = empty_set,
    inference(rw,[status(thm)],[c_0_41,c_0_40]) ).

cnf(c_0_46,plain,
    union(X1,empty_set) = X1,
    i_0_3 ).

cnf(c_0_47,plain,
    ( intersection(X1,X2) = X1
    | ~ subset(X1,X2) ),
    i_0_2 ).

cnf(c_0_48,negated_conjecture,
    subset(esk4_0,union(esk6_0,esk5_0)),
    inference(rw,[status(thm)],[c_0_42,c_0_43]) ).

cnf(c_0_49,negated_conjecture,
    intersection(esk4_0,union(X1,esk6_0)) = intersection(esk4_0,X1),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_44,c_0_45]),c_0_46]) ).

cnf(c_0_50,negated_conjecture,
    intersection(esk4_0,union(esk6_0,esk5_0)) = esk4_0,
    inference(spm,[status(thm)],[c_0_47,c_0_48]) ).

cnf(c_0_51,plain,
    intersection(esk4_0,union(esk6_0,X1)) = intersection(esk4_0,X1),
    inference(spm,[status(thm)],[c_0_49,c_0_43]) ).

cnf(c_0_52,plain,
    subset(intersection(X1,X2),X1),
    i_0_1 ).

cnf(c_0_53,negated_conjecture,
    intersection(esk5_0,esk4_0) = esk4_0,
    inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_50,c_0_51]),c_0_40]) ).

cnf(c_0_54,negated_conjecture,
    ~ subset(esk4_0,esk5_0),
    i_0_27 ).

cnf(c_0_55,plain,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_52,c_0_53]),c_0_54]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SET638+3 : TPTP v8.1.0. Released v2.2.0.
% 0.07/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.34  % Computer : n010.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 23:42:32 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.20/0.46  # ENIGMATIC: Selected complete mode:
% 8.29/2.44  # ENIGMATIC: Solved by autoschedule-lgb:
% 8.29/2.44  # No SInE strategy applied
% 8.29/2.44  # Trying AutoSched0 for 150 seconds
% 8.29/2.44  # AutoSched0-Mode selected heuristic G_E___024_B31_F1_PI_AE_Q4_CS_SP_S2S
% 8.29/2.44  # and selection function SelectNewComplexAHP.
% 8.29/2.44  #
% 8.29/2.44  # Preprocessing time       : 0.020 s
% 8.29/2.44  
% 8.29/2.44  # Proof found!
% 8.29/2.44  # SZS status Theorem
% 8.29/2.44  # SZS output start CNFRefutation
% See solution above
% 8.29/2.44  # Training examples: 0 positive, 0 negative
% 8.29/2.44  
% 8.29/2.44  # -------------------------------------------------
% 8.29/2.44  # User time                : 0.022 s
% 8.29/2.44  # System time              : 0.006 s
% 8.29/2.44  # Total time               : 0.028 s
% 8.29/2.44  # Maximum resident set size: 7124 pages
% 8.29/2.44  
%------------------------------------------------------------------------------