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

% Computer : n022.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:00 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_13,plain,
    ( ~ intersect(X1,X2)
    | ~ disjoint(X1,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-x52ownhh/lgb.p',i_0_13) ).

cnf(i_0_5,plain,
    disjoint(intersection(X1,X2),difference(X1,X2)),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-x52ownhh/lgb.p',i_0_5) ).

cnf(i_0_22,negated_conjecture,
    ~ disjoint(intersection(esk3_0,esk4_0),union(difference(esk3_0,esk4_0),difference(esk4_0,esk3_0))),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-x52ownhh/lgb.p',i_0_22) ).

cnf(i_0_12,plain,
    ( intersect(X1,X2)
    | disjoint(X1,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-x52ownhh/lgb.p',i_0_12) ).

cnf(i_0_15,plain,
    intersection(X1,X2) = intersection(X2,X1),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-x52ownhh/lgb.p',i_0_15) ).

cnf(i_0_4,plain,
    ( intersect(X1,X2)
    | intersect(X1,X3)
    | ~ intersect(X1,union(X3,X2)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-x52ownhh/lgb.p',i_0_4) ).

cnf(c_0_29,plain,
    ( ~ intersect(X1,X2)
    | ~ disjoint(X1,X2) ),
    i_0_13 ).

cnf(c_0_30,plain,
    disjoint(intersection(X1,X2),difference(X1,X2)),
    i_0_5 ).

cnf(c_0_31,negated_conjecture,
    ~ disjoint(intersection(esk3_0,esk4_0),union(difference(esk3_0,esk4_0),difference(esk4_0,esk3_0))),
    i_0_22 ).

cnf(c_0_32,plain,
    ( intersect(X1,X2)
    | disjoint(X1,X2) ),
    i_0_12 ).

cnf(c_0_33,plain,
    ~ intersect(intersection(X1,X2),difference(X1,X2)),
    inference(spm,[status(thm)],[c_0_29,c_0_30]) ).

cnf(c_0_34,plain,
    intersection(X1,X2) = intersection(X2,X1),
    i_0_15 ).

cnf(c_0_35,plain,
    ( intersect(X1,X2)
    | intersect(X1,X3)
    | ~ intersect(X1,union(X3,X2)) ),
    i_0_4 ).

cnf(c_0_36,negated_conjecture,
    intersect(intersection(esk3_0,esk4_0),union(difference(esk3_0,esk4_0),difference(esk4_0,esk3_0))),
    inference(spm,[status(thm)],[c_0_31,c_0_32]) ).

cnf(c_0_37,plain,
    ~ intersect(intersection(X1,X2),difference(X2,X1)),
    inference(spm,[status(thm)],[c_0_33,c_0_34]) ).

cnf(c_0_38,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_35,c_0_36]),c_0_33]),c_0_37]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SET630+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 : n022.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 19:03:27 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.20/0.45  # ENIGMATIC: Selected complete mode:
% 7.82/2.39  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.82/2.39  # No SInE strategy applied
% 7.82/2.39  # Trying AutoSched0 for 150 seconds
% 7.82/2.39  # AutoSched0-Mode selected heuristic G_____X1276__C12_02_nc_F1_AE_CS_SP_RG_S04AN
% 7.82/2.39  # and selection function SelectComplexExceptUniqMaxHorn.
% 7.82/2.39  #
% 7.82/2.39  # Preprocessing time       : 0.016 s
% 7.82/2.39  # Presaturation interreduction done
% 7.82/2.39  
% 7.82/2.39  # Proof found!
% 7.82/2.39  # SZS status Theorem
% 7.82/2.39  # SZS output start CNFRefutation
% See solution above
% 7.82/2.39  # Training examples: 0 positive, 0 negative
% 7.82/2.39  
% 7.82/2.39  # -------------------------------------------------
% 7.82/2.39  # User time                : 0.016 s
% 7.82/2.39  # System time              : 0.008 s
% 7.82/2.39  # Total time               : 0.024 s
% 7.82/2.39  # Maximum resident set size: 7128 pages
% 7.82/2.39  
%------------------------------------------------------------------------------