%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : NUM606+1 : TPTP v8.1.0. Released v4.0.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 : Mon Jul 18 14:28:01 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(2,axiom,
    aSet0(szNzAzT0),
    file('NUM606+1.p',unknown),
    [] ).

cnf(3,axiom,
    isCountable0(szNzAzT0),
    file('NUM606+1.p',unknown),
    [] ).

cnf(17,axiom,
    aSubsetOf0(xS,szNzAzT0),
    file('NUM606+1.p',unknown),
    [] ).

cnf(20,axiom,
    aSubsetOf0(xO,xS),
    file('NUM606+1.p',unknown),
    [] ).

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

cnf(22,axiom,
    ~ aSubsetOf0(xQ,szNzAzT0),
    file('NUM606+1.p',unknown),
    [] ).

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

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

cnf(206,plain,
    ( ~ aSet0(u)
    | ~ aSubsetOf0(v,u)
    | ~ aSubsetOf0(w,v)
    | aSubsetOf0(w,u) ),
    inference(mrr,[status(thm)],[147,67]),
    [iquote('0:MRR:147.0,147.1,67.2,67.2')] ).

cnf(219,plain,
    ( ~ aSet0(szNzAzT0)
    | ~ aSubsetOf0(xQ,u)
    | ~ aSubsetOf0(u,szNzAzT0) ),
    inference(res,[status(thm),theory(equality)],[206,22]),
    [iquote('0:Res:206.3,22.0')] ).

cnf(224,plain,
    ( ~ aSubsetOf0(u,szNzAzT0)
    | ~ aSubsetOf0(xQ,u) ),
    inference(mrr,[status(thm)],[219,2]),
    [iquote('0:MRR:219.0,2.0')] ).

cnf(910,plain,
    ( ~ aSet0(szNzAzT0)
    | ~ aSubsetOf0(u,xS)
    | aSubsetOf0(u,szNzAzT0) ),
    inference(res,[status(thm),theory(equality)],[17,206]),
    [iquote('0:Res:17.0,206.1')] ).

cnf(921,plain,
    ( ~ aSubsetOf0(u,xS)
    | aSubsetOf0(u,szNzAzT0) ),
    inference(ssi,[status(thm)],[910,3,2]),
    [iquote('0:SSi:910.0,3.0,2.0')] ).

cnf(940,plain,
    aSubsetOf0(xO,szNzAzT0),
    inference(res,[status(thm),theory(equality)],[20,921]),
    [iquote('0:Res:20.0,921.0')] ).

cnf(942,plain,
    ~ aSubsetOf0(xQ,xO),
    inference(res,[status(thm),theory(equality)],[940,224]),
    [iquote('0:Res:940.0,224.0')] ).

cnf(947,plain,
    $false,
    inference(mrr,[status(thm)],[942,21]),
    [iquote('0:MRR:942.0,21.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11  % Problem  : NUM606+1 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.12  % Command  : run_spass %d %s
% 0.11/0.33  % Computer : n010.cluster.edu
% 0.11/0.33  % Model    : x86_64 x86_64
% 0.11/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33  % Memory   : 8042.1875MB
% 0.11/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33  % CPULimit : 300
% 0.11/0.33  % WCLimit  : 600
% 0.11/0.33  % DateTime : Wed Jul  6 01:59:47 EDT 2022
% 0.11/0.33  % CPUTime  : 
% 0.60/0.79  
% 0.60/0.79  SPASS V 3.9 
% 0.60/0.79  SPASS beiseite: Proof found.
% 0.60/0.79  % SZS status Theorem
% 0.60/0.79  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.60/0.79  SPASS derived 538 clauses, backtracked 24 clauses, performed 2 splits and kept 460 clauses.
% 0.60/0.79  SPASS allocated 101023 KBytes.
% 0.60/0.79  SPASS spent	0:00:00.45 on the problem.
% 0.60/0.79  		0:00:00.04 for the input.
% 0.60/0.79  		0:00:00.29 for the FLOTTER CNF translation.
% 0.60/0.79  		0:00:00.01 for inferences.
% 0.60/0.79  		0:00:00.00 for the backtracking.
% 0.60/0.79  		0:00:00.07 for the reduction.
% 0.60/0.79  
% 0.60/0.79  
% 0.60/0.79  Here is a proof with depth 3, length 16 :
% 0.60/0.79  % SZS output start Refutation
% See solution above
% 0.60/0.79  Formulae used in the proof : mNATSet m__3435 m__4998 m__5093 m__ mDefSub mSubTrans
% 0.60/0.79  
%------------------------------------------------------------------------------