%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : SEU133+1 : TPTP v8.1.0. Released v3.3.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n016.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 14:34:12 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(7,axiom,
    ~ subset(set_difference(skc5,skc4),skc5),
    file('SEU133+1.p',unknown),
    [] ).

cnf(11,axiom,
    ( subset(u,v)
    | in(skf2(v,u),u) ),
    file('SEU133+1.p',unknown),
    [] ).

cnf(12,axiom,
    ( ~ in(skf2(u,v),u)
    | subset(w,u) ),
    file('SEU133+1.p',unknown),
    [] ).

cnf(15,axiom,
    ( ~ in(u,v)
    | ~ equal(v,set_difference(w,x))
    | in(u,w) ),
    file('SEU133+1.p',unknown),
    [] ).

cnf(22,plain,
    ~ in(skf2(skc5,u),skc5),
    inference(res,[status(thm),theory(equality)],[12,7]),
    [iquote('0:Res:12.1,7.0')] ).

cnf(38,plain,
    ( ~ in(u,set_difference(v,w))
    | in(u,v) ),
    inference(eqr,[status(thm),theory(equality)],[15]),
    [iquote('0:EqR:15.1')] ).

cnf(43,plain,
    ( subset(set_difference(u,v),w)
    | in(skf2(w,set_difference(u,v)),u) ),
    inference(res,[status(thm),theory(equality)],[11,38]),
    [iquote('0:Res:11.1,38.0')] ).

cnf(282,plain,
    subset(set_difference(skc5,u),skc5),
    inference(res,[status(thm),theory(equality)],[43,22]),
    [iquote('0:Res:43.1,22.0')] ).

cnf(292,plain,
    $false,
    inference(unc,[status(thm)],[282,7]),
    [iquote('0:UnC:282.0,7.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : SEU133+1 : TPTP v8.1.0. Released v3.3.0.
% 0.03/0.12  % Command  : run_spass %d %s
% 0.12/0.33  % Computer : n016.cluster.edu
% 0.12/0.33  % Model    : x86_64 x86_64
% 0.12/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.33  % Memory   : 8042.1875MB
% 0.12/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.33  % CPULimit : 300
% 0.12/0.33  % WCLimit  : 600
% 0.12/0.34  % DateTime : Sun Jun 19 12:52:23 EDT 2022
% 0.12/0.34  % 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/sandbox/benchmark/theBenchmark.p 
% 0.19/0.47  SPASS derived 223 clauses, backtracked 0 clauses, performed 0 splits and kept 123 clauses.
% 0.19/0.47  SPASS allocated 97879 KBytes.
% 0.19/0.47  SPASS spent	0:00:00.11 on the problem.
% 0.19/0.47  		0:00:00.03 for the input.
% 0.19/0.47  		0:00:00.03 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.02 for the reduction.
% 0.19/0.47  
% 0.19/0.47  
% 0.19/0.47  Here is a proof with depth 3, length 9 :
% 0.19/0.47  % SZS output start Refutation
% See solution above
% 0.19/0.47  Formulae used in the proof : t36_xboole_1 d3_tarski d4_xboole_0
% 0.19/0.47  
%------------------------------------------------------------------------------