%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : NUM610+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n008.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 : Mon Jul 18 14:28:04 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(13,axiom,
    aSet0(xO),
    file('NUM610+1.p',unknown),
    [] ).

cnf(22,axiom,
    aSubsetOf0(xQ,xO),
    file('NUM610+1.p',unknown),
    [] ).

cnf(26,axiom,
    aSubsetOf0(xP,xQ),
    file('NUM610+1.p',unknown),
    [] ).

cnf(27,axiom,
    ~ aSubsetOf0(xP,xO),
    file('NUM610+1.p',unknown),
    [] ).

cnf(75,axiom,
    ( ~ aSet0(u)
    | ~ aSubsetOf0(v,u)
    | aSet0(v) ),
    file('NUM610+1.p',unknown),
    [] ).

cnf(155,axiom,
    ( ~ aSet0(u)
    | ~ aSet0(v)
    | ~ aSet0(w)
    | ~ aSubsetOf0(u,v)
    | ~ aSubsetOf0(v,w)
    | aSubsetOf0(u,w) ),
    file('NUM610+1.p',unknown),
    [] ).

cnf(215,plain,
    ( ~ aSet0(u)
    | ~ aSubsetOf0(v,u)
    | ~ aSubsetOf0(w,v)
    | aSubsetOf0(w,u) ),
    inference(mrr,[status(thm)],[155,75]),
    [iquote('0:MRR:155.0,155.1,75.2,75.2')] ).

cnf(228,plain,
    ( ~ aSet0(xO)
    | ~ aSubsetOf0(xP,u)
    | ~ aSubsetOf0(u,xO) ),
    inference(res,[status(thm),theory(equality)],[215,27]),
    [iquote('0:Res:215.3,27.0')] ).

cnf(233,plain,
    ( ~ aSubsetOf0(u,xO)
    | ~ aSubsetOf0(xP,u) ),
    inference(mrr,[status(thm)],[228,13]),
    [iquote('0:MRR:228.0,13.0')] ).

cnf(260,plain,
    ~ aSubsetOf0(xP,xQ),
    inference(res,[status(thm),theory(equality)],[22,233]),
    [iquote('0:Res:22.0,233.0')] ).

cnf(262,plain,
    $false,
    inference(mrr,[status(thm)],[260,26]),
    [iquote('0:MRR:260.0,26.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.12  % Problem  : NUM610+1 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.13  % Command  : run_spass %d %s
% 0.12/0.34  % Computer : n008.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 : Wed Jul  6 16:57:53 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.49/0.69  
% 0.49/0.69  SPASS V 3.9 
% 0.49/0.69  SPASS beiseite: Proof found.
% 0.49/0.69  % SZS status Theorem
% 0.49/0.69  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.49/0.69  SPASS derived 28 clauses, backtracked 0 clauses, performed 0 splits and kept 211 clauses.
% 0.49/0.69  SPASS allocated 101073 KBytes.
% 0.49/0.69  SPASS spent	0:00:00.33 on the problem.
% 0.49/0.69  		0:00:00.04 for the input.
% 0.49/0.69  		0:00:00.25 for the FLOTTER CNF translation.
% 0.49/0.69  		0:00:00.00 for inferences.
% 0.49/0.69  		0:00:00.00 for the backtracking.
% 0.49/0.69  		0:00:00.02 for the reduction.
% 0.49/0.69  
% 0.49/0.69  
% 0.49/0.69  Here is a proof with depth 2, length 11 :
% 0.49/0.69  % SZS output start Refutation
% See solution above
% 0.49/0.69  Formulae used in the proof : m__4908 m__5093 m__5195 m__ mDefSub mSubTrans
% 0.49/0.69  
%------------------------------------------------------------------------------