%------------------------------------------------------------------------------ % File : SPASS---3.9 % Problem : SWV477+1 : TPTP v8.1.0. Released v4.0.0. % Transfm : none % Format : tptp % Command : run_spass %d %s % Computer : n020.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 103.85s 104.04s % Output : Refutation 103.85s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.07/0.12 % Problem : SWV477+1 : TPTP v8.1.0. Released v4.0.0. % 0.07/0.13 % Command : run_spass %d %s % 0.13/0.34 % Computer : n020.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.34 % CPULimit : 300 % 0.13/0.34 % WCLimit : 600 % 0.13/0.34 % DateTime : Thu Jun 16 03:14:04 EDT 2022 % 0.13/0.34 % CPUTime : % 103.85/104.04 % 103.85/104.04 SPASS V 3.9 % 103.85/104.04 SPASS beiseite: Proof found. % 103.85/104.04 % SZS status Theorem % 103.85/104.04 Problem: /export/starexec/sandbox/benchmark/theBenchmark.p % 103.85/104.04 SPASS derived 51724 clauses, backtracked 4 clauses, performed 12 splits and kept 17851 clauses. % 103.85/104.04 SPASS allocated 142545 KBytes. % 103.85/104.04 SPASS spent 0:1:41.19 on the problem. % 103.85/104.04 0:00:00.04 for the input. % 103.85/104.04 0:00:00.06 for the FLOTTER CNF translation. % 103.85/104.04 0:00:00.87 for inferences. % 103.85/104.04 0:00:01.00 for the backtracking. % 103.85/104.04 0:1:38.66 for the reduction. % 103.85/104.04 % 103.85/104.04 % 103.85/104.04 Here is a proof with depth 4, length 51 : % 103.85/104.04 % SZS output start Refutation % 103.85/104.04 2[0:Inp] || -> setIn(skc13,alive)*. % 103.85/104.04 4[0:Inp] || -> setIn(skc8,alive)*. % 103.85/104.04 7[0:Inp] || -> leq(host(u),nbr_proc)*l. % 103.85/104.04 22[0:Inp] || -> leq(nbr_proc,s(host(skc13)))*r. % 103.85/104.04 23[0:Inp] || -> leq(s(zero),host(u))*r. % 103.85/104.04 27[0:Inp] || leq(s(u),u)*l -> . % 103.85/104.04 28[0:Inp] || -> elem(m_Down(skc15),queue(host(skc13)))*. % 103.85/104.04 29[0:Inp] || -> elem(m_Down(skc14),queue(host(skc13)))*. % 103.85/104.04 31[0:Inp] || equal(host(skc13),host(skc8))** -> . % 103.85/104.04 33[0:Inp] || -> equal(s(host(skc13)),host(skc15))**. % 103.85/104.04 34[0:Inp] || -> equal(index(status__dfg,host(skc8)),elec_2)**. % 103.85/104.04 35[0:Inp] || -> leq(nbr_proc,index(pendack,host(skc8)))*r. % 103.85/104.04 55[0:Inp] || -> equal(index(pendack,host(skc8)),host(skc9))**. % 103.85/104.04 98[0:Inp] || leq(u,v)*+ leq(v,u)* -> equal(v,u). % 103.85/104.04 99[0:Inp] || leq(u,v)* leq(v,w)* -> leq(u,w)*. % 103.85/104.04 105[0:Inp] || leq(u,s(v))* -> leq(u,v) equal(u,s(v)). % 103.85/104.04 117[0:Inp] || leq(s(zero),u) -> equal(u,host(skc14)) setIn(u,index(down,host(skc13)))* leq(host(skc13),u). % 103.85/104.04 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)). % 103.85/104.04 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))*. % 103.85/104.04 137[0:Rew:33.0,22.0] || -> leq(nbr_proc,host(skc15))*r. % 103.85/104.04 138[0:Rew:55.0,35.0] || -> leq(nbr_proc,host(skc9))*r. % 103.85/104.04 263[0:Res:34.0,121.2] || setIn(u,alive) setIn(host(skc8),index(down,host(u)))* setIn(skc8,alive) -> leq(index(pendack,host(skc8)),host(u)). % 103.85/104.04 267[0:Res:34.0,123.4] || setIn(u,alive) elem(m_Down(v),queue(host(u)))* equal(host(skc8),host(v)) setIn(skc8,alive) -> leq(index(pendack,host(skc8)),host(u)). % 103.85/104.04 361[0:Rew:55.0,263.3] || setIn(u,alive) setIn(host(skc8),index(down,host(u)))* setIn(skc8,alive) -> leq(host(skc9),host(u)). % 103.85/104.04 362[0:MRR:361.2,4.0] || setIn(u,alive) setIn(host(skc8),index(down,host(u)))* -> leq(host(skc9),host(u)). % 103.85/104.04 375[0:Rew:55.0,267.4] || setIn(u,alive) elem(m_Down(v),queue(host(u)))* equal(host(skc8),host(v)) setIn(skc8,alive) -> leq(host(skc9),host(u)). % 103.85/104.04 376[0:MRR:375.3,4.0] || setIn(u,alive) elem(m_Down(v),queue(host(u)))* equal(host(skc8),host(v)) -> leq(host(skc9),host(u)). % 103.85/104.04 689[0:SpL:33.0,27.0] || leq(host(skc15),host(skc13))*l -> . % 103.85/104.04 733[0:NCh:99.2,99.0,689.0,7.0] || leq(nbr_proc,host(skc13))*r -> . % 103.85/104.04 1619[0:Res:137.0,98.0] || leq(host(skc15),nbr_proc)*l -> equal(host(skc15),nbr_proc). % 103.85/104.04 1620[0:Res:138.0,98.0] || leq(host(skc9),nbr_proc)*l -> equal(host(skc9),nbr_proc). % 103.85/104.04 1707[0:MRR:1619.0,7.0] || -> equal(host(skc15),nbr_proc)**. % 103.85/104.04 1708[0:Rew:1707.0,33.0] || -> equal(s(host(skc13)),nbr_proc)**. % 103.85/104.04 1762[0:MRR:1620.0,7.0] || -> equal(host(skc9),nbr_proc)**. % 103.85/104.04 1768[0:Rew:1762.0,376.3] || setIn(u,alive) elem(m_Down(v),queue(host(u)))* equal(host(skc8),host(v)) -> leq(nbr_proc,host(u)). % 103.85/104.04 1769[0:Rew:1762.0,362.2] || setIn(u,alive) setIn(host(skc8),index(down,host(u)))* -> leq(nbr_proc,host(u)). % 103.85/104.04 1886[0:SpL:1708.0,105.0] || leq(u,nbr_proc)* -> leq(u,host(skc13))* equal(u,s(host(skc13)))*. % 103.85/104.04 1946[0:Rew:1708.0,1886.2] || leq(u,nbr_proc)*+ -> leq(u,host(skc13))* equal(u,nbr_proc). % 103.85/104.04 9976[0:Res:117.2,1769.1] || leq(s(zero),host(skc8)) setIn(skc13,alive)* -> equal(host(skc14),host(skc8)) leq(host(skc13),host(skc8)) leq(nbr_proc,host(skc13)). % 103.85/104.04 9981[0:MRR:9976.0,9976.1,9976.4,23.0,2.0,733.0] || -> equal(host(skc14),host(skc8))** leq(host(skc13),host(skc8)). % 103.85/104.04 10033[0:Res:7.0,1946.0] || -> leq(host(u),host(skc13))* equal(host(u),nbr_proc)**. % 103.85/104.04 19018[0:Res:29.0,1768.1] || setIn(skc13,alive)* equal(host(skc14),host(skc8)) -> leq(nbr_proc,host(skc13)). % 103.85/104.04 19019[0:Res:28.0,1768.1] || setIn(skc13,alive)* equal(host(skc15),host(skc8)) -> leq(nbr_proc,host(skc13)). % 103.85/104.04 19022[0:MRR:19018.0,19018.2,2.0,733.0] || equal(host(skc14),host(skc8))** -> . % 103.85/104.04 19023[0:MRR:9981.0,19022.0] || -> leq(host(skc13),host(skc8))*l. % 103.85/104.04 19024[0:Rew:1707.0,19019.1] || setIn(skc13,alive)* equal(host(skc8),nbr_proc) -> leq(nbr_proc,host(skc13)). % 103.85/104.04 19025[0:MRR:19024.0,19024.2,2.0,733.0] || equal(host(skc8),nbr_proc)** -> . % 103.85/104.04 19047[0:Res:19023.0,98.0] || leq(host(skc8),host(skc13))*r -> equal(host(skc13),host(skc8)). % 103.85/104.04 19134[0:MRR:19047.1,31.0] || leq(host(skc8),host(skc13))*r -> . % 103.85/104.04 62984[0:Res:10033.0,19134.0] || -> equal(host(skc8),nbr_proc)**. % 103.85/104.04 63328[0:MRR:62984.0,19025.0] || -> . % 103.85/104.04 % SZS output end Refutation % 103.85/104.04 Formulae used in the proof : conj axiom_02 axiom_62 axiom_63 axiom_58 axiom_04 axiom_61 axiom_64 % 103.85/104.04 %------------------------------------------------------------------------------