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

% Result   : Theorem 0.50s 0.71s
% Output   : Refutation 0.50s
% 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(9,axiom,
    aElementOf0(xK,szNzAzT0),
    file('NUM568+1.p',unknown),
    [] ).

cnf(11,axiom,
    aElementOf0(skf25(u),szNzAzT0),
    file('NUM568+1.p',unknown),
    [] ).

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

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

cnf(54,axiom,
    ( ~ aElementOf0(u,szNzAzT0)
    | equal(u,sz00)
    | equal(szszuzczcdt0(skf25(u)),u) ),
    file('NUM568+1.p',unknown),
    [] ).

cnf(187,plain,
    ~ equal(szszuzczcdt0(skf25(u)),xK),
    inference(res,[status(thm),theory(equality)],[11,35]),
    [iquote('0:Res:11.0,35.0')] ).

cnf(328,plain,
    ( ~ aElementOf0(u,szNzAzT0)
    | ~ equal(u,xK)
    | equal(u,sz00) ),
    inference(spl,[status(thm),theory(equality)],[54,187]),
    [iquote('0:SpL:54.2,187.0')] ).

cnf(334,plain,
    ( ~ equal(xK,xK)
    | equal(xK,sz00) ),
    inference(res,[status(thm),theory(equality)],[9,328]),
    [iquote('0:Res:9.0,328.0')] ).

cnf(341,plain,
    equal(xK,sz00),
    inference(obv,[status(thm),theory(equality)],[334]),
    [iquote('0:Obv:334.0')] ).

cnf(342,plain,
    $false,
    inference(mrr,[status(thm)],[341,15]),
    [iquote('0:MRR:341.0,15.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.14  % Problem  : NUM568+1 : TPTP v8.1.0. Released v4.0.0.
% 0.14/0.15  % Command  : run_spass %d %s
% 0.15/0.37  % Computer : n029.cluster.edu
% 0.15/0.37  % Model    : x86_64 x86_64
% 0.15/0.37  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37  % Memory   : 8042.1875MB
% 0.15/0.37  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37  % CPULimit : 300
% 0.15/0.37  % WCLimit  : 600
% 0.15/0.37  % DateTime : Wed Jul  6 08:30:13 EDT 2022
% 0.15/0.37  % CPUTime  : 
% 0.50/0.71  
% 0.50/0.71  SPASS V 3.9 
% 0.50/0.71  SPASS beiseite: Proof found.
% 0.50/0.71  % SZS status Theorem
% 0.50/0.71  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.50/0.71  SPASS derived 141 clauses, backtracked 0 clauses, performed 0 splits and kept 223 clauses.
% 0.50/0.71  SPASS allocated 100873 KBytes.
% 0.50/0.71  SPASS spent	0:00:00.33 on the problem.
% 0.50/0.71  		0:00:00.04 for the input.
% 0.50/0.71  		0:00:00.24 for the FLOTTER CNF translation.
% 0.50/0.71  		0:00:00.00 for inferences.
% 0.50/0.71  		0:00:00.00 for the backtracking.
% 0.50/0.71  		0:00:00.02 for the reduction.
% 0.50/0.71  
% 0.50/0.71  
% 0.50/0.71  Here is a proof with depth 3, length 10 :
% 0.50/0.71  % SZS output start Refutation
% See solution above
% 0.50/0.71  Formulae used in the proof : m__3418 mNatExtra m__3520 m__
% 0.50/0.71  
%------------------------------------------------------------------------------