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

% Computer : n007.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 0.51s 0.72s
% Output   : Refutation 0.51s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    4
%            Number of leaves      :    4
% Syntax   : Number of clauses     :    8 (   4 unt;   0 nHn;   8 RR)
%            Number of literals    :   13 (   0 equ;   9 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    :    7 (   7 usr;   5 con; 0-2 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(31,axiom,
    aElementOf0(xx,xO),
    file('NUM618+1.p',unknown),
    [] ).

cnf(45,axiom,
    aElementOf0(skf50(u),szNzAzT0),
    file('NUM618+1.p',unknown),
    [] ).

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

cnf(95,axiom,
    ( ~ aElementOf0(u,xO)
    | equal(sdtlpdtrp0(xe,skf50(u)),u) ),
    file('NUM618+1.p',unknown),
    [] ).

cnf(393,plain,
    ( ~ aElementOf0(u,xO)
    | ~ aElementOf0(skf50(u),szNzAzT0)
    | ~ equal(u,xx) ),
    inference(spl,[status(thm),theory(equality)],[95,91]),
    [iquote('0:SpL:95.1,91.1')] ).

cnf(394,plain,
    ( ~ aElementOf0(u,xO)
    | ~ equal(u,xx) ),
    inference(mrr,[status(thm)],[393,45]),
    [iquote('0:MRR:393.1,45.0')] ).

cnf(502,plain,
    ~ equal(xx,xx),
    inference(res,[status(thm),theory(equality)],[31,394]),
    [iquote('0:Res:31.0,394.0')] ).

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

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13  % Problem  : NUM618+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.14  % Command  : run_spass %d %s
% 0.14/0.35  % Computer : n007.cluster.edu
% 0.14/0.35  % Model    : x86_64 x86_64
% 0.14/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.35  % Memory   : 8042.1875MB
% 0.14/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.35  % CPULimit : 300
% 0.14/0.35  % WCLimit  : 600
% 0.14/0.35  % DateTime : Wed Jul  6 13:57:43 EDT 2022
% 0.14/0.36  % CPUTime  : 
% 0.51/0.72  
% 0.51/0.72  SPASS V 3.9 
% 0.51/0.72  SPASS beiseite: Proof found.
% 0.51/0.72  % SZS status Theorem
% 0.51/0.72  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.51/0.72  SPASS derived 208 clauses, backtracked 0 clauses, performed 0 splits and kept 316 clauses.
% 0.51/0.72  SPASS allocated 101129 KBytes.
% 0.51/0.72  SPASS spent	0:00:00.35 on the problem.
% 0.51/0.72  		0:00:00.04 for the input.
% 0.51/0.72  		0:00:00.25 for the FLOTTER CNF translation.
% 0.51/0.72  		0:00:00.00 for inferences.
% 0.51/0.72  		0:00:00.00 for the backtracking.
% 0.51/0.72  		0:00:00.03 for the reduction.
% 0.51/0.72  
% 0.51/0.72  
% 0.51/0.72  Here is a proof with depth 2, length 8 :
% 0.51/0.72  % SZS output start Refutation
% See solution above
% 0.51/0.72  Formulae used in the proof : m__5365 m__4982 m__
% 0.51/0.72  
%------------------------------------------------------------------------------