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

View Problem - Process Solution

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

% Computer : n006.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:09 EDT 2022

% Result   : Theorem 0.55s 0.76s
% Output   : Refutation 0.55s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    9
% Syntax   : Number of clauses     :   17 (   9 unt;   0 nHn;  17 RR)
%            Number of literals    :   36 (   0 equ;  23 neg)
%            Maximal clause size   :    6 (   2 avg)
%            Maximal term depth    :    1 (   1 avg)
%            Number of predicates  :    5 (   4 usr;   1 prp; 0-2 aty)
%            Number of functors    :    7 (   7 usr;   7 con; 0-0 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(2,axiom,
    aSet0(szNzAzT0),
    file('NUM617+1.p',unknown),
    [] ).

cnf(3,axiom,
    isCountable0(szNzAzT0),
    file('NUM617+1.p',unknown),
    [] ).

cnf(23,axiom,
    aSubsetOf0(xQ,szNzAzT0),
    file('NUM617+1.p',unknown),
    [] ).

cnf(26,axiom,
    aSubsetOf0(xP,xQ),
    file('NUM617+1.p',unknown),
    [] ).

cnf(29,axiom,
    aElementOf0(xx,xP),
    file('NUM617+1.p',unknown),
    [] ).

cnf(30,axiom,
    ~ aElementOf0(xx,szNzAzT0),
    file('NUM617+1.p',unknown),
    [] ).

cnf(83,axiom,
    ( ~ aSet0(u)
    | ~ aSubsetOf0(v,u)
    | aSet0(v) ),
    file('NUM617+1.p',unknown),
    [] ).

cnf(111,axiom,
    ( ~ aSet0(u)
    | ~ aElementOf0(v,w)
    | ~ aSubsetOf0(w,u)
    | aElementOf0(v,u) ),
    file('NUM617+1.p',unknown),
    [] ).

cnf(164,axiom,
    ( ~ aSet0(u)
    | ~ aSet0(v)
    | ~ aSet0(w)
    | ~ aSubsetOf0(u,v)
    | ~ aSubsetOf0(v,w)
    | aSubsetOf0(u,w) ),
    file('NUM617+1.p',unknown),
    [] ).

cnf(223,plain,
    ( ~ aSet0(u)
    | ~ aSubsetOf0(v,u)
    | ~ aSubsetOf0(w,v)
    | aSubsetOf0(w,u) ),
    inference(mrr,[status(thm)],[164,83]),
    [iquote('0:MRR:164.0,164.1,83.2,83.2')] ).

cnf(243,plain,
    ( ~ aSet0(szNzAzT0)
    | ~ aSubsetOf0(u,szNzAzT0)
    | ~ aElementOf0(xx,u) ),
    inference(res,[status(thm),theory(equality)],[111,30]),
    [iquote('0:Res:111.3,30.0')] ).

cnf(250,plain,
    ( ~ aSubsetOf0(u,szNzAzT0)
    | ~ aElementOf0(xx,u) ),
    inference(mrr,[status(thm)],[243,2]),
    [iquote('0:MRR:243.0,2.0')] ).

cnf(1152,plain,
    ( ~ aSet0(szNzAzT0)
    | ~ aSubsetOf0(u,xQ)
    | aSubsetOf0(u,szNzAzT0) ),
    inference(res,[status(thm),theory(equality)],[23,223]),
    [iquote('0:Res:23.0,223.1')] ).

cnf(1168,plain,
    ( ~ aSubsetOf0(u,xQ)
    | aSubsetOf0(u,szNzAzT0) ),
    inference(ssi,[status(thm)],[1152,3,2]),
    [iquote('0:SSi:1152.0,3.0,2.0')] ).

cnf(1187,plain,
    aSubsetOf0(xP,szNzAzT0),
    inference(res,[status(thm),theory(equality)],[26,1168]),
    [iquote('0:Res:26.0,1168.0')] ).

cnf(1189,plain,
    ~ aElementOf0(xx,xP),
    inference(res,[status(thm),theory(equality)],[1187,250]),
    [iquote('0:Res:1187.0,250.0')] ).

cnf(1194,plain,
    $false,
    inference(mrr,[status(thm)],[1189,29]),
    [iquote('0:MRR:1189.0,29.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.11  % Problem  : NUM617+1 : TPTP v8.1.0. Released v4.0.0.
% 0.00/0.12  % Command  : run_spass %d %s
% 0.12/0.33  % Computer : n006.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 : Tue Jul  5 08:33:37 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.55/0.76  
% 0.55/0.76  SPASS V 3.9 
% 0.55/0.76  SPASS beiseite: Proof found.
% 0.55/0.76  % SZS status Theorem
% 0.55/0.76  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.55/0.76  SPASS derived 730 clauses, backtracked 75 clauses, performed 1 splits and kept 599 clauses.
% 0.55/0.76  SPASS allocated 101001 KBytes.
% 0.55/0.76  SPASS spent	0:00:00.41 on the problem.
% 0.55/0.76  		0:00:00.04 for the input.
% 0.55/0.76  		0:00:00.24 for the FLOTTER CNF translation.
% 0.55/0.76  		0:00:00.01 for inferences.
% 0.55/0.76  		0:00:00.00 for the backtracking.
% 0.55/0.76  		0:00:00.08 for the reduction.
% 0.55/0.76  
% 0.55/0.76  
% 0.55/0.76  Here is a proof with depth 3, length 17 :
% 0.55/0.76  % SZS output start Refutation
% See solution above
% 0.55/0.76  Formulae used in the proof : mNATSet m__5106 m__5195 m__5348 m__ mDefSub mSubTrans
% 0.55/0.76  
%------------------------------------------------------------------------------