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

% Computer : n017.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 : Mon Jul 18 08:35:39 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(i_0_14,plain,
    ( ordinal(X1)
    | ~ epsilon_transitive(X1)
    | ~ epsilon_connected(X1) ),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-37k40wqz/input.p',i_0_14) ).

cnf(i_0_51,plain,
    epsilon_connected(empty_set),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-37k40wqz/input.p',i_0_51) ).

cnf(i_0_52,plain,
    epsilon_transitive(empty_set),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-37k40wqz/input.p',i_0_52) ).

cnf(i_0_47,negated_conjecture,
    ~ ordinal(empty_set),
    file('/export/starexec/sandbox/tmp/enigma-theBenchmark.p-37k40wqz/input.p',i_0_47) ).

cnf(c_0_57,plain,
    ( ordinal(X1)
    | ~ epsilon_transitive(X1)
    | ~ epsilon_connected(X1) ),
    i_0_14 ).

cnf(c_0_58,plain,
    epsilon_connected(empty_set),
    i_0_51 ).

cnf(c_0_59,plain,
    epsilon_transitive(empty_set),
    i_0_52 ).

cnf(c_0_60,negated_conjecture,
    ~ ordinal(empty_set),
    i_0_47 ).

cnf(c_0_61,plain,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_57,c_0_58]),c_0_59])]),c_0_60]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : NUM395+1 : TPTP v8.1.0. Released v3.2.0.
% 0.03/0.12  % Command  : enigmatic-eprover.py %s %d 1
% 0.12/0.33  % Computer : n017.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 : Thu Jul  7 01:29:01 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.19/0.45  # ENIGMATIC: Selected complete mode:
% 7.30/2.21  # ENIGMATIC: Solved by autoschedule:
% 7.30/2.21  # No SInE strategy applied
% 7.30/2.21  # Trying AutoSched0 for 150 seconds
% 7.30/2.21  # AutoSched0-Mode selected heuristic G_E___208_C18_F1_SE_CS_SP_PS_S021N
% 7.30/2.21  # and selection function PSelectAllCondOptimalLit.
% 7.30/2.21  #
% 7.30/2.21  # Preprocessing time       : 0.023 s
% 7.30/2.21  # Presaturation interreduction done
% 7.30/2.21  
% 7.30/2.21  # Proof found!
% 7.30/2.21  # SZS status Theorem
% 7.30/2.21  # SZS output start CNFRefutation
% See solution above
% 7.30/2.21  # Training examples: 0 positive, 0 negative
% 7.30/2.21  
% 7.30/2.21  # -------------------------------------------------
% 7.30/2.21  # User time                : 0.027 s
% 7.30/2.21  # System time              : 0.006 s
% 7.30/2.21  # Total time               : 0.033 s
% 7.30/2.21  # Maximum resident set size: 7120 pages
% 7.30/2.21  
%------------------------------------------------------------------------------