%------------------------------------------------------------------------------
% File     : Enigma---0.5.1
% Problem  : SEU188+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:39:20 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_45,plain,
    ( X1 = empty_set
    | ~ empty(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3fap1r7u/lgb.p',i_0_45) ).

cnf(i_0_32,plain,
    ( empty(relation_rng(X1))
    | ~ empty(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3fap1r7u/lgb.p',i_0_32) ).

cnf(i_0_27,plain,
    ( empty(X1)
    | ~ relation(X1)
    | ~ empty(relation_dom(X1)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3fap1r7u/lgb.p',i_0_27) ).

cnf(i_0_43,negated_conjecture,
    ( relation_dom(esk14_0) = empty_set
    | relation_rng(esk14_0) = empty_set ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3fap1r7u/lgb.p',i_0_43) ).

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

cnf(i_0_44,negated_conjecture,
    relation(esk14_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3fap1r7u/lgb.p',i_0_44) ).

cnf(i_0_28,plain,
    ( empty(X1)
    | ~ relation(X1)
    | ~ empty(relation_rng(X1)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3fap1r7u/lgb.p',i_0_28) ).

cnf(i_0_42,negated_conjecture,
    esk14_0 != empty_set,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-3fap1r7u/lgb.p',i_0_42) ).

cnf(c_0_54,plain,
    ( X1 = empty_set
    | ~ empty(X1) ),
    i_0_45 ).

cnf(c_0_55,plain,
    ( empty(relation_rng(X1))
    | ~ empty(X1) ),
    i_0_32 ).

cnf(c_0_56,plain,
    ( empty(X1)
    | ~ relation(X1)
    | ~ empty(relation_dom(X1)) ),
    i_0_27 ).

cnf(c_0_57,negated_conjecture,
    ( relation_dom(esk14_0) = empty_set
    | relation_rng(esk14_0) = empty_set ),
    i_0_43 ).

cnf(c_0_58,plain,
    empty(empty_set),
    i_0_26 ).

cnf(c_0_59,negated_conjecture,
    relation(esk14_0),
    i_0_44 ).

cnf(c_0_60,plain,
    ( relation_rng(X1) = empty_set
    | ~ empty(X1) ),
    inference(spm,[status(thm)],[c_0_54,c_0_55]) ).

cnf(c_0_61,plain,
    ( empty(X1)
    | ~ relation(X1)
    | ~ empty(relation_rng(X1)) ),
    i_0_28 ).

cnf(c_0_62,negated_conjecture,
    relation_rng(esk14_0) = empty_set,
    inference(csr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_56,c_0_57]),c_0_58]),c_0_59])]),c_0_60]) ).

cnf(c_0_63,negated_conjecture,
    empty(esk14_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_61,c_0_62]),c_0_58]),c_0_59])]) ).

cnf(c_0_64,negated_conjecture,
    esk14_0 != empty_set,
    i_0_42 ).

cnf(c_0_65,plain,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_54,c_0_63]),c_0_64]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SEU188+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.33  % Computer : n029.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 600
% 0.13/0.33  % DateTime : Sun Jun 19 02:24:31 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 0.19/0.44  # ENIGMATIC: Selected complete mode:
% 7.14/2.23  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.14/2.23  # No SInE strategy applied
% 7.14/2.23  # Trying AutoSched0 for 150 seconds
% 7.14/2.23  # AutoSched0-Mode selected heuristic G_____0021_C18_F1_SE_CS_SP_S0Y
% 7.14/2.23  # and selection function SelectMaxLComplexAvoidPosPred.
% 7.14/2.23  #
% 7.14/2.23  # Preprocessing time       : 0.023 s
% 7.14/2.23  
% 7.14/2.23  # Proof found!
% 7.14/2.23  # SZS status Theorem
% 7.14/2.23  # SZS output start CNFRefutation
% See solution above
% 7.14/2.23  # Training examples: 0 positive, 0 negative
% 7.14/2.23  
% 7.14/2.23  # -------------------------------------------------
% 7.14/2.23  # User time                : 0.021 s
% 7.14/2.23  # System time              : 0.008 s
% 7.14/2.23  # Total time               : 0.030 s
% 7.14/2.23  # Maximum resident set size: 7124 pages
% 7.14/2.23  
%------------------------------------------------------------------------------