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

% Computer : n013.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:21 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(14,axiom,
    isCountable0(xO),
    file('NUM633+1.p',unknown),
    [] ).

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

cnf(33,axiom,
    aElementOf0(szDzizrdt0(xd),xT),
    file('NUM633+1.p',unknown),
    [] ).

cnf(84,axiom,
    ( ~ aElementOf0(u,slbdtsldtrb0(xO,xK))
    | equal(sdtlpdtrp0(xc,u),szDzizrdt0(xd)) ),
    file('NUM633+1.p',unknown),
    [] ).

cnf(126,axiom,
    ( ~ isCountable0(u)
    | ~ aSubsetOf0(u,xS)
    | ~ aElementOf0(v,xT)
    | aElementOf0(skf26(u,w),slbdtsldtrb0(u,xK)) ),
    file('NUM633+1.p',unknown),
    [] ).

cnf(132,axiom,
    ( ~ isCountable0(u)
    | ~ aSubsetOf0(u,xS)
    | ~ aElementOf0(v,xT)
    | ~ equal(sdtlpdtrp0(xc,skf26(u,v)),v) ),
    file('NUM633+1.p',unknown),
    [] ).

cnf(228,plain,
    ( ~ isCountable0(xO)
    | ~ aElementOf0(u,xT)
    | aElementOf0(skf26(xO,v),slbdtsldtrb0(xO,xK)) ),
    inference(res,[status(thm),theory(equality)],[20,126]),
    [iquote('0:Res:20.0,126.1')] ).

cnf(243,plain,
    ( ~ isCountable0(xO)
    | ~ aElementOf0(u,xT)
    | ~ equal(sdtlpdtrp0(xc,skf26(xO,u)),u) ),
    inference(res,[status(thm),theory(equality)],[20,132]),
    [iquote('0:Res:20.0,132.2')] ).

cnf(245,plain,
    ( ~ aElementOf0(u,xT)
    | aElementOf0(skf26(xO,v),slbdtsldtrb0(xO,xK)) ),
    inference(mrr,[status(thm)],[228,14]),
    [iquote('0:MRR:228.0,14.0')] ).

cnf(247,plain,
    ( ~ aElementOf0(u,xT)
    | ~ equal(sdtlpdtrp0(xc,skf26(xO,u)),u) ),
    inference(mrr,[status(thm)],[243,14]),
    [iquote('0:MRR:243.0,14.0')] ).

cnf(420,plain,
    aElementOf0(skf26(xO,u),slbdtsldtrb0(xO,xK)),
    inference(res,[status(thm),theory(equality)],[33,245]),
    [iquote('0:Res:33.0,245.0')] ).

cnf(486,plain,
    equal(sdtlpdtrp0(xc,skf26(xO,u)),szDzizrdt0(xd)),
    inference(res,[status(thm),theory(equality)],[420,84]),
    [iquote('0:Res:420.0,84.0')] ).

cnf(488,plain,
    ( ~ aElementOf0(u,xT)
    | ~ equal(szDzizrdt0(xd),u) ),
    inference(rew,[status(thm),theory(equality)],[486,247]),
    [iquote('0:Rew:486.0,247.1')] ).

cnf(491,plain,
    ~ equal(szDzizrdt0(xd),szDzizrdt0(xd)),
    inference(res,[status(thm),theory(equality)],[33,488]),
    [iquote('0:Res:33.0,488.0')] ).

cnf(496,plain,
    $false,
    inference(obv,[status(thm),theory(equality)],[491]),
    [iquote('0:Obv:491.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13  % Problem  : NUM633+1 : TPTP v8.1.0. Released v4.0.0.
% 0.08/0.13  % Command  : run_spass %d %s
% 0.14/0.35  % Computer : n013.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 600
% 0.14/0.35  % DateTime : Wed Jul  6 07:04:29 EDT 2022
% 0.14/0.35  % CPUTime  : 
% 0.62/0.78  
% 0.62/0.78  SPASS V 3.9 
% 0.62/0.78  SPASS beiseite: Proof found.
% 0.62/0.78  % SZS status Theorem
% 0.62/0.78  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.62/0.78  SPASS derived 210 clauses, backtracked 0 clauses, performed 0 splits and kept 303 clauses.
% 0.62/0.78  SPASS allocated 101232 KBytes.
% 0.62/0.78  SPASS spent	0:00:00.41 on the problem.
% 0.62/0.78  		0:00:00.04 for the input.
% 0.62/0.78  		0:00:00.31 for the FLOTTER CNF translation.
% 0.62/0.78  		0:00:00.00 for inferences.
% 0.62/0.78  		0:00:00.00 for the backtracking.
% 0.62/0.78  		0:00:00.03 for the reduction.
% 0.62/0.78  
% 0.62/0.78  
% 0.62/0.78  Here is a proof with depth 3, length 15 :
% 0.62/0.78  % SZS output start Refutation
% See solution above
% 0.62/0.78  Formulae used in the proof : m__4908 m__4998 m__4854 m__
% 0.62/0.78  
%------------------------------------------------------------------------------