/export/starexec/sandbox2/solver/bin/starexec_run_Default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- MAYBE Input TRS: 1: app(nil(),YS) -> YS 2: app(cons(X,XS),YS) -> cons(X,n__app(activate(XS),YS)) 3: from(X) -> cons(X,n__from(n__s(X))) 4: zWadr(nil(),YS) -> nil() 5: zWadr(XS,nil()) -> nil() 6: zWadr(cons(X,XS),cons(Y,YS)) -> cons(app(Y,cons(X,n__nil())),n__zWadr(activate(XS),activate(YS))) 7: prefix(L) -> cons(nil(),n__zWadr(L,n__prefix(L))) 8: app(X1,X2) -> n__app(X1,X2) 9: from(X) -> n__from(X) 10: s(X) -> n__s(X) 11: nil() -> n__nil() 12: zWadr(X1,X2) -> n__zWadr(X1,X2) 13: prefix(X) -> n__prefix(X) 14: activate(n__app(X1,X2)) -> app(activate(X1),activate(X2)) 15: activate(n__from(X)) -> from(activate(X)) 16: activate(n__s(X)) -> s(activate(X)) 17: activate(n__nil()) -> nil() 18: activate(n__zWadr(X1,X2)) -> zWadr(activate(X1),activate(X2)) 19: activate(n__prefix(X)) -> prefix(activate(X)) 20: activate(X) -> X Number of strict rules: 20 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #app(cons(X,XS),YS) -> #activate(XS) #2: #zWadr(cons(X,XS),cons(Y,YS)) -> #app(Y,cons(X,n__nil())) #3: #zWadr(cons(X,XS),cons(Y,YS)) -> #activate(XS) #4: #zWadr(cons(X,XS),cons(Y,YS)) -> #activate(YS) #5: #activate(n__app(X1,X2)) -> #app(activate(X1),activate(X2)) #6: #activate(n__app(X1,X2)) -> #activate(X1) #7: #activate(n__app(X1,X2)) -> #activate(X2) #8: #prefix(L) -> #nil() #9: #activate(n__nil()) -> #nil() #10: #activate(n__prefix(X)) -> #prefix(activate(X)) #11: #activate(n__prefix(X)) -> #activate(X) #12: #activate(n__s(X)) -> #s(activate(X)) #13: #activate(n__s(X)) -> #activate(X) #14: #activate(n__from(X)) -> #from(activate(X)) #15: #activate(n__from(X)) -> #activate(X) #16: #activate(n__zWadr(X1,X2)) -> #zWadr(activate(X1),activate(X2)) #17: #activate(n__zWadr(X1,X2)) -> #activate(X1) #18: #activate(n__zWadr(X1,X2)) -> #activate(X2) Number of SCCs: 1, DPs: 13 SCC { #1..7 #11 #13 #15..18 } POLO(Sum)... POLO(max)... succeeded. s w: x1 n__prefix w: x1 + 3 activate w: x1 n__from w: x1 + 1 #activate w: x1 + 1 prefix w: x1 + 3 #zWadr w: max(x1 + 2, x2 + 1) zWadr w: max(x1 + 3, x2) n__nil w: 1 n__zWadr w: max(x1 + 3, x2) n__s w: x1 from w: x1 + 1 n__app w: max(x1, x2 + 2) #s w: 0 nil w: 1 #prefix w: 0 #nil w: 0 #app w: max(x1 + 1) #from w: 0 cons w: max(x1 + 1, x2) app w: max(x1, x2 + 2) USABLE RULES: { 1..20 } Removed DPs: #2 #3 #7 #11 #15 #17 Number of SCCs: 1, DPs: 7 SCC { #1 #4..6 #13 #16 #18 } POLO(Sum)... succeeded. s w: x1 + 1 n__prefix w: 1 activate w: x1 n__from w: 1 #activate w: x1 prefix w: 1 #zWadr w: x2 zWadr w: x2 n__nil w: 0 n__zWadr w: x2 n__s w: x1 + 1 from w: 1 n__app w: x1 + x2 + 2 #s w: 0 nil w: 0 #prefix w: 0 #nil w: 0 #app w: x1 + 1 #from w: 0 cons w: x2 app w: x1 + x2 + 2 USABLE RULES: { 1..20 } Removed DPs: #1 #5 #6 #13 Number of SCCs: 1, DPs: 3 SCC { #4 #16 #18 } POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... succeeded. s w: 0 n__prefix w: max(x1 + 4, 0) activate w: max(x1, 0) n__from w: max(x1 + 1, 0) #activate w: max(x1 + 6, 0) prefix w: max(x1 + 4, 0) #zWadr w: max(x2 + 13, 0) zWadr w: max(x1 + 3, x2 + 7, 0) n__nil w: 13 n__zWadr w: max(x1 + 3, x2 + 7, 0) n__s w: 0 from w: max(x1 + 1, 0) n__app w: max(x1 + 4, x2 + 13, 0) #s w: max(x1 - 1, 0) nil w: 13 #prefix w: max(x1 - 1, 0) #nil w: 0 #app w: max(x2 - 1, 0) #from w: 0 cons w: max(x1 - 12, x2 - 7, 0) app w: max(x1 + 4, x2 + 13, 0) USABLE RULES: { 1..20 } Removed DPs: #18 Number of SCCs: 1, DPs: 2 SCC { #4 #16 } POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed. Finding a loop... failed.