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

% Computer : n011.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:08:53 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_6,plain,
    ( X1 = X2
    | ~ subset(X2,X1)
    | ~ subset(X1,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-eg7v02ih/lgb.p',i_0_6) ).

cnf(i_0_13,negated_conjecture,
    subset(esk3_0,empty_set),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-eg7v02ih/lgb.p',i_0_13) ).

cnf(i_0_1,plain,
    subset(empty_set,X1),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-eg7v02ih/lgb.p',i_0_1) ).

cnf(i_0_12,negated_conjecture,
    esk3_0 != empty_set,
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-eg7v02ih/lgb.p',i_0_12) ).

cnf(c_0_18,plain,
    ( X1 = X2
    | ~ subset(X2,X1)
    | ~ subset(X1,X2) ),
    i_0_6 ).

cnf(c_0_19,negated_conjecture,
    subset(esk3_0,empty_set),
    i_0_13 ).

cnf(c_0_20,plain,
    subset(empty_set,X1),
    i_0_1 ).

cnf(c_0_21,negated_conjecture,
    esk3_0 != empty_set,
    i_0_12 ).

cnf(c_0_22,negated_conjecture,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_18,c_0_19]),c_0_20])]),c_0_21]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.11  % Problem  : SET063+3 : TPTP v8.1.0. Released v2.2.0.
% 0.07/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n011.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 : Sun Jul 10 21:41:43 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.43  # ENIGMATIC: Selected complete mode:
% 8.18/2.44  # ENIGMATIC: Solved by autoschedule-lgb:
% 8.18/2.44  # No SInE strategy applied
% 8.18/2.44  # Trying AutoSched0 for 150 seconds
% 8.18/2.44  # AutoSched0-Mode selected heuristic G_E___205_C45_F1_AE_CS_SP_PI_S0Y
% 8.18/2.44  # and selection function SelectMaxLComplexAvoidPosPred.
% 8.18/2.44  #
% 8.18/2.44  # Preprocessing time       : 0.023 s
% 8.18/2.44  
% 8.18/2.44  # Proof found!
% 8.18/2.44  # SZS status Theorem
% 8.18/2.44  # SZS output start CNFRefutation
% See solution above
% 8.18/2.44  # Training examples: 0 positive, 0 negative
% 8.18/2.44  
% 8.18/2.44  # -------------------------------------------------
% 8.18/2.44  # User time                : 0.024 s
% 8.18/2.44  # System time              : 0.003 s
% 8.18/2.44  # Total time               : 0.027 s
% 8.18/2.44  # Maximum resident set size: 7128 pages
% 8.18/2.44  
%------------------------------------------------------------------------------