%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : NUM395+1 : TPTP v8.1.0. Released v3.2.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% 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 : Mon Jul 18 14:25:51 EDT 2022

% Result   : Theorem 0.18s 0.43s
% Output   : Refutation 0.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    2
%            Number of leaves      :    4
% Syntax   : Number of clauses     :    6 (   4 unt;   0 nHn;   6 RR)
%            Number of literals    :    9 (   0 equ;   5 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    :    2 (   2 usr;   2 con; 0-0 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(30,axiom,
    epsilon_transitive(empty_set),
    file('NUM395+1.p',unknown),
    [] ).

cnf(31,axiom,
    epsilon_connected(empty_set),
    file('NUM395+1.p',unknown),
    [] ).

cnf(32,axiom,
    ~ ordinal(empty_set),
    file('NUM395+1.p',unknown),
    [] ).

cnf(47,axiom,
    ( ~ epsilon_connected(u)
    | ~ epsilon_transitive(u)
    | ordinal(u) ),
    file('NUM395+1.p',unknown),
    [] ).

cnf(52,plain,
    ( ~ epsilon_transitive(empty_set)
    | ~ epsilon_connected(empty_set) ),
    inference(res,[status(thm),theory(equality)],[47,32]),
    [iquote('0:Res:47.2,32.0')] ).

cnf(53,plain,
    $false,
    inference(mrr,[status(thm)],[52,30,31]),
    [iquote('0:MRR:52.0,52.1,30.0,31.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : NUM395+1 : TPTP v8.1.0. Released v3.2.0.
% 0.11/0.12  % Command  : run_spass %d %s
% 0.13/0.33  % Computer : n008.cluster.edu
% 0.13/0.33  % Model    : x86_64 x86_64
% 0.13/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.33  % Memory   : 8042.1875MB
% 0.13/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.33  % CPULimit : 300
% 0.13/0.33  % WCLimit  : 600
% 0.13/0.33  % DateTime : Thu Jul  7 02:10:53 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 0.18/0.43  
% 0.18/0.43  SPASS V 3.9 
% 0.18/0.43  SPASS beiseite: Proof found.
% 0.18/0.43  % SZS status Theorem
% 0.18/0.43  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.18/0.43  SPASS derived 1 clauses, backtracked 0 clauses, performed 0 splits and kept 45 clauses.
% 0.18/0.43  SPASS allocated 97669 KBytes.
% 0.18/0.43  SPASS spent	0:00:00.08 on the problem.
% 0.18/0.43  		0:00:00.03 for the input.
% 0.18/0.43  		0:00:00.03 for the FLOTTER CNF translation.
% 0.18/0.43  		0:00:00.00 for inferences.
% 0.18/0.43  		0:00:00.00 for the backtracking.
% 0.18/0.43  		0:00:00.00 for the reduction.
% 0.18/0.43  
% 0.18/0.43  
% 0.18/0.43  Here is a proof with depth 1, length 6 :
% 0.18/0.43  % SZS output start Refutation
% See solution above
% 0.18/0.43  Formulae used in the proof : l18_ordinal1 t27_ordinal1 d4_ordinal1
% 0.18/0.43  
%------------------------------------------------------------------------------