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

% Computer : n029.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:08 EDT 2022

% Result   : Theorem 0.18s 0.43s
% Output   : Refutation 0.18s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    6
% Syntax   : Number of clauses     :   14 (   5 unt;   3 nHn;  14 RR)
%            Number of literals    :   29 (   0 equ;  14 neg)
%            Maximal clause size   :    4 (   2 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('SEU126+1.p',unknown),
    [] ).

cnf(8,axiom,
    ~ equal(set_union2(skc4,skc5),skc5),
    file('SEU126+1.p',unknown),
    [] ).

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

cnf(25,axiom,
    ( ~ in(skf2(u,v,w),w)
    | ~ in(skf2(u,v,w),v)
    | equal(w,set_union2(v,u)) ),
    file('SEU126+1.p',unknown),
    [] ).

cnf(26,axiom,
    ( ~ in(skf2(u,v,w),w)
    | ~ in(skf2(u,v,w),u)
    | equal(w,set_union2(v,u)) ),
    file('SEU126+1.p',unknown),
    [] ).

cnf(27,axiom,
    ( equal(u,set_union2(v,w))
    | in(skf2(w,v,u),w)
    | in(skf2(w,v,u),v)
    | in(skf2(w,v,u),u) ),
    file('SEU126+1.p',unknown),
    [] ).

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

cnf(35,plain,
    ( in(skf2(skc5,skc4,skc5),skc5)
    | in(skf2(skc5,skc4,skc5),skc4)
    | in(skf2(skc5,skc4,skc5),skc5) ),
    inference(res,[status(thm),theory(equality)],[27,8]),
    [iquote('0:Res:27.3,8.0')] ).

cnf(36,plain,
    ( ~ in(skf2(skc5,skc4,skc5),skc4)
    | ~ in(skf2(skc5,skc4,skc5),skc5) ),
    inference(res,[status(thm),theory(equality)],[25,8]),
    [iquote('0:Res:25.2,8.0')] ).

cnf(37,plain,
    ( ~ in(skf2(skc5,skc4,skc5),skc5)
    | ~ in(skf2(skc5,skc4,skc5),skc5) ),
    inference(res,[status(thm),theory(equality)],[26,8]),
    [iquote('0:Res:26.2,8.0')] ).

cnf(38,plain,
    ~ in(skf2(skc5,skc4,skc5),skc4),
    inference(mrr,[status(thm)],[36,30]),
    [iquote('0:MRR:36.1,30.1')] ).

cnf(39,plain,
    ~ in(skf2(skc5,skc4,skc5),skc5),
    inference(obv,[status(thm),theory(equality)],[37]),
    [iquote('0:Obv:37.0')] ).

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

cnf(41,plain,
    $false,
    inference(mrr,[status(thm)],[40,38,39]),
    [iquote('0:MRR:40.0,40.1,38.0,39.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11  % Problem  : SEU126+1 : TPTP v8.1.0. Released v3.3.0.
% 0.10/0.12  % Command  : run_spass %d %s
% 0.12/0.33  % Computer : n029.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.33  % DateTime : Sun Jun 19 23:07:30 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.43  
% 0.18/0.43  SPASS V 3.9 
% 0.18/0.43  SPASS beiseite: Proof found.
% 0.18/0.43  % SZS status Theorem
% 0.18/0.43  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.18/0.43  SPASS derived 10 clauses, backtracked 0 clauses, performed 0 splits and kept 33 clauses.
% 0.18/0.43  SPASS allocated 97918 KBytes.
% 0.18/0.43  SPASS spent	0:00:00.09 on the problem.
% 0.18/0.43  		0:00:00.03 for the input.
% 0.18/0.43  		0:00:00.04 for the FLOTTER CNF translation.
% 0.18/0.43  		0:00:00.00 for inferences.
% 0.18/0.43  		0:00:00.00 for the backtracking.
% 0.18/0.43  		0:00:00.00 for the reduction.
% 0.18/0.43  
% 0.18/0.43  
% 0.18/0.43  Here is a proof with depth 1, length 14 :
% 0.18/0.43  % SZS output start Refutation
% See solution above
% 0.18/0.43  Formulae used in the proof : t12_xboole_1 d3_tarski d2_xboole_0
% 0.18/0.43  
%------------------------------------------------------------------------------