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

% Computer : n029.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:35 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_12,plain,
    ( ~ empty(X1)
    | ~ in(X2,X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-i69rv8wk/lgb.p',i_0_12) ).

cnf(i_0_3,plain,
    ( subset(X1,X2)
    | in(esk1_2(X1,X2),X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-i69rv8wk/lgb.p',i_0_3) ).

cnf(i_0_10,negated_conjecture,
    ~ subset(empty_set,esk4_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-i69rv8wk/lgb.p',i_0_10) ).

cnf(i_0_6,plain,
    empty(empty_set),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-i69rv8wk/lgb.p',i_0_6) ).

cnf(c_0_17,plain,
    ( ~ empty(X1)
    | ~ in(X2,X1) ),
    i_0_12 ).

cnf(c_0_18,plain,
    ( subset(X1,X2)
    | in(esk1_2(X1,X2),X1) ),
    i_0_3 ).

cnf(c_0_19,negated_conjecture,
    ~ subset(empty_set,esk4_0),
    i_0_10 ).

cnf(c_0_20,plain,
    ( subset(X1,X2)
    | ~ empty(X1) ),
    inference(spm,[status(thm)],[c_0_17,c_0_18]) ).

cnf(c_0_21,plain,
    empty(empty_set),
    i_0_6 ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : SEU122+1 : TPTP v8.1.0. Released v3.3.0.
% 0.12/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n029.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 : Mon Jun 20 05:00:32 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.17/0.44  # ENIGMATIC: Selected complete mode:
% 7.60/2.32  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.60/2.32  # No SInE strategy applied
% 7.60/2.32  # Trying AutoSched0 for 150 seconds
% 7.60/2.32  # AutoSched0-Mode selected heuristic G_E___302_C18_F1_URBAN_S0Y
% 7.60/2.32  # and selection function SelectMaxLComplexAvoidPosPred.
% 7.60/2.32  #
% 7.60/2.32  # Preprocessing time       : 0.023 s
% 7.60/2.32  
% 7.60/2.32  # Proof found!
% 7.60/2.32  # SZS status Theorem
% 7.60/2.32  # SZS output start CNFRefutation
% See solution above
% 7.60/2.32  # Training examples: 0 positive, 0 negative
% 7.60/2.32  
% 7.60/2.32  # -------------------------------------------------
% 7.60/2.32  # User time                : 0.023 s
% 7.60/2.32  # System time              : 0.006 s
% 7.60/2.32  # Total time               : 0.028 s
% 7.60/2.32  # Maximum resident set size: 7124 pages
% 7.60/2.32  
%------------------------------------------------------------------------------