%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : SET063+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n004.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:22 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(3,axiom,
    subclass(skc3,null_class),
    file('SET063+1.p',unknown),
    [] ).

cnf(6,axiom,
    ~ equal(skc3,null_class),
    file('SET063+1.p',unknown),
    [] ).

cnf(7,axiom,
    ~ member(u,null_class),
    file('SET063+1.p',unknown),
    [] ).

cnf(21,axiom,
    ( equal(u,null_class)
    | member(skf9(u),u) ),
    file('SET063+1.p',unknown),
    [] ).

cnf(55,axiom,
    ( ~ member(u,v)
    | ~ subclass(v,w)
    | member(u,w) ),
    file('SET063+1.p',unknown),
    [] ).

cnf(93,plain,
    ( ~ member(u,skc3)
    | member(u,null_class) ),
    inference(res,[status(thm),theory(equality)],[3,55]),
    [iquote('0:Res:3.0,55.0')] ).

cnf(97,plain,
    member(skf9(skc3),skc3),
    inference(res,[status(thm),theory(equality)],[21,6]),
    [iquote('0:Res:21.1,6.0')] ).

cnf(105,plain,
    ~ member(u,skc3),
    inference(mrr,[status(thm)],[93,7]),
    [iquote('0:MRR:93.1,7.0')] ).

cnf(106,plain,
    $false,
    inference(unc,[status(thm)],[105,97]),
    [iquote('0:UnC:105.0,97.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : SET063+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% 0.06/0.13  % Command  : run_spass %d %s
% 0.14/0.34  % Computer : n004.cluster.edu
% 0.14/0.34  % Model    : x86_64 x86_64
% 0.14/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.34  % Memory   : 8042.1875MB
% 0.14/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.34  % CPULimit : 300
% 0.14/0.34  % WCLimit  : 600
% 0.14/0.34  % DateTime : Sat Jul  9 19:26:07 EDT 2022
% 0.14/0.34  % CPUTime  : 
% 0.20/0.48  
% 0.20/0.48  SPASS V 3.9 
% 0.20/0.48  SPASS beiseite: Proof found.
% 0.20/0.48  % SZS status Theorem
% 0.20/0.48  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.20/0.48  SPASS derived 13 clauses, backtracked 0 clauses, performed 0 splits and kept 93 clauses.
% 0.20/0.48  SPASS allocated 98320 KBytes.
% 0.20/0.48  SPASS spent	0:00:00.13 on the problem.
% 0.20/0.48  		0:00:00.04 for the input.
% 0.20/0.48  		0:00:00.06 for the FLOTTER CNF translation.
% 0.20/0.48  		0:00:00.00 for inferences.
% 0.20/0.48  		0:00:00.00 for the backtracking.
% 0.20/0.48  		0:00:00.00 for the reduction.
% 0.20/0.48  
% 0.20/0.48  
% 0.20/0.48  Here is a proof with depth 1, length 9 :
% 0.20/0.48  % SZS output start Refutation
% See solution above
% 0.20/0.48  Formulae used in the proof : corollary_of_null_class_is_subclass null_class_defn regularity infinity subclass_defn
% 0.20/0.48  
%------------------------------------------------------------------------------