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

% Computer : n021.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:41 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_58,negated_conjecture,
    ( relation_rng(function_inverse(esk12_0)) != relation_dom(esk12_0)
    | relation_rng(esk12_0) != relation_dom(function_inverse(esk12_0)) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-07tqsvk1/input.p',i_0_58) ).

cnf(i_0_7,plain,
    ( relation_inverse(X1) = function_inverse(X1)
    | ~ function(X1)
    | ~ relation(X1)
    | ~ one_to_one(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-07tqsvk1/input.p',i_0_7) ).

cnf(i_0_59,negated_conjecture,
    one_to_one(esk12_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-07tqsvk1/input.p',i_0_59) ).

cnf(i_0_61,negated_conjecture,
    relation(esk12_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-07tqsvk1/input.p',i_0_61) ).

cnf(i_0_60,negated_conjecture,
    function(esk12_0),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-07tqsvk1/input.p',i_0_60) ).

cnf(i_0_53,plain,
    ( relation_rng(relation_inverse(X1)) = relation_dom(X1)
    | ~ relation(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-07tqsvk1/input.p',i_0_53) ).

cnf(i_0_54,plain,
    ( relation_dom(relation_inverse(X1)) = relation_rng(X1)
    | ~ relation(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-07tqsvk1/input.p',i_0_54) ).

cnf(c_0_69,negated_conjecture,
    ( relation_rng(function_inverse(esk12_0)) != relation_dom(esk12_0)
    | relation_rng(esk12_0) != relation_dom(function_inverse(esk12_0)) ),
    i_0_58 ).

cnf(c_0_70,plain,
    ( relation_inverse(X1) = function_inverse(X1)
    | ~ function(X1)
    | ~ relation(X1)
    | ~ one_to_one(X1) ),
    i_0_7 ).

cnf(c_0_71,negated_conjecture,
    one_to_one(esk12_0),
    i_0_59 ).

cnf(c_0_72,negated_conjecture,
    relation(esk12_0),
    i_0_61 ).

cnf(c_0_73,negated_conjecture,
    function(esk12_0),
    i_0_60 ).

cnf(c_0_74,negated_conjecture,
    ( relation_dom(relation_inverse(esk12_0)) != relation_rng(esk12_0)
    | relation_rng(relation_inverse(esk12_0)) != relation_dom(esk12_0) ),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_69,c_0_70]),c_0_71]),c_0_72]),c_0_73])]) ).

cnf(c_0_75,plain,
    ( relation_rng(relation_inverse(X1)) = relation_dom(X1)
    | ~ relation(X1) ),
    i_0_53 ).

cnf(c_0_76,plain,
    relation_dom(relation_inverse(esk12_0)) != relation_rng(esk12_0),
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_74,c_0_75]),c_0_72])]) ).

cnf(c_0_77,plain,
    ( relation_dom(relation_inverse(X1)) = relation_rng(X1)
    | ~ relation(X1) ),
    i_0_54 ).

cnf(c_0_78,plain,
    $false,
    inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_76,c_0_77]),c_0_72])]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem  : SEU219+3 : TPTP v8.1.0. Released v3.2.0.
% 0.12/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n021.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 : Sun Jun 19 19:28:19 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.19/0.45  # ENIGMATIC: Selected complete mode:
% 7.52/2.35  # ENIGMATIC: Solved by autoschedule:
% 7.52/2.35  # No SInE strategy applied
% 7.52/2.35  # Trying AutoSched0 for 150 seconds
% 7.52/2.35  # AutoSched0-Mode selected heuristic G_E___300_C18_F1_SE_CS_SP_S0Y
% 7.52/2.35  # and selection function SelectMaxLComplexAvoidPosPred.
% 7.52/2.35  #
% 7.52/2.35  # Preprocessing time       : 0.024 s
% 7.52/2.35  
% 7.52/2.35  # Proof found!
% 7.52/2.35  # SZS status Theorem
% 7.52/2.35  # SZS output start CNFRefutation
% See solution above
% 7.52/2.35  # Training examples: 0 positive, 0 negative
% 7.52/2.35  
% 7.52/2.35  # -------------------------------------------------
% 7.52/2.35  # User time                : 0.026 s
% 7.52/2.35  # System time              : 0.006 s
% 7.52/2.35  # Total time               : 0.033 s
% 7.52/2.35  # Maximum resident set size: 7124 pages
% 7.52/2.35  
%------------------------------------------------------------------------------