↑ Up

SPASS---3.9.THM-Ref.s

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

% Computer : n020.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:59 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(6,axiom,
    aSet0(xS),
    file('NUM603+3.p',unknown),
    [] ).

cnf(16,axiom,
    aElementOf0(sz00,szNzAzT0),
    file('NUM603+3.p',unknown),
    [] ).

cnf(22,axiom,
    aElementOf0(xi,szNzAzT0),
    file('NUM603+3.p',unknown),
    [] ).

cnf(44,axiom,
    equal(sdtlpdtrp0(xN,sz00),xS),
    file('NUM603+3.p',unknown),
    [] ).

cnf(51,axiom,
    ~ aSubsetOf0(sdtlpdtrp0(xN,xi),xS),
    file('NUM603+3.p',unknown),
    [] ).

cnf(65,axiom,
    ( ~ aElementOf0(u,szNzAzT0)
    | sdtlseqdt0(sz00,u) ),
    file('NUM603+3.p',unknown),
    [] ).

cnf(66,axiom,
    ( ~ aElementOf0(u,szNzAzT0)
    | sdtlseqdt0(u,u) ),
    file('NUM603+3.p',unknown),
    [] ).

cnf(84,axiom,
    ( ~ aSet0(u)
    | ~ aSubsetOf0(v,u)
    | aSet0(v) ),
    file('NUM603+3.p',unknown),
    [] ).

cnf(229,axiom,
    ( ~ sdtlseqdt0(u,v)
    | ~ aElementOf0(u,szNzAzT0)
    | ~ aElementOf0(v,szNzAzT0)
    | aSubsetOf0(sdtlpdtrp0(xN,v),sdtlpdtrp0(xN,u)) ),
    file('NUM603+3.p',unknown),
    [] ).

cnf(259,axiom,
    ( ~ aSet0(u)
    | ~ aSet0(v)
    | ~ aSet0(w)
    | ~ aSubsetOf0(u,v)
    | ~ aSubsetOf0(v,w)
    | aSubsetOf0(u,w) ),
    file('NUM603+3.p',unknown),
    [] ).

cnf(418,plain,
    ( ~ aSet0(u)
    | ~ aSubsetOf0(v,u)
    | ~ aSubsetOf0(w,v)
    | aSubsetOf0(w,u) ),
    inference(mrr,[status(thm)],[259,84]),
    [iquote('0:MRR:259.0,259.1,84.2,84.2')] ).

cnf(518,plain,
    ( ~ aSet0(xS)
    | ~ aSubsetOf0(sdtlpdtrp0(xN,xi),u)
    | ~ aSubsetOf0(u,xS) ),
    inference(res,[status(thm),theory(equality)],[418,51]),
    [iquote('0:Res:418.3,51.0')] ).

cnf(530,plain,
    ( ~ aSubsetOf0(u,xS)
    | ~ aSubsetOf0(sdtlpdtrp0(xN,xi),u) ),
    inference(mrr,[status(thm)],[518,6]),
    [iquote('0:MRR:518.0,6.0')] ).

cnf(5674,plain,
    ( ~ sdtlseqdt0(sz00,u)
    | ~ aElementOf0(sz00,szNzAzT0)
    | ~ aElementOf0(u,szNzAzT0)
    | aSubsetOf0(sdtlpdtrp0(xN,u),xS) ),
    inference(spr,[status(thm),theory(equality)],[44,229]),
    [iquote('0:SpR:44.0,229.3')] ).

cnf(5676,plain,
    ( ~ sdtlseqdt0(u,xi)
    | ~ aElementOf0(u,szNzAzT0)
    | ~ aElementOf0(xi,szNzAzT0)
    | ~ aSubsetOf0(sdtlpdtrp0(xN,u),xS) ),
    inference(res,[status(thm),theory(equality)],[229,530]),
    [iquote('0:Res:229.3,530.1')] ).

cnf(5681,plain,
    ( ~ aElementOf0(u,szNzAzT0)
    | aSubsetOf0(sdtlpdtrp0(xN,u),xS) ),
    inference(mrr,[status(thm)],[5674,65,16]),
    [iquote('0:MRR:5674.0,5674.1,65.1,16.0')] ).

cnf(5683,plain,
    ( ~ sdtlseqdt0(u,xi)
    | ~ aElementOf0(u,szNzAzT0)
    | ~ aSubsetOf0(sdtlpdtrp0(xN,u),xS) ),
    inference(mrr,[status(thm)],[5676,22]),
    [iquote('0:MRR:5676.2,22.0')] ).

cnf(5684,plain,
    ( ~ sdtlseqdt0(u,xi)
    | ~ aElementOf0(u,szNzAzT0) ),
    inference(mrr,[status(thm)],[5683,5681]),
    [iquote('0:MRR:5683.2,5681.1')] ).

cnf(5689,plain,
    ( ~ aElementOf0(xi,szNzAzT0)
    | ~ aElementOf0(xi,szNzAzT0) ),
    inference(res,[status(thm),theory(equality)],[66,5684]),
    [iquote('0:Res:66.1,5684.0')] ).

cnf(5694,plain,
    ~ aElementOf0(xi,szNzAzT0),
    inference(obv,[status(thm),theory(equality)],[5689]),
    [iquote('0:Obv:5689.0')] ).

cnf(5695,plain,
    $false,
    inference(mrr,[status(thm)],[5694,22]),
    [iquote('0:MRR:5694.0,22.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : NUM603+3 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.13  % Command  : run_spass %d %s
% 0.12/0.34  % Computer : n020.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 : Thu Jul  7 00:08:14 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 2.00/2.20  
% 2.00/2.20  SPASS V 3.9 
% 2.00/2.20  SPASS beiseite: Proof found.
% 2.00/2.20  % SZS status Theorem
% 2.00/2.20  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 2.00/2.20  SPASS derived 3933 clauses, backtracked 648 clauses, performed 18 splits and kept 3015 clauses.
% 2.00/2.20  SPASS allocated 104656 KBytes.
% 2.00/2.20  SPASS spent	0:00:01.81 on the problem.
% 2.00/2.20  		0:00:00.04 for the input.
% 2.00/2.20  		0:00:00.68 for the FLOTTER CNF translation.
% 2.00/2.20  		0:00:00.06 for inferences.
% 2.00/2.20  		0:00:00.03 for the backtracking.
% 2.00/2.20  		0:00:00.92 for the reduction.
% 2.00/2.20  
% 2.00/2.20  
% 2.00/2.20  Here is a proof with depth 3, length 21 :
% 2.00/2.20  % SZS output start Refutation
% See solution above
% 2.00/2.20  Formulae used in the proof : m__3435 mZeroNum m__5034 m__3623 m__ mZeroLess mLessRefl mDefSub m__3754 mSubTrans
% 2.00/2.20  
%------------------------------------------------------------------------------