TSTP Solution File: NUM561+1 by SPASS---3.9

View Problem - Process Solution

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

% Computer : n029.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:27:31 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(4,axiom,
    aFunction0(xF),
    file('NUM561+1.p',unknown),
    [] ).

cnf(9,axiom,
    aElementOf0(xx,szDzozmdt0(xF)),
    file('NUM561+1.p',unknown),
    [] ).

cnf(13,axiom,
    ( ~ aSet0(u)
    | aSubsetOf0(u,u) ),
    file('NUM561+1.p',unknown),
    [] ).

cnf(15,axiom,
    ( ~ aFunction0(u)
    | aSet0(szDzozmdt0(u)) ),
    file('NUM561+1.p',unknown),
    [] ).

cnf(26,axiom,
    ~ aElementOf0(sdtlpdtrp0(xF,xx),sdtlcdtrc0(xF,szDzozmdt0(xF))),
    file('NUM561+1.p',unknown),
    [] ).

cnf(112,axiom,
    ( ~ aFunction0(u)
    | ~ aElementOf0(v,w)
    | ~ aSubsetOf0(w,szDzozmdt0(u))
    | ~ equal(x,sdtlcdtrc0(u,w))
    | ~ equal(sdtlpdtrp0(u,v),y)
    | aElementOf0(y,x) ),
    file('NUM561+1.p',unknown),
    [] ).

cnf(147,plain,
    ( ~ aFunction0(u)
    | ~ aElementOf0(v,w)
    | ~ aSubsetOf0(w,szDzozmdt0(u))
    | ~ equal(sdtlpdtrp0(u,v),sdtlpdtrp0(xF,xx))
    | ~ equal(sdtlcdtrc0(xF,szDzozmdt0(xF)),sdtlcdtrc0(u,w)) ),
    inference(res,[status(thm),theory(equality)],[112,26]),
    [iquote('0:Res:112.5,26.0')] ).

cnf(75428,plain,
    ( ~ aFunction0(xF)
    | ~ aElementOf0(u,szDzozmdt0(xF))
    | ~ aSubsetOf0(szDzozmdt0(xF),szDzozmdt0(xF))
    | ~ equal(sdtlpdtrp0(xF,u),sdtlpdtrp0(xF,xx)) ),
    inference(eqr,[status(thm),theory(equality)],[147]),
    [iquote('0:EqR:147.4')] ).

cnf(75429,plain,
    ( ~ aElementOf0(u,szDzozmdt0(xF))
    | ~ aSubsetOf0(szDzozmdt0(xF),szDzozmdt0(xF))
    | ~ equal(sdtlpdtrp0(xF,u),sdtlpdtrp0(xF,xx)) ),
    inference(ssi,[status(thm)],[75428,4]),
    [iquote('0:SSi:75428.0,4.0')] ).

cnf(76670,plain,
    ( ~ aElementOf0(xx,szDzozmdt0(xF))
    | ~ aSubsetOf0(szDzozmdt0(xF),szDzozmdt0(xF)) ),
    inference(eqr,[status(thm),theory(equality)],[75429]),
    [iquote('0:EqR:75429.2')] ).

cnf(76676,plain,
    ~ aSubsetOf0(szDzozmdt0(xF),szDzozmdt0(xF)),
    inference(mrr,[status(thm)],[76670,9]),
    [iquote('0:MRR:76670.0,9.0')] ).

cnf(76677,plain,
    ~ aSet0(szDzozmdt0(xF)),
    inference(res,[status(thm),theory(equality)],[13,76676]),
    [iquote('0:Res:13.1,76676.0')] ).

cnf(76683,plain,
    $false,
    inference(ssi,[status(thm)],[76677,15,4]),
    [iquote('0:SSi:76677.0,15.0,4.1')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : NUM561+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.13  % Command  : run_spass %d %s
% 0.12/0.34  % Computer : n029.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 : Tue Jul  5 18:56:42 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 99.90/100.06  
% 99.90/100.06  SPASS V 3.9 
% 99.90/100.06  SPASS beiseite: Proof found.
% 99.90/100.06  % SZS status Theorem
% 99.90/100.06  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 99.90/100.06  SPASS derived 53763 clauses, backtracked 3661 clauses, performed 20 splits and kept 15822 clauses.
% 99.90/100.06  SPASS allocated 161298 KBytes.
% 99.90/100.06  SPASS spent	0:1:27.57 on the problem.
% 99.90/100.06  		0:00:00.03 for the input.
% 99.90/100.06  		0:00:00.21 for the FLOTTER CNF translation.
% 99.90/100.06  		0:00:01.21 for inferences.
% 99.90/100.06  		0:00:04.47 for the backtracking.
% 99.90/100.06  		0:1:21.01 for the reduction.
% 99.90/100.06  
% 99.90/100.06  
% 99.90/100.06  Here is a proof with depth 4, length 13 :
% 99.90/100.06  % SZS output start Refutation
% See solution above
% 99.90/100.06  Formulae used in the proof : m__2911 m__2911_02 mSubRefl mDomSet m__ mDefSImg
% 99.90/100.06  
%------------------------------------------------------------------------------