%------------------------------------------------------------------------------ % File : SPASS---3.9 % Problem : SWV478+1 : TPTP v8.1.0. Released v4.0.0. % Transfm : none % Format : tptp % Command : run_spass %d %s % Computer : n025.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 26.35s 26.55s % Output : Refutation 26.35s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SWV478+1 : TPTP v8.1.0. Released v4.0.0. % 0.07/0.13 % Command : run_spass %d %s % 0.13/0.34 % Computer : n025.cluster.edu % 0.13/0.34 % Model : x86_64 x86_64 % 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz % 0.13/0.34 % Memory : 8042.1875MB % 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64 % 0.13/0.35 % CPULimit : 300 % 0.13/0.35 % WCLimit : 600 % 0.13/0.35 % DateTime : Thu Jun 16 03:30:41 EDT 2022 % 0.13/0.35 % CPUTime : % 26.35/26.55 % 26.35/26.55 SPASS V 3.9 % 26.35/26.55 SPASS beiseite: Proof found. % 26.35/26.55 % SZS status Theorem % 26.35/26.55 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p % 26.35/26.55 SPASS derived 24792 clauses, backtracked 4 clauses, performed 12 splits and kept 9896 clauses. % 26.35/26.55 SPASS allocated 115420 KBytes. % 26.35/26.55 SPASS spent 0:0:26.04 on the problem. % 26.35/26.55 0:00:00.04 for the input. % 26.35/26.55 0:00:00.07 for the FLOTTER CNF translation. % 26.35/26.55 0:00:00.30 for inferences. % 26.35/26.55 0:00:00.04 for the backtracking. % 26.35/26.55 0:0:25.45 for the reduction. % 26.35/26.55 % 26.35/26.55 % 26.35/26.55 Here is a proof with depth 5, length 75 : % 26.35/26.55 % SZS output start Refutation % 26.35/26.55 2[0:Inp] || -> setIn(skc8,alive)*. % 26.35/26.55 3[0:Inp] || -> setIn(skc13,alive)*. % 26.35/26.55 7[0:Inp] || -> leq(host(u),nbr_proc)*l. % 26.35/26.55 22[0:Inp] || -> leq(host(skc8),host(skc9))*r. % 26.35/26.55 23[0:Inp] || -> equal(host(skc13),host(skc11))**. % 26.35/26.55 24[0:Inp] || -> leq(nbr_proc,s(host(skc13)))*r. % 26.35/26.55 25[0:Inp] || -> leq(s(zero),host(u))*r. % 26.35/26.55 29[0:Inp] || leq(s(u),u)*l -> . % 26.35/26.55 30[0:Inp] || -> equal(index(status__dfg,host(skc8)),elec_2)**. % 26.35/26.55 31[0:Inp] || -> leq(nbr_proc,index(pendack,host(skc8)))*r. % 26.35/26.55 32[0:Inp] || equal(host(skc13),host(skc8))** -> . % 26.35/26.55 34[0:Inp] || -> equal(s(host(skc13)),host(skc15))**. % 26.35/26.55 37[0:Inp] || equal(m_Down(u),m_Ldr(v))* -> . % 26.35/26.55 51[0:Inp] || -> leq(u,v)* leq(v,u)*. % 26.35/26.55 55[0:Inp] || -> equal(index(pendack,host(skc8)),host(skc9))**. % 26.35/26.55 67[0:Inp] || equal(u,v)* -> leq(v,u). % 26.35/26.55 68[0:Inp] || -> equal(cons(m_Down(skc9),skc10),queue(host(skc8)))**. % 26.35/26.55 72[0:Inp] || -> elem(m_Down(skc14),snoc(queue(host(skc13)),m_Ldr(skc8)))*. % 26.35/26.55 83[0:Inp] || equal(u,v) -> elem(u,cons(v,w))*. % 26.35/26.55 100[0:Inp] || leq(u,v)*+ leq(v,u)* -> equal(v,u). % 26.35/26.55 101[0:Inp] || leq(u,v)* leq(v,w)* -> leq(u,w)*. % 26.35/26.55 103[0:Inp] || elem(u,snoc(v,w))* -> elem(u,v) equal(u,w). % 26.35/26.55 106[0:Inp] || leq(u,s(v))* -> leq(u,v) equal(u,s(v)). % 26.35/26.55 107[0:Inp] || equal(host(u),host(v)) elem(m_Down(u),queue(host(v)))* -> . % 26.35/26.55 118[0:Inp] || leq(s(zero),u) -> leq(host(skc13),u) setIn(u,index(down,host(skc13)))* equal(u,host(skc14)). % 26.35/26.55 122[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)). % 26.35/26.55 124[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))*. % 26.35/26.55 137[0:Rew:23.0,34.0] || -> equal(s(host(skc11)),host(skc15))**. % 26.35/26.55 139[0:Rew:23.0,32.0] || equal(host(skc11),host(skc8))** -> . % 26.35/26.55 141[0:Rew:23.0,72.0] || -> elem(m_Down(skc14),snoc(queue(host(skc11)),m_Ldr(skc8)))*. % 26.35/26.55 143[0:Rew:137.0,24.0,23.0,24.0] || -> leq(nbr_proc,host(skc15))*r. % 26.35/26.55 144[0:Rew:55.0,31.0] || -> leq(nbr_proc,host(skc9))*r. % 26.35/26.55 145[0:Rew:23.0,118.2,23.0,118.1] || leq(s(zero),u) -> equal(u,host(skc14)) setIn(u,index(down,host(skc11)))* leq(host(skc11),u). % 26.35/26.55 204[0:Res:2.0,122.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)). % 26.35/26.55 220[0:Res:2.0,124.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)). % 26.35/26.55 347[0:Rew:55.0,204.3,30.0,204.2] || setIn(u,alive) setIn(host(skc8),index(down,host(u)))* equal(elec_2,elec_2) -> leq(host(skc9),host(u)). % 26.35/26.55 348[0:Obv:347.2] || setIn(u,alive) setIn(host(skc8),index(down,host(u)))* -> leq(host(skc9),host(u)). % 26.35/26.55 392[0:Rew:55.0,220.4,30.0,220.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)). % 26.35/26.55 393[0:Obv:392.3] || setIn(u,alive) elem(m_Down(v),queue(host(u)))* equal(host(skc8),host(v)) -> leq(host(skc9),host(u)). % 26.35/26.55 701[0:SpR:68.0,83.1] || equal(u,m_Down(skc9)) -> elem(u,queue(host(skc8)))*. % 26.35/26.55 712[0:SpL:137.0,29.0] || leq(host(skc15),host(skc11))*l -> . % 26.35/26.55 762[0:NCh:101.2,101.0,712.0,7.0] || leq(nbr_proc,host(skc11))*r -> . % 26.35/26.55 934[0:Res:141.0,103.0] || -> elem(m_Down(skc14),queue(host(skc11)))* equal(m_Down(skc14),m_Ldr(skc8)). % 26.35/26.55 938[0:MRR:934.1,37.0] || -> elem(m_Down(skc14),queue(host(skc11)))*. % 26.35/26.55 988[0:Res:701.1,107.1] || equal(m_Down(u),m_Down(skc9)) equal(host(u),host(skc8))* -> . % 26.35/26.55 1730[0:Res:143.0,100.0] || leq(host(skc15),nbr_proc)*l -> equal(host(skc15),nbr_proc). % 26.35/26.55 1731[0:Res:144.0,100.0] || leq(host(skc9),nbr_proc)*l -> equal(host(skc9),nbr_proc). % 26.35/26.55 1779[0:NCh:101.2,101.1,100.0,22.0] || equal(u,host(skc8)) leq(host(skc9),u)* -> equal(host(skc9),u). % 26.35/26.55 1824[0:MRR:1730.0,7.0] || -> equal(host(skc15),nbr_proc)**. % 26.35/26.55 1825[0:Rew:1824.0,137.0] || -> equal(s(host(skc11)),nbr_proc)**. % 26.35/26.55 1870[0:MRR:1731.0,7.0] || -> equal(host(skc9),nbr_proc)**. % 26.35/26.55 1877[0:Rew:1870.0,393.3] || setIn(u,alive) elem(m_Down(v),queue(host(u)))* equal(host(skc8),host(v)) -> leq(nbr_proc,host(u)). % 26.35/26.55 1878[0:Rew:1870.0,348.2] || setIn(u,alive) setIn(host(skc8),index(down,host(u)))* -> leq(nbr_proc,host(u)). % 26.35/26.55 1920[0:Rew:1870.0,1779.2,1870.0,1779.1] || equal(u,host(skc8))* leq(nbr_proc,u)*+ -> equal(nbr_proc,u). % 26.35/26.55 1982[0:SpL:1870.0,988.1] || equal(m_Down(skc9),m_Down(skc9)) equal(host(skc8),nbr_proc)** -> . % 26.35/26.55 1985[0:Obv:1982.0] || equal(host(skc8),nbr_proc)** -> . % 26.35/26.55 2016[0:Res:51.0,106.0] || -> leq(s(u),v)* leq(v,u)* equal(v,s(u)). % 26.35/26.55 2072[0:MRR:2016.2,67.0] || -> leq(s(u),v)* leq(v,u)*. % 26.35/26.55 12124[0:SpL:23.0,1878.1] || setIn(skc13,alive) setIn(host(skc8),index(down,host(skc11)))* -> leq(nbr_proc,host(skc13)). % 26.35/26.55 12132[0:Rew:23.0,12124.2] || setIn(skc13,alive) setIn(host(skc8),index(down,host(skc11)))* -> leq(nbr_proc,host(skc11)). % 26.35/26.55 12133[0:MRR:12132.0,12132.2,3.0,762.0] || setIn(host(skc8),index(down,host(skc11)))* -> . % 26.35/26.55 12137[0:Res:145.2,12133.0] || leq(s(zero),host(skc8)) -> equal(host(skc14),host(skc8))** leq(host(skc11),host(skc8)). % 26.35/26.55 12138[0:MRR:12137.0,25.0] || -> equal(host(skc14),host(skc8))** leq(host(skc11),host(skc8)). % 26.35/26.55 20867[0:SpL:23.0,1877.1] || setIn(skc13,alive) elem(m_Down(u),queue(host(skc11)))* equal(host(skc8),host(u)) -> leq(nbr_proc,host(skc13)). % 26.35/26.55 20891[0:Rew:23.0,20867.3] || setIn(skc13,alive) elem(m_Down(u),queue(host(skc11)))* equal(host(skc8),host(u)) -> leq(nbr_proc,host(skc11)). % 26.35/26.55 20892[0:MRR:20891.0,20891.3,3.0,762.0] || elem(m_Down(u),queue(host(skc11)))* equal(host(skc8),host(u)) -> . % 26.35/26.55 27174[0:Res:938.0,20892.0] || equal(host(skc14),host(skc8))** -> . % 26.35/26.55 27176[0:MRR:12138.0,27174.0] || -> leq(host(skc11),host(skc8))*l. % 26.35/26.55 27197[0:Res:27176.0,100.0] || leq(host(skc8),host(skc11))*r -> equal(host(skc11),host(skc8)). % 26.35/26.55 27310[0:MRR:27197.1,139.0] || leq(host(skc8),host(skc11))*r -> . % 26.35/26.55 28029[0:NCh:101.2,101.1,27310.0,2072.1] || equal(host(skc8),u)* -> leq(s(host(skc11)),u)*. % 26.35/26.55 28050[0:Rew:1825.0,28029.1] || equal(host(skc8),u)* -> leq(nbr_proc,u). % 26.35/26.55 28051[0:MRR:1920.1,28050.1] || equal(u,host(skc8))* -> equal(nbr_proc,u). % 26.35/26.55 28057[0:EqR:28051.0] || -> equal(host(skc8),nbr_proc)**. % 26.35/26.55 28058[0:MRR:28057.0,1985.0] || -> . % 26.35/26.55 % SZS output end Refutation % 26.35/26.55 Formulae used in the proof : conj axiom_02 axiom_62 axiom_63 axiom_58 axiom_04 axiom_18 axiom_60 axiom_61 axiom_46 axiom_47 axiom_64 % 26.35/26.55 %------------------------------------------------------------------------------