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

% Computer : n017.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:08 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(62,axiom,
    equal(sdtlpdtrp0(xe,skc95),xp),
    file('NUM615+3.p',unknown),
    [] ).

cnf(76,axiom,
    aElementOf0(skc95,sdtlbdtrb0(xd,szDzizrdt0(xd))),
    file('NUM615+3.p',unknown),
    [] ).

cnf(151,axiom,
    ( ~ aElementOf0(u,sdtlbdtrb0(xd,szDzizrdt0(xd)))
    | ~ equal(sdtlpdtrp0(xe,u),xp) ),
    file('NUM615+3.p',unknown),
    [] ).

cnf(491,plain,
    ~ equal(sdtlpdtrp0(xe,skc95),xp),
    inference(res,[status(thm),theory(equality)],[76,151]),
    [iquote('0:Res:76.0,151.0')] ).

cnf(502,plain,
    ~ equal(xp,xp),
    inference(rew,[status(thm),theory(equality)],[62,491]),
    [iquote('0:Rew:62.0,491.0')] ).

cnf(503,plain,
    $false,
    inference(obv,[status(thm),theory(equality)],[502]),
    [iquote('0:Obv:502.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12  % Problem  : NUM615+3 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.13  % Command  : run_spass %d %s
% 0.12/0.34  % Computer : n017.cluster.edu
% 0.12/0.34  % Model    : x86_64 x86_64
% 0.12/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.12/0.34  % Memory   : 8042.1875MB
% 0.12/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.12/0.34  % CPULimit : 300
% 0.12/0.34  % WCLimit  : 600
% 0.12/0.34  % DateTime : Wed Jul  6 12:27:44 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.91/1.15  
% 0.91/1.15  SPASS V 3.9 
% 0.91/1.15  SPASS beiseite: Proof found.
% 0.91/1.15  % SZS status Theorem
% 0.91/1.15  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.91/1.15  SPASS derived 7 clauses, backtracked 0 clauses, performed 0 splits and kept 366 clauses.
% 0.91/1.15  SPASS allocated 104633 KBytes.
% 0.91/1.15  SPASS spent	0:00:00.80 on the problem.
% 0.91/1.15  		0:00:00.04 for the input.
% 0.91/1.15  		0:00:00.68 for the FLOTTER CNF translation.
% 0.91/1.15  		0:00:00.00 for inferences.
% 0.91/1.15  		0:00:00.00 for the backtracking.
% 0.91/1.15  		0:00:00.04 for the reduction.
% 0.91/1.15  
% 0.91/1.15  
% 0.91/1.15  Here is a proof with depth 1, length 6 :
% 0.91/1.15  % SZS output start Refutation
% See solution above
% 0.91/1.15  Formulae used in the proof : m__5182 m__
% 0.91/1.15  
%------------------------------------------------------------------------------