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

% Computer : n009.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 8.05s 2.49s
% Output   : CNFRefutation 8.05s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   17 (   8 unt;   3 nHn;  17 RR)
%            Number of literals    :   30 (   9 equ;  12 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   :    6 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_144,plain,
    ( empty(X1)
    | ~ relation(X1)
    | ~ empty(relation_rng(X1)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2i5dokzw/lgb.p',i_0_144) ).

cnf(i_0_271,negated_conjecture,
    ( relation_dom(esk50_0) = empty_set
    | relation_rng(esk50_0) = empty_set ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2i5dokzw/lgb.p',i_0_271) ).

cnf(i_0_272,negated_conjecture,
    relation(esk50_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2i5dokzw/lgb.p',i_0_272) ).

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

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

cnf(i_0_276,plain,
    ( X1 = empty_set
    | ~ empty(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2i5dokzw/lgb.p',i_0_276) ).

cnf(i_0_270,negated_conjecture,
    esk50_0 != empty_set,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-2i5dokzw/lgb.p',i_0_270) ).

cnf(c_0_284,plain,
    ( empty(X1)
    | ~ relation(X1)
    | ~ empty(relation_rng(X1)) ),
    i_0_144 ).

cnf(c_0_285,negated_conjecture,
    ( relation_dom(esk50_0) = empty_set
    | relation_rng(esk50_0) = empty_set ),
    i_0_271 ).

cnf(c_0_286,negated_conjecture,
    relation(esk50_0),
    i_0_272 ).

cnf(c_0_287,plain,
    empty(empty_set),
    i_0_141 ).

cnf(c_0_288,plain,
    ( empty(X1)
    | ~ relation(X1)
    | ~ empty(relation_dom(X1)) ),
    i_0_143 ).

cnf(c_0_289,negated_conjecture,
    ( relation_dom(esk50_0) = empty_set
    | empty(esk50_0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_284,c_0_285]),c_0_286]),c_0_287])]) ).

cnf(c_0_290,plain,
    ( X1 = empty_set
    | ~ empty(X1) ),
    i_0_276 ).

cnf(c_0_291,plain,
    empty(esk50_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_288,c_0_289]),c_0_286]),c_0_287])]) ).

cnf(c_0_292,negated_conjecture,
    esk50_0 != empty_set,
    i_0_270 ).

cnf(c_0_293,plain,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_290,c_0_291]),c_0_292]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SEU188+2 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.13  % Command  : enigmatic-eprover.py %s %d 1
% 0.13/0.34  % Computer : n009.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Sun Jun 19 23:01:24 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 0.18/0.45  # ENIGMATIC: Selected complete mode:
% 8.05/2.49  # ENIGMATIC: Solved by autoschedule-lgb:
% 8.05/2.49  # No SInE strategy applied
% 8.05/2.49  # Trying AutoSched0 for 150 seconds
% 8.05/2.49  # AutoSched0-Mode selected heuristic G_E___302_C18_F1_URBAN_S0Y
% 8.05/2.49  # and selection function SelectMaxLComplexAvoidPosPred.
% 8.05/2.49  #
% 8.05/2.49  # Preprocessing time       : 0.024 s
% 8.05/2.49  
% 8.05/2.49  # Proof found!
% 8.05/2.49  # SZS status Theorem
% 8.05/2.49  # SZS output start CNFRefutation
% See solution above
% 8.05/2.49  # Training examples: 0 positive, 0 negative
% 8.05/2.49  
% 8.05/2.49  # -------------------------------------------------
% 8.05/2.49  # User time                : 0.033 s
% 8.05/2.49  # System time              : 0.004 s
% 8.05/2.49  # Total time               : 0.037 s
% 8.05/2.49  # Maximum resident set size: 7120 pages
% 8.05/2.49  
%------------------------------------------------------------------------------