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

% Computer : n008.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:53 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_13,plain,
    ( epsilon_transitive(X1)
    | ~ subset(esk1_1(X1),X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-i_6ml1fj/lgb.p',i_0_13) ).

cnf(i_0_81,negated_conjecture,
    ( subset(X1,esk17_0)
    | ~ in(X1,esk17_0) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-i_6ml1fj/lgb.p',i_0_81) ).

cnf(i_0_14,plain,
    ( epsilon_transitive(X1)
    | in(esk1_1(X1),X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-i_6ml1fj/lgb.p',i_0_14) ).

cnf(i_0_78,plain,
    ( X1 = X2
    | in(X2,X1)
    | in(X1,X2)
    | ~ ordinal(X2)
    | ~ ordinal(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-i_6ml1fj/lgb.p',i_0_78) ).

cnf(i_0_82,negated_conjecture,
    ( ordinal(X1)
    | ~ in(X1,esk17_0) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-i_6ml1fj/lgb.p',i_0_82) ).

cnf(i_0_9,plain,
    ( ordinal(X1)
    | ~ epsilon_transitive(X1)
    | ~ epsilon_connected(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-i_6ml1fj/lgb.p',i_0_9) ).

cnf(i_0_80,negated_conjecture,
    ~ ordinal(esk17_0),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-i_6ml1fj/lgb.p',i_0_80) ).

cnf(i_0_20,plain,
    ( epsilon_connected(X1)
    | in(esk2_1(X1),X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-i_6ml1fj/lgb.p',i_0_20) ).

cnf(i_0_19,plain,
    ( epsilon_connected(X1)
    | in(esk3_1(X1),X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-i_6ml1fj/lgb.p',i_0_19) ).

cnf(i_0_18,plain,
    ( epsilon_connected(X1)
    | ~ in(esk2_1(X1),esk3_1(X1)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-i_6ml1fj/lgb.p',i_0_18) ).

cnf(i_0_16,plain,
    ( epsilon_connected(X1)
    | ~ in(esk3_1(X1),esk2_1(X1)) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-i_6ml1fj/lgb.p',i_0_16) ).

cnf(i_0_17,plain,
    ( epsilon_connected(X1)
    | esk3_1(X1) != esk2_1(X1) ),
    file('/export/starexec/sandbox2/tmp/enigma-theBenchmark.p-i_6ml1fj/lgb.p',i_0_17) ).

cnf(c_0_95,plain,
    ( epsilon_transitive(X1)
    | ~ subset(esk1_1(X1),X1) ),
    i_0_13 ).

cnf(c_0_96,negated_conjecture,
    ( subset(X1,esk17_0)
    | ~ in(X1,esk17_0) ),
    i_0_81 ).

cnf(c_0_97,negated_conjecture,
    ( epsilon_transitive(esk17_0)
    | ~ in(esk1_1(esk17_0),esk17_0) ),
    inference(spm,[status(thm)],[c_0_95,c_0_96]) ).

cnf(c_0_98,plain,
    ( epsilon_transitive(X1)
    | in(esk1_1(X1),X1) ),
    i_0_14 ).

cnf(c_0_99,plain,
    ( X1 = X2
    | in(X2,X1)
    | in(X1,X2)
    | ~ ordinal(X2)
    | ~ ordinal(X1) ),
    i_0_78 ).

cnf(c_0_100,negated_conjecture,
    ( ordinal(X1)
    | ~ in(X1,esk17_0) ),
    i_0_82 ).

cnf(c_0_101,plain,
    ( ordinal(X1)
    | ~ epsilon_transitive(X1)
    | ~ epsilon_connected(X1) ),
    i_0_9 ).

cnf(c_0_102,negated_conjecture,
    epsilon_transitive(esk17_0),
    inference(spm,[status(thm)],[c_0_97,c_0_98]) ).

cnf(c_0_103,negated_conjecture,
    ~ ordinal(esk17_0),
    i_0_80 ).

cnf(c_0_104,negated_conjecture,
    ( X1 = X2
    | in(X1,X2)
    | in(X2,X1)
    | ~ ordinal(X1)
    | ~ in(X2,esk17_0) ),
    inference(spm,[status(thm)],[c_0_99,c_0_100]) ).

cnf(c_0_105,plain,
    ( epsilon_connected(X1)
    | in(esk2_1(X1),X1) ),
    i_0_20 ).

cnf(c_0_106,plain,
    ~ epsilon_connected(esk17_0),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_101,c_0_102]),c_0_103]) ).

cnf(c_0_107,plain,
    ( X1 = esk2_1(esk17_0)
    | in(esk2_1(esk17_0),X1)
    | in(X1,esk2_1(esk17_0))
    | ~ ordinal(X1) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_104,c_0_105]),c_0_106]) ).

cnf(c_0_108,negated_conjecture,
    ( X1 = esk2_1(esk17_0)
    | in(X1,esk2_1(esk17_0))
    | in(esk2_1(esk17_0),X1)
    | ~ in(X1,esk17_0) ),
    inference(spm,[status(thm)],[c_0_107,c_0_100]) ).

cnf(c_0_109,plain,
    ( epsilon_connected(X1)
    | in(esk3_1(X1),X1) ),
    i_0_19 ).

cnf(c_0_110,plain,
    ( epsilon_connected(X1)
    | ~ in(esk2_1(X1),esk3_1(X1)) ),
    i_0_18 ).

cnf(c_0_111,plain,
    ( esk2_1(esk17_0) = esk3_1(esk17_0)
    | in(esk2_1(esk17_0),esk3_1(esk17_0))
    | in(esk3_1(esk17_0),esk2_1(esk17_0)) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_108,c_0_109]),c_0_106]) ).

cnf(c_0_112,plain,
    ( epsilon_connected(X1)
    | ~ in(esk3_1(X1),esk2_1(X1)) ),
    i_0_16 ).

cnf(c_0_113,plain,
    ( esk2_1(esk17_0) = esk3_1(esk17_0)
    | in(esk3_1(esk17_0),esk2_1(esk17_0)) ),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_110,c_0_111]),c_0_106]) ).

cnf(c_0_114,plain,
    ( epsilon_connected(X1)
    | esk3_1(X1) != esk2_1(X1) ),
    i_0_17 ).

cnf(c_0_115,plain,
    esk2_1(esk17_0) = esk3_1(esk17_0),
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_112,c_0_113]),c_0_106]) ).

cnf(c_0_116,plain,
    $false,
    inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_114,c_0_115]),c_0_106]),
    [proof] ).

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