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

% Computer : n011.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:39 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(3,axiom,
    subclass(u,universal_class),
    file('SET077+1.p',unknown),
    [] ).

cnf(8,axiom,
    ~ member(singleton(skc3),universal_class),
    file('SET077+1.p',unknown),
    [] ).

cnf(9,axiom,
    member(unordered_pair(u,v),universal_class),
    file('SET077+1.p',unknown),
    [] ).

cnf(13,axiom,
    equal(unordered_pair(u,u),singleton(u)),
    file('SET077+1.p',unknown),
    [] ).

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

cnf(106,plain,
    ( ~ subclass(u,universal_class)
    | ~ member(singleton(skc3),u) ),
    inference(res,[status(thm),theory(equality)],[54,8]),
    [iquote('0:Res:54.2,8.0')] ).

cnf(108,plain,
    ~ member(singleton(skc3),u),
    inference(mrr,[status(thm)],[106,3]),
    [iquote('0:MRR:106.0,3.0')] ).

cnf(111,plain,
    member(singleton(u),universal_class),
    inference(spr,[status(thm),theory(equality)],[13,9]),
    [iquote('0:SpR:13.0,9.0')] ).

cnf(113,plain,
    $false,
    inference(unc,[status(thm)],[111,108]),
    [iquote('0:UnC:111.0,108.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11  % Problem  : SET077+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% 0.10/0.12  % Command  : run_spass %d %s
% 0.13/0.33  % Computer : n011.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 : Mon Jul 11 00:24:57 EDT 2022
% 0.13/0.33  % CPUTime  : 
% 0.19/0.47  
% 0.19/0.47  SPASS V 3.9 
% 0.19/0.47  SPASS beiseite: Proof found.
% 0.19/0.47  % SZS status Theorem
% 0.19/0.47  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.19/0.47  SPASS derived 14 clauses, backtracked 0 clauses, performed 0 splits and kept 98 clauses.
% 0.19/0.47  SPASS allocated 98250 KBytes.
% 0.19/0.47  SPASS spent	0:00:00.12 on the problem.
% 0.19/0.47  		0:00:00.04 for the input.
% 0.19/0.47  		0:00:00.06 for the FLOTTER CNF translation.
% 0.19/0.47  		0:00:00.00 for inferences.
% 0.19/0.47  		0:00:00.00 for the backtracking.
% 0.19/0.47  		0:00:00.00 for the reduction.
% 0.19/0.47  
% 0.19/0.47  
% 0.19/0.47  Here is a proof with depth 1, length 9 :
% 0.19/0.47  % SZS output start Refutation
% See solution above
% 0.19/0.47  Formulae used in the proof : class_elements_are_sets singletons_are_sets unordered_pair singleton_set_defn subclass_defn
% 0.19/0.47  
%------------------------------------------------------------------------------