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

% Computer : n022.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:40 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_4,plain,
    ( X1 = X2
    | ~ subset(X2,X1)
    | ~ subset(X1,X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-yw5oqm5t/input.p',i_0_4) ).

cnf(i_0_39,lemma,
    subset(set_intersection2(X1,X2),X1),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-yw5oqm5t/input.p',i_0_39) ).

cnf(i_0_40,lemma,
    ( subset(X1,set_intersection2(X2,X3))
    | ~ subset(X1,X3)
    | ~ subset(X1,X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-yw5oqm5t/input.p',i_0_40) ).

cnf(i_0_36,plain,
    subset(X1,X1),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-yw5oqm5t/input.p',i_0_36) ).

cnf(i_0_44,negated_conjecture,
    set_intersection2(esk7_0,esk8_0) != esk7_0,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-yw5oqm5t/input.p',i_0_44) ).

cnf(i_0_45,negated_conjecture,
    subset(esk7_0,esk8_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-yw5oqm5t/input.p',i_0_45) ).

cnf(c_0_52,plain,
    ( X1 = X2
    | ~ subset(X2,X1)
    | ~ subset(X1,X2) ),
    i_0_4 ).

cnf(c_0_53,lemma,
    subset(set_intersection2(X1,X2),X1),
    i_0_39 ).

cnf(c_0_54,lemma,
    ( set_intersection2(X1,X2) = X1
    | ~ subset(X1,set_intersection2(X1,X2)) ),
    inference(spm,[status(thm)],[c_0_52,c_0_53]) ).

cnf(c_0_55,lemma,
    ( subset(X1,set_intersection2(X2,X3))
    | ~ subset(X1,X3)
    | ~ subset(X1,X2) ),
    i_0_40 ).

cnf(c_0_56,plain,
    subset(X1,X1),
    i_0_36 ).

cnf(c_0_57,negated_conjecture,
    set_intersection2(esk7_0,esk8_0) != esk7_0,
    i_0_44 ).

cnf(c_0_58,lemma,
    ( set_intersection2(X1,X2) = X1
    | ~ subset(X1,X2) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_55]),c_0_56])]) ).

cnf(c_0_59,negated_conjecture,
    subset(esk7_0,esk8_0),
    i_0_45 ).

cnf(c_0_60,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_59])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11  % Problem  : SEU130+2 : TPTP v8.1.0. Released v3.3.0.
% 0.11/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n022.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 03:28:48 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.43  # ENIGMATIC: Selected complete mode:
% 7.86/2.31  # ENIGMATIC: Solved by autoschedule:
% 7.86/2.31  # No SInE strategy applied
% 7.86/2.31  # Trying AutoSched0 for 150 seconds
% 7.86/2.31  # AutoSched0-Mode selected heuristic G_E___107_B42_F1_PI_SE_Q4_CS_SP_PS_S5PRR_S0Y
% 7.86/2.31  # and selection function SelectMaxLComplexAvoidPosPred.
% 7.86/2.31  #
% 7.86/2.31  # Preprocessing time       : 0.023 s
% 7.86/2.31  # Presaturation interreduction done
% 7.86/2.31  
% 7.86/2.31  # Proof found!
% 7.86/2.31  # SZS status Theorem
% 7.86/2.31  # SZS output start CNFRefutation
% See solution above
% 7.86/2.31  # Training examples: 0 positive, 0 negative
% 7.86/2.31  
% 7.86/2.31  # -------------------------------------------------
% 7.86/2.31  # User time                : 0.043 s
% 7.86/2.31  # System time              : 0.006 s
% 7.86/2.31  # Total time               : 0.049 s
% 7.86/2.31  # Maximum resident set size: 7120 pages
% 7.86/2.31  
%------------------------------------------------------------------------------