TSTP Solution File: RNG099+2 by SPASS---3.9

View Problem - Process Solution

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

% Computer : n020.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:28 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(3,axiom,
    aSet0(xI),
    file('RNG099+2.p',unknown),
    [] ).

cnf(4,axiom,
    aIdeal0(xI),
    file('RNG099+2.p',unknown),
    [] ).

cnf(5,axiom,
    aSet0(xJ),
    file('RNG099+2.p',unknown),
    [] ).

cnf(6,axiom,
    aIdeal0(xJ),
    file('RNG099+2.p',unknown),
    [] ).

cnf(7,axiom,
    aElement0(xx),
    file('RNG099+2.p',unknown),
    [] ).

cnf(8,axiom,
    aElement0(xy),
    file('RNG099+2.p',unknown),
    [] ).

cnf(10,axiom,
    aElementOf0(xa,xI),
    file('RNG099+2.p',unknown),
    [] ).

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

cnf(18,axiom,
    aElementOf0(sdtpldt0(xw,smndt0(xx)),xI),
    file('RNG099+2.p',unknown),
    [] ).

cnf(19,axiom,
    aElementOf0(sdtpldt0(xw,smndt0(xy)),xJ),
    file('RNG099+2.p',unknown),
    [] ).

cnf(29,axiom,
    ( ~ aElementOf0(sdtpldt0(u,smndt0(xx)),xI)
    | skP2(u) ),
    file('RNG099+2.p',unknown),
    [] ).

cnf(32,axiom,
    ( ~ aSet0(u)
    | ~ aElementOf0(v,u)
    | aElement0(v) ),
    file('RNG099+2.p',unknown),
    [] ).

cnf(35,axiom,
    equal(sdtpldt0(sdtasdt0(xy,xa),sdtasdt0(xx,xb)),xw),
    file('RNG099+2.p',unknown),
    [] ).

cnf(36,axiom,
    ( ~ aElement0(u)
    | ~ aElement0(v)
    | aElement0(sdtpldt0(v,u)) ),
    file('RNG099+2.p',unknown),
    [] ).

cnf(37,axiom,
    ( ~ aElement0(u)
    | ~ aElement0(v)
    | aElement0(sdtasdt0(v,u)) ),
    file('RNG099+2.p',unknown),
    [] ).

cnf(48,axiom,
    ( ~ skP2(u)
    | ~ aElement0(u)
    | ~ aElementOf0(sdtpldt0(u,smndt0(xy)),xJ) ),
    file('RNG099+2.p',unknown),
    [] ).

cnf(79,plain,
    skP2(xw),
    inference(res,[status(thm),theory(equality)],[18,29]),
    [iquote('0:Res:18.0,29.0')] ).

cnf(90,plain,
    ( ~ aElement0(xw)
    | ~ skP2(xw) ),
    inference(res,[status(thm),theory(equality)],[19,48]),
    [iquote('0:Res:19.0,48.2')] ).

cnf(91,plain,
    ~ aElement0(xw),
    inference(mrr,[status(thm)],[90,79]),
    [iquote('0:MRR:90.1,79.0')] ).

cnf(128,plain,
    ( ~ aSet0(xJ)
    | aElement0(xb) ),
    inference(res,[status(thm),theory(equality)],[11,32]),
    [iquote('0:Res:11.0,32.1')] ).

cnf(131,plain,
    ( ~ aSet0(xI)
    | aElement0(xa) ),
    inference(res,[status(thm),theory(equality)],[10,32]),
    [iquote('0:Res:10.0,32.1')] ).

cnf(137,plain,
    aElement0(xb),
    inference(ssi,[status(thm)],[128,6,5]),
    [iquote('0:SSi:128.0,6.0,5.0')] ).

cnf(138,plain,
    aElement0(xa),
    inference(ssi,[status(thm)],[131,4,3]),
    [iquote('0:SSi:131.0,4.0,3.0')] ).

cnf(174,plain,
    ( ~ aElement0(sdtasdt0(xx,xb))
    | ~ aElement0(sdtasdt0(xy,xa))
    | aElement0(xw) ),
    inference(spr,[status(thm),theory(equality)],[35,36]),
    [iquote('0:SpR:35.0,36.2')] ).

cnf(178,plain,
    aElement0(xw),
    inference(ssi,[status(thm)],[174,37,8,138,7,137]),
    [iquote('0:SSi:174.1,174.0,37.0,8.0,138.2,37.0,7.0,137.2')] ).

cnf(179,plain,
    $false,
    inference(mrr,[status(thm)],[178,91]),
    [iquote('0:MRR:178.0,91.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.12  % Problem  : RNG099+2 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.13  % Command  : run_spass %d %s
% 0.13/0.34  % Computer : n020.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 18:21:39 EDT 2022
% 0.13/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 82 clauses, backtracked 0 clauses, performed 0 splits and kept 116 clauses.
% 0.21/0.51  SPASS allocated 98859 KBytes.
% 0.21/0.51  SPASS spent	0:00:00.16 on the problem.
% 0.21/0.51  		0:00:00.03 for the input.
% 0.21/0.51  		0:00:00.09 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.01 for the reduction.
% 0.21/0.51  
% 0.21/0.51  
% 0.21/0.51  Here is a proof with depth 1, length 26 :
% 0.21/0.51  % SZS output start Refutation
% See solution above
% 0.21/0.51  Formulae used in the proof : m__1205 m__1217 m__1294 m__1332 m__1409 m__ mEOfElem m__1319 mSortsB mSortsB_02
% 0.21/0.51  
%------------------------------------------------------------------------------