TSTP Solution File: SWV480+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWV480+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n009.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:14 EDT 2022
% Result : Theorem 10.94s 11.11s
% Output : Refutation 10.94s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.04/0.12 % Problem : SWV480+1 : TPTP v8.1.0. Released v4.0.0.
% 0.04/0.13 % Command : run_spass %d %s
% 0.12/0.34 % Computer : n009.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 : Tue Jun 14 19:26:38 EDT 2022
% 0.12/0.34 % CPUTime :
% 10.94/11.11
% 10.94/11.11 SPASS V 3.9
% 10.94/11.11 SPASS beiseite: Proof found.
% 10.94/11.11 % SZS status Theorem
% 10.94/11.11 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p
% 10.94/11.11 SPASS derived 19297 clauses, backtracked 2 clauses, performed 7 splits and kept 6973 clauses.
% 10.94/11.11 SPASS allocated 111554 KBytes.
% 10.94/11.11 SPASS spent 0:0:10.66 on the problem.
% 10.94/11.11 0:00:00.04 for the input.
% 10.94/11.11 0:00:00.07 for the FLOTTER CNF translation.
% 10.94/11.11 0:00:00.22 for inferences.
% 10.94/11.11 0:00:00.02 for the backtracking.
% 10.94/11.11 0:0:10.20 for the reduction.
% 10.94/11.11
% 10.94/11.11
% 10.94/11.11 Here is a proof with depth 4, length 61 :
% 10.94/11.11 % SZS output start Refutation
% 10.94/11.11 2[0:Inp] || -> setIn(skc8,alive)*.
% 10.94/11.11 3[0:Inp] || -> setIn(skc13,alive)*.
% 10.94/11.11 7[0:Inp] || -> leq(host(u),nbr_proc)*l.
% 10.94/11.11 22[0:Inp] || -> leq(host(skc8),host(skc9))*r.
% 10.94/11.11 23[0:Inp] || -> leq(nbr_proc,s(host(skc13)))*r.
% 10.94/11.11 24[0:Inp] || -> leq(s(zero),host(u))*r.
% 10.94/11.11 28[0:Inp] || leq(s(u),u)*l -> .
% 10.94/11.11 30[0:Inp] || -> elem(m_Down(skc14),queue(host(skc13)))*.
% 10.94/11.11 31[0:Inp] || -> equal(index(status__dfg,host(skc8)),elec_2)**.
% 10.94/11.11 32[0:Inp] || -> leq(nbr_proc,index(pendack,host(skc8)))*r.
% 10.94/11.11 33[0:Inp] || equal(host(skc13),host(skc8))** -> .
% 10.94/11.11 35[0:Inp] || -> equal(s(host(skc13)),host(skc15))**.
% 10.94/11.11 52[0:Inp] || -> leq(u,v)* leq(v,u)*.
% 10.94/11.11 55[0:Inp] || -> equal(index(pendack,host(skc8)),host(skc9))**.
% 10.94/11.11 67[0:Inp] || equal(u,v)* -> leq(v,u).
% 10.94/11.11 68[0:Inp] || -> equal(cons(m_Down(skc9),skc10),queue(host(skc8)))**.
% 10.94/11.11 82[0:Inp] || equal(u,v) -> elem(u,cons(v,w))*.
% 10.94/11.11 99[0:Inp] || leq(u,v)*+ leq(v,u)* -> equal(v,u).
% 10.94/11.11 100[0:Inp] || leq(u,v)* leq(v,w)* -> leq(u,w)*.
% 10.94/11.11 105[0:Inp] || leq(u,s(v))* -> leq(u,v) equal(u,s(v)).
% 10.94/11.11 106[0:Inp] || equal(host(u),host(v)) elem(m_Down(u),queue(host(v)))* -> .
% 10.94/11.11 117[0:Inp] || leq(s(zero),u) -> equal(u,host(skc14)) setIn(u,index(down,host(skc13)))* leq(host(skc13),u).
% 10.94/11.11 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)).
% 10.94/11.11 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))*.
% 10.94/11.11 137[0:Rew:35.0,23.0] || -> leq(nbr_proc,host(skc15))*r.
% 10.94/11.11 138[0:Rew:55.0,32.0] || -> leq(nbr_proc,host(skc9))*r.
% 10.94/11.11 197[0:Res:2.0,121.3] || setIn(u,alive) setIn(host(skc8),index(down,host(u)))* equal(index(status__dfg,host(skc8)),elec_2) -> leq(index(pendack,host(skc8)),host(u)).
% 10.94/11.11 213[0:Res:2.0,123.3] || setIn(u,alive) elem(m_Down(v),queue(host(u)))* equal(host(skc8),host(v)) equal(index(status__dfg,host(skc8)),elec_2) -> leq(index(pendack,host(skc8)),host(u)).
% 10.94/11.11 336[0:Rew:55.0,197.3,31.0,197.2] || setIn(u,alive) setIn(host(skc8),index(down,host(u)))* equal(elec_2,elec_2) -> leq(host(skc9),host(u)).
% 10.94/11.11 337[0:Obv:336.2] || setIn(u,alive) setIn(host(skc8),index(down,host(u)))* -> leq(host(skc9),host(u)).
% 10.94/11.11 364[0:Rew:55.0,213.4,31.0,213.3] || 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)).
% 10.94/11.11 365[0:Obv:364.3] || setIn(u,alive) elem(m_Down(v),queue(host(u)))* equal(host(skc8),host(v)) -> leq(host(skc9),host(u)).
% 10.94/11.11 653[0:SpR:68.0,82.1] || equal(u,m_Down(skc9)) -> elem(u,queue(host(skc8)))*.
% 10.94/11.11 663[0:SpL:35.0,28.0] || leq(host(skc15),host(skc13))*l -> .
% 10.94/11.11 714[0:NCh:100.2,100.0,663.0,7.0] || leq(nbr_proc,host(skc13))*r -> .
% 10.94/11.11 1000[0:Res:653.1,106.1] || equal(m_Down(u),m_Down(skc9)) equal(host(u),host(skc8))* -> .
% 10.94/11.11 1847[0:Res:137.0,99.0] || leq(host(skc15),nbr_proc)*l -> equal(host(skc15),nbr_proc).
% 10.94/11.11 1848[0:Res:138.0,99.0] || leq(host(skc9),nbr_proc)*l -> equal(host(skc9),nbr_proc).
% 10.94/11.11 1895[0:NCh:100.2,100.1,99.0,22.0] || equal(u,host(skc8)) leq(host(skc9),u)* -> equal(host(skc9),u).
% 10.94/11.11 1938[0:MRR:1847.0,7.0] || -> equal(host(skc15),nbr_proc)**.
% 10.94/11.11 1939[0:Rew:1938.0,35.0] || -> equal(s(host(skc13)),nbr_proc)**.
% 10.94/11.11 1993[0:MRR:1848.0,7.0] || -> equal(host(skc9),nbr_proc)**.
% 10.94/11.11 2000[0:Rew:1993.0,365.3] || setIn(u,alive) elem(m_Down(v),queue(host(u)))* equal(host(skc8),host(v)) -> leq(nbr_proc,host(u)).
% 10.94/11.11 2001[0:Rew:1993.0,337.2] || setIn(u,alive) setIn(host(skc8),index(down,host(u)))* -> leq(nbr_proc,host(u)).
% 10.94/11.11 2043[0:Rew:1993.0,1895.2,1993.0,1895.1] || equal(u,host(skc8))* leq(nbr_proc,u)*+ -> equal(nbr_proc,u).
% 10.94/11.11 2103[0:SpL:1993.0,1000.1] || equal(m_Down(skc9),m_Down(skc9)) equal(host(skc8),nbr_proc)** -> .
% 10.94/11.11 2106[0:Obv:2103.0] || equal(host(skc8),nbr_proc)** -> .
% 10.94/11.11 2140[0:Res:52.0,105.0] || -> leq(s(u),v)* leq(v,u)* equal(v,s(u)).
% 10.94/11.11 2193[0:MRR:2140.2,67.0] || -> leq(s(u),v)* leq(v,u)*.
% 10.94/11.11 11982[0:Res:117.2,2001.1] || leq(s(zero),host(skc8)) setIn(skc13,alive)* -> equal(host(skc14),host(skc8)) leq(host(skc13),host(skc8)) leq(nbr_proc,host(skc13)).
% 10.94/11.11 11987[0:MRR:11982.0,11982.1,11982.4,24.0,3.0,714.0] || -> equal(host(skc14),host(skc8))** leq(host(skc13),host(skc8)).
% 10.94/11.11 20905[0:Res:30.0,2000.1] || setIn(skc13,alive)* equal(host(skc14),host(skc8)) -> leq(nbr_proc,host(skc13)).
% 10.94/11.11 20911[0:MRR:20905.0,20905.2,3.0,714.0] || equal(host(skc14),host(skc8))** -> .
% 10.94/11.11 20912[0:MRR:11987.0,20911.0] || -> leq(host(skc13),host(skc8))*l.
% 10.94/11.11 21009[0:Res:20912.0,99.0] || leq(host(skc8),host(skc13))*r -> equal(host(skc13),host(skc8)).
% 10.94/11.11 21103[0:MRR:21009.1,33.0] || leq(host(skc8),host(skc13))*r -> .
% 10.94/11.11 21856[0:NCh:100.2,100.1,21103.0,2193.1] || equal(host(skc8),u)* -> leq(s(host(skc13)),u)*.
% 10.94/11.11 21877[0:Rew:1939.0,21856.1] || equal(host(skc8),u)* -> leq(nbr_proc,u).
% 10.94/11.11 21878[0:MRR:2043.1,21877.1] || equal(u,host(skc8))* -> equal(nbr_proc,u).
% 10.94/11.11 21882[0:EqR:21878.0] || -> equal(host(skc8),nbr_proc)**.
% 10.94/11.11 21883[0:MRR:21882.0,2106.0] || -> .
% 10.94/11.11 % SZS output end Refutation
% 10.94/11.11 Formulae used in the proof : conj axiom_02 axiom_62 axiom_63 axiom_58 axiom_04 axiom_60 axiom_61 axiom_46 axiom_64
% 10.94/11.11
%------------------------------------------------------------------------------