%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : SET055-6 : TPTP v8.1.0. Released v1.0.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 : Tue Jul 19 05:23:13 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(69,axiom,
    ( subclass(u,v)
    | member(not_subclass_element(u,v),u) ),
    file('SET055-6.p',unknown),
    [] ).

cnf(70,axiom,
    ( ~ member(not_subclass_element(u,v),v)
    | subclass(u,v) ),
    file('SET055-6.p',unknown),
    [] ).

cnf(74,axiom,
    ( ~ subclass(u,v)
    | ~ subclass(v,u)
    | equalish(v,u) ),
    file('SET055-6.p',unknown),
    [] ).

cnf(159,axiom,
    ~ equalish(x__dfg,x__dfg),
    file('SET055-6.p',unknown),
    [] ).

cnf(161,plain,
    ( ~ subclass(x__dfg,x__dfg)
    | ~ subclass(x__dfg,x__dfg) ),
    inference(res,[status(thm),theory(equality)],[74,159]),
    [iquote('0:Res:74.2,159.0')] ).

cnf(164,plain,
    ~ subclass(x__dfg,x__dfg),
    inference(obv,[status(thm),theory(equality)],[161]),
    [iquote('0:Obv:161.0')] ).

cnf(194,plain,
    ( subclass(u,u)
    | subclass(u,u) ),
    inference(res,[status(thm),theory(equality)],[69,70]),
    [iquote('0:Res:69.1,70.0')] ).

cnf(195,plain,
    subclass(u,u),
    inference(obv,[status(thm),theory(equality)],[194]),
    [iquote('0:Obv:194.0')] ).

cnf(196,plain,
    $false,
    inference(unc,[status(thm)],[195,164]),
    [iquote('0:UnC:195.0,164.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13  % Problem  : SET055-6 : TPTP v8.1.0. Released v1.0.0.
% 0.08/0.14  % Command  : run_spass %d %s
% 0.14/0.36  % Computer : n008.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit : 300
% 0.14/0.36  % WCLimit  : 600
% 0.14/0.36  % DateTime : Mon Jul 11 05:04:08 EDT 2022
% 0.14/0.36  % CPUTime  : 
% 0.22/0.46  
% 0.22/0.46  SPASS V 3.9 
% 0.22/0.46  SPASS beiseite: Proof found.
% 0.22/0.46  % SZS status Theorem
% 0.22/0.46  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.22/0.46  SPASS derived 16 clauses, backtracked 0 clauses, performed 0 splits and kept 169 clauses.
% 0.22/0.46  SPASS allocated 75834 KBytes.
% 0.22/0.46  SPASS spent	0:00:00.08 on the problem.
% 0.22/0.46  		0:00:00.04 for the input.
% 0.22/0.46  		0:00:00.00 for the FLOTTER CNF translation.
% 0.22/0.46  		0:00:00.00 for inferences.
% 0.22/0.46  		0:00:00.00 for the backtracking.
% 0.22/0.46  		0:00:00.01 for the reduction.
% 0.22/0.46  
% 0.22/0.46  
% 0.22/0.46  Here is a proof with depth 1, length 9 :
% 0.22/0.46  % SZS output start Refutation
% See solution above
% 0.22/0.46  Formulae used in the proof : not_subclass_members1 not_subclass_members2 subclass_implies_equal prove_reflexivity
% 0.22/0.46  
%------------------------------------------------------------------------------