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

% Computer : n026.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:46 EDT 2022

% Result   : Theorem 4.46s 2.23s
% Output   : CNFRefutation 4.46s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   22 (  13 unt;   0 nHn;  17 RR)
%            Number of literals    :   31 (  11 equ;  11 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    :    5 (   5 usr;   4 con; 0-2 aty)
%            Number of variables   :   23 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_13,plain,
    ( subset(set_intersection2(X1,X2),set_intersection2(X3,X2))
    | ~ subset(X1,X3) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lh21ybkl/input.p',i_0_13) ).

cnf(i_0_18,negated_conjecture,
    subset(esk3_0,esk4_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lh21ybkl/input.p',i_0_18) ).

cnf(i_0_4,plain,
    ( set_intersection2(X1,X2) = empty_set
    | ~ disjoint(X1,X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lh21ybkl/input.p',i_0_4) ).

cnf(i_0_17,negated_conjecture,
    disjoint(esk4_0,esk5_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lh21ybkl/input.p',i_0_17) ).

cnf(i_0_2,plain,
    set_intersection2(X1,X2) = set_intersection2(X2,X1),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lh21ybkl/input.p',i_0_2) ).

cnf(i_0_3,plain,
    ( disjoint(X1,X2)
    | set_intersection2(X1,X2) != empty_set ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lh21ybkl/input.p',i_0_3) ).

cnf(i_0_15,plain,
    ( X1 = empty_set
    | ~ subset(X1,empty_set) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lh21ybkl/input.p',i_0_15) ).

cnf(i_0_16,negated_conjecture,
    ~ disjoint(esk3_0,esk5_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-lh21ybkl/input.p',i_0_16) ).

cnf(c_0_27,plain,
    ( subset(set_intersection2(X1,X2),set_intersection2(X3,X2))
    | ~ subset(X1,X3) ),
    i_0_13 ).

cnf(c_0_28,negated_conjecture,
    subset(esk3_0,esk4_0),
    i_0_18 ).

cnf(c_0_29,plain,
    ( set_intersection2(X1,X2) = empty_set
    | ~ disjoint(X1,X2) ),
    i_0_4 ).

cnf(c_0_30,negated_conjecture,
    disjoint(esk4_0,esk5_0),
    i_0_17 ).

cnf(c_0_31,negated_conjecture,
    subset(set_intersection2(esk3_0,X1),set_intersection2(esk4_0,X1)),
    inference(spm,[status(thm)],[c_0_27,c_0_28]) ).

cnf(c_0_32,negated_conjecture,
    set_intersection2(esk4_0,esk5_0) = empty_set,
    inference(spm,[status(thm)],[c_0_29,c_0_30]) ).

cnf(c_0_33,plain,
    set_intersection2(X1,X2) = set_intersection2(X2,X1),
    i_0_2 ).

cnf(c_0_34,plain,
    ( disjoint(X1,X2)
    | set_intersection2(X1,X2) != empty_set ),
    i_0_3 ).

cnf(c_0_35,plain,
    ( X1 = empty_set
    | ~ subset(X1,empty_set) ),
    i_0_15 ).

cnf(c_0_36,negated_conjecture,
    subset(set_intersection2(esk5_0,esk3_0),empty_set),
    inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31,c_0_32]),c_0_33]) ).

cnf(c_0_37,plain,
    ( disjoint(X1,X2)
    | set_intersection2(X2,X1) != empty_set ),
    inference(spm,[status(thm)],[c_0_34,c_0_33]) ).

cnf(c_0_38,plain,
    set_intersection2(esk5_0,esk3_0) = empty_set,
    inference(spm,[status(thm)],[c_0_35,c_0_36]) ).

cnf(c_0_39,negated_conjecture,
    ~ disjoint(esk3_0,esk5_0),
    i_0_16 ).

cnf(c_0_40,plain,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_37,c_0_38]),c_0_39]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : SEU140+1 : TPTP v8.1.0. Released v3.3.0.
% 0.11/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n026.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 05:14:26 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.19/0.44  # ENIGMATIC: Selected complete mode:
% 4.46/2.23  # ENIGMATIC: Solved by autoschedule:
% 4.46/2.23  # No SInE strategy applied
% 4.46/2.23  # Trying AutoSched0 for 150 seconds
% 4.46/2.23  # AutoSched0-Mode selected heuristic G_E___008_C45_F1_PI_AE_Q4_CS_SP_S4c
% 4.46/2.23  # and selection function SelectCQPrecWNTNp.
% 4.46/2.23  #
% 4.46/2.23  # Preprocessing time       : 0.023 s
% 4.46/2.23  
% 4.46/2.23  # Proof found!
% 4.46/2.23  # SZS status Theorem
% 4.46/2.23  # SZS output start CNFRefutation
% See solution above
% 4.46/2.23  # Training examples: 0 positive, 0 negative
% 4.46/2.23  
% 4.46/2.23  # -------------------------------------------------
% 4.46/2.23  # User time                : 0.024 s
% 4.46/2.23  # System time              : 0.004 s
% 4.46/2.23  # Total time               : 0.028 s
% 4.46/2.23  # Maximum resident set size: 7120 pages
% 4.46/2.23  
%------------------------------------------------------------------------------