↑ Up

SPASS---3.9.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : NUM627+1 : 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:28:17 EDT 2022

% Result   : Theorem 0.83s 1.04s
% Output   : Refutation 0.83s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   15 (   8 unt;   1 nHn;  15 RR)
%            Number of literals    :   30 (   0 equ;  22 neg)
%            Maximal clause size   :    4 (   2 avg)
%            Maximal term depth    :    3 (   1 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :    8 (   8 usr;   6 con; 0-2 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(28,axiom,
    aElementOf0(xn,szNzAzT0),
    file('NUM627+1.p',unknown),
    [] ).

cnf(32,axiom,
    aElementOf0(xm,szNzAzT0),
    file('NUM627+1.p',unknown),
    [] ).

cnf(80,axiom,
    ( ~ aElementOf0(u,szNzAzT0)
    | aElementOf0(szszuzczcdt0(u),szNzAzT0) ),
    file('NUM627+1.p',unknown),
    [] ).

cnf(86,axiom,
    ~ aSubsetOf0(sdtlpdtrp0(xN,xn),sdtlpdtrp0(xN,xm)),
    file('NUM627+1.p',unknown),
    [] ).

cnf(96,axiom,
    ~ aSubsetOf0(sdtlpdtrp0(xN,xm),sdtlpdtrp0(xN,szszuzczcdt0(xn))),
    file('NUM627+1.p',unknown),
    [] ).

cnf(128,axiom,
    ( ~ aElementOf0(u,szNzAzT0)
    | ~ aElementOf0(v,szNzAzT0)
    | sdtlseqdt0(v,u)
    | sdtlseqdt0(szszuzczcdt0(u),v) ),
    file('NUM627+1.p',unknown),
    [] ).

cnf(156,axiom,
    ( ~ sdtlseqdt0(u,v)
    | ~ aElementOf0(u,szNzAzT0)
    | ~ aElementOf0(v,szNzAzT0)
    | aSubsetOf0(sdtlpdtrp0(xN,v),sdtlpdtrp0(xN,u)) ),
    file('NUM627+1.p',unknown),
    [] ).

cnf(2367,plain,
    ( ~ sdtlseqdt0(xm,xn)
    | ~ aElementOf0(xm,szNzAzT0)
    | ~ aElementOf0(xn,szNzAzT0) ),
    inference(res,[status(thm),theory(equality)],[156,86]),
    [iquote('0:Res:156.3,86.0')] ).

cnf(2368,plain,
    ( ~ sdtlseqdt0(szszuzczcdt0(xn),xm)
    | ~ aElementOf0(szszuzczcdt0(xn),szNzAzT0)
    | ~ aElementOf0(xm,szNzAzT0) ),
    inference(res,[status(thm),theory(equality)],[156,96]),
    [iquote('0:Res:156.3,96.0')] ).

cnf(2369,plain,
    ~ sdtlseqdt0(xm,xn),
    inference(mrr,[status(thm)],[2367,32,28]),
    [iquote('0:MRR:2367.1,2367.2,32.0,28.0')] ).

cnf(2370,plain,
    ( ~ sdtlseqdt0(szszuzczcdt0(xn),xm)
    | ~ aElementOf0(szszuzczcdt0(xn),szNzAzT0) ),
    inference(mrr,[status(thm)],[2368,32]),
    [iquote('0:MRR:2368.2,32.0')] ).

cnf(2562,plain,
    ( ~ aElementOf0(xn,szNzAzT0)
    | ~ aElementOf0(xm,szNzAzT0)
    | ~ aElementOf0(szszuzczcdt0(xn),szNzAzT0)
    | sdtlseqdt0(xm,xn) ),
    inference(res,[status(thm),theory(equality)],[128,2370]),
    [iquote('0:Res:128.3,2370.0')] ).

cnf(2563,plain,
    ~ aElementOf0(szszuzczcdt0(xn),szNzAzT0),
    inference(mrr,[status(thm)],[2562,28,32,2369]),
    [iquote('0:MRR:2562.0,2562.1,2562.3,28.0,32.0,2369.0')] ).

cnf(2564,plain,
    ~ aElementOf0(xn,szNzAzT0),
    inference(res,[status(thm),theory(equality)],[80,2563]),
    [iquote('0:Res:80.1,2563.0')] ).

cnf(2565,plain,
    $false,
    inference(mrr,[status(thm)],[2564,28]),
    [iquote('0:MRR:2564.0,28.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem  : NUM627+1 : TPTP v8.1.0. Released v4.0.0.
% 0.11/0.12  % Command  : run_spass %d %s
% 0.11/0.33  % Computer : n016.cluster.edu
% 0.11/0.33  % Model    : x86_64 x86_64
% 0.11/0.33  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.11/0.33  % Memory   : 8042.1875MB
% 0.11/0.33  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.11/0.33  % CPULimit : 300
% 0.11/0.33  % WCLimit  : 600
% 0.11/0.33  % DateTime : Tue Jul  5 05:50:18 EDT 2022
% 0.11/0.33  % CPUTime  : 
% 0.83/1.04  
% 0.83/1.04  SPASS V 3.9 
% 0.83/1.04  SPASS beiseite: Proof found.
% 0.83/1.04  % SZS status Theorem
% 0.83/1.04  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.83/1.04  SPASS derived 1740 clauses, backtracked 238 clauses, performed 5 splits and kept 1172 clauses.
% 0.83/1.04  SPASS allocated 101132 KBytes.
% 0.83/1.04  SPASS spent	0:00:00.68 on the problem.
% 0.83/1.04  		0:00:00.04 for the input.
% 0.83/1.04  		0:00:00.26 for the FLOTTER CNF translation.
% 0.83/1.04  		0:00:00.03 for inferences.
% 0.83/1.04  		0:00:00.00 for the backtracking.
% 0.83/1.04  		0:00:00.30 for the reduction.
% 0.83/1.04  
% 0.83/1.04  
% 0.83/1.04  Here is a proof with depth 3, length 15 :
% 0.83/1.04  % SZS output start Refutation
% See solution above
% 0.83/1.04  Formulae used in the proof : m__5309 m__5389 mSuccNum m__5461 m__5442 mLessTotal m__3754
% 0.83/1.04  
%------------------------------------------------------------------------------