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

% Computer : n007.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:12:57 EDT 2022

% Result   : Theorem 7.75s 3.40s
% Output   : CNFRefutation 7.75s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   23 (  11 unt;   0 nHn;  23 RR)
%            Number of literals    :   39 (   0 equ;  18 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    4 (   4 usr;   3 con; 0-2 aty)
%            Number of variables   :   26 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_3,plain,
    ( member(esk1_2(X1,X2),X1)
    | ~ intersect(X1,X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hzv50jqa/input.p',i_0_3) ).

cnf(i_0_11,negated_conjecture,
    intersect(esk3_0,esk4_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hzv50jqa/input.p',i_0_11) ).

cnf(i_0_6,plain,
    ( member(X1,X2)
    | ~ member(X1,X3)
    | ~ subset(X3,X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hzv50jqa/input.p',i_0_6) ).

cnf(i_0_10,negated_conjecture,
    subset(esk4_0,esk5_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hzv50jqa/input.p',i_0_10) ).

cnf(i_0_2,plain,
    ( member(esk1_2(X1,X2),X2)
    | ~ intersect(X1,X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hzv50jqa/input.p',i_0_2) ).

cnf(i_0_1,plain,
    ( intersect(X1,X2)
    | ~ member(X3,X2)
    | ~ member(X3,X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hzv50jqa/input.p',i_0_1) ).

cnf(i_0_7,plain,
    ( intersect(X1,X2)
    | ~ intersect(X2,X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hzv50jqa/input.p',i_0_7) ).

cnf(i_0_9,negated_conjecture,
    ~ intersect(esk3_0,esk5_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-hzv50jqa/input.p',i_0_9) ).

cnf(c_0_20,plain,
    ( member(esk1_2(X1,X2),X1)
    | ~ intersect(X1,X2) ),
    i_0_3 ).

cnf(c_0_21,negated_conjecture,
    intersect(esk3_0,esk4_0),
    i_0_11 ).

cnf(c_0_22,plain,
    ( member(X1,X2)
    | ~ member(X1,X3)
    | ~ subset(X3,X2) ),
    i_0_6 ).

cnf(c_0_23,negated_conjecture,
    subset(esk4_0,esk5_0),
    i_0_10 ).

cnf(c_0_24,plain,
    ( member(esk1_2(X1,X2),X2)
    | ~ intersect(X1,X2) ),
    i_0_2 ).

cnf(c_0_25,plain,
    ( intersect(X1,X2)
    | ~ member(X3,X2)
    | ~ member(X3,X1) ),
    i_0_1 ).

cnf(c_0_26,negated_conjecture,
    member(esk1_2(esk3_0,esk4_0),esk3_0),
    inference(spm,[status(thm)],[c_0_20,c_0_21]) ).

cnf(c_0_27,negated_conjecture,
    ( member(X1,esk5_0)
    | ~ member(X1,esk4_0) ),
    inference(spm,[status(thm)],[c_0_22,c_0_23]) ).

cnf(c_0_28,negated_conjecture,
    member(esk1_2(esk3_0,esk4_0),esk4_0),
    inference(spm,[status(thm)],[c_0_24,c_0_21]) ).

cnf(c_0_29,plain,
    ( intersect(X1,esk3_0)
    | ~ member(esk1_2(esk3_0,esk4_0),X1) ),
    inference(spm,[status(thm)],[c_0_25,c_0_26]) ).

cnf(c_0_30,negated_conjecture,
    member(esk1_2(esk3_0,esk4_0),esk5_0),
    inference(spm,[status(thm)],[c_0_27,c_0_28]) ).

cnf(c_0_31,plain,
    ( intersect(X1,X2)
    | ~ intersect(X2,X1) ),
    i_0_7 ).

cnf(c_0_32,negated_conjecture,
    intersect(esk5_0,esk3_0),
    inference(spm,[status(thm)],[c_0_29,c_0_30]) ).

cnf(c_0_33,negated_conjecture,
    ~ intersect(esk3_0,esk5_0),
    i_0_9 ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem  : SET625+3 : TPTP v8.1.0. Released v2.2.0.
% 0.04/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.07/0.33  % Computer : n007.cluster.edu
% 0.07/0.33  % Model    : x86_64 x86_64
% 0.07/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.33  % Memory   : 8042.1875MB
% 0.07/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.07/0.33  % CPULimit : 300
% 0.07/0.33  % WCLimit  : 600
% 0.07/0.33  % DateTime : Sun Jul 10 10:58:18 EDT 2022
% 0.07/0.33  % CPUTime  : 
% 0.11/0.44  # ENIGMATIC: Selected complete mode:
% 7.75/3.39  # ENIGMATIC: Solved by autoschedule:
% 7.75/3.40  # No SInE strategy applied
% 7.75/3.40  # Trying AutoSched0 for 150 seconds
% 7.75/3.40  # AutoSched0-Mode selected heuristic G_E___042_C45_F1_PI_AE_Q4_CS_SP_PS_S4S
% 7.75/3.40  # and selection function SelectNewComplexAHPNS.
% 7.75/3.40  #
% 7.75/3.40  # Preprocessing time       : 0.012 s
% 7.75/3.40  # Presaturation interreduction done
% 7.75/3.40  
% 7.75/3.40  # Proof found!
% 7.75/3.40  # SZS status Theorem
% 7.75/3.40  # SZS output start CNFRefutation
% See solution above
% 7.75/3.40  # Training examples: 0 positive, 0 negative
% 7.75/3.40  
% 7.75/3.40  # -------------------------------------------------
% 7.75/3.40  # User time                : 0.012 s
% 7.75/3.40  # System time              : 0.005 s
% 7.75/3.40  # Total time               : 0.017 s
% 7.75/3.40  # Maximum resident set size: 7132 pages
% 7.75/3.40  
%------------------------------------------------------------------------------