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

View Problem - Process Solution

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

% Computer : n003.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:52 EDT 2022

% Result   : Theorem 0.56s 0.75s
% Output   : Refutation 0.56s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    8
%            Number of leaves      :   13
% Syntax   : Number of clauses     :   28 (  13 unt;   0 nHn;  28 RR)
%            Number of literals    :   56 (   0 equ;  34 neg)
%            Maximal clause size   :    4 (   2 avg)
%            Maximal term depth    :    4 (   1 avg)
%            Number of predicates  :    6 (   5 usr;   1 prp; 0-2 aty)
%            Number of functors    :   17 (  17 usr;  12 con; 0-2 aty)
%            Number of variables   :    0 (   0 sgn)

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

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

cnf(12,axiom,
    isCountable0(xX),
    file('NUM592+1.p',unknown),
    [] ).

cnf(19,axiom,
    aSubsetOf0(xY,szNzAzT0),
    file('NUM592+1.p',unknown),
    [] ).

cnf(20,axiom,
    aElementOf0(xu,xT),
    file('NUM592+1.p',unknown),
    [] ).

cnf(21,axiom,
    aSubsetOf0(xX,xY),
    file('NUM592+1.p',unknown),
    [] ).

cnf(22,axiom,
    aSet0(skf22(u,v)),
    file('NUM592+1.p',unknown),
    [] ).

cnf(34,axiom,
    equal(sdtlpdtrp0(xC,xi),xd),
    file('NUM592+1.p',unknown),
    [] ).

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

cnf(69,axiom,
    equal(sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))),xY),
    file('NUM592+1.p',unknown),
    [] ).

cnf(94,axiom,
    ( ~ aSet0(u)
    | ~ aElementOf0(u,slbdtsldtrb0(xX,xk))
    | equal(sdtlpdtrp0(xd,u),xu) ),
    file('NUM592+1.p',unknown),
    [] ).

