↑ Up

SPASS---3.9.THM-Ref.s

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

% Computer : n004.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 : Wed Jul 20 21:43:09 EDT 2022

% Result   : Theorem 29.06s 29.31s
% Output   : Refutation 29.06s
% Verified : 
% SZS Type : Refutation
%            Derivation depth      :    9
%            Number of leaves      :   12
% Syntax   : Number of clauses     :   29 (  20 unt;   1 nHn;  29 RR)
%            Number of literals    :   54 (   0 equ;  34 neg)
%            Maximal clause size   :    7 (   1 avg)
%            Maximal term depth    :    3 (   2 avg)
%            Number of predicates  :    4 (   3 usr;   1 prp; 0-2 aty)
%            Number of functors    :   17 (  17 usr;  13 con; 0-2 aty)
%            Number of variables   :    0 (   0 sgn)

% Comments : 
%------------------------------------------------------------------------------
cnf(2,axiom,
    setIn(skc8,alive),
    file('SWV452+1.p',unknown),
    [] ).

cnf(4,axiom,
    elem(m_Down(skc14),skc11),
    file('SWV452+1.p',unknown),
    [] ).

cnf(21,axiom,
    equal(host(skc15),host(skc12)),
    file('SWV452+1.p',unknown),
    [] ).

cnf(22,axiom,
    equal(host(skc14),host(skc13)),
    file('SWV452+1.p',unknown),
    [] ).

cnf(23,axiom,
    equal(host(skc12),host(skc8)),
    file('SWV452+1.p',unknown),
    [] ).

cnf(24,axiom,
    equal(host(skc10),host(skc8)),
    file('SWV452+1.p',unknown),
    [] ).

cnf(31,axiom,
    ( equal(skc10,skc13)
    | setIn(skc13,alive) ),
    file('SWV452+1.p',unknown),
    [] ).

cnf(33,axiom,
    elem(m_Down(skc15),queue(host(skc13))),
    file('SWV452+1.p',unknown),
    [] ).

cnf(34,axiom,
    ~ equal(host(skc13),host(skc8)),
    file('SWV452+1.p',unknown),
    [] ).

cnf(68,axiom,
    equal(cons(m_Down(skc9),skc11),queue(host(skc8))),
    file('SWV452+1.p',unknown),
    [] ).

cnf(84,axiom,
    ( ~ elem(u,v)
    | elem(u,cons(w,v)) ),
    file('SWV452+1.p',unknown),
    [] ).

cnf(125,axiom,
    ( ~ setIn(u,alive)
    | ~ setIn(v,alive)
    | ~ equal(host(w),host(u))
    | ~ equal(host(x),host(v))
    | ~ elem(m_Down(x),queue(host(u)))
    | ~ elem(m_Down(w),queue(host(v)))
    | equal(host(u),host(v)) ),
    file('SWV452+1.p',unknown),
    [] ).

cnf(126,plain,
    equal(host(skc15),host(skc8)),
    inference(rew,[status(thm),theory(equality)],[23,21]),
    [iquote('0:Rew:23.0,21.0')] ).

cnf(138,plain,
    elem(m_Down(skc14),cons(u,skc11)),
    inference(res,[status(thm),theory(equality)],[4,84]),
    [iquote('0:Res:4.0,84.0')] ).

cnf(301,plain,
    ( ~ setIn(skc13,alive)
    | ~ equal(host(u),host(skc13))
    | ~ elem(m_Down(v),queue(host(skc13)))
    | ~ elem(m_Down(u),queue(host(skc8)))
    | ~ equal(host(v),host(skc8))
    | ~ setIn(skc8,alive) ),
    inference(res,[status(thm),theory(equality)],[125,34]),
    [iquote('0:Res:125.6,34.0')] ).

cnf(458,plain,
    ( ~ setIn(skc13,alive)
    | ~ equal(host(u),host(skc8))
    | ~ equal(host(v),host(skc13))
    | ~ elem(m_Down(v),queue(host(skc8)))
    | ~ elem(m_Down(u),queue(host(skc13))) ),
    inference(mrr,[status(thm)],[301,2]),
    [iquote('0:MRR:301.5,2.0')] ).

cnf(459,plain,
    equal(skc10,skc13),
    inference(spt,[spt(split,[position(s1)])],[31]),
    [iquote('1:Spt:31.0')] ).

cnf(468,plain,
    equal(host(skc13),host(skc8)),
    inference(rew,[status(thm),theory(equality)],[459,24]),
    [iquote('1:Rew:459.0,24.0')] ).

