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

% Computer : n014.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:06 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_21,negated_conjecture,
    intersection(esk5_0,esk4_0) = empty_set,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0x_9ju3h/lgb.p',i_0_21) ).

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

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

cnf(i_0_22,negated_conjecture,
    subset(esk4_0,esk5_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0x_9ju3h/lgb.p',i_0_22) ).

cnf(i_0_20,negated_conjecture,
    empty_set != esk4_0,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-0x_9ju3h/lgb.p',i_0_20) ).

cnf(c_0_28,negated_conjecture,
    intersection(esk5_0,esk4_0) = empty_set,
    i_0_21 ).

cnf(c_0_29,plain,
    intersection(X1,X2) = intersection(X2,X1),
    i_0_12 ).

cnf(c_0_30,plain,
    ( intersection(X1,X2) = X1
    | ~ subset(X1,X2) ),
    i_0_1 ).

cnf(c_0_31,negated_conjecture,
    subset(esk4_0,esk5_0),
    i_0_22 ).

cnf(c_0_32,negated_conjecture,
    intersection(esk4_0,esk5_0) = empty_set,
    inference(rw,[status(thm)],[c_0_28,c_0_29]) ).

cnf(c_0_33,negated_conjecture,
    empty_set != esk4_0,
    i_0_20 ).

cnf(c_0_34,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30,c_0_31]),c_0_32]),c_0_33]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : SET639+3 : TPTP v8.1.0. Released v2.2.0.
% 0.06/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n014.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.33  % DateTime : Sat Jul  9 21:06:22 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.19/0.44  # ENIGMATIC: Selected complete mode:
% 7.66/2.33  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.66/2.33  # No SInE strategy applied
% 7.66/2.33  # Trying AutoSched0 for 150 seconds
% 7.66/2.33  # AutoSched0-Mode selected heuristic G_____0026_C18_F1_SE_CS_SP_S4S
% 7.66/2.33  # and selection function SelectNewComplexAHPNS.
% 7.66/2.33  #
% 7.66/2.33  # Preprocessing time       : 0.023 s
% 7.66/2.33  
% 7.66/2.33  # Proof found!
% 7.66/2.33  # SZS status Theorem
% 7.66/2.33  # SZS output start CNFRefutation
% See solution above
% 7.66/2.33  # Training examples: 0 positive, 0 negative
% 7.66/2.33  
% 7.66/2.33  # -------------------------------------------------
% 7.66/2.33  # User time                : 0.027 s
% 7.66/2.33  # System time              : 0.002 s
% 7.66/2.33  # Total time               : 0.029 s
% 7.66/2.33  # Maximum resident set size: 7120 pages
% 7.66/2.33  
%------------------------------------------------------------------------------