%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : SEU120+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : enigmatic-eprover.py %s %d 1

% Computer : n017.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 08:38:34 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_4,plain,
    ( X1 != empty_set
    | ~ in(X2,X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8z8sdp1f/input.p',i_0_4) ).

cnf(i_0_17,negated_conjecture,
    ( in(esk6_0,set_intersection2(esk4_0,esk5_0))
    | ~ disjoint(esk4_0,esk5_0) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8z8sdp1f/input.p',i_0_17) ).

cnf(i_0_5,plain,
    ( disjoint(X1,X2)
    | set_intersection2(X1,X2) != empty_set ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8z8sdp1f/input.p',i_0_5) ).

cnf(i_0_14,negated_conjecture,
    ( disjoint(esk4_0,esk5_0)
    | ~ in(X1,set_intersection2(esk4_0,esk5_0)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8z8sdp1f/input.p',i_0_14) ).

cnf(i_0_3,plain,
    ( X1 = empty_set
    | in(esk1_1(X1),X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8z8sdp1f/input.p',i_0_3) ).

cnf(i_0_6,plain,
    ( set_intersection2(X1,X2) = empty_set
    | ~ disjoint(X1,X2) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-8z8sdp1f/input.p',i_0_6) ).

cnf(c_0_24,plain,
    ( X1 != empty_set
    | ~ in(X2,X1) ),
    i_0_4 ).

cnf(c_0_25,negated_conjecture,
    ( in(esk6_0,set_intersection2(esk4_0,esk5_0))
    | ~ disjoint(esk4_0,esk5_0) ),
    i_0_17 ).

cnf(c_0_26,plain,
    ( disjoint(X1,X2)
    | set_intersection2(X1,X2) != empty_set ),
    i_0_5 ).

cnf(c_0_27,negated_conjecture,
    ( disjoint(esk4_0,esk5_0)
    | ~ in(X1,set_intersection2(esk4_0,esk5_0)) ),
    i_0_14 ).

cnf(c_0_28,plain,
    ( X1 = empty_set
    | in(esk1_1(X1),X1) ),
    i_0_3 ).

cnf(c_0_29,negated_conjecture,
    set_intersection2(esk4_0,esk5_0) != empty_set,
    inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_24,c_0_25]),c_0_26]) ).

cnf(c_0_30,plain,
    ( set_intersection2(X1,X2) = empty_set
    | ~ disjoint(X1,X2) ),
    i_0_6 ).

cnf(c_0_31,negated_conjecture,
    disjoint(esk4_0,esk5_0),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_27,c_0_28]),c_0_29]) ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SEU120+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n017.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 Jun 19 23:01:46 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.45  # ENIGMATIC: Selected complete mode:
% 7.39/2.19  # ENIGMATIC: Solved by autoschedule:
% 7.39/2.19  # No SInE strategy applied
% 7.39/2.19  # Trying AutoSched0 for 150 seconds
% 7.39/2.19  # AutoSched0-Mode selected heuristic G_E___205_C45_F1_AE_CS_SP_PI_S0Y
% 7.39/2.19  # and selection function SelectMaxLComplexAvoidPosPred.
% 7.39/2.19  #
% 7.39/2.19  # Preprocessing time       : 0.023 s
% 7.39/2.19  
% 7.39/2.19  # Proof found!
% 7.39/2.19  # SZS status Theorem
% 7.39/2.19  # SZS output start CNFRefutation
% See solution above
% 7.39/2.19  # Training examples: 0 positive, 0 negative
% 7.39/2.19  
% 7.39/2.19  # -------------------------------------------------
% 7.39/2.19  # User time                : 0.024 s
% 7.39/2.19  # System time              : 0.006 s
% 7.39/2.19  # Total time               : 0.029 s
% 7.39/2.19  # Maximum resident set size: 7124 pages
% 7.39/2.19  
%------------------------------------------------------------------------------