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

% Computer : n006.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:32 EDT 2022

% Result   : Theorem 7.23s 7.48s
% Output   : Refutation 7.23s
% 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    :    3 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    9 (   9 usr;   7 con; 0-3 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(6,axiom,
    ~ subset(equivalence_class(skc5,skc3,skc4),skc3),
    file('SET767+4.p',unknown),
    [] ).

cnf(14,axiom,
    ( subset(u,v)
    | member(skf20(v,u),u) ),
    file('SET767+4.p',unknown),
    [] ).

cnf(27,axiom,
    ( ~ member(skf20(u,v),u)
    | subset(w,u) ),
    file('SET767+4.p',unknown),
    [] ).

cnf(39,axiom,
    ( ~ member(u,equivalence_class(v,w,x))
    | member(u,w) ),
    file('SET767+4.p',unknown),
    [] ).

cnf(87,plain,
    ~ member(skf20(skc3,u),skc3),
    inference(res,[status(thm),theory(equality)],[27,6]),
    [iquote('0:Res:27.1,6.0')] ).

cnf(193,plain,
    ( subset(equivalence_class(u,v,w),x)
    | member(skf20(x,equivalence_class(u,v,w)),v) ),
    inference(res,[status(thm),theory(equality)],[14,39]),
    [iquote('0:Res:14.1,39.0')] ).

cnf(17896,plain,
    subset(equivalence_class(u,skc3,v),skc3),
    inference(res,[status(thm),theory(equality)],[193,87]),
    [iquote('0:Res:193.1,87.0')] ).

cnf(17915,plain,
    $false,
    inference(unc,[status(thm)],[17896,6]),
    [iquote('0:UnC:17896.0,6.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13  % Problem  : SET767+4 : TPTP v8.1.0. Released v2.2.0.
% 0.08/0.14  % Command  : run_spass %d %s
% 0.13/0.35  % Computer : n006.cluster.edu
% 0.13/0.35  % Model    : x86_64 x86_64
% 0.13/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35  % Memory   : 8042.1875MB
% 0.13/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35  % CPULimit : 300
% 0.13/0.35  % WCLimit  : 600
% 0.13/0.35  % DateTime : Sat Jul  9 17:46:06 EDT 2022
% 0.13/0.35  % CPUTime  : 
% 7.23/7.48  
% 7.23/7.48  SPASS V 3.9 
% 7.23/7.48  SPASS beiseite: Proof found.
% 7.23/7.48  % SZS status Theorem
% 7.23/7.48  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 7.23/7.48  SPASS derived 16365 clauses, backtracked 0 clauses, performed 0 splits and kept 9059 clauses.
% 7.23/7.48  SPASS allocated 99044 KBytes.
% 7.23/7.48  SPASS spent	0:00:06.93 on the problem.
% 7.23/7.48  		0:00:00.04 for the input.
% 7.23/7.48  		0:00:00.15 for the FLOTTER CNF translation.
% 7.23/7.48  		0:00:00.20 for inferences.
% 7.23/7.48  		0:00:00.00 for the backtracking.
% 7.23/7.48  		0:00:06.33 for the reduction.
% 7.23/7.48  
% 7.23/7.48  
% 7.23/7.48  Here is a proof with depth 2, length 8 :
% 7.23/7.48  % SZS output start Refutation
% See solution above
% 7.23/7.48  Formulae used in the proof : thIII03 subset equivalence_class
% 7.23/7.48  
%------------------------------------------------------------------------------