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

% Computer : n025.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:27 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(2,axiom,
    aElement0(sz10),
    file('RNG095+2.p',unknown),
    [] ).

cnf(11,axiom,
    aElementOf0(skf19(u),xI),
    file('RNG095+2.p',unknown),
    [] ).

cnf(12,axiom,
    aElementOf0(skf18(u),xJ),
    file('RNG095+2.p',unknown),
    [] ).

cnf(34,axiom,
    ( ~ aElement0(u)
    | equal(sdtpldt0(skf19(u),skf18(u)),u) ),
    file('RNG095+2.p',unknown),
    [] ).

cnf(43,axiom,
    ( ~ aElementOf0(u,xJ)
    | ~ aElementOf0(v,xI)
    | ~ equal(sdtpldt0(v,u),sz10) ),
    file('RNG095+2.p',unknown),
    [] ).

cnf(311,plain,
    ( ~ aElement0(u)
    | ~ aElementOf0(skf18(u),xJ)
    | ~ aElementOf0(skf19(u),xI)
    | ~ equal(u,sz10) ),
    inference(spl,[status(thm),theory(equality)],[34,43]),
    [iquote('0:SpL:34.1,43.2')] ).

cnf(315,plain,
    ( ~ aElement0(u)
    | ~ equal(u,sz10) ),
    inference(mrr,[status(thm)],[311,12,11]),
    [iquote('0:MRR:311.1,311.2,12.0,11.0')] ).

cnf(329,plain,
    ~ equal(sz10,sz10),
    inference(ems,[status(thm)],[315,2]),
    [iquote('0:EmS:315.0,2.0')] ).

cnf(332,plain,
    $false,
    inference(obv,[status(thm),theory(equality)],[329]),
    [iquote('0:Obv:329.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.11  % Problem  : RNG095+2 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.12  % Command  : run_spass %d %s
% 0.12/0.33  % Computer : n025.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 : Mon May 30 11:50:42 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.18/0.51  
% 0.18/0.51  SPASS V 3.9 
% 0.18/0.51  SPASS beiseite: Proof found.
% 0.18/0.51  % SZS status Theorem
% 0.18/0.51  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.18/0.51  SPASS derived 194 clauses, backtracked 0 clauses, performed 0 splits and kept 117 clauses.
% 0.18/0.51  SPASS allocated 98839 KBytes.
% 0.18/0.51  SPASS spent	0:00:00.17 on the problem.
% 0.18/0.51  		0:00:00.03 for the input.
% 0.18/0.51  		0:00:00.10 for the FLOTTER CNF translation.
% 0.18/0.51  		0:00:00.00 for inferences.
% 0.18/0.51  		0:00:00.00 for the backtracking.
% 0.18/0.51  		0:00:00.01 for the reduction.
% 0.18/0.51  
% 0.18/0.51  
% 0.18/0.51  Here is a proof with depth 2, length 9 :
% 0.18/0.51  % SZS output start Refutation
% See solution above
% 0.18/0.51  Formulae used in the proof : mSortsC_01 m__1205_03 mSortsC m__
% 0.18/0.51  
%------------------------------------------------------------------------------