cnf(158,axiom,
    ( ~ isCountable0(u)
    | ~ aSubsetOf0(u,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
    | ~ aElementOf0(v,xT)
    | aElementOf0(skf22(v,u),slbdtsldtrb0(u,xk)) ),
    file('NUM592+1.p',unknown),
    [] ).

cnf(171,axiom,
    ( ~ isCountable0(u)
    | ~ aElementOf0(v,xT)
    | ~ aSubsetOf0(u,sdtmndt0(sdtlpdtrp0(xN,xi),szmzizndt0(sdtlpdtrp0(xN,xi))))
    | ~ equal(sdtlpdtrp0(sdtlpdtrp0(xC,xi),skf22(v,u)),v) ),
    file('NUM592+1.p',unknown),
    [] ).

cnf(197,plain,
    ( ~ isCountable0(u)
    | ~ aElementOf0(v,xT)
    | ~ aSubsetOf0(u,xY)
    | aElementOf0(skf22(v,u),slbdtsldtrb0(u,xk)) ),
    inference(rew,[status(thm),theory(equality)],[69,158]),
    [iquote('0:Rew:69.0,158.1')] ).

cnf(199,plain,
    ( ~ isCountable0(u)
    | ~ aSubsetOf0(u,xY)
    | ~ aElementOf0(v,xT)
    | ~ equal(sdtlpdtrp0(xd,skf22(v,u)),v) ),
    inference(rew,[status(thm),theory(equality)],[34,171,69]),
    [iquote('0:Rew:34.0,171.3,69.0,171.2')] ).

cnf(281,plain,
    ( ~ isCountable0(xX)
    | ~ aElementOf0(u,xT)
    | aElementOf0(skf22(u,xX),slbdtsldtrb0(xX,xk)) ),
    inference(res,[status(thm),theory(equality)],[21,197]),
    [iquote('0:Res:21.0,197.1')] ).

cnf(291,plain,
    ( ~ isCountable0(xX)
    | ~ aElementOf0(u,xT)
    | ~ equal(sdtlpdtrp0(xd,skf22(u,xX)),u) ),
    inference(res,[status(thm),theory(equality)],[21,199]),
    [iquote('0:Res:21.0,199.2')] ).

cnf(292,plain,
    ( ~ aElementOf0(u,xT)
    | aElementOf0(skf22(u,xX),slbdtsldtrb0(xX,xk)) ),
    inference(mrr,[status(thm)],[281,12]),
    [iquote('0:MRR:281.0,12.0')] ).

cnf(294,plain,
    ( ~ aElementOf0(u,xT)
    | ~ equal(sdtlpdtrp0(xd,skf22(u,xX)),u) ),
    inference(mrr,[status(thm)],[291,12]),
    [iquote('0:MRR:291.0,12.0')] ).

cnf(374,plain,
    ( ~ aSet0(xY)
    | aSet0(xX) ),
    inference(res,[status(thm),theory(equality)],[21,59]),
    [iquote('0:Res:21.0,59.1')] ).

cnf(375,plain,
    ( ~ aSet0(szNzAzT0)
    | aSet0(xY) ),
    inference(res,[status(thm),theory(equality)],[19,59]),
    [iquote('0:Res:19.0,59.1')] ).

cnf(382,plain,
    aSet0(xY),
    inference(ssi,[status(thm)],[375,3,2]),
    [iquote('0:SSi:375.0,3.0,2.0')] ).

cnf(383,plain,
    aSet0(xX),
    inference(mrr,[status(thm)],[374,382]),
    [iquote('0:MRR:374.0,382.0')] ).

cnf(683,plain,
    ( ~ aSet0(skf22(u,xX))
    | ~ aElementOf0(u,xT)
    | equal(sdtlpdtrp0(xd,skf22(u,xX)),xu) ),
    inference(res,[status(thm),theory(equality)],[292,94]),
    [iquote('0:Res:292.1,94.1')] ).

cnf(684,plain,
    ( ~ aElementOf0(u,xT)
    | equal(sdtlpdtrp0(xd,skf22(u,xX)),xu) ),
    inference(ssi,[status(thm)],[683,22,12,383]),
    [iquote('0:SSi:683.0,22.0,12.0,383.0')] ).

cnf(685,plain,
    ( ~ aElementOf0(u,xT)
    | ~ equal(xu,u) ),
    inference(rew,[status(thm),theory(equality)],[684,294]),
    [iquote('0:Rew:684.1,294.1')] ).

cnf(686,plain,
    ~ equal(xu,xu),
    inference(res,[status(thm),theory(equality)],[20,685]),
    [iquote('0:Res:20.0,685.0')] ).

cnf(689,plain,
    $false,
    inference(obv,[status(thm),theory(equality)],[686]),
    [iquote('0:Obv:686.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12  % Problem  : NUM592+1 : TPTP v8.1.0. Released v4.0.0.
% 0.03/0.13  % Command  : run_spass %d %s
% 0.12/0.34  % Computer : n003.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 : Wed Jul  6 05:29:41 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 0.56/0.75  
% 0.56/0.75  SPASS V 3.9 
% 0.56/0.75  SPASS beiseite: Proof found.
% 0.56/0.75  % SZS status Theorem
% 0.56/0.75  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.56/0.75  SPASS derived 325 clauses, backtracked 0 clauses, performed 0 splits and kept 339 clauses.
% 0.56/0.75  SPASS allocated 100922 KBytes.
% 0.56/0.75  SPASS spent	0:00:00.40 on the problem.
% 0.56/0.75  		0:00:00.04 for the input.
% 0.56/0.75  		0:00:00.28 for the FLOTTER CNF translation.
% 0.56/0.75  		0:00:00.01 for inferences.
% 0.56/0.75  		0:00:00.00 for the backtracking.
% 0.56/0.75  		0:00:00.04 for the reduction.
% 0.56/0.75  
% 0.56/0.75  
% 0.56/0.75  Here is a proof with depth 2, length 28 :
% 0.56/0.75  % SZS output start Refutation
% See solution above
% 0.56/0.75  Formulae used in the proof : mNATSet m__4545 m__4482 m__ m__3291 m__4448_02 mDefSub
% 0.56/0.75  
%------------------------------------------------------------------------------