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

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

% Result   : Theorem 0.50s 0.74s
% Output   : Refutation 0.50s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    4
% Syntax   : Number of clauses     :    8 (   5 unt;   0 nHn;   8 RR)
%            Number of literals    :   12 (   0 equ;   6 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   2 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,
    member(skc3,universal_class),
    file('SET024+1.p',unknown),
    [] ).

cnf(9,axiom,
    ~ member(skc3,singleton(skc3)),
    file('SET024+1.p',unknown),
    [] ).

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

cnf(72,axiom,
    ( ~ equal(u,v)
    | ~ member(u,universal_class)
    | member(u,unordered_pair(w,v)) ),
    file('SET024+1.p',unknown),
    [] ).

cnf(97,plain,
    ( ~ equal(skc3,u)
    | member(skc3,unordered_pair(v,u)) ),
    inference(res,[status(thm),theory(equality)],[3,72]),
    [iquote('0:Res:3.0,72.1')] ).

cnf(1658,plain,
    ( ~ equal(skc3,u)
    | member(skc3,singleton(u)) ),
    inference(spr,[status(thm),theory(equality)],[13,97]),
    [iquote('0:SpR:13.0,97.1')] ).

cnf(1719,plain,
    ~ equal(skc3,skc3),
    inference(res,[status(thm),theory(equality)],[1658,9]),
    [iquote('0:Res:1658.1,9.0')] ).

cnf(1724,plain,
    $false,
    inference(obv,[status(thm),theory(equality)],[1719]),
    [iquote('0:Obv:1719.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12  % Problem  : SET024+1 : TPTP v8.1.0. Bugfixed v5.4.0.
% 0.04/0.13  % Command  : run_spass %d %s
% 0.13/0.34  % Computer : n009.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Sun Jul 10 08:55:52 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 0.50/0.74  
% 0.50/0.74  SPASS V 3.9 
% 0.50/0.74  SPASS beiseite: Proof found.
% 0.50/0.74  % SZS status Theorem
% 0.50/0.74  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.50/0.74  SPASS derived 1516 clauses, backtracked 67 clauses, performed 3 splits and kept 1191 clauses.
% 0.50/0.74  SPASS allocated 98950 KBytes.
% 0.50/0.74  SPASS spent	0:00:00.37 on the problem.
% 0.50/0.74  		0:00:00.04 for the input.
% 0.50/0.74  		0:00:00.06 for the FLOTTER CNF translation.
% 0.50/0.74  		0:00:00.02 for inferences.
% 0.50/0.74  		0:00:00.00 for the backtracking.
% 0.50/0.74  		0:00:00.22 for the reduction.
% 0.50/0.74  
% 0.50/0.74  
% 0.50/0.74  Here is a proof with depth 3, length 8 :
% 0.50/0.74  % SZS output start Refutation
% See solution above
% 0.50/0.74  Formulae used in the proof : set_in_its_singleton singleton_set_defn unordered_pair_defn
% 0.50/0.74  
%------------------------------------------------------------------------------