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

% Computer : n009.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:10 EDT 2022

% Result   : Theorem 1.09s 1.32s
% Output   : Refutation 1.09s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    3
%            Number of leaves      :    5
% Syntax   : Number of clauses     :    9 (   6 unt;   0 nHn;   9 RR)
%            Number of literals    :   12 (   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    :   10 (  10 usr;   6 con; 0-2 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(48,axiom,
    equal(szDzozmdt0(xd),szNzAzT0),
    file('NUM618+3.p',unknown),
    [] ).

cnf(72,axiom,
    equal(sdtlpdtrp0(xe,skc97),xx),
    file('NUM618+3.p',unknown),
    [] ).

cnf(89,axiom,
    aElementOf0(skc97,sdtlbdtrb0(xd,szDzizrdt0(xd))),
    file('NUM618+3.p',unknown),
    [] ).

cnf(133,axiom,
    ( ~ aElementOf0(u,szNzAzT0)
    | ~ equal(sdtlpdtrp0(xe,u),xx) ),
    file('NUM618+3.p',unknown),
    [] ).

cnf(151,axiom,
    ( ~ aElementOf0(u,sdtlbdtrb0(xd,szDzizrdt0(xd)))
    | aElementOf0(u,szDzozmdt0(xd)) ),
    file('NUM618+3.p',unknown),
    [] ).

cnf(424,plain,
    ( ~ aElementOf0(u,sdtlbdtrb0(xd,szDzizrdt0(xd)))
    | aElementOf0(u,szNzAzT0) ),
    inference(rew,[status(thm),theory(equality)],[48,151]),
    [iquote('0:Rew:48.0,151.1')] ).

cnf(513,plain,
    ~ aElementOf0(skc97,szNzAzT0),
    inference(res,[status(thm),theory(equality)],[72,133]),
    [iquote('0:Res:72.0,133.1')] ).

cnf(745,plain,
    aElementOf0(skc97,szNzAzT0),
    inference(res,[status(thm),theory(equality)],[89,424]),
    [iquote('0:Res:89.0,424.0')] ).

cnf(750,plain,
    $false,
    inference(mrr,[status(thm)],[745,513]),
    [iquote('0:MRR:745.0,513.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : NUM618+3 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.12  % Command  : run_spass %d %s
% 0.12/0.33  % Computer : n009.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 19:16:52 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 1.09/1.32  
% 1.09/1.32  SPASS V 3.9 
% 1.09/1.32  SPASS beiseite: Proof found.
% 1.09/1.32  % SZS status Theorem
% 1.09/1.32  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 1.09/1.32  SPASS derived 211 clauses, backtracked 0 clauses, performed 0 splits and kept 474 clauses.
% 1.09/1.32  SPASS allocated 105194 KBytes.
% 1.09/1.32  SPASS spent	0:00:00.97 on the problem.
% 1.09/1.32  		0:00:00.04 for the input.
% 1.09/1.32  		0:00:00.84 for the FLOTTER CNF translation.
% 1.09/1.32  		0:00:00.00 for inferences.
% 1.09/1.32  		0:00:00.00 for the backtracking.
% 1.09/1.32  		0:00:00.05 for the reduction.
% 1.09/1.32  
% 1.09/1.32  
% 1.09/1.32  Here is a proof with depth 1, length 9 :
% 1.09/1.32  % SZS output start Refutation
% See solution above
% 1.09/1.32  Formulae used in the proof : m__4730 m__5365 m__ m__4891
% 1.09/1.32  
%------------------------------------------------------------------------------