TSTP Solution File: NUM504+3 by SPASS---3.9

View Problem - Process Solution

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

% Computer : n016.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 14:26:53 EDT 2022

% Result   : Theorem 0.11s 0.45s
% Output   : Refutation 0.11s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :   12
% Syntax   : Number of clauses     :   26 (  17 unt;   0 nHn;  26 RR)
%            Number of literals    :   46 (   0 equ;  25 neg)
%            Maximal clause size   :    5 (   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;   7 con; 0-2 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(3,axiom,
    aNaturalNumber0(xn),
    file('NUM504+3.p',unknown),
    [] ).

cnf(4,axiom,
    aNaturalNumber0(xm),
    file('NUM504+3.p',unknown),
    [] ).

cnf(18,axiom,
    aNaturalNumber0(skc16),
    file('NUM504+3.p',unknown),
    [] ).

cnf(54,axiom,
    equal(sdtasdt0(xp,xk),sdtasdt0(xn,xm)),
    file('NUM504+3.p',unknown),
    [] ).

cnf(57,axiom,
    sdtlseqdt0(sdtasdt0(xn,xm),sdtasdt0(xp,xm)),
    file('NUM504+3.p',unknown),
    [] ).

cnf(58,axiom,
    sdtlseqdt0(sdtasdt0(xp,xm),sdtasdt0(xp,xk)),
    file('NUM504+3.p',unknown),
    [] ).

cnf(66,axiom,
    ~ equal(sdtasdt0(xp,xk),sdtasdt0(xp,xm)),
    file('NUM504+3.p',unknown),
    [] ).

cnf(69,axiom,
    equal(sdtasdt0(xp,xm),sdtpldt0(sdtasdt0(xn,xm),skc16)),
    file('NUM504+3.p',unknown),
    [] ).

cnf(71,axiom,
    ( ~ aNaturalNumber0(u)
    | ~ aNaturalNumber0(v)
    | aNaturalNumber0(sdtpldt0(v,u)) ),
    file('NUM504+3.p',unknown),
    [] ).

cnf(72,axiom,
    ( ~ aNaturalNumber0(u)
    | ~ aNaturalNumber0(v)
    | aNaturalNumber0(sdtasdt0(v,u)) ),
    file('NUM504+3.p',unknown),
    [] ).

cnf(80,axiom,
    ( ~ aNaturalNumber0(u)
    | ~ aNaturalNumber0(v)
    | equal(sdtpldt0(v,u),sdtpldt0(u,v)) ),
    file('NUM504+3.p',unknown),
    [] ).

cnf(100,axiom,
    ( ~ aNaturalNumber0(u)
    | ~ aNaturalNumber0(v)
    | ~ sdtlseqdt0(v,u)
    | ~ sdtlseqdt0(u,v)
    | equal(v,u) ),
    file('NUM504+3.p',unknown),
    [] ).

cnf(137,plain,
    sdtlseqdt0(sdtasdt0(xp,xm),sdtasdt0(xn,xm)),
    inference(rew,[status(thm),theory(equality)],[54,58]),
    [iquote('0:Rew:54.0,58.0')] ).

cnf(138,plain,
    ~ equal(sdtasdt0(xp,xm),sdtasdt0(xn,xm)),
    inference(rew,[status(thm),theory(equality)],[54,66]),
    [iquote('0:Rew:54.0,66.0')] ).

cnf(140,plain,
    sdtlseqdt0(sdtasdt0(xn,xm),sdtpldt0(sdtasdt0(xn,xm),skc16)),
    inference(rew,[status(thm),theory(equality)],[69,57]),
    [iquote('0:Rew:69.0,57.0')] ).

cnf(141,plain,
    sdtlseqdt0(sdtpldt0(sdtasdt0(xn,xm),skc16),sdtasdt0(xn,xm)),
    inference(rew,[status(thm),theory(equality)],[69,137]),
    [iquote('0:Rew:69.0,137.0')] ).

cnf(142,plain,
    ~ equal(sdtpldt0(sdtasdt0(xn,xm),skc16),sdtasdt0(xn,xm)),
    inference(rew,[status(thm),theory(equality)],[69,138]),
    [iquote('0:Rew:69.0,138.0')] ).

cnf(359,plain,
    ( ~ aNaturalNumber0(skc16)
    | ~ aNaturalNumber0(sdtasdt0(xn,xm))
    | sdtlseqdt0(sdtpldt0(skc16,sdtasdt0(xn,xm)),sdtasdt0(xn,xm)) ),
    inference(spr,[status(thm),theory(equality)],[80,141]),
    [iquote('0:SpR:80.2,141.0')] ).

cnf(360,plain,
    ( ~ aNaturalNumber0(skc16)
    | ~ aNaturalNumber0(sdtasdt0(xn,xm))
    | sdtlseqdt0(sdtasdt0(xn,xm),sdtpldt0(skc16,sdtasdt0(xn,xm))) ),
    inference(spr,[status(thm),theory(equality)],[80,140]),
    [iquote('0:SpR:80.2,140.0')] ).

cnf(376,plain,
    ( ~ aNaturalNumber0(skc16)
    | ~ aNaturalNumber0(sdtasdt0(xn,xm))
    | ~ equal(sdtpldt0(skc16,sdtasdt0(xn,xm)),sdtasdt0(xn,xm)) ),
    inference(spl,[status(thm),theory(equality)],[80,142]),
    [iquote('0:SpL:80.2,142.0')] ).

cnf(392,plain,
    sdtlseqdt0(sdtpldt0(skc16,sdtasdt0(xn,xm)),sdtasdt0(xn,xm)),
    inference(ssi,[status(thm)],[359,72,3,4,18]),
    [iquote('0:SSi:359.1,359.0,72.0,3.0,4.0,18.2')] ).

cnf(393,plain,
    sdtlseqdt0(sdtasdt0(xn,xm),sdtpldt0(skc16,sdtasdt0(xn,xm))),
    inference(ssi,[status(thm)],[360,72,3,4,18]),
    [iquote('0:SSi:360.1,360.0,72.0,3.0,4.0,18.2')] ).

cnf(394,plain,
    ~ equal(sdtpldt0(skc16,sdtasdt0(xn,xm)),sdtasdt0(xn,xm)),
    inference(ssi,[status(thm)],[376,72,3,4,18]),
    [iquote('0:SSi:376.1,376.0,72.0,3.0,4.0,18.2')] ).

cnf(1243,plain,
    ( ~ aNaturalNumber0(sdtpldt0(skc16,sdtasdt0(xn,xm)))
    | ~ aNaturalNumber0(sdtasdt0(xn,xm))
    | ~ sdtlseqdt0(sdtpldt0(skc16,sdtasdt0(xn,xm)),sdtasdt0(xn,xm))
    | equal(sdtpldt0(skc16,sdtasdt0(xn,xm)),sdtasdt0(xn,xm)) ),
    inference(res,[status(thm),theory(equality)],[393,100]),
    [iquote('0:Res:393.0,100.2')] ).

cnf(1281,plain,
    ( ~ sdtlseqdt0(sdtpldt0(skc16,sdtasdt0(xn,xm)),sdtasdt0(xn,xm))
    | equal(sdtpldt0(skc16,sdtasdt0(xn,xm)),sdtasdt0(xn,xm)) ),
    inference(ssi,[status(thm)],[1243,72,3,4,71,18]),
    [iquote('0:SSi:1243.1,1243.0,72.0,3.0,4.2,71.0,18.2,72.0,3.0,4.2')] ).

cnf(1282,plain,
    $false,
    inference(mrr,[status(thm)],[1281,392,394]),
    [iquote('0:MRR:1281.0,1281.1,392.0,394.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.02/0.07  % Problem  : NUM504+3 : TPTP v8.1.0. Released v4.0.0.
% 0.02/0.08  % Command  : run_spass %d %s
% 0.07/0.27  % Computer : n016.cluster.edu
% 0.07/0.27  % Model    : x86_64 x86_64
% 0.07/0.27  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.07/0.27  % Memory   : 8042.1875MB
% 0.07/0.27  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.07/0.27  % CPULimit : 300
% 0.07/0.27  % WCLimit  : 600
% 0.07/0.27  % DateTime : Tue Jul  5 06:35:03 EDT 2022
% 0.07/0.27  % CPUTime  : 
% 0.11/0.45  
% 0.11/0.45  SPASS V 3.9 
% 0.11/0.45  SPASS beiseite: Proof found.
% 0.11/0.45  % SZS status Theorem
% 0.11/0.45  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.11/0.45  SPASS derived 846 clauses, backtracked 104 clauses, performed 8 splits and kept 554 clauses.
% 0.11/0.45  SPASS allocated 98573 KBytes.
% 0.11/0.45  SPASS spent	0:00:00.17 on the problem.
% 0.11/0.45  		0:00:00.03 for the input.
% 0.11/0.45  		0:00:00.03 for the FLOTTER CNF translation.
% 0.11/0.45  		0:00:00.01 for inferences.
% 0.11/0.45  		0:00:00.00 for the backtracking.
% 0.11/0.45  		0:00:00.08 for the reduction.
% 0.11/0.45  
% 0.11/0.45  
% 0.11/0.45  Here is a proof with depth 2, length 26 :
% 0.11/0.45  % SZS output start Refutation
% See solution above
% 0.11/0.45  Formulae used in the proof : m__1837 m__2414 m__2306 mSortsB mSortsB_02 mAddComm mLEAsym
% 0.11/0.45  
%------------------------------------------------------------------------------