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

% Computer : n026.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.42s 2.40s
% Output   : CNFRefutation 7.42s
% 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 (  23 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    :    4 (   4 usr;   2 con; 0-1 aty)
%            Number of variables   :    4 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_33,plain,
    ( X1 = empty_set
    | relation_rng(X1) != empty_set
    | ~ relation(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-runuzaa0/lgb.p',i_0_33) ).

cnf(i_0_28,negated_conjecture,
    ( relation_dom(esk6_0) = empty_set
    | relation_rng(esk6_0) = empty_set ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-runuzaa0/lgb.p',i_0_28) ).

cnf(i_0_30,negated_conjecture,
    relation(esk6_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-runuzaa0/lgb.p',i_0_30) ).

cnf(i_0_34,plain,
    ( X1 = empty_set
    | relation_dom(X1) != empty_set
    | ~ relation(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-runuzaa0/lgb.p',i_0_34) ).

cnf(i_0_29,negated_conjecture,
    ( relation_dom(esk6_0) != empty_set
    | relation_rng(esk6_0) != empty_set ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-runuzaa0/lgb.p',i_0_29) ).

cnf(i_0_32,plain,
    relation_dom(empty_set) = empty_set,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-runuzaa0/lgb.p',i_0_32) ).

cnf(i_0_31,plain,
    relation_rng(empty_set) = empty_set,
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-runuzaa0/lgb.p',i_0_31) ).

cnf(c_0_42,plain,
    ( X1 = empty_set
    | relation_rng(X1) != empty_set
    | ~ relation(X1) ),
    i_0_33 ).

cnf(c_0_43,negated_conjecture,
    ( relation_dom(esk6_0) = empty_set
    | relation_rng(esk6_0) = empty_set ),
    i_0_28 ).

cnf(c_0_44,negated_conjecture,
    relation(esk6_0),
    i_0_30 ).

cnf(c_0_45,plain,
    ( X1 = empty_set
    | relation_dom(X1) != empty_set
    | ~ relation(X1) ),
    i_0_34 ).

cnf(c_0_46,negated_conjecture,
    ( relation_dom(esk6_0) = empty_set
    | esk6_0 = empty_set ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_42,c_0_43]),c_0_44])]) ).

cnf(c_0_47,negated_conjecture,
    ( relation_dom(esk6_0) != empty_set
    | relation_rng(esk6_0) != empty_set ),
    i_0_29 ).

cnf(c_0_48,plain,
    esk6_0 = empty_set,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45,c_0_46]),c_0_44])]) ).

cnf(c_0_49,plain,
    relation_dom(empty_set) = empty_set,
    i_0_32 ).

cnf(c_0_50,plain,
    relation_rng(empty_set) = empty_set,
    i_0_31 ).

cnf(c_0_51,negated_conjecture,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_47,c_0_48]),c_0_49]),c_0_48]),c_0_50])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : SEU189+1 : TPTP v8.1.0. Released v3.3.0.
% 0.07/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n026.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 11:31:42 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.19/0.44  # ENIGMATIC: Selected complete mode:
% 7.42/2.40  # ENIGMATIC: Solved by autoschedule-lgb:
% 7.42/2.40  # No SInE strategy applied
% 7.42/2.40  # Trying AutoSched0 for 150 seconds
% 7.42/2.40  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S021N
% 7.42/2.40  # and selection function PSelectAllCondOptimalLit.
% 7.42/2.40  #
% 7.42/2.40  # Preprocessing time       : 0.023 s
% 7.42/2.40  # Presaturation interreduction done
% 7.42/2.40  
% 7.42/2.40  # Proof found!
% 7.42/2.40  # SZS status Theorem
% 7.42/2.40  # SZS output start CNFRefutation
% See solution above
% 7.42/2.40  # Training examples: 0 positive, 0 negative
% 7.42/2.40  
% 7.42/2.40  # -------------------------------------------------
% 7.42/2.40  # User time                : 0.022 s
% 7.42/2.40  # System time              : 0.006 s
% 7.42/2.40  # Total time               : 0.028 s
% 7.42/2.40  # Maximum resident set size: 7124 pages
% 7.42/2.40  
%------------------------------------------------------------------------------