%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : SET148+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:09:56 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_17,negated_conjecture,
    intersection(esk3_0,esk3_0) != esk3_0,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-an2qn6ux/input.p',i_0_17) ).

cnf(i_0_1,plain,
    ( intersection(X1,X2) = X1
    | ~ subset(X1,X2) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-an2qn6ux/input.p',i_0_1) ).

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

cnf(c_0_21,negated_conjecture,
    intersection(esk3_0,esk3_0) != esk3_0,
    i_0_17 ).

cnf(c_0_22,plain,
    ( intersection(X1,X2) = X1
    | ~ subset(X1,X2) ),
    i_0_1 ).

cnf(c_0_23,plain,
    subset(X1,X1),
    i_0_12 ).

cnf(c_0_24,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21,c_0_22]),c_0_23])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem  : SET148+3 : TPTP v8.1.0. Released v2.2.0.
% 0.00/0.11  % Command  : enigmatic-eprover.py %s %d 1
% 0.11/0.32  % Computer : n011.cluster.edu
% 0.11/0.32  % Model    : x86_64 x86_64
% 0.11/0.32  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.32  % Memory   : 8042.1875MB
% 0.11/0.32  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.32  % CPULimit : 300
% 0.11/0.32  % WCLimit  : 600
% 0.11/0.32  % DateTime : Sat Jul  9 22:09:43 EDT 2022
% 0.11/0.32  % CPUTime  : 
% 0.17/0.43  # ENIGMATIC: Selected complete mode:
% 6.01/2.05  # ENIGMATIC: Solved by autoschedule:
% 6.01/2.05  # No SInE strategy applied
% 6.01/2.05  # Trying AutoSched0 for 150 seconds
% 6.01/2.05  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S04CA
% 6.01/2.05  # and selection function MSelectComplexExceptUniqMaxHorn.
% 6.01/2.05  #
% 6.01/2.05  # Preprocessing time       : 0.023 s
% 6.01/2.05  # Presaturation interreduction done
% 6.01/2.05  
% 6.01/2.05  # Proof found!
% 6.01/2.05  # SZS status Theorem
% 6.01/2.05  # SZS output start CNFRefutation
% See solution above
% 6.01/2.05  # Training examples: 0 positive, 0 negative
% 6.01/2.05  
% 6.01/2.05  # -------------------------------------------------
% 6.01/2.05  # User time                : 0.022 s
% 6.01/2.05  # System time              : 0.007 s
% 6.01/2.05  # Total time               : 0.028 s
% 6.01/2.05  # Maximum resident set size: 7116 pages
% 6.01/2.05  
%------------------------------------------------------------------------------