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

% Computer : n018.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.20s 0.51s
% Output   : Refutation 0.20s
% 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(9,axiom,
    aElementOf0(skc32,xI),
    file('RNG087+2.p',unknown),
    [] ).

cnf(12,axiom,
    aElementOf0(skc31,xJ),
    file('RNG087+2.p',unknown),
    [] ).

cnf(17,axiom,
    equal(sdtpldt0(skc32,skc31),xy),
    file('RNG087+2.p',unknown),
    [] ).

cnf(47,axiom,
    ( ~ aElementOf0(u,xJ)
    | ~ aElementOf0(v,xI)
    | ~ equal(sdtpldt0(v,u),xy) ),
    file('RNG087+2.p',unknown),
    [] ).

cnf(75,plain,
    ( ~ aElementOf0(skc32,xI)
    | ~ aElementOf0(skc31,xJ) ),
    inference(res,[status(thm),theory(equality)],[17,47]),
    [iquote('0:Res:17.0,47.1')] ).

cnf(79,plain,
    $false,
    inference(mrr,[status(thm)],[75,9,12]),
    [iquote('0:MRR:75.0,75.1,9.0,12.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : RNG087+2 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.13  % Command  : run_spass %d %s
% 0.12/0.34  % Computer : n018.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 : Mon May 30 13:32:57 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.20/0.51  
% 0.20/0.51  SPASS V 3.9 
% 0.20/0.51  SPASS beiseite: Proof found.
% 0.20/0.51  % SZS status Theorem
% 0.20/0.51  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.20/0.51  SPASS derived 7 clauses, backtracked 0 clauses, performed 0 splits and kept 72 clauses.
% 0.20/0.51  SPASS allocated 98792 KBytes.
% 0.20/0.51  SPASS spent	0:00:00.15 on the problem.
% 0.20/0.51  		0:00:00.04 for the input.
% 0.20/0.51  		0:00:00.09 for the FLOTTER CNF translation.
% 0.20/0.51  		0:00:00.00 for inferences.
% 0.20/0.51  		0:00:00.00 for the backtracking.
% 0.20/0.51  		0:00:00.00 for the reduction.
% 0.20/0.51  
% 0.20/0.51  
% 0.20/0.51  Here is a proof with depth 1, length 6 :
% 0.20/0.51  % SZS output start Refutation
% See solution above
% 0.20/0.51  Formulae used in the proof : m__901 m__
% 0.20/0.51  
%------------------------------------------------------------------------------