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

% Computer : n010.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:10 EDT 2022

% Result   : Theorem 0.22s 0.48s
% Output   : Refutation 0.22s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    5
% Syntax   : Number of clauses     :   13 (   6 unt;   2 nHn;  13 RR)
%            Number of literals    :   25 (   0 equ;  14 neg)
%            Maximal clause size   :    4 (   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-3 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(3,axiom,
    subset(skc4,skc5),
    file('SEU130+1.p',unknown),
    [] ).

cnf(9,axiom,
    ~ equal(set_intersection2(skc4,skc5),skc4),
    file('SEU130+1.p',unknown),
    [] ).

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

cnf(24,axiom,
    ( equal(u,set_intersection2(v,w))
    | in(skf3(w,v,u),u)
    | in(skf3(w,v,u),v) ),
    file('SEU130+1.p',unknown),
    [] ).

cnf(26,axiom,
    ( ~ in(skf3(u,v,w),u)
    | ~ in(skf3(u,v,w),v)
    | ~ in(skf3(u,v,w),w)
    | equal(w,set_intersection2(v,u)) ),
    file('SEU130+1.p',unknown),
    [] ).

cnf(29,plain,
    ( ~ in(u,skc4)
    | in(u,skc5) ),
    inference(res,[status(thm),theory(equality)],[3,20]),
    [iquote('0:Res:3.0,20.0')] ).

cnf(34,plain,
    ( ~ in(skf3(skc5,skc4,skc4),skc4)
    | ~ in(skf3(skc5,skc4,skc4),skc4)
    | ~ in(skf3(skc5,skc4,skc4),skc5) ),
    inference(res,[status(thm),theory(equality)],[26,9]),
    [iquote('0:Res:26.3,9.0')] ).

cnf(35,plain,
    ( in(skf3(skc5,skc4,skc4),skc4)
    | in(skf3(skc5,skc4,skc4),skc4) ),
    inference(res,[status(thm),theory(equality)],[24,9]),
    [iquote('0:Res:24.2,9.0')] ).

cnf(38,plain,
    in(skf3(skc5,skc4,skc4),skc4),
    inference(obv,[status(thm),theory(equality)],[35]),
    [iquote('0:Obv:35.0')] ).

cnf(39,plain,
    ( ~ in(skf3(skc5,skc4,skc4),skc4)
    | ~ in(skf3(skc5,skc4,skc4),skc5) ),
    inference(obv,[status(thm),theory(equality)],[34]),
    [iquote('0:Obv:34.0')] ).

cnf(40,plain,
    ~ in(skf3(skc5,skc4,skc4),skc5),
    inference(mrr,[status(thm)],[39,38]),
    [iquote('0:MRR:39.0,38.0')] ).

cnf(51,plain,
    ~ in(skf3(skc5,skc4,skc4),skc4),
    inference(res,[status(thm),theory(equality)],[29,40]),
    [iquote('0:Res:29.1,40.0')] ).

cnf(53,plain,
    $false,
    inference(mrr,[status(thm)],[51,38]),
    [iquote('0:MRR:51.0,38.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.14  % Problem  : SEU130+1 : TPTP v8.1.0. Released v3.3.0.
% 0.08/0.15  % Command  : run_spass %d %s
% 0.14/0.37  % Computer : n010.cluster.edu
% 0.14/0.37  % Model    : x86_64 x86_64
% 0.14/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.37  % Memory   : 8042.1875MB
% 0.14/0.37  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.37  % CPULimit : 300
% 0.14/0.37  % WCLimit  : 600
% 0.14/0.37  % DateTime : Mon Jun 20 03:24:52 EDT 2022
% 0.14/0.37  % CPUTime  : 
% 0.22/0.48  
% 0.22/0.48  SPASS V 3.9 
% 0.22/0.48  SPASS beiseite: Proof found.
% 0.22/0.48  % SZS status Theorem
% 0.22/0.48  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.22/0.48  SPASS derived 22 clauses, backtracked 0 clauses, performed 0 splits and kept 36 clauses.
% 0.22/0.48  SPASS allocated 97891 KBytes.
% 0.22/0.48  SPASS spent	0:00:00.09 on the problem.
% 0.22/0.48  		0:00:00.04 for the input.
% 0.22/0.48  		0:00:00.04 for the FLOTTER CNF translation.
% 0.22/0.48  		0:00:00.00 for inferences.
% 0.22/0.48  		0:00:00.00 for the backtracking.
% 0.22/0.48  		0:00:00.00 for the reduction.
% 0.22/0.48  
% 0.22/0.48  
% 0.22/0.48  Here is a proof with depth 2, length 13 :
% 0.22/0.48  % SZS output start Refutation
% See solution above
% 0.22/0.48  Formulae used in the proof : t28_xboole_1 d3_tarski d3_xboole_0
% 0.22/0.48  
%------------------------------------------------------------------------------