cnf(475,plain,
    $false,
    inference(mrr,[status(thm)],[468,34]),
    [iquote('1:MRR:468.0,34.0')] ).

cnf(487,plain,
    ~ equal(skc10,skc13),
    inference(spt,[spt(split,[position(sa)])],[475,459]),
    [iquote('1:Spt:475.0,31.0,459.0')] ).

cnf(488,plain,
    setIn(skc13,alive),
    inference(spt,[spt(split,[position(s2)])],[31]),
    [iquote('1:Spt:475.0,31.1')] ).

cnf(492,plain,
    ( ~ equal(host(u),host(skc8))
    | ~ equal(host(v),host(skc13))
    | ~ elem(m_Down(v),queue(host(skc8)))
    | ~ elem(m_Down(u),queue(host(skc13))) ),
    inference(mrr,[status(thm)],[458,488]),
    [iquote('1:MRR:458.0,488.0')] ).

cnf(537,plain,
    elem(m_Down(skc14),queue(host(skc8))),
    inference(spr,[status(thm),theory(equality)],[68,138]),
    [iquote('0:SpR:68.0,138.0')] ).

cnf(24051,plain,
    ( ~ equal(host(u),host(skc8))
    | ~ equal(host(skc14),host(skc13))
    | ~ elem(m_Down(u),queue(host(skc13))) ),
    inference(res,[status(thm),theory(equality)],[537,492]),
    [iquote('1:Res:537.0,492.2')] ).

cnf(24058,plain,
    ( ~ equal(host(u),host(skc8))
    | ~ equal(host(skc13),host(skc13))
    | ~ elem(m_Down(u),queue(host(skc13))) ),
    inference(rew,[status(thm),theory(equality)],[22,24051]),
    [iquote('1:Rew:22.0,24051.1')] ).

cnf(24059,plain,
    ( ~ equal(host(u),host(skc8))
    | ~ elem(m_Down(u),queue(host(skc13))) ),
    inference(obv,[status(thm),theory(equality)],[24058]),
    [iquote('1:Obv:24058.1')] ).

cnf(26817,plain,
    ~ equal(host(skc15),host(skc8)),
    inference(res,[status(thm),theory(equality)],[33,24059]),
    [iquote('1:Res:33.0,24059.1')] ).

cnf(26821,plain,
    ~ equal(host(skc8),host(skc8)),
    inference(rew,[status(thm),theory(equality)],[126,26817]),
    [iquote('1:Rew:126.0,26817.0')] ).

cnf(26822,plain,
    $false,
    inference(obv,[status(thm),theory(equality)],[26821]),
    [iquote('1:Obv:26821.0')] ).

%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.13  % Problem  : SWV452+1 : TPTP v8.1.0. Released v4.0.0.
% 0.04/0.14  % Command  : run_spass %d %s
% 0.14/0.36  % Computer : n004.cluster.edu
% 0.14/0.36  % Model    : x86_64 x86_64
% 0.14/0.36  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.14/0.36  % Memory   : 8042.1875MB
% 0.14/0.36  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.14/0.36  % CPULimit : 300
% 0.14/0.36  % WCLimit  : 600
% 0.14/0.36  % DateTime : Wed Jun 15 14:35:09 EDT 2022
% 0.14/0.36  % CPUTime  : 
% 29.06/29.31  
% 29.06/29.31  SPASS V 3.9 
% 29.06/29.31  SPASS beiseite: Proof found.
% 29.06/29.31  % SZS status Theorem
% 29.06/29.31  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 29.06/29.31  SPASS derived 24663 clauses, backtracked 162 clauses, performed 17 splits and kept 11163 clauses.
% 29.06/29.31  SPASS allocated 114379 KBytes.
% 29.06/29.31  SPASS spent	0:0:28.78 on the problem.
% 29.06/29.31  		0:00:00.04 for the input.
% 29.06/29.31  		0:00:00.05 for the FLOTTER CNF translation.
% 29.06/29.31  		0:00:00.31 for inferences.
% 29.06/29.31  		0:00:00.58 for the backtracking.
% 29.06/29.31  		0:0:27.64 for the reduction.
% 29.06/29.31  
% 29.06/29.31  
% 29.06/29.31  Here is a proof with depth 4, length 29 :
% 29.06/29.31  % SZS output start Refutation
% See solution above
% 29.06/29.31  Formulae used in the proof : conj axiom_46
% 29.06/29.31  
%------------------------------------------------------------------------------