%------------------------------------------------------------------------------ % File : SPASS---3.9 % Problem : SWV469+1 : TPTP v8.1.0. Released v4.0.0. % Transfm : none % Format : tptp % Command : run_spass %d %s % Computer : n017.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:12 EDT 2022 % Result : Theorem 1.45s 1.67s % Output : Refutation 1.45s % Verified : % SZS Type : - % Comments : %------------------------------------------------------------------------------ %----WARNING: Could not form TPTP format derivation %------------------------------------------------------------------------------ %----ORIGINAL SYSTEM OUTPUT % 0.10/0.12 % Problem : SWV469+1 : TPTP v8.1.0. Released v4.0.0. % 0.10/0.13 % Command : run_spass %d %s % 0.13/0.34 % Computer : n017.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 : Tue Jun 14 21:27:24 EDT 2022 % 0.13/0.34 % CPUTime : % 1.45/1.67 % 1.45/1.67 SPASS V 3.9 % 1.45/1.67 SPASS beiseite: Proof found. % 1.45/1.67 % SZS status Theorem % 1.45/1.67 Problem: /export/starexec/sandbox2/benchmark/theBenchmark.p % 1.45/1.67 SPASS derived 6644 clauses, backtracked 202 clauses, performed 7 splits and kept 1963 clauses. % 1.45/1.67 SPASS allocated 103707 KBytes. % 1.45/1.67 SPASS spent 0:00:01.28 on the problem. % 1.45/1.67 0:00:00.04 for the input. % 1.45/1.67 0:00:00.05 for the FLOTTER CNF translation. % 1.45/1.67 0:00:00.09 for inferences. % 1.45/1.67 0:00:00.01 for the backtracking. % 1.45/1.67 0:00:01.02 for the reduction. % 1.45/1.67 % 1.45/1.67 % 1.45/1.67 Here is a proof with depth 8, length 56 : % 1.45/1.67 % SZS output start Refutation % 1.45/1.67 2[0:Inp] || -> setIn(skc5,alive)*. % 1.45/1.67 4[0:Inp] || -> setIn(skc8,alive)*. % 1.45/1.67 5[0:Inp] || -> leq(u,u)*. % 1.45/1.67 8[0:Inp] || equal(elec_1,elec_2)** -> . % 1.45/1.67 23[0:Inp] || -> leq(s(zero),host(u))*. % 1.45/1.67 28[0:Inp] || equal(host(skc8),host(skc5))** -> . % 1.45/1.67 31[0:Inp] || -> equal(index(status__dfg,host(skc8)),norm)**. % 1.45/1.67 42[0:Inp] || -> equal(head(cons(u,v)),u)**. % 1.45/1.67 47[0:Inp] || equal(snoc(u,v),q_nil)** -> . % 1.45/1.67 48[0:Inp] || -> leq(u,v)* leq(v,u)*. % 1.45/1.67 50[0:Inp] || -> equal(index(ldr,host(skc8)),host(skc8))**. % 1.45/1.67 51[0:Inp] || leq(s(host(skc5)),host(skc8))*l -> . % 1.45/1.67 64[0:Inp] || -> equal(cons(m_Down(skc6),skc7),queue(host(skc5)))**. % 1.45/1.67 77[0:Inp] || equal(u,v) -> elem(u,cons(v,w))*. % 1.45/1.67 87[0:Inp] || -> equal(u,q_nil) equal(cons(head(u),tail(u)),u)**. % 1.45/1.67 93[0:Inp] || -> equal(cons(u,snoc(v,w)),snoc(cons(u,v),w))**. % 1.45/1.67 94[0:Inp] || leq(u,v)*+ leq(v,u)* -> equal(v,u). % 1.45/1.67 97[0:Inp] || elem(u,snoc(v,w))* -> elem(u,v) equal(u,w). % 1.45/1.67 100[0:Inp] || leq(u,s(v))* -> leq(u,v) equal(u,s(v)). % 1.45/1.67 113[0:Inp] || leq(s(zero),u) -> equal(u,host(skc6)) setIn(u,index(down,host(skc5)))* leq(host(skc5),u). % 1.45/1.67 119[0:Inp] || setIn(u,alive) setIn(v,alive) setIn(host(u),index(down,host(v)))* equal(index(status__dfg,host(u)),norm) equal(index(ldr,host(u)),host(u)) -> . % 1.45/1.67 124[0:Inp] || setIn(u,alive) setIn(v,alive) equal(host(w),host(u))* elem(m_Down(w),queue(host(v)))* equal(index(status__dfg,host(u)),norm) equal(index(ldr,host(u)),host(u))**+ -> . % 1.45/1.67 251[0:Res:31.0,119.3] || setIn(u,alive) setIn(host(skc8),index(down,host(u)))* equal(index(ldr,host(skc8)),host(skc8)) setIn(skc8,alive) -> . % 1.45/1.67 255[0:Res:31.0,124.4] || setIn(u,alive) elem(m_Down(v),queue(host(u)))* equal(host(v),host(skc8)) setIn(skc8,alive) equal(index(ldr,host(skc8)),host(skc8)) -> . % 1.45/1.67 304[0:Res:94.2,28.0] || leq(host(skc8),host(skc5))*l leq(host(skc5),host(skc8)) -> . % 1.45/1.67 342[0:Rew:50.0,251.2] || setIn(u,alive) setIn(host(skc8),index(down,host(u)))* equal(host(skc8),host(skc8)) setIn(skc8,alive) -> . % 1.45/1.67 343[0:Obv:342.2] || setIn(u,alive) setIn(host(skc8),index(down,host(u)))* setIn(skc8,alive) -> . % 1.45/1.67 344[0:MRR:343.2,4.0] || setIn(u,alive) setIn(host(skc8),index(down,host(u)))* -> . % 1.45/1.67 348[0:Rew:50.0,255.4] || setIn(u,alive) elem(m_Down(v),queue(host(u)))* equal(host(v),host(skc8)) setIn(skc8,alive) equal(host(skc8),host(skc8)) -> . % 1.45/1.67 349[0:Obv:348.4] || setIn(u,alive) elem(m_Down(v),queue(host(u)))* equal(host(v),host(skc8)) setIn(skc8,alive) -> . % 1.45/1.67 350[0:MRR:349.3,4.0] || setIn(u,alive) equal(host(v),host(skc8)) elem(m_Down(v),queue(host(u)))* -> . % 1.45/1.67 665[0:SpR:87.1,77.1] || equal(u,head(v)) -> equal(v,q_nil) elem(u,v)*. % 1.45/1.67 708[0:SpR:93.0,42.0] || -> equal(head(snoc(cons(u,v),w)),u)**. % 1.45/1.67 724[0:SpR:64.0,708.0] || -> equal(head(snoc(queue(host(skc5)),u)),m_Down(skc6))**. % 1.45/1.67 828[0:Res:665.2,97.0] || equal(u,head(snoc(v,w)))* -> equal(snoc(v,w),q_nil) elem(u,v)* equal(u,w). % 1.45/1.67 862[0:MRR:828.1,47.0] || equal(u,head(snoc(v,w)))*+ -> elem(u,v)* equal(u,w). % 1.45/1.67 1098[0:Res:48.0,51.0] || -> leq(host(skc8),s(host(skc5)))*r. % 1.45/1.67 1985[0:Res:1098.0,100.0] || -> leq(host(skc8),host(skc5)) equal(s(host(skc5)),host(skc8))**. % 1.45/1.67 2269[0:Res:113.2,344.1] || leq(s(zero),host(skc8)) setIn(skc5,alive)* -> equal(host(skc8),host(skc6)) leq(host(skc5),host(skc8)). % 1.45/1.67 2270[0:MRR:2269.0,2269.1,23.0,2.0] || -> equal(host(skc8),host(skc6)) leq(host(skc5),host(skc8))*r. % 1.45/1.67 3495[0:EqR:862.0] || -> elem(head(snoc(u,v)),u)* equal(head(snoc(u,v)),v). % 1.45/1.67 3536[0:SpR:708.0,3495.0] || -> elem(u,cons(u,v))* equal(head(snoc(cons(u,v),w)),w)**. % 1.45/1.67 3552[0:Rew:708.0,3536.1] || -> elem(u,cons(u,v))* equal(u,w)*. % 1.45/1.67 5263[0:SpR:87.1,3552.0] || -> equal(u,q_nil) elem(head(u),u)* equal(head(u),v)*. % 1.45/1.67 6664[0:AED:8.0,5263.2] || -> equal(u,q_nil) elem(head(u),u)*. % 1.45/1.67 6933[0:SpR:724.0,6664.1] || -> equal(snoc(queue(host(skc5)),u),q_nil) elem(m_Down(skc6),snoc(queue(host(skc5)),u))*. % 1.45/1.67 6955[0:MRR:6933.0,47.0] || -> elem(m_Down(skc6),snoc(queue(host(skc5)),u))*. % 1.45/1.67 6979[0:Res:6955.0,97.0] || -> elem(m_Down(skc6),queue(host(skc5)))* equal(m_Down(skc6),u)*. % 1.45/1.67 6980[0:AED:8.0,6979.1] || -> elem(m_Down(skc6),queue(host(skc5)))*. % 1.45/1.67 8227[0:Res:6980.0,350.2] || setIn(skc5,alive)* equal(host(skc8),host(skc6)) -> . % 1.45/1.67 8228[0:MRR:8227.0,2.0] || equal(host(skc8),host(skc6))** -> . % 1.45/1.67 8229[0:MRR:2270.0,8228.0] || -> leq(host(skc5),host(skc8))*r. % 1.45/1.67 8230[0:MRR:304.1,8229.0] || leq(host(skc8),host(skc5))*l -> . % 1.45/1.67 8231[0:MRR:1985.0,8230.0] || -> equal(s(host(skc5)),host(skc8))**. % 1.45/1.67 8295[0:Rew:8231.0,51.0] || leq(host(skc8),host(skc8))* -> . % 1.45/1.67 8317[0:MRR:8295.0,5.0] || -> . % 1.45/1.67 % SZS output end Refutation % 1.45/1.67 Formulae used in the proof : conj axiom_02 axiom_62 axiom_63 axiom_58 axiom_59 axiom_05 axiom_35 axiom_42 axiom_60 axiom_46 axiom_39 axiom_44 axiom_61 axiom_47 axiom_64 % 1.45/1.67 %------------------------------------------------------------------------------