%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : SET705+4 : TPTP v8.1.0. Released v2.2.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n007.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:28:12 EDT 2022

% Result   : Theorem 0.19s 0.45s
% Output   : Refutation 0.19s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    4
% Syntax   : Number of clauses     :    8 (   4 unt;   2 nHn;   8 RR)
%            Number of literals    :   12 (   0 equ;   4 neg)
%            Maximal clause size   :    2 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   4 con; 0-2 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(2,axiom,
    ~ member(skc1,power_set(skc1)),
    file('SET705+4.p',unknown),
    [] ).

cnf(7,axiom,
    ( subset(u,v)
    | member(skf3(v,u),u) ),
    file('SET705+4.p',unknown),
    [] ).

cnf(9,axiom,
    ( ~ subset(u,v)
    | member(u,power_set(v)) ),
    file('SET705+4.p',unknown),
    [] ).

cnf(12,axiom,
    ( ~ member(skf3(u,v),u)
    | subset(w,u) ),
    file('SET705+4.p',unknown),
    [] ).

cnf(31,plain,
    ~ subset(skc1,skc1),
    inference(res,[status(thm),theory(equality)],[9,2]),
    [iquote('0:Res:9.1,2.0')] ).

cnf(57,plain,
    ( subset(u,u)
    | subset(v,u) ),
    inference(res,[status(thm),theory(equality)],[7,12]),
    [iquote('0:Res:7.1,12.0')] ).

cnf(58,plain,
    subset(u,u),
    inference(con,[status(thm)],[57]),
    [iquote('0:Con:57.1')] ).

cnf(59,plain,
    $false,
    inference(unc,[status(thm)],[58,31]),
    [iquote('0:UnC:58.0,31.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : SET705+4 : TPTP v8.1.0. Released v2.2.0.
% 0.11/0.13  % Command  : run_spass %d %s
% 0.12/0.34  % Computer : n007.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Sat Jul  9 22:52:16 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.19/0.45  
% 0.19/0.45  SPASS V 3.9 
% 0.19/0.45  SPASS beiseite: Proof found.
% 0.19/0.45  % SZS status Theorem
% 0.19/0.45  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.19/0.45  SPASS derived 21 clauses, backtracked 0 clauses, performed 0 splits and kept 47 clauses.
% 0.19/0.45  SPASS allocated 85390 KBytes.
% 0.19/0.45  SPASS spent	0:00:00.10 on the problem.
% 0.19/0.45  		0:00:00.04 for the input.
% 0.19/0.45  		0:00:00.04 for the FLOTTER CNF translation.
% 0.19/0.45  		0:00:00.00 for inferences.
% 0.19/0.45  		0:00:00.00 for the backtracking.
% 0.19/0.45  		0:00:00.00 for the reduction.
% 0.19/0.45  
% 0.19/0.45  
% 0.19/0.45  Here is a proof with depth 1, length 8 :
% 0.19/0.45  % SZS output start Refutation
% See solution above
% 0.19/0.45  Formulae used in the proof : thI48 subset power_set
% 0.19/0.45  
%------------------------------------------------------------------------------