TSTP Solution File: SWV448+1 by SPASS---3.9
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : SPASS---3.9
% Problem : SWV448+1 : TPTP v8.1.0. Released v4.0.0.
% Transfm : none
% Format : tptp
% Command : run_spass %d %s
% Computer : n018.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:08 EDT 2022
% Result : Theorem 69.63s 69.88s
% Output : Refutation 69.63s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.06/0.12 % Problem : SWV448+1 : TPTP v8.1.0. Released v4.0.0.
% 0.06/0.13 % Command : run_spass %d %s
% 0.12/0.34 % Computer : n018.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 : Thu Jun 16 02:00:30 EDT 2022
% 0.12/0.34 % CPUTime :
% 69.63/69.88
% 69.63/69.88 SPASS V 3.9
% 69.63/69.88 SPASS beiseite: Proof found.
% 69.63/69.88 % SZS status Theorem
% 69.63/69.88 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p
% 69.63/69.88 SPASS derived 41590 clauses, backtracked 1734 clauses, performed 19 splits and kept 15580 clauses.
% 69.63/69.88 SPASS allocated 128100 KBytes.
% 69.63/69.88 SPASS spent 0:01:08.63 on the problem.
% 69.63/69.88 0:00:00.04 for the input.
% 69.63/69.88 0:00:00.05 for the FLOTTER CNF translation.
% 69.63/69.88 0:00:00.62 for inferences.
% 69.63/69.88 0:00:00.63 for the backtracking.
% 69.63/69.88 0:01:06.85 for the reduction.
% 69.63/69.88
% 69.63/69.88
% 69.63/69.88 Here is a proof with depth 5, length 60 :
% 69.63/69.88 % SZS output start Refutation
% 69.63/69.88 3[0:Inp] || -> setIn(skc11,alive)*.
% 69.63/69.88 6[0:Inp] || -> leq(nbr_proc,host(skc6))*r.
% 69.63/69.88 9[0:Inp] || -> leq(host(u),nbr_proc)*l.
% 69.63/69.88 30[0:Inp] || equal(host(skc11),host(skc6))** -> .
% 69.63/69.88 32[0:Inp] || -> equal(index(status__dfg,host(skc6)),elec_1)**.
% 69.63/69.88 33[0:Inp] || -> equal(index(status__dfg,host(skc11)),norm)**.
% 69.63/69.88 51[0:Inp] || leq(host(u),skf5(v,u))*r -> .
% 69.63/69.88 52[0:Inp] || -> equal(index(ldr,host(skc11)),host(skc11))**.
% 69.63/69.88 65[0:Inp] || -> equal(cons(m_Down(skc7),skc8),queue(host(skc6)))**.
% 69.63/69.88 77[0:Inp] || equal(u,v) -> equal(m_Down(u),m_Down(v))*.
% 69.63/69.88 78[0:Inp] || equal(u,v) -> elem(u,cons(v,w))*.
% 69.63/69.88 95[0:Inp] || leq(u,v)*+ leq(v,u)* -> equal(v,u).
% 69.63/69.88 114[0:Inp] || leq(s(zero),u) -> leq(host(skc6),u) setIn(u,index(down,host(skc6)))* equal(u,host(skc7)).
% 69.63/69.88 119[0:Inp] || setIn(u,alive) elem(m_Down(v),queue(host(w)))* equal(index(status__dfg,host(u)),norm) equal(index(status__dfg,host(w)),elec_1) equal(index(ldr,host(u)),host(u))**+ -> leq(host(w),host(u))* leq(s(zero),skf5(v,w)).
% 69.63/69.88 120[0:Inp] || setIn(u,alive) elem(m_Down(v),queue(host(w)))* equal(skf5(v,w),host(v)) equal(index(status__dfg,host(u)),norm) equal(index(status__dfg,host(w)),elec_1) equal(index(ldr,host(u)),host(u))**+ -> leq(host(w),host(u))*.
% 69.63/69.88 121[0:Inp] || setIn(u,alive) elem(m_Down(v),queue(host(w))) setIn(skf5(v,w),index(down,host(w)))*+ equal(index(status__dfg,host(u)),norm) equal(index(status__dfg,host(w)),elec_1) equal(index(ldr,host(u)),host(u))** -> leq(host(w),host(u))*.
% 69.63/69.88 236[0:Res:32.0,119.1] || elem(m_Down(u),queue(host(skc6)))* setIn(v,alive) equal(index(ldr,host(v)),host(v))** equal(index(status__dfg,host(v)),norm) -> leq(s(zero),skf5(u,skc6)) leq(host(skc6),host(v)).
% 69.63/69.88 268[0:Res:95.2,30.0] || leq(host(skc6),host(skc11)) leq(host(skc11),host(skc6))*l -> .
% 69.63/69.88 283[0:Res:52.0,121.4] || setIn(skf5(u,v),index(down,host(v)))* elem(m_Down(u),queue(host(v))) equal(index(status__dfg,host(v)),elec_1) setIn(skc11,alive) equal(index(status__dfg,host(skc11)),norm) -> leq(host(v),host(skc11)).
% 69.63/69.88 284[0:Res:52.0,120.4] || equal(skf5(u,v),host(u)) elem(m_Down(u),queue(host(v)))* equal(index(status__dfg,host(v)),elec_1) setIn(skc11,alive) equal(index(status__dfg,host(skc11)),norm) -> leq(host(v),host(skc11)).
% 69.63/69.88 318[0:Res:6.0,95.1] || leq(host(skc6),nbr_proc)*l -> equal(host(skc6),nbr_proc).
% 69.63/69.88 334[0:Res:114.1,51.0] || leq(s(zero),skf5(u,skc6)) -> setIn(skf5(u,skc6),index(down,host(skc6)))* equal(skf5(u,skc6),host(skc7)).
% 69.63/69.88 383[0:MRR:318.0,9.0] || -> equal(host(skc6),nbr_proc)**.
% 69.63/69.88 384[0:Rew:383.0,32.0] || -> equal(index(status__dfg,nbr_proc),elec_1)**.
% 69.63/69.88 386[0:Rew:383.0,65.0] || -> equal(cons(m_Down(skc7),skc8),queue(nbr_proc))**.
% 69.63/69.88 399[0:Rew:383.0,268.1,383.0,268.0] || leq(nbr_proc,host(skc11)) leq(host(skc11),nbr_proc)*l -> .
% 69.63/69.88 400[0:MRR:399.1,9.0] || leq(nbr_proc,host(skc11))*r -> .
% 69.63/69.88 402[0:Rew:383.0,334.1] || leq(s(zero),skf5(u,skc6)) -> equal(skf5(u,skc6),host(skc7)) setIn(skf5(u,skc6),index(down,nbr_proc))*.
% 69.63/69.88 419[0:Rew:33.0,284.4] || equal(skf5(u,v),host(u)) elem(m_Down(u),queue(host(v)))* equal(index(status__dfg,host(v)),elec_1) setIn(skc11,alive) equal(norm,norm) -> leq(host(v),host(skc11)).
% 69.63/69.88 420[0:Obv:419.4] || equal(skf5(u,v),host(u)) elem(m_Down(u),queue(host(v)))* equal(index(status__dfg,host(v)),elec_1) setIn(skc11,alive) -> leq(host(v),host(skc11)).
% 69.63/69.88 421[0:MRR:420.3,3.0] || elem(m_Down(u),queue(host(v)))* equal(skf5(u,v),host(u)) equal(index(status__dfg,host(v)),elec_1) -> leq(host(v),host(skc11)).
% 69.63/69.88 425[0:Rew:33.0,283.4] || setIn(skf5(u,v),index(down,host(v)))* elem(m_Down(u),queue(host(v))) equal(index(status__dfg,host(v)),elec_1) setIn(skc11,alive) equal(norm,norm) -> leq(host(v),host(skc11)).
% 69.63/69.88 426[0:Obv:425.4] || setIn(skf5(u,v),index(down,host(v)))* elem(m_Down(u),queue(host(v))) equal(index(status__dfg,host(v)),elec_1) setIn(skc11,alive) -> leq(host(v),host(skc11)).
% 69.63/69.88 427[0:MRR:426.3,3.0] || elem(m_Down(u),queue(host(v))) setIn(skf5(u,v),index(down,host(v)))* equal(index(status__dfg,host(v)),elec_1) -> leq(host(v),host(skc11)).
% 69.63/69.88 434[0:Rew:383.0,236.5,383.0,236.0] || setIn(u,alive) elem(m_Down(v),queue(nbr_proc))* equal(index(status__dfg,host(u)),norm) equal(index(ldr,host(u)),host(u))**+ -> leq(nbr_proc,host(u)) leq(s(zero),skf5(v,skc6)).
% 69.63/69.88 451[1:Spt:434.0,434.2,434.3,434.4] || setIn(u,alive) equal(index(status__dfg,host(u)),norm) equal(index(ldr,host(u)),host(u))** -> leq(nbr_proc,host(u)).
% 69.63/69.88 471[1:SpL:52.0,451.2] || setIn(skc11,alive) equal(index(status__dfg,host(skc11)),norm)** equal(host(skc11),host(skc11)) -> leq(nbr_proc,host(skc11)).
% 69.63/69.88 472[1:Obv:471.2] || setIn(skc11,alive) equal(index(status__dfg,host(skc11)),norm)** -> leq(nbr_proc,host(skc11)).
% 69.63/69.88 473[1:Rew:33.0,472.1] || setIn(skc11,alive)* equal(norm,norm) -> leq(nbr_proc,host(skc11)).
% 69.63/69.88 474[1:Obv:473.1] || setIn(skc11,alive)* -> leq(nbr_proc,host(skc11)).
% 69.63/69.88 475[1:MRR:474.0,3.0] || -> leq(nbr_proc,host(skc11))*r.
% 69.63/69.88 476[1:MRR:475.0,400.0] || -> .
% 69.63/69.88 477[1:Spt:476.0,434.1,434.5] || elem(m_Down(u),queue(nbr_proc))* -> leq(s(zero),skf5(u,skc6)).
% 69.63/69.88 504[0:SpR:77.1,386.0] || equal(skc7,u) -> equal(cons(m_Down(u),skc8),queue(nbr_proc))**.
% 69.63/69.88 786[0:SpR:504.1,78.1] || equal(skc7,u) equal(v,m_Down(u))*+ -> elem(v,queue(nbr_proc))*.
% 69.63/69.88 3517[0:EqR:786.1] || equal(skc7,u) -> elem(m_Down(u),queue(nbr_proc))*.
% 69.63/69.88 33305[0:SpL:383.0,421.0] || elem(m_Down(u),queue(nbr_proc))* equal(skf5(u,skc6),host(u)) equal(index(status__dfg,host(skc6)),elec_1) -> leq(host(skc6),host(skc11)).
% 69.63/69.88 33315[0:Rew:383.0,33305.3,384.0,33305.2,383.0,33305.2] || elem(m_Down(u),queue(nbr_proc))* equal(skf5(u,skc6),host(u)) equal(elec_1,elec_1) -> leq(nbr_proc,host(skc11)).
% 69.63/69.88 33316[0:Obv:33315.2] || elem(m_Down(u),queue(nbr_proc))* equal(skf5(u,skc6),host(u)) -> leq(nbr_proc,host(skc11)).
% 69.63/69.88 33317[0:MRR:33316.2,400.0] || elem(m_Down(u),queue(nbr_proc))* equal(skf5(u,skc6),host(u)) -> .
% 69.63/69.88 35284[0:SpL:383.0,427.1] || elem(m_Down(u),queue(host(skc6))) setIn(skf5(u,skc6),index(down,nbr_proc))* equal(index(status__dfg,host(skc6)),elec_1) -> leq(host(skc6),host(skc11)).
% 69.63/69.88 35287[0:Rew:383.0,35284.3,384.0,35284.2,383.0,35284.2,383.0,35284.0] || elem(m_Down(u),queue(nbr_proc)) setIn(skf5(u,skc6),index(down,nbr_proc))* equal(elec_1,elec_1) -> leq(nbr_proc,host(skc11)).
% 69.63/69.88 35288[0:Obv:35287.2] || elem(m_Down(u),queue(nbr_proc)) setIn(skf5(u,skc6),index(down,nbr_proc))* -> leq(nbr_proc,host(skc11)).
% 69.63/69.88 35289[0:MRR:35288.2,400.0] || elem(m_Down(u),queue(nbr_proc)) setIn(skf5(u,skc6),index(down,nbr_proc))* -> .
% 69.63/69.88 43835[0:Res:402.2,35289.1] || leq(s(zero),skf5(u,skc6)) elem(m_Down(u),queue(nbr_proc))* -> equal(skf5(u,skc6),host(skc7)).
% 69.63/69.88 43836[1:MRR:43835.0,477.1] || elem(m_Down(u),queue(nbr_proc))* -> equal(skf5(u,skc6),host(skc7)).
% 69.63/69.88 43839[1:Rew:43836.1,33317.1] || elem(m_Down(u),queue(nbr_proc))* equal(host(skc7),host(u)) -> .
% 69.63/69.88 44547[1:Res:3517.1,43839.0] || equal(skc7,u) equal(host(skc7),host(u))* -> .
% 69.63/69.88 50334[1:EqR:44547.1] || equal(skc7,skc7)* -> .
% 69.63/69.88 50337[1:Obv:50334.0] || -> .
% 69.63/69.88 % SZS output end Refutation
% 69.63/69.88 Formulae used in the proof : conj axiom_02 axiom_62 axiom_63 axiom_58 axiom_04 axiom_30 axiom_46 axiom_61
% 69.63/69.88
%------------------------------------------------------------------------------