/export/starexec/sandbox/solver/bin/starexec_run_Default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- NO Input TRS: 1: zeros() -> cons(0(),n__zeros()) 2: U11(tt(),L) -> U12(tt(),activate(L)) 3: U12(tt(),L) -> s(length(activate(L))) 4: U21(tt(),IL,M,N) -> U22(tt(),activate(IL),activate(M),activate(N)) 5: U22(tt(),IL,M,N) -> U23(tt(),activate(IL),activate(M),activate(N)) 6: U23(tt(),IL,M,N) -> cons(activate(N),n__take(activate(M),activate(IL))) 7: length(nil()) -> 0() 8: length(cons(N,L)) -> U11(tt(),activate(L)) 9: take(0(),IL) -> nil() 10: take(s(M),cons(N,IL)) -> U21(tt(),activate(IL),M,N) 11: zeros() -> n__zeros() 12: take(X1,X2) -> n__take(X1,X2) 13: activate(n__zeros()) -> zeros() 14: activate(n__take(X1,X2)) -> take(activate(X1),activate(X2)) 15: activate(X) -> X Number of strict rules: 15 Direct POLO(bPol) ... removes: 7 9 U21 w: x1 + x2 + x3 + x4 + 3 U11 w: 2 * x1 + x2 s w: x1 activate w: x1 take w: x1 + x2 + 5 n__zeros w: 1 U23 w: 2 * x1 + x2 + x3 + x4 + 1 zeros w: 1 U12 w: x1 + x2 + 2 0 w: 0 n__take w: x1 + x2 + 5 nil w: 4 cons w: x1 + x2 tt w: 2 U22 w: x1 + x2 + x3 + x4 + 3 length w: x1 + 4 Number of strict rules: 13 Direct POLO(bPol) ... failed. Uncurrying U12 U22 U23 U11 U21 1: zeros() -> cons(0(),n__zeros()) 2: U11^1_tt(L) -> U12^1_tt(activate(L)) 3: U12^1_tt(L) -> s(length(activate(L))) 4: U21^1_tt(IL,M,N) -> U22^1_tt(activate(IL),activate(M),activate(N)) 5: U22^1_tt(IL,M,N) -> U23^1_tt(activate(IL),activate(M),activate(N)) 6: U23^1_tt(IL,M,N) -> cons(activate(N),n__take(activate(M),activate(IL))) 8: length(cons(N,L)) -> U11^1_tt(activate(L)) 10: take(s(M),cons(N,IL)) -> U21^1_tt(activate(IL),M,N) 11: zeros() -> n__zeros() 12: take(X1,X2) -> n__take(X1,X2) 13: activate(n__zeros()) -> zeros() 14: activate(n__take(X1,X2)) -> take(activate(X1),activate(X2)) 15: activate(X) -> X 16: U21(tt(),_3,_4,_5) ->= U21^1_tt(_3,_4,_5) 17: U11(tt(),_1) ->= U11^1_tt(_1) 18: U23(tt(),_3,_4,_5) ->= U23^1_tt(_3,_4,_5) 19: U22(tt(),_3,_4,_5) ->= U22^1_tt(_3,_4,_5) 20: U12(tt(),_1) ->= U12^1_tt(_1) Number of strict rules: 13 Direct POLO(bPol) ... removes: 18 16 19 17 20 U21 w: x1 + 2 * x2 + 2 * x3 + 2 * x4 + 10 U11 w: x1 + 2 * x2 + 5 s w: x1 U23^1_tt w: x1 + 2 * x2 + x3 + 8 activate w: x1 take w: 2 * x1 + x2 + 8 n__zeros w: 1 U23 w: x1 + x2 + 2 * x3 + x4 + 9 zeros w: 1 U12 w: 2 * x1 + 2 * x2 U22^1_tt w: x1 + 2 * x2 + x3 + 8 0 w: 0 U21^1_tt w: x1 + 2 * x2 + x3 + 8 n__take w: 2 * x1 + x2 + 8 nil w: 0 U11^1_tt w: 2 * x1 U12^1_tt w: 2 * x1 cons w: x1 + x2 tt w: 1 U22 w: x1 + 2 * x2 + 2 * x3 + x4 + 10 length w: 2 * x1 Number of strict rules: 13 Direct POLO(bPol) ... failed. Dependency Pairs: #1: #U11^1_tt(L) -> #U12^1_tt(activate(L)) #2: #U11^1_tt(L) -> #activate(L) #3: #U23^1_tt(IL,M,N) -> #activate(N) #4: #U23^1_tt(IL,M,N) -> #activate(M) #5: #U23^1_tt(IL,M,N) -> #activate(IL) #6: #activate(n__zeros()) -> #zeros() #7: #activate(n__take(X1,X2)) -> #take(activate(X1),activate(X2)) #8: #activate(n__take(X1,X2)) -> #activate(X1) #9: #activate(n__take(X1,X2)) -> #activate(X2) #10: #take(s(M),cons(N,IL)) -> #U21^1_tt(activate(IL),M,N) #11: #take(s(M),cons(N,IL)) -> #activate(IL) #12: #U22^1_tt(IL,M,N) -> #U23^1_tt(activate(IL),activate(M),activate(N)) #13: #U22^1_tt(IL,M,N) -> #activate(IL) #14: #U22^1_tt(IL,M,N) -> #activate(M) #15: #U22^1_tt(IL,M,N) -> #activate(N) #16: #U12^1_tt(L) -> #length(activate(L)) #17: #U12^1_tt(L) -> #activate(L) #18: #length(cons(N,L)) -> #U11^1_tt(activate(L)) #19: #length(cons(N,L)) -> #activate(L) #20: #U21^1_tt(IL,M,N) -> #U22^1_tt(activate(IL),activate(M),activate(N)) #21: #U21^1_tt(IL,M,N) -> #activate(IL) #22: #U21^1_tt(IL,M,N) -> #activate(M) #23: #U21^1_tt(IL,M,N) -> #activate(N) Number of SCCs: 2, DPs: 19 SCC { #1 #16 #18 } POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed. Finding a loop... found. #length(cons(N,n__zeros())) -#18-> #U11^1_tt(activate(n__zeros())) --->* #U11^1_tt(activate(n__zeros())) -#1-> #U12^1_tt(activate(activate(n__zeros()))) --->* #U12^1_tt(activate(activate(n__zeros()))) -#16-> #length(activate(activate(activate(n__zeros())))) --->* #length(cons(0(),n__zeros())) Looping with: [ N := 0(); ]