%------------------------------------------------------------------------------
% File     : CSE_E---1.5
% Problem  : NUM395+1 : TPTP v8.1.2. Released v3.2.0.
% Transfm  : none
% Format   : tptp:raw
% Command  : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s

% Computer : n020.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  : 300s
% DateTime : Thu Aug 31 10:37:11 EDT 2023

% Result   : Theorem 0.20s 0.59s
% Output   : CNFRefutation 0.20s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :   27
% Syntax   : Number of formulae    :   34 (   6 unt;  24 typ;   0 def)
%            Number of atoms       :   17 (   0 equ)
%            Maximal formula atoms :    3 (   1 avg)
%            Number of connectives :   13 (   6   ~;   4   |;   2   &)
%                                         (   0 <=>;   1  =>;   0  <=;   0 <~>)
%            Maximal formula depth :    5 (   2 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of types       :    2 (   0 usr)
%            Number of type conns  :   14 (  12   >;   2   *;   0   +;   0  <<)
%            Number of predicates  :   12 (  11 usr;   1 prp; 0-2 aty)
%            Number of functors    :   13 (  13 usr;  12 con; 0-1 aty)
%            Number of variables   :    3 (   0 sgn;   2   !;   0   ?;   0   :)

% Comments : 
%------------------------------------------------------------------------------
tff(decl_22,type,
    element: ( $i * $i ) > $o ).

tff(decl_23,type,
    empty: $i > $o ).

tff(decl_24,type,
    in: ( $i * $i ) > $o ).

tff(decl_25,type,
    function: $i > $o ).

tff(decl_26,type,
    relation: $i > $o ).

tff(decl_27,type,
    one_to_one: $i > $o ).

tff(decl_28,type,
    ordinal: $i > $o ).

tff(decl_29,type,
    epsilon_transitive: $i > $o ).

tff(decl_30,type,
    epsilon_connected: $i > $o ).

tff(decl_31,type,
    relation_empty_yielding: $i > $o ).

tff(decl_32,type,
    relation_non_empty: $i > $o ).

tff(decl_33,type,
    empty_set: $i ).

tff(decl_34,type,
    esk1_1: $i > $i ).

tff(decl_35,type,
    esk2_0: $i ).

tff(decl_36,type,
    esk3_0: $i ).

tff(decl_37,type,
    esk4_0: $i ).

tff(decl_38,type,
    esk5_0: $i ).

tff(decl_39,type,
    esk6_0: $i ).

tff(decl_40,type,
    esk7_0: $i ).

tff(decl_41,type,
    esk8_0: $i ).

tff(decl_42,type,
    esk9_0: $i ).

tff(decl_43,type,
    esk10_0: $i ).

tff(decl_44,type,
    esk11_0: $i ).

tff(decl_45,type,
    esk12_0: $i ).

fof(cc2_ordinal1,axiom,
    ! [X1] :
      ( ( epsilon_transitive(X1)
        & epsilon_connected(X1) )
     => ordinal(X1) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',cc2_ordinal1) ).

fof(t27_ordinal1,conjecture,
    ordinal(empty_set),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',t27_ordinal1) ).

fof(l18_ordinal1,axiom,
    ( epsilon_transitive(empty_set)
    & epsilon_connected(empty_set) ),
    file('/export/starexec/sandbox2/benchmark/theBenchmark.p',l18_ordinal1) ).

fof(c_0_3,plain,
    ! [X19] :
      ( ~ epsilon_transitive(X19)
      | ~ epsilon_connected(X19)
      | ordinal(X19) ),
    inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[cc2_ordinal1])]) ).

fof(c_0_4,negated_conjecture,
    ~ ordinal(empty_set),
    inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[t27_ordinal1])]) ).

cnf(c_0_5,plain,
    ( ordinal(X1)
    | ~ epsilon_transitive(X1)
    | ~ epsilon_connected(X1) ),
    inference(split_conjunct,[status(thm)],[c_0_3]) ).

cnf(c_0_6,plain,
    epsilon_connected(empty_set),
    inference(split_conjunct,[status(thm)],[l18_ordinal1]) ).

cnf(c_0_7,plain,
    epsilon_transitive(empty_set),
    inference(split_conjunct,[status(thm)],[l18_ordinal1]) ).

cnf(c_0_8,negated_conjecture,
    ~ ordinal(empty_set),
    inference(split_conjunct,[status(thm)],[c_0_4]) ).

cnf(c_0_9,plain,
    $false,
    inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_5,c_0_6]),c_0_7])]),c_0_8]),
    [proof] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.13  % Problem    : NUM395+1 : TPTP v8.1.2. Released v3.2.0.
% 0.00/0.13  % Command    : java -jar /export/starexec/sandbox2/solver/bin/mcs_scs.jar %d %s
% 0.13/0.35  % Computer : n020.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit   : 300
% 0.13/0.35  % WCLimit    : 300
% 0.13/0.35  % DateTime   : Fri Aug 25 14:28:00 EDT 2023
% 0.13/0.35  % CPUTime  : 
% 0.20/0.57  start to proof: theBenchmark
% 0.20/0.59  % Version  : CSE_E---1.5
% 0.20/0.59  % Problem  : theBenchmark.p
% 0.20/0.59  % Proof found
% 0.20/0.59  % SZS status Theorem for theBenchmark.p
% 0.20/0.59  % SZS output start Proof
% See solution above
% 0.20/0.59  % Total time : 0.008000 s
% 0.20/0.59  % SZS output end Proof
% 0.20/0.59  % Total time : 0.011000 s
%------------------------------------------------------------------------------