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

% Computer : n022.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:32 EDT 2022

% Result   : Theorem 0.48s 0.68s
% Output   : Refutation 0.48s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    5
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   15 (   6 unt;   0 nHn;  15 RR)
%            Number of literals    :   29 (   0 equ;  19 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    :    9 (   9 usr;   5 con; 0-2 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(4,axiom,
    aElement0(xb),
    file('RNG121+4.p',unknown),
    [] ).

cnf(28,axiom,
    aElement0(skf47(u)),
    file('RNG121+4.p',unknown),
    [] ).

cnf(39,axiom,
    aElementOf0(sz00,slsdtgt0(xa)),
    file('RNG121+4.p',unknown),
    [] ).

cnf(42,axiom,
    aElementOf0(xb,slsdtgt0(xb)),
    file('RNG121+4.p',unknown),
    [] ).

cnf(79,axiom,
    ( ~ aElement0(u)
    | equal(sdtpldt0(sz00,u),u) ),
    file('RNG121+4.p',unknown),
    [] ).

cnf(102,axiom,
    ( ~ aElement0(u)
    | ~ aElement0(v)
    | aElement0(sdtasdt0(v,u)) ),
    file('RNG121+4.p',unknown),
    [] ).

cnf(116,axiom,
    ( ~ aElementOf0(u,slsdtgt0(xb))
    | equal(sdtasdt0(xb,skf47(u)),u) ),
    file('RNG121+4.p',unknown),
    [] ).

cnf(140,axiom,
    ( ~ aElementOf0(u,slsdtgt0(xb))
    | ~ aElementOf0(v,slsdtgt0(xa))
    | ~ equal(sdtpldt0(v,u),xb) ),
    file('RNG121+4.p',unknown),
    [] ).

cnf(194,plain,
    ( ~ aElementOf0(u,slsdtgt0(xb))
    | ~ equal(sdtpldt0(sz00,u),xb) ),
    inference(res,[status(thm),theory(equality)],[39,140]),
    [iquote('0:Res:39.0,140.0')] ).

cnf(359,plain,
    ( ~ aElement0(skf47(u))
    | ~ aElement0(xb)
    | ~ aElementOf0(u,slsdtgt0(xb))
    | aElement0(u) ),
    inference(spr,[status(thm),theory(equality)],[116,102]),
    [iquote('0:SpR:116.1,102.2')] ).

cnf(360,plain,
    ( ~ aElementOf0(u,slsdtgt0(xb))
    | aElement0(u) ),
    inference(ssi,[status(thm)],[359,4,28]),
    [iquote('0:SSi:359.1,359.0,4.0,28.0')] ).

cnf(374,plain,
    ( ~ aElement0(u)
    | ~ aElementOf0(u,slsdtgt0(xb))
    | ~ equal(u,xb) ),
    inference(spl,[status(thm),theory(equality)],[79,194]),
    [iquote('0:SpL:79.1,194.1')] ).

cnf(377,plain,
    ( ~ aElementOf0(u,slsdtgt0(xb))
    | ~ equal(u,xb) ),
    inference(mrr,[status(thm)],[374,360]),
    [iquote('0:MRR:374.0,360.1')] ).

cnf(384,plain,
    ~ equal(xb,xb),
    inference(res,[status(thm),theory(equality)],[42,377]),
    [iquote('0:Res:42.0,377.0')] ).

cnf(388,plain,
    $false,
    inference(obv,[status(thm),theory(equality)],[384]),
    [iquote('0:Obv:384.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.13  % Problem  : RNG121+4 : TPTP v8.1.0. Released v4.0.0.
% 0.08/0.14  % Command  : run_spass %d %s
% 0.15/0.35  % Computer : n022.cluster.edu
% 0.15/0.35  % Model    : x86_64 x86_64
% 0.15/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35  % Memory   : 8042.1875MB
% 0.15/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35  % CPULimit : 300
% 0.15/0.35  % WCLimit  : 600
% 0.15/0.35  % DateTime : Mon May 30 18:35:52 EDT 2022
% 0.15/0.35  % CPUTime  : 
% 0.48/0.68  
% 0.48/0.68  SPASS V 3.9 
% 0.48/0.68  SPASS beiseite: Proof found.
% 0.48/0.68  % SZS status Theorem
% 0.48/0.68  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.48/0.68  SPASS derived 169 clauses, backtracked 0 clauses, performed 0 splits and kept 246 clauses.
% 0.48/0.68  SPASS allocated 100382 KBytes.
% 0.48/0.68  SPASS spent	0:00:00.31 on the problem.
% 0.48/0.68  		0:00:00.04 for the input.
% 0.48/0.68  		0:00:00.23 for the FLOTTER CNF translation.
% 0.48/0.68  		0:00:00.00 for inferences.
% 0.48/0.68  		0:00:00.00 for the backtracking.
% 0.48/0.68  		0:00:00.02 for the reduction.
% 0.48/0.68  
% 0.48/0.68  
% 0.48/0.68  Here is a proof with depth 3, length 15 :
% 0.48/0.68  % SZS output start Refutation
% See solution above
% 0.48/0.68  Formulae used in the proof : m__2091 m__2228 m__2666 m__2203 mAddZero mSortsB_02 m__
% 0.48/0.68  
%------------------------------------------------------------------------------