TSTP Solution File: SWV464+1 by SPASS---3.9

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : SWV464+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 : Wed Jul 20 21:43:11 EDT 2022

% Result   : Theorem 58.67s 58.87s
% Output   : Refutation 58.67s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.12/0.13  % Problem  : SWV464+1 : TPTP v8.1.0. Released v4.0.0.
% 0.12/0.14  % Command  : run_spass %d %s
% 0.15/0.35  % Computer : n026.cluster.edu
% 0.15/0.35  % Model    : x86_64 x86_64
% 0.15/0.35  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.35  % Memory   : 8042.1875MB
% 0.15/0.35  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.15/0.35  % CPULimit : 300
% 0.15/0.35  % WCLimit  : 600
% 0.15/0.35  % DateTime : Wed Jun 15 10:30:22 EDT 2022
% 0.15/0.36  % CPUTime  : 
% 58.67/58.87  
% 58.67/58.87  SPASS V 3.9 
% 58.67/58.87  SPASS beiseite: Proof found.
% 58.67/58.87  % SZS status Theorem
% 58.67/58.87  Problem: /export/starexec/sandbox/benchmark/theBenchmark.p 
% 58.67/58.87  SPASS derived 33326 clauses, backtracked 2 clauses, performed 6 splits and kept 14520 clauses.
% 58.67/58.87  SPASS allocated 120303 KBytes.
% 58.67/58.87  SPASS spent	0:0:58.24 on the problem.
% 58.67/58.87  		0:00:00.04 for the input.
% 58.67/58.87  		0:00:00.05 for the FLOTTER CNF translation.
% 58.67/58.87  		0:00:00.41 for inferences.
% 58.67/58.87  		0:00:00.54 for the backtracking.
% 58.67/58.87  		0:0:56.97 for the reduction.
% 58.67/58.87  
% 58.67/58.87  
% 58.67/58.87  Here is a proof with depth 3, length 42 :
% 58.67/58.87  % SZS output start Refutation
% 58.67/58.87  2[0:Inp] ||  -> setIn(skc13,alive)*.
% 58.67/58.87  4[0:Inp] ||  -> setIn(skc10,alive)*.
% 58.67/58.87  5[0:Inp] ||  -> leq(u,u)*.
% 58.67/58.87  7[0:Inp] ||  -> leq(host(u),nbr_proc)*l.
% 58.67/58.87  27[0:Inp] ||  -> equal(index(status__dfg,host(skc10)),elec_2)**.
% 58.67/58.87  29[0:Inp] ||  -> equal(index(status__dfg,host(skc13)),norm)**.
% 58.67/58.87  31[0:Inp] || equal(m_Down(u),m_Halt(v))* -> .
% 58.67/58.87  48[0:Inp] ||  -> equal(index(pendack,host(skc10)),host(skc12))**.
% 58.67/58.87  51[0:Inp] ||  -> leq(nbr_proc,s(index(pendack,host(skc10))))*r.
% 58.67/58.87  52[0:Inp] ||  -> equal(index(ldr,host(skc13)),host(skc13))**.
% 58.67/58.87  53[0:Inp] || equal(m_Ack(u,v),m_Halt(w))* -> .
% 58.67/58.87  65[0:Inp] ||  -> equal(s(index(pendack,host(skc10))),host(skc11))**.
% 58.67/58.87  69[0:Inp] ||  -> elem(m_Down(skc11),snoc(queue(host(skc10)),m_Halt(skc7)))*.
% 58.67/58.87  90[0:Inp] ||  -> elem(m_Ack(skc10,skc12),snoc(queue(host(skc10)),m_Halt(skc7)))*.
% 58.67/58.87  98[0:Inp] || leq(u,v)*+ leq(v,u)* -> equal(v,u).
% 58.67/58.87  102[0:Inp] || elem(u,snoc(v,w))* -> elem(u,v) equal(u,w).
% 58.67/58.87  132[0:Inp] || elem(m_Down(u),queue(host(v)))* equal(host(u),s(index(pendack,host(v)))) equal(index(status__dfg,host(v)),elec_2) leq(nbr_proc,s(index(pendack,host(v)))) setIn(v,alive) equal(host(w),index(pendack,host(v))) elem(m_Ack(v,w),queue(host(v)))* setIn(x,alive) equal(index(ldr,host(x)),host(x))** equal(index(status__dfg,host(x)),norm) -> .
% 58.67/58.87  135[0:Rew:48.0,65.0] ||  -> equal(s(host(skc12)),host(skc11))**.
% 58.67/58.87  136[0:Rew:135.0,51.0,48.0,51.0] ||  -> leq(nbr_proc,host(skc11))*r.
% 58.67/58.87  378[0:Res:48.0,132.5] || elem(m_Down(u),queue(host(skc10)))* equal(host(u),s(index(pendack,host(skc10)))) equal(index(status__dfg,host(skc10)),elec_2) leq(nbr_proc,s(index(pendack,host(skc10)))) setIn(skc10,alive) elem(m_Ack(skc10,skc12),queue(host(skc10)))* setIn(v,alive) equal(index(ldr,host(v)),host(v))** equal(index(status__dfg,host(v)),norm) -> .
% 58.67/58.87  381[0:Res:69.0,102.0] ||  -> equal(m_Halt(skc7),m_Down(skc11)) elem(m_Down(skc11),queue(host(skc10)))*.
% 58.67/58.87  385[0:Res:136.0,98.1] || leq(host(skc11),nbr_proc)*l -> equal(host(skc11),nbr_proc).
% 58.67/58.87  426[0:MRR:385.0,7.0] ||  -> equal(host(skc11),nbr_proc)**.
% 58.67/58.87  427[0:Rew:426.0,135.0] ||  -> equal(s(host(skc12)),nbr_proc)**.
% 58.67/58.87  492[0:Rew:427.0,378.3,48.0,378.3,27.0,378.2,427.0,378.1,48.0,378.1] || elem(m_Down(u),queue(host(skc10)))* equal(host(u),nbr_proc) equal(elec_2,elec_2) leq(nbr_proc,nbr_proc) setIn(skc10,alive) elem(m_Ack(skc10,skc12),queue(host(skc10)))* setIn(v,alive) equal(index(ldr,host(v)),host(v))** equal(index(status__dfg,host(v)),norm) -> .
% 58.67/58.87  493[0:Obv:492.2] || elem(m_Down(u),queue(host(skc10)))* equal(host(u),nbr_proc) leq(nbr_proc,nbr_proc) setIn(skc10,alive) elem(m_Ack(skc10,skc12),queue(host(skc10)))* setIn(v,alive) equal(index(ldr,host(v)),host(v))** equal(index(status__dfg,host(v)),norm) -> .
% 58.67/58.87  494[0:MRR:493.2,493.3,5.0,4.0] || setIn(u,alive) equal(host(v),nbr_proc) elem(m_Down(v),queue(host(skc10)))* elem(m_Ack(skc10,skc12),queue(host(skc10)))* equal(index(status__dfg,host(u)),norm) equal(index(ldr,host(u)),host(u))** -> .
% 58.67/58.87  510[1:Spt:381.0] ||  -> equal(m_Halt(skc7),m_Down(skc11))**.
% 58.67/58.87  511[1:UnC:510.0,31.0] ||  -> .
% 58.67/58.87  512[1:Spt:511.0,381.0,510.0] || equal(m_Halt(skc7),m_Down(skc11))** -> .
% 58.67/58.87  513[1:Spt:511.0,381.1] ||  -> elem(m_Down(skc11),queue(host(skc10)))*.
% 58.67/58.87  903[0:Res:90.0,102.0] ||  -> elem(m_Ack(skc10,skc12),queue(host(skc10)))* equal(m_Ack(skc10,skc12),m_Halt(skc7)).
% 58.67/58.87  948[0:MRR:903.1,53.0] ||  -> elem(m_Ack(skc10,skc12),queue(host(skc10)))*.
% 58.67/58.87  949[0:MRR:494.3,948.0] || setIn(u,alive) equal(host(v),nbr_proc) elem(m_Down(v),queue(host(skc10)))* equal(index(status__dfg,host(u)),norm) equal(index(ldr,host(u)),host(u))**+ -> .
% 58.67/58.87  32105[0:SpL:52.0,949.4] || setIn(skc13,alive) equal(host(u),nbr_proc) elem(m_Down(u),queue(host(skc10)))* equal(index(status__dfg,host(skc13)),norm) equal(host(skc13),host(skc13)) -> .
% 58.67/58.87  32106[0:Obv:32105.4] || setIn(skc13,alive) equal(host(u),nbr_proc) elem(m_Down(u),queue(host(skc10)))* equal(index(status__dfg,host(skc13)),norm) -> .
% 58.67/58.87  32107[0:Rew:29.0,32106.3] || setIn(skc13,alive) equal(host(u),nbr_proc) elem(m_Down(u),queue(host(skc10)))* equal(norm,norm) -> .
% 58.67/58.87  32108[0:Obv:32107.3] || setIn(skc13,alive) equal(host(u),nbr_proc) elem(m_Down(u),queue(host(skc10)))* -> .
% 58.67/58.87  32109[0:MRR:32108.0,2.0] || equal(host(u),nbr_proc) elem(m_Down(u),queue(host(skc10)))* -> .
% 58.67/58.87  37489[1:Res:513.0,32109.1] || equal(host(skc11),nbr_proc)** -> .
% 58.67/58.87  37495[1:Rew:426.0,37489.0] || equal(nbr_proc,nbr_proc)* -> .
% 58.67/58.87  37496[1:Obv:37495.0] ||  -> .
% 58.67/58.87  % SZS output end Refutation
% 58.67/58.87  Formulae used in the proof : conj axiom_02 axiom_62 axiom_63 axiom_58 axiom_59 axiom_04 axiom_17 axiom_11 axiom_61 axiom_47
% 58.67/58.87  
%------------------------------------------------------------------------------