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

% Computer : n027.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:27:36 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(10,axiom,
    aElementOf0(xK,szNzAzT0),
    file('NUM568+3.p',unknown),
    [] ).

cnf(12,axiom,
    aElementOf0(skf34(u),szNzAzT0),
    file('NUM568+3.p',unknown),
    [] ).

cnf(16,axiom,
    ~ equal(xK,sz00),
    file('NUM568+3.p',unknown),
    [] ).

cnf(41,axiom,
    ( ~ aElementOf0(u,szNzAzT0)
    | ~ equal(szszuzczcdt0(u),xK) ),
    file('NUM568+3.p',unknown),
    [] ).

cnf(65,axiom,
    ( ~ aElementOf0(u,szNzAzT0)
    | equal(u,sz00)
    | equal(szszuzczcdt0(skf34(u)),u) ),
    file('NUM568+3.p',unknown),
    [] ).

cnf(226,plain,
    ~ equal(szszuzczcdt0(skf34(u)),xK),
    inference(res,[status(thm),theory(equality)],[12,41]),
    [iquote('0:Res:12.0,41.0')] ).

cnf(493,plain,
    ( ~ aElementOf0(u,szNzAzT0)
    | ~ equal(u,xK)
    | equal(u,sz00) ),
    inference(spl,[status(thm),theory(equality)],[65,226]),
    [iquote('0:SpL:65.2,226.0')] ).

cnf(498,plain,
    ( ~ equal(xK,xK)
    | equal(xK,sz00) ),
    inference(res,[status(thm),theory(equality)],[10,493]),
    [iquote('0:Res:10.0,493.0')] ).

cnf(507,plain,
    equal(xK,sz00),
    inference(obv,[status(thm),theory(equality)],[498]),
    [iquote('0:Obv:498.0')] ).

cnf(508,plain,
    $false,
    inference(mrr,[status(thm)],[507,16]),
    [iquote('0:MRR:507.0,16.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : NUM568+3 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.12  % Command  : run_spass %d %s
% 0.12/0.33  % Computer : n027.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 : Thu Jul  7 08:57:14 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.68/0.87  
% 0.68/0.87  SPASS V 3.9 
% 0.68/0.87  SPASS beiseite: Proof found.
% 0.68/0.87  % SZS status Theorem
% 0.68/0.87  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.68/0.87  SPASS derived 254 clauses, backtracked 0 clauses, performed 2 splits and kept 316 clauses.
% 0.68/0.87  SPASS allocated 102090 KBytes.
% 0.68/0.87  SPASS spent	0:00:00.52 on the problem.
% 0.68/0.87  		0:00:00.04 for the input.
% 0.68/0.87  		0:00:00.42 for the FLOTTER CNF translation.
% 0.68/0.87  		0:00:00.00 for inferences.
% 0.68/0.87  		0:00:00.00 for the backtracking.
% 0.68/0.87  		0:00:00.03 for the reduction.
% 0.68/0.87  
% 0.68/0.87  
% 0.68/0.87  Here is a proof with depth 3, length 10 :
% 0.68/0.87  % SZS output start Refutation
% See solution above
% 0.68/0.87  Formulae used in the proof : m__3418 mNatExtra m__3520 m__
% 0.68/0.87  
%------------------------------------------------------------------------------