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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : RNG108+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:30 EDT 2022

% Result   : Theorem 0.46s 0.68s
% Output   : Refutation 0.46s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   10
% Syntax   : Number of clauses     :   32 (  13 unt;   0 nHn;  32 RR)
%            Number of literals    :   63 (   0 equ;  47 neg)
%            Maximal clause size   :    5 (   1 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    6 (   5 usr;   4 prp; 0-2 aty)
%            Number of functors    :    6 (   6 usr;   5 con; 0-2 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    aElement0(sz00),
    file('RNG108+4.p',unknown),
    [] ).

cnf(2,axiom,
    aElement0(sz10),
    file('RNG108+4.p',unknown),
    [] ).

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

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

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

cnf(41,axiom,
    ( ~ aElement0(u)
    | equal(sdtasdt0(u,sz00),sz00) ),
    file('RNG108+4.p',unknown),
    [] ).

cnf(58,axiom,
    ( ~ aElement0(u)
    | ~ equal(sdtasdt0(xa,u),sz00)
    | skC0 ),
    file('RNG108+4.p',unknown),
    [] ).

cnf(59,axiom,
    ( ~ aElement0(u)
    | ~ equal(sdtasdt0(xa,u),xa)
    | skC1 ),
    file('RNG108+4.p',unknown),
    [] ).

cnf(60,axiom,
    ( ~ aElement0(u)
    | ~ equal(sdtasdt0(xb,u),sz00)
    | skC2 ),
    file('RNG108+4.p',unknown),
    [] ).

cnf(93,axiom,
    ( ~ aElement0(u)
    | ~ skC2
    | ~ skC1
    | ~ skC0
    | ~ equal(sdtasdt0(xb,u),xb) ),
    file('RNG108+4.p',unknown),
    [] ).

cnf(188,plain,
    ( ~ skC2
    | ~ skC1
    | ~ skC0
    | ~ equal(sdtasdt0(xb,sz10),xb) ),
    inference(res,[status(thm),theory(equality)],[2,93]),
    [iquote('0:Res:2.0,93.0')] ).

cnf(200,plain,
    ( ~ aElement0(u)
    | ~ equal(sdtasdt0(xb,u),sz00) ),
    inference(spt,[spt(split,[position(s1)])],[60]),
    [iquote('1:Spt:60.0,60.1')] ).

cnf(221,plain,
    ( ~ aElement0(xb)
    | ~ aElement0(sz00)
    | ~ equal(sz00,sz00) ),
    inference(spl,[status(thm),theory(equality)],[41,200]),
    [iquote('1:SpL:41.1,200.1')] ).

cnf(228,plain,
    ( ~ aElement0(xb)
    | ~ aElement0(sz00) ),
    inference(obv,[status(thm),theory(equality)],[221]),
    [iquote('1:Obv:221.2')] ).

cnf(229,plain,
    $false,
    inference(ssi,[status(thm)],[228,1,4]),
    [iquote('1:SSi:228.1,228.0,1.0,4.0')] ).

cnf(234,plain,
    skC2,
    inference(spt,[spt(split,[position(s2)])],[60]),
    [iquote('1:Spt:229.0,60.2')] ).

cnf(237,plain,
    ( ~ skC1
    | ~ skC0
    | ~ equal(sdtasdt0(xb,sz10),xb) ),
    inference(mrr,[status(thm)],[188,234]),
    [iquote('1:MRR:188.0,234.0')] ).

cnf(244,plain,
    ( ~ aElement0(u)
    | ~ equal(sdtasdt0(xa,u),xa) ),
    inference(spt,[spt(split,[position(s2s1)])],[59]),
    [iquote('2:Spt:59.0,59.1')] ).

cnf(279,plain,
    ( ~ aElement0(xa)
    | ~ aElement0(sz10)
    | ~ equal(xa,xa) ),
    inference(spl,[status(thm),theory(equality)],[39,244]),
    [iquote('2:SpL:39.1,244.1')] ).

cnf(283,plain,
    ( ~ aElement0(xa)
    | ~ aElement0(sz10) ),
    inference(obv,[status(thm),theory(equality)],[279]),
    [iquote('2:Obv:279.2')] ).

cnf(284,plain,
    $false,
    inference(ssi,[status(thm)],[283,2,3]),
    [iquote('2:SSi:283.1,283.0,2.0,3.0')] ).

cnf(285,plain,
    skC1,
    inference(spt,[spt(split,[position(s2s2)])],[59]),
    [iquote('2:Spt:284.0,59.2')] ).

cnf(292,plain,
    ( ~ skC0
    | ~ equal(sdtasdt0(xb,sz10),xb) ),
    inference(mrr,[status(thm)],[237,285]),
    [iquote('2:MRR:237.0,285.0')] ).

cnf(295,plain,
    ( ~ aElement0(u)
    | ~ equal(sdtasdt0(xa,u),sz00) ),
    inference(spt,[spt(split,[position(s2s2s1)])],[58]),
    [iquote('3:Spt:58.0,58.1')] ).

cnf(296,plain,
    ( ~ aElement0(xa)
    | ~ aElement0(sz00)
    | ~ equal(sz00,sz00) ),
    inference(spl,[status(thm),theory(equality)],[41,295]),
    [iquote('3:SpL:41.1,295.1')] ).

cnf(298,plain,
    ( ~ aElement0(xa)
    | ~ aElement0(sz00) ),
    inference(obv,[status(thm),theory(equality)],[296]),
    [iquote('3:Obv:296.2')] ).

cnf(299,plain,
    $false,
    inference(ssi,[status(thm)],[298,1,3]),
    [iquote('3:SSi:298.1,298.0,1.0,3.0')] ).

cnf(301,plain,
    skC0,
    inference(spt,[spt(split,[position(s2s2s2)])],[58]),
    [iquote('3:Spt:299.0,58.2')] ).

cnf(308,plain,
    ~ equal(sdtasdt0(xb,sz10),xb),
    inference(mrr,[status(thm)],[292,301]),
    [iquote('3:MRR:292.0,301.0')] ).

cnf(313,plain,
    ( ~ aElement0(xb)
    | ~ equal(xb,xb) ),
    inference(spl,[status(thm),theory(equality)],[39,308]),
    [iquote('3:SpL:39.1,308.0')] ).

cnf(314,plain,
    ~ aElement0(xb),
    inference(obv,[status(thm),theory(equality)],[313]),
    [iquote('3:Obv:313.1')] ).

cnf(315,plain,
    $false,
    inference(ssi,[status(thm)],[314,4]),
    [iquote('3:SSi:314.0,4.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.08/0.12  % Problem  : RNG108+4 : TPTP v8.1.0. Released v4.0.0.
% 0.08/0.13  % Command  : run_spass %d %s
% 0.12/0.34  % Computer : n025.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 07:52:57 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.46/0.68  
% 0.46/0.68  SPASS V 3.9 
% 0.46/0.68  SPASS beiseite: Proof found.
% 0.46/0.68  % SZS status Theorem
% 0.46/0.68  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.46/0.68  SPASS derived 101 clauses, backtracked 68 clauses, performed 11 splits and kept 270 clauses.
% 0.46/0.68  SPASS allocated 99704 KBytes.
% 0.46/0.68  SPASS spent	0:00:00.33 on the problem.
% 0.46/0.68  		0:00:00.04 for the input.
% 0.46/0.68  		0:00:00.23 for the FLOTTER CNF translation.
% 0.46/0.68  		0:00:00.00 for inferences.
% 0.46/0.68  		0:00:00.00 for the backtracking.
% 0.46/0.68  		0:00:00.02 for the reduction.
% 0.46/0.68  
% 0.46/0.68  
% 0.46/0.68  Here is a proof with depth 2, length 32 :
% 0.46/0.68  % SZS output start Refutation
% See solution above
% 0.46/0.68  Formulae used in the proof : mSortsC mSortsC_01 m__2091 mMulUnit mMulZero m__
% 0.46/0.68  
%------------------------------------------------------------------------------