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

% Computer : n024.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:58 EDT 2022

% Result   : Theorem 0.46s 0.68s
% Output   : Refutation 0.46s
% 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(20,axiom,
    aElementOf0(xx,xO),
    file('NUM602+1.p',unknown),
    [] ).

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

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

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

cnf(336,plain,
    ( ~ aElementOf0(u,xO)
    | ~ aElementOf0(skf50(u),szNzAzT0)
    | ~ equal(u,xx) ),
    inference(spl,[status(thm),theory(equality)],[74,70]),
    [iquote('0:SpL:74.1,70.1')] ).

cnf(337,plain,
    ( ~ aElementOf0(u,xO)
    | ~ equal(u,xx) ),
    inference(mrr,[status(thm)],[336,34]),
    [iquote('0:MRR:336.1,34.0')] ).

cnf(385,plain,
    ~ equal(xx,xx),
    inference(res,[status(thm),theory(equality)],[20,337]),
    [iquote('0:Res:20.0,337.0')] ).

cnf(387,plain,
    $false,
    inference(obv,[status(thm),theory(equality)],[385]),
    [iquote('0:Obv:385.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.11/0.11  % Problem  : NUM602+1 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.12  % Command  : run_spass %d %s
% 0.12/0.33  % Computer : n024.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:46:44 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.46/0.68  
% 0.46/0.68  SPASS V 3.9 
% 0.46/0.68  SPASS beiseite: Proof found.
% 0.46/0.68  % SZS status Theorem
% 0.46/0.68  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.46/0.68  SPASS derived 124 clauses, backtracked 0 clauses, performed 0 splits and kept 258 clauses.
% 0.46/0.68  SPASS allocated 101044 KBytes.
% 0.46/0.68  SPASS spent	0:00:00.34 on the problem.
% 0.46/0.68  		0:00:00.04 for the input.
% 0.46/0.68  		0:00:00.24 for the FLOTTER CNF translation.
% 0.46/0.68  		0:00:00.00 for inferences.
% 0.46/0.68  		0:00:00.00 for the backtracking.
% 0.46/0.68  		0:00:00.02 for the reduction.
% 0.46/0.68  
% 0.46/0.68  
% 0.46/0.68  Here is a proof with depth 2, length 8 :
% 0.46/0.68  % SZS output start Refutation
% See solution above
% 0.46/0.68  Formulae used in the proof : m__5009 m__4982 m__3533 m__
% 0.46/0.68  
%------------------------------------------------------------------------------