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

View Problem - Process Solution

%------------------------------------------------------------------------------
% File     : SPASS---3.9
% Problem  : SWV475+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm  : none
% Format   : tptp
% Command  : run_spass %d %s

% Computer : n024.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:13 EDT 2022

% Result   : Theorem 42.97s 43.35s
% Output   : Refutation 42.97s
% Verified : 
% SZS Type : -

% Comments : 
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09  % Problem  : SWV475+1 : TPTP v8.1.0. Released v4.0.0.
% 0.00/0.09  % Command  : run_spass %d %s
% 0.09/0.29  % Computer : n024.cluster.edu
% 0.09/0.29  % Model    : x86_64 x86_64
% 0.09/0.29  % CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29  % Memory   : 8042.1875MB
% 0.09/0.29  % OS       : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29  % CPULimit : 300
% 0.09/0.29  % WCLimit  : 600
% 0.09/0.29  % DateTime : Wed Jun 15 16:50:48 EDT 2022
% 0.09/0.29  % CPUTime  : 
% 42.97/43.35  
% 42.97/43.35  SPASS V 3.9 
% 42.97/43.35  SPASS beiseite: Proof found.
% 42.97/43.35  % SZS status Theorem
% 42.97/43.35  Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p 
% 42.97/43.35  SPASS derived 27205 clauses, backtracked 30 clauses, performed 12 splits and kept 11191 clauses.
% 42.97/43.35  SPASS allocated 116931 KBytes.
% 42.97/43.35  SPASS spent	0:0:42.87 on the problem.
% 42.97/43.35  		0:00:00.03 for the input.
% 42.97/43.35  		0:00:00.05 for the FLOTTER CNF translation.
% 42.97/43.35  		0:00:00.55 for inferences.
% 42.97/43.35  		0:00:00.03 for the backtracking.
% 42.97/43.35  		0:0:42.00 for the reduction.
% 42.97/43.35  
% 42.97/43.35  
% 42.97/43.35  Here is a proof with depth 7, length 76 :
% 42.97/43.35  % SZS output start Refutation
% 42.97/43.35  2[0:Inp] ||  -> setIn(skc13,alive)*.
% 42.97/43.35  3[0:Inp] ||  -> setIn(skc12,alive)*.
% 42.97/43.35  4[0:Inp] ||  -> setIn(skc8,alive)*.
% 42.97/43.35  7[0:Inp] ||  -> leq(host(u),nbr_proc)*l.
% 42.97/43.35  21[0:Inp] ||  -> equal(host(skc12),host(skc8))**.
% 42.97/43.35  22[0:Inp] ||  -> equal(host(skc13),host(skc11))**.
% 42.97/43.35  23[0:Inp] ||  -> leq(nbr_proc,s(host(skc13)))*r.
% 42.97/43.35  24[0:Inp] ||  -> leq(s(zero),host(u))*r.
% 42.97/43.35  28[0:Inp] || leq(s(u),u)*l -> .
% 42.97/43.35  29[0:Inp] || equal(host(skc13),host(skc8))** -> .
% 42.97/43.35  31[0:Inp] ||  -> equal(s(host(skc13)),host(skc15))**.
% 42.97/43.35  32[0:Inp] ||  -> equal(index(status__dfg,host(skc8)),elec_2)**.
% 42.97/43.35  33[0:Inp] ||  -> leq(nbr_proc,index(pendack,host(skc8)))*r.
% 42.97/43.35  36[0:Inp] || equal(m_Down(u),m_Ldr(v))* -> .
% 42.97/43.35  50[0:Inp] ||  -> leq(u,v)* leq(v,u)*.
% 42.97/43.35  53[0:Inp] ||  -> equal(index(pendack,host(skc8)),host(skc9))**.
% 42.97/43.35  65[0:Inp] || equal(u,v)* -> leq(v,u).
% 42.97/43.35  68[0:Inp] ||  -> elem(m_Down(skc15),snoc(queue(host(skc13)),m_Ldr(skc8)))*.
% 42.97/43.35  69[0:Inp] ||  -> elem(m_Down(skc14),snoc(queue(host(skc13)),m_Ldr(skc8)))*.
% 42.97/43.35  97[0:Inp] || leq(u,v)*+ leq(v,u)* -> equal(v,u).
% 42.97/43.35  98[0:Inp] || leq(u,v)* leq(v,w)* -> leq(u,w)*.
% 42.97/43.35  102[0:Inp] || elem(u,snoc(v,w))* -> elem(u,v) equal(u,w).
% 42.97/43.35  105[0:Inp] || leq(u,s(v))* -> leq(u,v) equal(u,s(v)).
% 42.97/43.35  116[0:Inp] || setIn(u,alive)* setIn(v,alive)* equal(host(u),host(v))*+ -> equal(u,v).
% 42.97/43.35  117[0:Inp] || leq(s(zero),u) -> leq(host(skc13),u) setIn(u,index(down,host(skc13)))* equal(u,host(skc14)).
% 42.97/43.35  121[0:Inp] || setIn(u,alive) setIn(v,alive) setIn(host(u),index(down,host(v)))* equal(index(status__dfg,host(u)),elec_2) -> leq(index(pendack,host(u)),host(v)).
% 42.97/43.35  123[0:Inp] || setIn(u,alive) setIn(v,alive) equal(host(u),host(w))* elem(m_Down(w),queue(host(v)))*+ equal(index(status__dfg,host(u)),elec_2) -> leq(index(pendack,host(u)),host(v))*.
% 42.97/43.35  136[0:Rew:22.0,31.0] ||  -> equal(s(host(skc11)),host(skc15))**.
% 42.97/43.35  138[0:Rew:22.0,29.0] || equal(host(skc11),host(skc8))** -> .
% 42.97/43.35  140[0:Rew:22.0,69.0] ||  -> elem(m_Down(skc14),snoc(queue(host(skc11)),m_Ldr(skc8)))*.
% 42.97/43.35  141[0:Rew:22.0,68.0] ||  -> elem(m_Down(skc15),snoc(queue(host(skc11)),m_Ldr(skc8)))*.
% 42.97/43.35  142[0:Rew:136.0,23.0,22.0,23.0] ||  -> leq(nbr_proc,host(skc15))*r.
% 42.97/43.35  143[0:Rew:53.0,33.0] ||  -> leq(nbr_proc,host(skc9))*r.
% 42.97/43.35  144[0:Rew:22.0,117.2,22.0,117.1] || leq(s(zero),u) -> equal(u,host(skc14)) setIn(u,index(down,host(skc11)))* leq(host(skc11),u).
% 42.97/43.35  176[0:Res:3.0,121.3] || setIn(u,alive) setIn(host(skc12),index(down,host(u)))* equal(index(status__dfg,host(skc12)),elec_2) -> leq(index(pendack,host(skc12)),host(u)).
% 42.97/43.35  192[0:Res:3.0,123.3] || setIn(u,alive) elem(m_Down(v),queue(host(u)))* equal(host(skc12),host(v)) equal(index(status__dfg,host(skc12)),elec_2) -> leq(index(pendack,host(skc12)),host(u)).
% 42.97/43.35  268[0:Res:21.0,116.0] || setIn(skc8,alive) setIn(skc12,alive)* -> equal(skc12,skc8).
% 42.97/43.35  321[0:MRR:268.0,268.1,4.0,3.0] ||  -> equal(skc12,skc8)**.
% 42.97/43.35  352[0:Rew:53.0,176.3,321.0,176.3,32.0,176.2,321.0,176.2,321.0,176.1] || setIn(u,alive) setIn(host(skc8),index(down,host(u)))* equal(elec_2,elec_2) -> leq(host(skc9),host(u)).
% 42.97/43.35  353[0:Obv:352.2] || setIn(u,alive) setIn(host(skc8),index(down,host(u)))* -> leq(host(skc9),host(u)).
% 42.97/43.35  399[0:Rew:53.0,192.4,321.0,192.4,32.0,192.3,321.0,192.3,321.0,192.2] || setIn(u,alive) elem(m_Down(v),queue(host(u)))* equal(host(skc8),host(v)) equal(elec_2,elec_2) -> leq(host(skc9),host(u)).
% 42.97/43.35  400[0:Obv:399.3] || setIn(u,alive) elem(m_Down(v),queue(host(u)))* equal(host(skc8),host(v)) -> leq(host(skc9),host(u)).
% 42.97/43.35  807[0:SpL:136.0,28.0] || leq(host(skc15),host(skc11))*l -> .
% 42.97/43.35  823[0:NCh:98.2,98.0,807.0,7.0] || leq(nbr_proc,host(skc11))*r -> .
% 42.97/43.35  969[0:Res:141.0,102.0] ||  -> elem(m_Down(skc15),queue(host(skc11)))* equal(m_Down(skc15),m_Ldr(skc8)).
% 42.97/43.35  970[0:Res:140.0,102.0] ||  -> elem(m_Down(skc14),queue(host(skc11)))* equal(m_Down(skc14),m_Ldr(skc8)).
% 42.97/43.35  973[0:MRR:969.1,36.0] ||  -> elem(m_Down(skc15),queue(host(skc11)))*.
% 42.97/43.35  974[0:MRR:970.1,36.0] ||  -> elem(m_Down(skc14),queue(host(skc11)))*.
% 42.97/43.35  1728[0:Res:142.0,97.0] || leq(host(skc15),nbr_proc)*l -> equal(host(skc15),nbr_proc).
% 42.97/43.35  1729[0:Res:143.0,97.0] || leq(host(skc9),nbr_proc)*l -> equal(host(skc9),nbr_proc).
% 42.97/43.35  1819[0:MRR:1728.0,7.0] ||  -> equal(host(skc15),nbr_proc)**.
% 42.97/43.35  1821[0:Rew:1819.0,136.0] ||  -> equal(s(host(skc11)),nbr_proc)**.
% 42.97/43.35  1865[0:MRR:1729.0,7.0] ||  -> equal(host(skc9),nbr_proc)**.
% 42.97/43.35  1871[0:Rew:1865.0,400.3] || setIn(u,alive) elem(m_Down(v),queue(host(u)))* equal(host(skc8),host(v)) -> leq(nbr_proc,host(u)).
% 42.97/43.35  1872[0:Rew:1865.0,353.2] || setIn(u,alive) setIn(host(skc8),index(down,host(u)))* -> leq(nbr_proc,host(u)).
% 42.97/43.35  1982[0:Res:50.0,105.0] ||  -> leq(s(u),v)* leq(v,u)* equal(v,s(u)).
% 42.97/43.35  2041[0:MRR:1982.2,65.0] ||  -> leq(s(u),v)* leq(v,u)*.
% 42.97/43.35  11454[0:SpL:22.0,1872.1] || setIn(skc13,alive) setIn(host(skc8),index(down,host(skc11)))* -> leq(nbr_proc,host(skc13)).
% 42.97/43.35  11462[0:Rew:22.0,11454.2] || setIn(skc13,alive) setIn(host(skc8),index(down,host(skc11)))* -> leq(nbr_proc,host(skc11)).
% 42.97/43.35  11463[0:MRR:11462.0,11462.2,2.0,823.0] || setIn(host(skc8),index(down,host(skc11)))* -> .
% 42.97/43.35  11467[0:Res:144.2,11463.0] || leq(s(zero),host(skc8)) -> equal(host(skc14),host(skc8))** leq(host(skc11),host(skc8)).
% 42.97/43.35  11468[0:MRR:11467.0,24.0] ||  -> equal(host(skc14),host(skc8))** leq(host(skc11),host(skc8)).
% 42.97/43.35  20602[0:SpL:22.0,1871.1] || setIn(skc13,alive) elem(m_Down(u),queue(host(skc11)))* equal(host(skc8),host(u)) -> leq(nbr_proc,host(skc13)).
% 42.97/43.35  20624[0:Rew:22.0,20602.3] || setIn(skc13,alive) elem(m_Down(u),queue(host(skc11)))* equal(host(skc8),host(u)) -> leq(nbr_proc,host(skc11)).
% 42.97/43.35  20625[0:MRR:20624.0,20624.3,2.0,823.0] || elem(m_Down(u),queue(host(skc11)))* equal(host(skc8),host(u)) -> .
% 42.97/43.35  24824[0:Res:973.0,20625.0] || equal(host(skc15),host(skc8))** -> .
% 42.97/43.35  24825[0:Res:974.0,20625.0] || equal(host(skc14),host(skc8))** -> .
% 42.97/43.35  24826[0:Rew:1819.0,24824.0] || equal(host(skc8),nbr_proc)** -> .
% 42.97/43.35  24827[0:MRR:11468.0,24825.0] ||  -> leq(host(skc11),host(skc8))*l.
% 42.97/43.35  24987[0:Res:24827.0,97.0] || leq(host(skc8),host(skc11))*r -> equal(host(skc11),host(skc8)).
% 42.97/43.35  25089[0:MRR:24987.1,138.0] || leq(host(skc8),host(skc11))*r -> .
% 42.97/43.35  25783[0:NCh:98.2,98.1,25089.0,2041.1] || equal(host(skc8),u)* -> leq(s(host(skc11)),u)*.
% 42.97/43.35  25804[0:Rew:1821.0,25783.1] || equal(host(skc8),u)* -> leq(nbr_proc,u).
% 42.97/43.35  29050[0:EqR:25804.0] ||  -> leq(nbr_proc,host(skc8))*r.
% 42.97/43.35  29068[0:Res:29050.0,97.0] || leq(host(skc8),nbr_proc)*l -> equal(host(skc8),nbr_proc).
% 42.97/43.35  29185[0:MRR:29068.0,29068.1,7.0,24826.0] ||  -> .
% 42.97/43.35  % SZS output end Refutation
% 42.97/43.35  Formulae used in the proof : conj axiom_02 axiom_62 axiom_63 axiom_58 axiom_04 axiom_18 axiom_60 axiom_61 axiom_47 axiom_64
% 42.97/43.35  
%------------------------------------------------------------------------------