TSTP Solution File: RNG120+4 by SPASS---3.9

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : RNG120+4 : 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:32 EDT 2022

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

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

cnf(3,axiom,
    aElement0(xa),
    file('RNG120+4.p',unknown),
    [] ).

cnf(4,axiom,
    aElement0(xb),
    file('RNG120+4.p',unknown),
    [] ).

cnf(17,axiom,
    aElement0(xq),
    file('RNG120+4.p',unknown),
    [] ).

cnf(29,axiom,
    aElementOf0(xu,xI),
    file('RNG120+4.p',unknown),
    [] ).

cnf(50,axiom,
    ( ~ aIdeal0(u)
    | aSet0(u) ),
    file('RNG120+4.p',unknown),
    [] ).

cnf(53,axiom,
    aElementOf0(skf46(u),slsdtgt0(xa)),
    file('RNG120+4.p',unknown),
    [] ).

cnf(54,axiom,
    aElementOf0(skf45(u),slsdtgt0(xb)),
    file('RNG120+4.p',unknown),
    [] ).

cnf(64,axiom,
    ( ~ aElement0(u)
    | aElement0(smndt0(u)) ),
    file('RNG120+4.p',unknown),
    [] ).

cnf(66,axiom,
    ( ~ aElement0(u)
    | aIdeal0(slsdtgt0(u)) ),
    file('RNG120+4.p',unknown),
    [] ).

cnf(71,axiom,
    ~ aElementOf0(smndt0(sdtasdt0(xq,xu)),xI),
    file('RNG120+4.p',unknown),
    [] ).

cnf(86,axiom,
    ( ~ aSet0(u)
    | ~ aElementOf0(v,u)
    | aElement0(v) ),
    file('RNG120+4.p',unknown),
    [] ).

cnf(97,axiom,
    ( ~ aElement0(u)
    | ~ aElement0(v)
    | aElement0(sdtpldt0(v,u)) ),
    file('RNG120+4.p',unknown),
    [] ).

cnf(99,axiom,
    ( ~ aElement0(u)
    | equal(sdtasdt0(smndt0(sz10),u),smndt0(u)) ),
    file('RNG120+4.p',unknown),
    [] ).

cnf(111,axiom,
    ( ~ aElementOf0(u,xI)
    | equal(sdtpldt0(skf46(u),skf45(u)),u) ),
    file('RNG120+4.p',unknown),
    [] ).

cnf(116,axiom,
    ( ~ aElement0(u)
    | ~ aElementOf0(v,xI)
    | aElementOf0(sdtasdt0(u,v),xI) ),
    file('RNG120+4.p',unknown),
    [] ).

cnf(256,plain,
    ( ~ aSet0(slsdtgt0(xb))
    | aElement0(skf45(u)) ),
    inference(res,[status(thm),theory(equality)],[54,86]),
    [iquote('0:Res:54.0,86.1')] ).

cnf(261,plain,
    ( ~ aSet0(slsdtgt0(xa))
    | aElement0(skf46(u)) ),
    inference(res,[status(thm),theory(equality)],[53,86]),
    [iquote('0:Res:53.0,86.1')] ).

cnf(272,plain,
    aElement0(skf45(u)),
    inference(ssi,[status(thm)],[256,50,66,4]),
    [iquote('0:SSi:256.0,50.0,66.1,4.1')] ).

cnf(273,plain,
    aElement0(skf46(u)),
    inference(ssi,[status(thm)],[261,50,66,3]),
    [iquote('0:SSi:261.0,50.0,66.1,3.1')] ).

cnf(356,plain,
    ( ~ aElement0(skf45(u))
    | ~ aElement0(skf46(u))
    | ~ aElementOf0(u,xI)
    | aElement0(u) ),
    inference(spr,[status(thm),theory(equality)],[111,97]),
    [iquote('0:SpR:111.1,97.2')] ).

cnf(358,plain,
    ( ~ aElementOf0(u,xI)
    | aElement0(u) ),
    inference(ssi,[status(thm)],[356,273,272]),
    [iquote('0:SSi:356.1,356.0,273.0,272.0')] ).

cnf(384,plain,
    ( ~ aElement0(u)
    | ~ aElement0(smndt0(sz10))
    | ~ aElementOf0(u,xI)
    | aElementOf0(smndt0(u),xI) ),
    inference(spr,[status(thm),theory(equality)],[99,116]),
    [iquote('0:SpR:99.1,116.2')] ).

cnf(401,plain,
    ( ~ aElement0(u)
    | ~ aElementOf0(u,xI)
    | aElementOf0(smndt0(u),xI) ),
    inference(ssi,[status(thm)],[384,64,2]),
    [iquote('0:SSi:384.1,64.0,2.1')] ).

cnf(402,plain,
    ( ~ aElementOf0(u,xI)
    | aElementOf0(smndt0(u),xI) ),
    inference(mrr,[status(thm)],[401,358]),
    [iquote('0:MRR:401.0,358.1')] ).

cnf(416,plain,
    ~ aElementOf0(sdtasdt0(xq,xu),xI),
    inference(res,[status(thm),theory(equality)],[402,71]),
    [iquote('0:Res:402.1,71.0')] ).

cnf(423,plain,
    ( ~ aElement0(xq)
    | ~ aElementOf0(xu,xI) ),
    inference(res,[status(thm),theory(equality)],[116,416]),
    [iquote('0:Res:116.2,416.0')] ).

cnf(424,plain,
    ~ aElementOf0(xu,xI),
    inference(ssi,[status(thm)],[423,17]),
    [iquote('0:SSi:423.0,17.0')] ).

cnf(425,plain,
    $false,
    inference(mrr,[status(thm)],[424,29]),
    [iquote('0:MRR:424.0,29.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.12  % Problem  : RNG120+4 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.13  % Command  : run_spass %d %s
% 0.13/0.34  % Computer : n025.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Mon May 30 16:56:27 EDT 2022
% 0.19/0.34  % CPUTime  : 
% 0.46/0.71  
% 0.46/0.71  SPASS V 3.9 
% 0.46/0.71  SPASS beiseite: Proof found.
% 0.46/0.71  % SZS status Theorem
% 0.46/0.71  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.46/0.71  SPASS derived 195 clauses, backtracked 0 clauses, performed 0 splits and kept 254 clauses.
% 0.46/0.71  SPASS allocated 100275 KBytes.
% 0.46/0.71  SPASS spent	0:00:00.36 on the problem.
% 0.46/0.71  		0:00:00.04 for the input.
% 0.46/0.71  		0:00:00.25 for the FLOTTER CNF translation.
% 0.46/0.71  		0:00:00.00 for inferences.
% 0.46/0.71  		0:00:00.00 for the backtracking.
% 0.46/0.71  		0:00:00.03 for the reduction.
% 0.46/0.71  
% 0.46/0.71  
% 0.46/0.71  Here is a proof with depth 3, length 29 :
% 0.46/0.71  % SZS output start Refutation
% See solution above
% 0.46/0.71  Formulae used in the proof : mSortsC_01 m__2091 m__2666 m__2273 mDefIdeal m__2174 mSortsU mPrIdeal m__ mEOfElem mSortsB mMulMnOne
% 0.46/0.71  
%------------------------------------------------------------------------------