↑ Up

SPASS---3.9.THM-Ref.s

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

% Computer : n017.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:38 EDT 2022

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

% Comments : 
%------------------------------------------------------------------------------
cnf(7,axiom,
    isCountable0(xS),
    file('NUM571+3.p',unknown),
    [] ).

cnf(12,axiom,
    aSubsetOf0(xS,szNzAzT0),
    file('NUM571+3.p',unknown),
    [] ).

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

cnf(44,axiom,
    ( isCountable0(sdtlpdtrp0(xN,xi))
    | equal(sz00,xi) ),
    file('NUM571+3.p',unknown),
    [] ).

cnf(51,axiom,
    ( equal(sz00,xi)
    | aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0) ),
    file('NUM571+3.p',unknown),
    [] ).

cnf(67,axiom,
    ( ~ isCountable0(sdtlpdtrp0(xN,xi))
    | ~ aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0) ),
    file('NUM571+3.p',unknown),
    [] ).

cnf(235,plain,
    equal(sz00,xi),
    inference(spt,[spt(split,[position(s1)])],[44]),
    [iquote('1:Spt:44.1')] ).

cnf(241,plain,
    equal(sdtlpdtrp0(xN,xi),xS),
    inference(rew,[status(thm),theory(equality)],[235,27]),
    [iquote('1:Rew:235.0,27.0')] ).

cnf(251,plain,
    ( ~ isCountable0(xS)
    | ~ aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0) ),
    inference(rew,[status(thm),theory(equality)],[241,67]),
    [iquote('1:Rew:241.0,67.0')] ).

cnf(252,plain,
    ( ~ isCountable0(xS)
    | ~ aSubsetOf0(xS,szNzAzT0) ),
    inference(rew,[status(thm),theory(equality)],[241,251]),
    [iquote('1:Rew:241.0,251.1')] ).

cnf(253,plain,
    $false,
    inference(mrr,[status(thm)],[252,7,12]),
    [iquote('1:MRR:252.0,252.1,7.0,12.0')] ).

cnf(258,plain,
    ~ equal(sz00,xi),
    inference(spt,[spt(split,[position(sa)])],[253,235]),
    [iquote('1:Spt:253.0,44.1,235.0')] ).

cnf(259,plain,
    isCountable0(sdtlpdtrp0(xN,xi)),
    inference(spt,[spt(split,[position(s2)])],[44]),
    [iquote('1:Spt:253.0,44.0')] ).

cnf(262,plain,
    aSubsetOf0(sdtlpdtrp0(xN,xi),szNzAzT0),
    inference(mrr,[status(thm)],[51,258]),
    [iquote('1:MRR:51.0,258.0')] ).

cnf(263,plain,
    $false,
    inference(mrr,[status(thm)],[67,259,262]),
    [iquote('1:MRR:67.0,67.1,259.0,262.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.10/0.11  % Problem  : NUM571+3 : TPTP v8.1.0. Released v4.0.0.
% 0.10/0.12  % Command  : run_spass %d %s
% 0.12/0.33  % Computer : n017.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 : Wed Jul  6 05:38:29 EDT 2022
% 0.12/0.33  % CPUTime  : 
% 0.76/0.95  
% 0.76/0.95  SPASS V 3.9 
% 0.76/0.95  SPASS beiseite: Proof found.
% 0.76/0.95  % SZS status Theorem
% 0.76/0.95  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 0.76/0.95  SPASS derived 18 clauses, backtracked 21 clauses, performed 2 splits and kept 259 clauses.
% 0.76/0.95  SPASS allocated 102582 KBytes.
% 0.76/0.95  SPASS spent	0:00:00.61 on the problem.
% 0.76/0.95  		0:00:00.04 for the input.
% 0.76/0.95  		0:00:00.51 for the FLOTTER CNF translation.
% 0.76/0.95  		0:00:00.00 for inferences.
% 0.76/0.95  		0:00:00.00 for the backtracking.
% 0.76/0.95  		0:00:00.03 for the reduction.
% 0.76/0.95  
% 0.76/0.95  
% 0.76/0.95  Here is a proof with depth 1, length 15 :
% 0.76/0.95  % SZS output start Refutation
% See solution above
% 0.76/0.95  Formulae used in the proof : m__3435 m__3623 m__3702_02 m__3702 m__
% 0.76/0.95  
%------------------------------------------------------------------------------