↑ Up

SPASS---3.9.THM-Ref.s

View TPTP
Problem
Process solution in
SystemOnTSTP
Download .tgz
%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : NUM548+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n026.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:22 EDT 2022

% Result   : Theorem 1.52s 1.70s
% Output   : Refutation 1.52s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :    8
% Syntax   : Number of clauses     :   22 (  10 unt;   0 nHn;  22 RR)
%            Number of literals    :   48 (   0 equ;  30 neg)
%            Maximal clause size   :    5 (   2 avg)
%            Maximal term depth    :    2 (   1 avg)
%            Number of predicates  :    6 (   5 usr;   1 prp; 0-2 aty)
%            Number of functors    :   10 (  10 usr;   8 con; 0-2 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(4,axiom,
    aSet0(xS),
    file('NUM548+1.p',unknown),
    [] ).

cnf(6,axiom,
    ~ isFinite0(xQ),
    file('NUM548+1.p',unknown),
    [] ).

cnf(8,axiom,
    aElementOf0(xk,szNzAzT0),
    file('NUM548+1.p',unknown),
    [] ).

cnf(14,axiom,
    aElementOf0(xQ,slbdtsldtrb0(xS,xk)),
    file('NUM548+1.p',unknown),
    [] ).

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

cnf(40,axiom,
    ( ~ aSet0(u)
    | ~ aElementOf0(sbrdtbr0(u),szNzAzT0)
    | isFinite0(u) ),
    file('NUM548+1.p',unknown),
    [] ).

cnf(84,axiom,
    ( ~ aSet0(u)
    | ~ aElementOf0(v,w)
    | ~ aElementOf0(x,szNzAzT0)
    | ~ equal(w,slbdtsldtrb0(u,x))
    | aSubsetOf0(v,u) ),
    file('NUM548+1.p',unknown),
    [] ).

cnf(93,axiom,
    ( ~ aSet0(u)
    | ~ aElementOf0(v,w)
    | ~ aElementOf0(x,szNzAzT0)
    | ~ equal(w,slbdtsldtrb0(u,x))
    | equal(sbrdtbr0(v),x) ),
    file('NUM548+1.p',unknown),
    [] ).

cnf(125,plain,
    ( ~ aSet0(xQ)
    | ~ aElementOf0(sbrdtbr0(xQ),szNzAzT0) ),
    inference(res,[status(thm),theory(equality)],[40,6]),
    [iquote('0:Res:40.2,6.0')] ).

cnf(1766,plain,
    ( ~ aSet0(u)
    | ~ aElementOf0(v,slbdtsldtrb0(u,w))
    | ~ aElementOf0(w,szNzAzT0)
    | aSubsetOf0(v,u) ),
    inference(eqr,[status(thm),theory(equality)],[84]),
    [iquote('0:EqR:84.3')] ).

cnf(2181,plain,
    ( ~ aSet0(u)
    | ~ aElementOf0(v,slbdtsldtrb0(u,w))
    | ~ aElementOf0(w,szNzAzT0)
    | equal(sbrdtbr0(v),w) ),
    inference(eqr,[status(thm),theory(equality)],[93]),
    [iquote('0:EqR:93.3')] ).

cnf(3953,plain,
    ( ~ aSet0(xS)
    | ~ aElementOf0(xk,szNzAzT0)
    | aSubsetOf0(xQ,xS) ),
    inference(res,[status(thm),theory(equality)],[14,1766]),
    [iquote('0:Res:14.0,1766.1')] ).

cnf(3955,plain,
    ( ~ aElementOf0(xk,szNzAzT0)
    | aSubsetOf0(xQ,xS) ),
    inference(ssi,[status(thm)],[3953,4]),
    [iquote('0:SSi:3953.0,4.0')] ).

cnf(3956,plain,
    aSubsetOf0(xQ,xS),
    inference(mrr,[status(thm)],[3955,8]),
    [iquote('0:MRR:3955.0,8.0')] ).

cnf(3980,plain,
    ( ~ aSet0(xS)
    | aSet0(xQ) ),
    inference(res,[status(thm),theory(equality)],[3956,33]),
    [iquote('0:Res:3956.0,33.1')] ).

cnf(3983,plain,
    aSet0(xQ),
    inference(ssi,[status(thm)],[3980,4]),
    [iquote('0:SSi:3980.0,4.0')] ).

cnf(3985,plain,
    ~ aElementOf0(sbrdtbr0(xQ),szNzAzT0),
    inference(mrr,[status(thm)],[125,3983]),
    [iquote('0:MRR:125.0,3983.0')] ).

cnf(5418,plain,
    ( ~ aSet0(xS)
    | ~ aElementOf0(xk,szNzAzT0)
    | equal(sbrdtbr0(xQ),xk) ),
    inference(res,[status(thm),theory(equality)],[14,2181]),
    [iquote('0:Res:14.0,2181.1')] ).

cnf(5420,plain,
    ( ~ aElementOf0(xk,szNzAzT0)
    | equal(sbrdtbr0(xQ),xk) ),
    inference(ssi,[status(thm)],[5418,4]),
    [iquote('0:SSi:5418.0,4.0')] ).

cnf(5421,plain,
    equal(sbrdtbr0(xQ),xk),
    inference(mrr,[status(thm)],[5420,8]),
    [iquote('0:MRR:5420.0,8.0')] ).

cnf(5422,plain,
    ~ aElementOf0(xk,szNzAzT0),
    inference(rew,[status(thm),theory(equality)],[5421,3985]),
    [iquote('0:Rew:5421.0,3985.0')] ).

cnf(5423,plain,
    $false,
    inference(mrr,[status(thm)],[5422,8]),
    [iquote('0:MRR:5422.0,8.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : NUM548+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13  % Command  : run_spass %d %s
% 0.13/0.34  % Computer : n026.cluster.edu
% 0.13/0.34  % Model    : x86_64 x86_64
% 0.13/0.34  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34  % Memory   : 8042.1875MB
% 0.13/0.34  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34  % CPULimit : 300
% 0.13/0.34  % WCLimit  : 600
% 0.13/0.34  % DateTime : Tue Jul  5 23:18:53 EDT 2022
% 0.13/0.34  % CPUTime  : 
% 1.52/1.70  
% 1.52/1.70  SPASS V 3.9 
% 1.52/1.70  SPASS beiseite: Proof found.
% 1.52/1.70  % SZS status Theorem
% 1.52/1.70  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 1.52/1.70  SPASS derived 4045 clauses, backtracked 249 clauses, performed 9 splits and kept 1736 clauses.
% 1.52/1.70  SPASS allocated 102377 KBytes.
% 1.52/1.70  SPASS spent	0:00:01.30 on the problem.
% 1.52/1.70  		0:00:00.04 for the input.
% 1.52/1.70  		0:00:00.11 for the FLOTTER CNF translation.
% 1.52/1.70  		0:00:00.08 for inferences.
% 1.52/1.70  		0:00:00.01 for the backtracking.
% 1.52/1.70  		0:00:01.03 for the reduction.
% 1.52/1.70  
% 1.52/1.70  
% 1.52/1.70  Here is a proof with depth 3, length 22 :
% 1.52/1.70  % SZS output start Refutation
% See solution above
% 1.52/1.70  Formulae used in the proof : m__2202_02 m__ m__2202 m__2270 mDefSub mCardNum mDefSel
% 1.52/1.70  
%------------------------------------------------------------------------------