%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : NUM615+1 : 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:08 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(25,axiom,
    aElementOf0(xp,xO),
    file('NUM615+1.p',unknown),
    [] ).

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

cnf(94,axiom,
    ( ~ aElementOf0(u,xO)
    | aElementOf0(skf50(u),sdtlbdtrb0(xd,szDzizrdt0(xd))) ),
    file('NUM615+1.p',unknown),
    [] ).

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

cnf(602,plain,
    ( ~ aElementOf0(u,xO)
    | ~ equal(sdtlpdtrp0(xe,skf50(u)),xp) ),
    inference(res,[status(thm),theory(equality)],[94,101]),
    [iquote('0:Res:94.1,101.0')] ).

cnf(603,plain,
    ( ~ aElementOf0(u,xO)
    | ~ equal(u,xp) ),
    inference(rew,[status(thm),theory(equality)],[87,602]),
    [iquote('0:Rew:87.1,602.1')] ).

cnf(616,plain,
    ~ equal(xp,xp),
    inference(res,[status(thm),theory(equality)],[25,603]),
    [iquote('0:Res:25.0,603.0')] ).

cnf(618,plain,
    $false,
    inference(obv,[status(thm),theory(equality)],[616]),
    [iquote('0:Obv:616.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : NUM615+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/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 : Wed Jul  6 02:08:38 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.55/0.76  
% 0.55/0.76  SPASS V 3.9 
% 0.55/0.76  SPASS beiseite: Proof found.
% 0.55/0.76  % SZS status Theorem
% 0.55/0.76  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.55/0.76  SPASS derived 288 clauses, backtracked 0 clauses, performed 0 splits and kept 344 clauses.
% 0.55/0.76  SPASS allocated 101097 KBytes.
% 0.55/0.76  SPASS spent	0:00:00.41 on the problem.
% 0.55/0.76  		0:00:00.04 for the input.
% 0.55/0.76  		0:00:00.30 for the FLOTTER CNF translation.
% 0.55/0.76  		0:00:00.01 for inferences.
% 0.55/0.76  		0:00:00.00 for the backtracking.
% 0.55/0.76  		0:00:00.04 for the reduction.
% 0.55/0.76  
% 0.55/0.76  
% 0.55/0.76  Here is a proof with depth 2, length 8 :
% 0.55/0.76  % SZS output start Refutation
% See solution above
% 0.55/0.76  Formulae used in the proof : m__5182 m__4982 m__3533 m__
% 0.55/0.76  
%------------------------------------------------------------------------------