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

View Problem - Process Solution

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

% Computer : n019.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 : Fri Jul 15 01:44:19 EDT 2022

% Result   : Theorem 0.65s 0.87s
% Output   : Refutation 0.70s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    7
%            Number of leaves      :   13
% Syntax   : Number of clauses     :   25 (  11 unt;   0 nHn;  25 RR)
%            Number of literals    :   69 (   0 equ;  48 neg)
%            Maximal clause size   :    8 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    8 (   7 usr;   1 prp; 0-3 aty)
%            Number of functors    :    9 (   9 usr;   8 con; 0-3 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(1,axiom,
    aRewritingSystem0(xR),
    file('COM017+4.p',unknown),
    [] ).

cnf(2,axiom,
    isLocallyConfluent0(xR),
    file('COM017+4.p',unknown),
    [] ).

cnf(3,axiom,
    isTerminating0(xR),
    file('COM017+4.p',unknown),
    [] ).

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

cnf(12,axiom,
    aElement0(xv),
    file('COM017+4.p',unknown),
    [] ).

cnf(29,axiom,
    aReductOfIn0(xu,xa,xR),
    file('COM017+4.p',unknown),
    [] ).

cnf(31,axiom,
    aReductOfIn0(xv,xa,xR),
    file('COM017+4.p',unknown),
    [] ).

cnf(35,axiom,
    aElement0(skf26(u,v,w)),
    file('COM017+4.p',unknown),
    [] ).

cnf(39,axiom,
    ( ~ sdtmndtasgtdt0(xu,xR,u)
    | skP2(u) ),
    file('COM017+4.p',unknown),
    [] ).

cnf(53,axiom,
    ( ~ skP2(u)
    | ~ aElement0(u)
    | ~ sdtmndtasgtdt0(xv,xR,u) ),
    file('COM017+4.p',unknown),
    [] ).

cnf(64,axiom,
    ( ~ aRewritingSystem0(u)
    | ~ aElement0(v)
    | ~ aReductOfIn0(w,v,u)
    | aElement0(w) ),
    file('COM017+4.p',unknown),
    [] ).

cnf(101,axiom,
    ( ~ isLocallyConfluent0(u)
    | ~ aElement0(v)
    | ~ aElement0(w)
    | ~ aElement0(x)
    | ~ aRewritingSystem0(u)
    | ~ aReductOfIn0(x,v,u)
    | ~ aReductOfIn0(w,v,u)
    | sdtmndtasgtdt0(x,u,skf26(x,u,w)) ),
    file('COM017+4.p',unknown),
    [] ).

cnf(102,axiom,
    ( ~ isLocallyConfluent0(u)
    | ~ aElement0(v)
    | ~ aElement0(w)
    | ~ aElement0(x)
    | ~ aRewritingSystem0(u)
    | ~ aReductOfIn0(x,v,u)
    | ~ aReductOfIn0(w,v,u)
    | sdtmndtasgtdt0(w,u,skf26(x,u,w)) ),
    file('COM017+4.p',unknown),
    [] ).

cnf(111,plain,
    ( ~ aRewritingSystem0(u)
    | ~ aElement0(v)
    | ~ isLocallyConfluent0(u)
    | ~ aReductOfIn0(w,v,u)
    | ~ aReductOfIn0(x,v,u)
    | sdtmndtasgtdt0(x,u,skf26(x,u,w)) ),
    inference(mrr,[status(thm)],[101,64]),
    [iquote('0:MRR:101.2,101.3,64.3,64.3')] ).

cnf(112,plain,
    ( ~ aRewritingSystem0(u)
    | ~ aElement0(v)
    | ~ isLocallyConfluent0(u)
    | ~ aReductOfIn0(w,v,u)
    | ~ aReductOfIn0(x,v,u)
    | sdtmndtasgtdt0(w,u,skf26(x,u,w)) ),
    inference(mrr,[status(thm)],[102,64]),
    [iquote('0:MRR:102.2,102.3,64.3,64.3')] ).

cnf(1557,plain,
    ( ~ aRewritingSystem0(xR)
    | ~ aElement0(xa)
    | ~ isLocallyConfluent0(xR)
    | ~ aReductOfIn0(u,xa,xR)
    | sdtmndtasgtdt0(u,xR,skf26(u,xR,xv)) ),
    inference(res,[status(thm),theory(equality)],[31,111]),
    [iquote('0:Res:31.0,111.3')] ).

cnf(1558,plain,
    ( ~ aRewritingSystem0(xR)
    | ~ aElement0(xa)
    | ~ isLocallyConfluent0(xR)
    | ~ aReductOfIn0(u,xa,xR)
    | sdtmndtasgtdt0(xv,xR,skf26(u,xR,xv)) ),
    inference(res,[status(thm),theory(equality)],[31,112]),
    [iquote('0:Res:31.0,112.3')] ).

cnf(1567,plain,
    ( ~ aReductOfIn0(u,xa,xR)
    | sdtmndtasgtdt0(xv,xR,skf26(u,xR,xv)) ),
    inference(ssi,[status(thm)],[1558,3,2,1,4]),
    [iquote('0:SSi:1558.2,1558.1,1558.0,3.0,2.0,1.0,4.0,3.0,2.0,1.0')] ).

cnf(1568,plain,
    ( ~ aReductOfIn0(u,xa,xR)
    | sdtmndtasgtdt0(u,xR,skf26(u,xR,xv)) ),
    inference(ssi,[status(thm)],[1557,3,2,1,4]),
    [iquote('0:SSi:1557.2,1557.1,1557.0,3.0,2.0,1.0,4.0,3.0,2.0,1.0')] ).

cnf(1963,plain,
    ( ~ skP2(skf26(u,xR,xv))
    | ~ aElement0(skf26(u,xR,xv))
    | ~ aReductOfIn0(u,xa,xR) ),
    inference(res,[status(thm),theory(equality)],[1567,53]),
    [iquote('0:Res:1567.1,53.2')] ).

cnf(1969,plain,
    ( ~ skP2(skf26(u,xR,xv))
    | ~ aReductOfIn0(u,xa,xR) ),
    inference(ssi,[status(thm)],[1963,35,3,2,1,12]),
    [iquote('0:SSi:1963.1,35.0,3.0,2.0,1.0,12.0')] ).

cnf(2427,plain,
    ( ~ aReductOfIn0(xu,xa,xR)
    | skP2(skf26(xu,xR,xv)) ),
    inference(res,[status(thm),theory(equality)],[1568,39]),
    [iquote('0:Res:1568.1,39.0')] ).

cnf(2435,plain,
    skP2(skf26(xu,xR,xv)),
    inference(mrr,[status(thm)],[2427,29]),
    [iquote('0:MRR:2427.0,29.0')] ).

cnf(2443,plain,
    ~ aReductOfIn0(xu,xa,xR),
    inference(sor,[status(thm)],[1969,2435]),
    [iquote('0:SoR:1969.0,2435.0')] ).

cnf(2444,plain,
    $false,
    inference(mrr,[status(thm)],[2443,29]),
    [iquote('0:MRR:2443.0,29.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : COM017+4 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.12  % Command  : run_spass %d %s
% 0.12/0.33  % Computer : n019.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 : Thu Jun 16 18:59:09 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.65/0.87  
% 0.65/0.87  SPASS V 3.9 
% 0.65/0.87  SPASS beiseite: Proof found.
% 0.65/0.87  % SZS status Theorem
% 0.65/0.87  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 0.65/0.87  SPASS derived 1774 clauses, backtracked 351 clauses, performed 19 splits and kept 1590 clauses.
% 0.65/0.87  SPASS allocated 99709 KBytes.
% 0.65/0.87  SPASS spent	0:00:00.51 on the problem.
% 0.65/0.87  		0:00:00.04 for the input.
% 0.65/0.87  		0:00:00.09 for the FLOTTER CNF translation.
% 0.65/0.87  		0:00:00.03 for inferences.
% 0.65/0.87  		0:00:00.01 for the backtracking.
% 0.65/0.87  		0:00:00.30 for the reduction.
% 0.65/0.87  
% 0.65/0.87  
% 0.65/0.87  Here is a proof with depth 3, length 25 :
% 0.65/0.87  % SZS output start Refutation
% See solution above
% 0.70/0.87  Formulae used in the proof : m__656 m__656_01 m__779 m__731 m__755 mWCRDef m__ mReduct
% 0.70/0.87  
%------------------------------------------------------------------------------