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

% Computer : n021.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 20:41:26 EDT 2022

% Result   : Theorem 0.21s 0.51s
% Output   : Refutation 0.21s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    2
%            Number of leaves      :    4
% Syntax   : Number of clauses     :    6 (   4 unt;   0 nHn;   6 RR)
%            Number of literals    :    9 (   0 equ;   5 neg)
%            Maximal clause size   :    3 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    3 (   2 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   7 con; 0-2 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(10,axiom,
    aElementOf0(skc30,xI),
    file('RNG086+2.p',unknown),
    [] ).

cnf(11,axiom,
    aElementOf0(skc29,xJ),
    file('RNG086+2.p',unknown),
    [] ).

cnf(16,axiom,
    equal(sdtpldt0(skc30,skc29),xx),
    file('RNG086+2.p',unknown),
    [] ).

cnf(44,axiom,
    ( ~ aElementOf0(u,xJ)
    | ~ aElementOf0(v,xI)
    | ~ equal(sdtpldt0(v,u),xx) ),
    file('RNG086+2.p',unknown),
    [] ).

cnf(71,plain,
    ( ~ aElementOf0(skc30,xI)
    | ~ aElementOf0(skc29,xJ) ),
    inference(res,[status(thm),theory(equality)],[16,44]),
    [iquote('0:Res:16.0,44.1')] ).

cnf(74,plain,
    $false,
    inference(mrr,[status(thm)],[71,10,11]),
    [iquote('0:MRR:71.0,71.1,10.0,11.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13  % Problem  : RNG086+2 : TPTP v8.1.0. Released v4.0.0.
% 0.04/0.13  % Command  : run_spass %d %s
% 0.14/0.35  % Computer : n021.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 : Mon May 30 09:18:13 EDT 2022
% 0.14/0.35  % CPUTime  : 
% 0.21/0.51  
% 0.21/0.51  SPASS V 3.9 
% 0.21/0.51  SPASS beiseite: Proof found.
% 0.21/0.51  % SZS status Theorem
% 0.21/0.51  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.21/0.51  SPASS derived 5 clauses, backtracked 0 clauses, performed 0 splits and kept 69 clauses.
% 0.21/0.51  SPASS allocated 98741 KBytes.
% 0.21/0.51  SPASS spent	0:00:00.16 on the problem.
% 0.21/0.51  		0:00:00.04 for the input.
% 0.21/0.51  		0:00:00.10 for the FLOTTER CNF translation.
% 0.21/0.51  		0:00:00.00 for inferences.
% 0.21/0.51  		0:00:00.00 for the backtracking.
% 0.21/0.51  		0:00:00.00 for the reduction.
% 0.21/0.51  
% 0.21/0.51  
% 0.21/0.51  Here is a proof with depth 1, length 6 :
% 0.21/0.51  % SZS output start Refutation
% See solution above
% 0.21/0.51  Formulae used in the proof : m__901 m__
% 0.21/0.51  
%------------------------------------------------------------------------------