%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : NUM620+3 : 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:12 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(37,axiom,
    aElementOf0(xm,szNzAzT0),
    file('NUM620+3.p',unknown),
    [] ).

cnf(74,axiom,
    equal(sdtlpdtrp0(xe,xm),xx),
    file('NUM620+3.p',unknown),
    [] ).

cnf(92,axiom,
    ~ aElementOf0(xx,sdtlpdtrp0(xN,szszuzczcdt0(xn))),
    file('NUM620+3.p',unknown),
    [] ).

cnf(153,axiom,
    ( ~ aElementOf0(u,szNzAzT0)
    | aElementOf0(sdtlpdtrp0(xe,u),sdtlpdtrp0(xN,u)) ),
    file('NUM620+3.p',unknown),
    [] ).

cnf(156,axiom,
    ( ~ aElementOf0(u,sdtlpdtrp0(xN,xm))
    | aElementOf0(u,sdtlpdtrp0(xN,szszuzczcdt0(xn))) ),
    file('NUM620+3.p',unknown),
    [] ).

cnf(513,plain,
    ~ aElementOf0(xx,sdtlpdtrp0(xN,xm)),
    inference(res,[status(thm),theory(equality)],[156,92]),
    [iquote('0:Res:156.1,92.0')] ).

cnf(898,plain,
    ( ~ aElementOf0(xm,szNzAzT0)
    | aElementOf0(xx,sdtlpdtrp0(xN,xm)) ),
    inference(spr,[status(thm),theory(equality)],[74,153]),
    [iquote('0:SpR:74.0,153.1')] ).

cnf(908,plain,
    $false,
    inference(mrr,[status(thm)],[898,37,513]),
    [iquote('0:MRR:898.0,898.1,37.0,513.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.11  % Problem  : NUM620+3 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.12  % Command  : run_spass %d %s
% 0.12/0.33  % Computer : n008.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 13:07:38 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 1.21/1.40  
% 1.21/1.40  SPASS V 3.9 
% 1.21/1.40  SPASS beiseite: Proof found.
% 1.21/1.40  % SZS status Theorem
% 1.21/1.40  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 1.21/1.40  SPASS derived 302 clauses, backtracked 0 clauses, performed 0 splits and kept 545 clauses.
% 1.21/1.40  SPASS allocated 105183 KBytes.
% 1.21/1.40  SPASS spent	0:00:01.05 on the problem.
% 1.21/1.40  		0:00:00.04 for the input.
% 1.21/1.40  		0:00:00.90 for the FLOTTER CNF translation.
% 1.21/1.40  		0:00:00.00 for inferences.
% 1.21/1.40  		0:00:00.00 for the backtracking.
% 1.21/1.40  		0:00:00.06 for the reduction.
% 1.21/1.40  
% 1.21/1.40  
% 1.21/1.40  Here is a proof with depth 1, length 8 :
% 1.21/1.40  % SZS output start Refutation
% See solution above
% 1.21/1.40  Formulae used in the proof : m__5389 m__ m__4660
% 1.21/1.40  
%------------------------------------------------------------------------------