↑ Up

SPASS---3.9.THM-Ref.s

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

% Computer : n013.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:07 EDT 2022

% Result   : Theorem 24.84s 25.01s
% Output   : Refutation 24.84s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    6
%            Number of leaves      :    7
% Syntax   : Number of clauses     :   13 (   7 unt;   0 nHn;  13 RR)
%            Number of literals    :   31 (   0 equ;  23 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    :   10 (  10 usr;   8 con; 0-2 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(13,axiom,
    aSet0(xO),
    file('NUM614+1.p',unknown),
    [] ).

cnf(14,axiom,
    isCountable0(xO),
    file('NUM614+1.p',unknown),
    [] ).

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

cnf(27,axiom,
    aSubsetOf0(xP,xO),
    file('NUM614+1.p',unknown),
    [] ).

cnf(45,axiom,
    equal(sbrdtbr0(xP),xk),
    file('NUM614+1.p',unknown),
    [] ).

cnf(51,axiom,
    ~ aElementOf0(xP,slbdtsldtrb0(xO,xk)),
    file('NUM614+1.p',unknown),
    [] ).

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

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

cnf(41743,plain,
    ( ~ aSet0(xO)
    | ~ aSubsetOf0(xP,xO)
    | ~ aElementOf0(xk,szNzAzT0)
    | ~ equal(sbrdtbr0(xP),xk) ),
    inference(res,[status(thm),theory(equality)],[5058,51]),
    [iquote('0:Res:5058.4,51.0')] ).

cnf(41744,plain,
    ( ~ aSet0(xO)
    | ~ aSubsetOf0(xP,xO)
    | ~ aElementOf0(xk,szNzAzT0)
    | ~ equal(xk,xk) ),
    inference(rew,[status(thm),theory(equality)],[45,41743]),
    [iquote('0:Rew:45.0,41743.3')] ).

cnf(41745,plain,
    ( ~ aSet0(xO)
    | ~ aSubsetOf0(xP,xO)
    | ~ aElementOf0(xk,szNzAzT0) ),
    inference(obv,[status(thm),theory(equality)],[41744]),
    [iquote('0:Obv:41744.3')] ).

cnf(41746,plain,
    ( ~ aSubsetOf0(xP,xO)
    | ~ aElementOf0(xk,szNzAzT0) ),
    inference(ssi,[status(thm)],[41745,13,14]),
    [iquote('0:SSi:41745.0,13.0,14.0')] ).

cnf(41747,plain,
    $false,
    inference(mrr,[status(thm)],[41746,27,19]),
    [iquote('0:MRR:41746.0,41746.1,27.0,19.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12  % Problem  : NUM614+1 : TPTP v8.1.0. Released v4.0.0.
% 0.07/0.12  % Command  : run_spass %d %s
% 0.12/0.34  % Computer : n013.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 12:02:59 EDT 2022
% 0.12/0.34  % CPUTime  : 
% 24.84/25.01  
% 24.84/25.01  SPASS V 3.9 
% 24.84/25.01  SPASS beiseite: Proof found.
% 24.84/25.01  % SZS status Theorem
% 24.84/25.01  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 24.84/25.01  SPASS derived 32659 clauses, backtracked 7157 clauses, performed 67 splits and kept 17452 clauses.
% 24.84/25.01  SPASS allocated 127944 KBytes.
% 24.84/25.01  SPASS spent	0:0:23.18 on the problem.
% 24.84/25.01  		0:00:00.04 for the input.
% 24.84/25.01  		0:00:00.30 for the FLOTTER CNF translation.
% 24.84/25.01  		0:00:00.56 for inferences.
% 24.84/25.01  		0:00:00.82 for the backtracking.
% 24.84/25.01  		0:0:21.08 for the reduction.
% 24.84/25.01  
% 24.84/25.01  
% 24.84/25.01  Here is a proof with depth 2, length 13 :
% 24.84/25.01  % SZS output start Refutation
% See solution above
% 24.84/25.01  Formulae used in the proof : m__4908 m__3533 m__5208 m__5217 m__ mDefSel
% 24.84/25.01  
%------------------------------------------------------------------------------