/export/starexec/sandbox/solver/bin/starexec_run_ttt2-1.17+nonreach /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES Problem: fst(0(),Z) -> nil() fst(s(X),cons(Y,Z)) -> cons(Y,n__fst(activate(X),activate(Z))) from(X) -> cons(X,n__from(n__s(X))) add(0(),X) -> X add(s(X),Y) -> s(n__add(activate(X),Y)) len(nil()) -> 0() len(cons(X,Z)) -> s(n__len(activate(Z))) fst(X1,X2) -> n__fst(X1,X2) from(X) -> n__from(X) s(X) -> n__s(X) add(X1,X2) -> n__add(X1,X2) len(X) -> n__len(X) activate(n__fst(X1,X2)) -> fst(activate(X1),activate(X2)) activate(n__from(X)) -> from(activate(X)) activate(n__s(X)) -> s(X) activate(n__add(X1,X2)) -> add(activate(X1),activate(X2)) activate(n__len(X)) -> len(activate(X)) activate(X) -> X Proof: DP Processor: DPs: fst#(s(X),cons(Y,Z)) -> activate#(Z) fst#(s(X),cons(Y,Z)) -> activate#(X) add#(s(X),Y) -> activate#(X) add#(s(X),Y) -> s#(n__add(activate(X),Y)) len#(cons(X,Z)) -> activate#(Z) len#(cons(X,Z)) -> s#(n__len(activate(Z))) activate#(n__fst(X1,X2)) -> activate#(X2) activate#(n__fst(X1,X2)) -> activate#(X1) activate#(n__fst(X1,X2)) -> fst#(activate(X1),activate(X2)) activate#(n__from(X)) -> activate#(X) activate#(n__from(X)) -> from#(activate(X)) activate#(n__s(X)) -> s#(X) activate#(n__add(X1,X2)) -> activate#(X2) activate#(n__add(X1,X2)) -> activate#(X1) activate#(n__add(X1,X2)) -> add#(activate(X1),activate(X2)) activate#(n__len(X)) -> activate#(X) activate#(n__len(X)) -> len#(activate(X)) TRS: fst(0(),Z) -> nil() fst(s(X),cons(Y,Z)) -> cons(Y,n__fst(activate(X),activate(Z))) from(X) -> cons(X,n__from(n__s(X))) add(0(),X) -> X add(s(X),Y) -> s(n__add(activate(X),Y)) len(nil()) -> 0() len(cons(X,Z)) -> s(n__len(activate(Z))) fst(X1,X2) -> n__fst(X1,X2) from(X) -> n__from(X) s(X) -> n__s(X) add(X1,X2) -> n__add(X1,X2) len(X) -> n__len(X) activate(n__fst(X1,X2)) -> fst(activate(X1),activate(X2)) activate(n__from(X)) -> from(activate(X)) activate(n__s(X)) -> s(X) activate(n__add(X1,X2)) -> add(activate(X1),activate(X2)) activate(n__len(X)) -> len(activate(X)) activate(X) -> X TDG Processor: DPs: fst#(s(X),cons(Y,Z)) -> activate#(Z) fst#(s(X),cons(Y,Z)) -> activate#(X) add#(s(X),Y) -> activate#(X) add#(s(X),Y) -> s#(n__add(activate(X),Y)) len#(cons(X,Z)) -> activate#(Z) len#(cons(X,Z)) -> s#(n__len(activate(Z))) activate#(n__fst(X1,X2)) -> activate#(X2) activate#(n__fst(X1,X2)) -> activate#(X1) activate#(n__fst(X1,X2)) -> fst#(activate(X1),activate(X2)) activate#(n__from(X)) -> activate#(X) activate#(n__from(X)) -> from#(activate(X)) activate#(n__s(X)) -> s#(X) activate#(n__add(X1,X2)) -> activate#(X2) activate#(n__add(X1,X2)) -> activate#(X1) activate#(n__add(X1,X2)) -> add#(activate(X1),activate(X2)) activate#(n__len(X)) -> activate#(X) activate#(n__len(X)) -> len#(activate(X)) TRS: fst(0(),Z) -> nil() fst(s(X),cons(Y,Z)) -> cons(Y,n__fst(activate(X),activate(Z))) from(X) -> cons(X,n__from(n__s(X))) add(0(),X) -> X add(s(X),Y) -> s(n__add(activate(X),Y)) len(nil()) -> 0() len(cons(X,Z)) -> s(n__len(activate(Z))) fst(X1,X2) -> n__fst(X1,X2) from(X) -> n__from(X) s(X) -> n__s(X) add(X1,X2) -> n__add(X1,X2) len(X) -> n__len(X) activate(n__fst(X1,X2)) -> fst(activate(X1),activate(X2)) activate(n__from(X)) -> from(activate(X)) activate(n__s(X)) -> s(X) activate(n__add(X1,X2)) -> add(activate(X1),activate(X2)) activate(n__len(X)) -> len(activate(X)) activate(X) -> X graph: len#(cons(X,Z)) -> activate#(Z) -> activate#(n__len(X)) -> len#(activate(X)) len#(cons(X,Z)) -> activate#(Z) -> activate#(n__len(X)) -> activate#(X) len#(cons(X,Z)) -> activate#(Z) -> activate#(n__add(X1,X2)) -> add#(activate(X1),activate(X2)) len#(cons(X,Z)) -> activate#(Z) -> activate#(n__add(X1,X2)) -> activate#(X1) len#(cons(X,Z)) -> activate#(Z) -> activate#(n__add(X1,X2)) -> activate#(X2) len#(cons(X,Z)) -> activate#(Z) -> activate#(n__s(X)) -> s#(X) len#(cons(X,Z)) -> activate#(Z) -> activate#(n__from(X)) -> from#(activate(X)) len#(cons(X,Z)) -> activate#(Z) -> activate#(n__from(X)) -> activate#(X) len#(cons(X,Z)) -> activate#(Z) -> activate#(n__fst(X1,X2)) -> fst#(activate(X1),activate(X2)) len#(cons(X,Z)) -> activate#(Z) -> activate#(n__fst(X1,X2)) -> activate#(X1) len#(cons(X,Z)) -> activate#(Z) -> activate#(n__fst(X1,X2)) -> activate#(X2) add#(s(X),Y) -> activate#(X) -> activate#(n__len(X)) -> len#(activate(X)) add#(s(X),Y) -> activate#(X) -> activate#(n__len(X)) -> activate#(X) add#(s(X),Y) -> activate#(X) -> activate#(n__add(X1,X2)) -> add#(activate(X1),activate(X2)) add#(s(X),Y) -> activate#(X) -> activate#(n__add(X1,X2)) -> activate#(X1) add#(s(X),Y) -> activate#(X) -> activate#(n__add(X1,X2)) -> activate#(X2) add#(s(X),Y) -> activate#(X) -> activate#(n__s(X)) -> s#(X) add#(s(X),Y) -> activate#(X) -> activate#(n__from(X)) -> from#(activate(X)) add#(s(X),Y) -> activate#(X) -> activate#(n__from(X)) -> activate#(X) add#(s(X),Y) -> activate#(X) -> activate#(n__fst(X1,X2)) -> fst#(activate(X1),activate(X2)) add#(s(X),Y) -> activate#(X) -> activate#(n__fst(X1,X2)) -> activate#(X1) add#(s(X),Y) -> activate#(X) -> activate#(n__fst(X1,X2)) -> activate#(X2) activate#(n__len(X)) -> len#(activate(X)) -> len#(cons(X,Z)) -> s#(n__len(activate(Z))) activate#(n__len(X)) -> len#(activate(X)) -> len#(cons(X,Z)) -> activate#(Z) activate#(n__len(X)) -> activate#(X) -> activate#(n__len(X)) -> len#(activate(X)) activate#(n__len(X)) -> activate#(X) -> activate#(n__len(X)) -> activate#(X) activate#(n__len(X)) -> activate#(X) -> activate#(n__add(X1,X2)) -> add#(activate(X1),activate(X2)) activate#(n__len(X)) -> activate#(X) -> activate#(n__add(X1,X2)) -> activate#(X1) activate#(n__len(X)) -> activate#(X) -> activate#(n__add(X1,X2)) -> activate#(X2) activate#(n__len(X)) -> activate#(X) -> activate#(n__s(X)) -> s#(X) activate#(n__len(X)) -> activate#(X) -> activate#(n__from(X)) -> from#(activate(X)) activate#(n__len(X)) -> activate#(X) -> activate#(n__from(X)) -> activate#(X) activate#(n__len(X)) -> activate#(X) -> activate#(n__fst(X1,X2)) -> fst#(activate(X1),activate(X2)) activate#(n__len(X)) -> activate#(X) -> activate#(n__fst(X1,X2)) -> activate#(X1) activate#(n__len(X)) -> activate#(X) -> activate#(n__fst(X1,X2)) -> activate#(X2) activate#(n__add(X1,X2)) -> add#(activate(X1),activate(X2)) -> add#(s(X),Y) -> s#(n__add(activate(X),Y)) activate#(n__add(X1,X2)) -> add#(activate(X1),activate(X2)) -> add#(s(X),Y) -> activate#(X) activate#(n__add(X1,X2)) -> activate#(X2) -> activate#(n__len(X)) -> len#(activate(X)) activate#(n__add(X1,X2)) -> activate#(X2) -> activate#(n__len(X)) -> activate#(X) activate#(n__add(X1,X2)) -> activate#(X2) -> activate#(n__add(X1,X2)) -> add#(activate(X1),activate(X2)) activate#(n__add(X1,X2)) -> activate#(X2) -> activate#(n__add(X1,X2)) -> activate#(X1) activate#(n__add(X1,X2)) -> activate#(X2) -> activate#(n__add(X1,X2)) -> activate#(X2) activate#(n__add(X1,X2)) -> activate#(X2) -> activate#(n__s(X)) -> s#(X) activate#(n__add(X1,X2)) -> activate#(X2) -> activate#(n__from(X)) -> from#(activate(X)) activate#(n__add(X1,X2)) -> activate#(X2) -> activate#(n__from(X)) -> activate#(X) activate#(n__add(X1,X2)) -> activate#(X2) -> activate#(n__fst(X1,X2)) -> fst#(activate(X1),activate(X2)) activate#(n__add(X1,X2)) -> activate#(X2) -> activate#(n__fst(X1,X2)) -> activate#(X1) activate#(n__add(X1,X2)) -> activate#(X2) -> activate#(n__fst(X1,X2)) -> activate#(X2) activate#(n__add(X1,X2)) -> activate#(X1) -> activate#(n__len(X)) -> len#(activate(X)) activate#(n__add(X1,X2)) -> activate#(X1) -> activate#(n__len(X)) -> activate#(X) activate#(n__add(X1,X2)) -> activate#(X1) -> activate#(n__add(X1,X2)) -> add#(activate(X1),activate(X2)) activate#(n__add(X1,X2)) -> activate#(X1) -> activate#(n__add(X1,X2)) -> activate#(X1) activate#(n__add(X1,X2)) -> activate#(X1) -> activate#(n__add(X1,X2)) -> activate#(X2) activate#(n__add(X1,X2)) -> activate#(X1) -> activate#(n__s(X)) -> s#(X) activate#(n__add(X1,X2)) -> activate#(X1) -> activate#(n__from(X)) -> from#(activate(X)) activate#(n__add(X1,X2)) -> activate#(X1) -> activate#(n__from(X)) -> activate#(X) activate#(n__add(X1,X2)) -> activate#(X1) -> activate#(n__fst(X1,X2)) -> fst#(activate(X1),activate(X2)) activate#(n__add(X1,X2)) -> activate#(X1) -> activate#(n__fst(X1,X2)) -> activate#(X1) activate#(n__add(X1,X2)) -> activate#(X1) -> activate#(n__fst(X1,X2)) -> activate#(X2) activate#(n__from(X)) -> activate#(X) -> activate#(n__len(X)) -> len#(activate(X)) activate#(n__from(X)) -> activate#(X) -> activate#(n__len(X)) -> activate#(X) activate#(n__from(X)) -> activate#(X) -> activate#(n__add(X1,X2)) -> add#(activate(X1),activate(X2)) activate#(n__from(X)) -> activate#(X) -> activate#(n__add(X1,X2)) -> activate#(X1) activate#(n__from(X)) -> activate#(X) -> activate#(n__add(X1,X2)) -> activate#(X2) activate#(n__from(X)) -> activate#(X) -> activate#(n__s(X)) -> s#(X) activate#(n__from(X)) -> activate#(X) -> activate#(n__from(X)) -> from#(activate(X)) activate#(n__from(X)) -> activate#(X) -> activate#(n__from(X)) -> activate#(X) activate#(n__from(X)) -> activate#(X) -> activate#(n__fst(X1,X2)) -> fst#(activate(X1),activate(X2)) activate#(n__from(X)) -> activate#(X) -> activate#(n__fst(X1,X2)) -> activate#(X1) activate#(n__from(X)) -> activate#(X) -> activate#(n__fst(X1,X2)) -> activate#(X2) activate#(n__fst(X1,X2)) -> activate#(X2) -> activate#(n__len(X)) -> len#(activate(X)) activate#(n__fst(X1,X2)) -> activate#(X2) -> activate#(n__len(X)) -> activate#(X) activate#(n__fst(X1,X2)) -> activate#(X2) -> activate#(n__add(X1,X2)) -> add#(activate(X1),activate(X2)) activate#(n__fst(X1,X2)) -> activate#(X2) -> activate#(n__add(X1,X2)) -> activate#(X1) activate#(n__fst(X1,X2)) -> activate#(X2) -> activate#(n__add(X1,X2)) -> activate#(X2) activate#(n__fst(X1,X2)) -> activate#(X2) -> activate#(n__s(X)) -> s#(X) activate#(n__fst(X1,X2)) -> activate#(X2) -> activate#(n__from(X)) -> from#(activate(X)) activate#(n__fst(X1,X2)) -> activate#(X2) -> activate#(n__from(X)) -> activate#(X) activate#(n__fst(X1,X2)) -> activate#(X2) -> activate#(n__fst(X1,X2)) -> fst#(activate(X1),activate(X2)) activate#(n__fst(X1,X2)) -> activate#(X2) -> activate#(n__fst(X1,X2)) -> activate#(X1) activate#(n__fst(X1,X2)) -> activate#(X2) -> activate#(n__fst(X1,X2)) -> activate#(X2) activate#(n__fst(X1,X2)) -> activate#(X1) -> activate#(n__len(X)) -> len#(activate(X)) activate#(n__fst(X1,X2)) -> activate#(X1) -> activate#(n__len(X)) -> activate#(X) activate#(n__fst(X1,X2)) -> activate#(X1) -> activate#(n__add(X1,X2)) -> add#(activate(X1),activate(X2)) activate#(n__fst(X1,X2)) -> activate#(X1) -> activate#(n__add(X1,X2)) -> activate#(X1) activate#(n__fst(X1,X2)) -> activate#(X1) -> activate#(n__add(X1,X2)) -> activate#(X2) activate#(n__fst(X1,X2)) -> activate#(X1) -> activate#(n__s(X)) -> s#(X) activate#(n__fst(X1,X2)) -> activate#(X1) -> activate#(n__from(X)) -> from#(activate(X)) activate#(n__fst(X1,X2)) -> activate#(X1) -> activate#(n__from(X)) -> activate#(X) activate#(n__fst(X1,X2)) -> activate#(X1) -> activate#(n__fst(X1,X2)) -> fst#(activate(X1),activate(X2)) activate#(n__fst(X1,X2)) -> activate#(X1) -> activate#(n__fst(X1,X2)) -> activate#(X1) activate#(n__fst(X1,X2)) -> activate#(X1) -> activate#(n__fst(X1,X2)) -> activate#(X2) activate#(n__fst(X1,X2)) -> fst#(activate(X1),activate(X2)) -> fst#(s(X),cons(Y,Z)) -> activate#(X) activate#(n__fst(X1,X2)) -> fst#(activate(X1),activate(X2)) -> fst#(s(X),cons(Y,Z)) -> activate#(Z) fst#(s(X),cons(Y,Z)) -> activate#(X) -> activate#(n__len(X)) -> len#(activate(X)) fst#(s(X),cons(Y,Z)) -> activate#(X) -> activate#(n__len(X)) -> activate#(X) fst#(s(X),cons(Y,Z)) -> activate#(X) -> activate#(n__add(X1,X2)) -> add#(activate(X1),activate(X2)) fst#(s(X),cons(Y,Z)) -> activate#(X) -> activate#(n__add(X1,X2)) -> activate#(X1) fst#(s(X),cons(Y,Z)) -> activate#(X) -> activate#(n__add(X1,X2)) -> activate#(X2) fst#(s(X),cons(Y,Z)) -> activate#(X) -> activate#(n__s(X)) -> s#(X) fst#(s(X),cons(Y,Z)) -> activate#(X) -> activate#(n__from(X)) -> from#(activate(X)) fst#(s(X),cons(Y,Z)) -> activate#(X) -> activate#(n__from(X)) -> activate#(X) fst#(s(X),cons(Y,Z)) -> activate#(X) -> activate#(n__fst(X1,X2)) -> fst#(activate(X1),activate(X2)) fst#(s(X),cons(Y,Z)) -> activate#(X) -> activate#(n__fst(X1,X2)) -> activate#(X1) fst#(s(X),cons(Y,Z)) -> activate#(X) -> activate#(n__fst(X1,X2)) -> activate#(X2) fst#(s(X),cons(Y,Z)) -> activate#(Z) -> activate#(n__len(X)) -> len#(activate(X)) fst#(s(X),cons(Y,Z)) -> activate#(Z) -> activate#(n__len(X)) -> activate#(X) fst#(s(X),cons(Y,Z)) -> activate#(Z) -> activate#(n__add(X1,X2)) -> add#(activate(X1),activate(X2)) fst#(s(X),cons(Y,Z)) -> activate#(Z) -> activate#(n__add(X1,X2)) -> activate#(X1) fst#(s(X),cons(Y,Z)) -> activate#(Z) -> activate#(n__add(X1,X2)) -> activate#(X2) fst#(s(X),cons(Y,Z)) -> activate#(Z) -> activate#(n__s(X)) -> s#(X) fst#(s(X),cons(Y,Z)) -> activate#(Z) -> activate#(n__from(X)) -> from#(activate(X)) fst#(s(X),cons(Y,Z)) -> activate#(Z) -> activate#(n__from(X)) -> activate#(X) fst#(s(X),cons(Y,Z)) -> activate#(Z) -> activate#(n__fst(X1,X2)) -> fst#(activate(X1),activate(X2)) fst#(s(X),cons(Y,Z)) -> activate#(Z) -> activate#(n__fst(X1,X2)) -> activate#(X1) fst#(s(X),cons(Y,Z)) -> activate#(Z) -> activate#(n__fst(X1,X2)) -> activate#(X2) SCC Processor: #sccs: 1 #rules: 13 #arcs: 116/289 DPs: len#(cons(X,Z)) -> activate#(Z) activate#(n__fst(X1,X2)) -> activate#(X2) activate#(n__fst(X1,X2)) -> activate#(X1) activate#(n__fst(X1,X2)) -> fst#(activate(X1),activate(X2)) fst#(s(X),cons(Y,Z)) -> activate#(Z) activate#(n__from(X)) -> activate#(X) activate#(n__add(X1,X2)) -> activate#(X2) activate#(n__add(X1,X2)) -> activate#(X1) activate#(n__add(X1,X2)) -> add#(activate(X1),activate(X2)) add#(s(X),Y) -> activate#(X) activate#(n__len(X)) -> activate#(X) activate#(n__len(X)) -> len#(activate(X)) fst#(s(X),cons(Y,Z)) -> activate#(X) TRS: fst(0(),Z) -> nil() fst(s(X),cons(Y,Z)) -> cons(Y,n__fst(activate(X),activate(Z))) from(X) -> cons(X,n__from(n__s(X))) add(0(),X) -> X add(s(X),Y) -> s(n__add(activate(X),Y)) len(nil()) -> 0() len(cons(X,Z)) -> s(n__len(activate(Z))) fst(X1,X2) -> n__fst(X1,X2) from(X) -> n__from(X) s(X) -> n__s(X) add(X1,X2) -> n__add(X1,X2) len(X) -> n__len(X) activate(n__fst(X1,X2)) -> fst(activate(X1),activate(X2)) activate(n__from(X)) -> from(activate(X)) activate(n__s(X)) -> s(X) activate(n__add(X1,X2)) -> add(activate(X1),activate(X2)) activate(n__len(X)) -> len(activate(X)) activate(X) -> X Arctic Interpretation Processor: dimension: 1 usable rules: fst(0(),Z) -> nil() fst(s(X),cons(Y,Z)) -> cons(Y,n__fst(activate(X),activate(Z))) from(X) -> cons(X,n__from(n__s(X))) add(0(),X) -> X add(s(X),Y) -> s(n__add(activate(X),Y)) len(nil()) -> 0() len(cons(X,Z)) -> s(n__len(activate(Z))) fst(X1,X2) -> n__fst(X1,X2) from(X) -> n__from(X) s(X) -> n__s(X) add(X1,X2) -> n__add(X1,X2) len(X) -> n__len(X) activate(n__fst(X1,X2)) -> fst(activate(X1),activate(X2)) activate(n__from(X)) -> from(activate(X)) activate(n__s(X)) -> s(X) activate(n__add(X1,X2)) -> add(activate(X1),activate(X2)) activate(n__len(X)) -> len(activate(X)) activate(X) -> X interpretation: [len#](x0) = 1x0 + 0, [add#](x0, x1) = 1x0 + 1x1 + 0, [activate#](x0) = 1x0 + 0, [fst#](x0, x1) = 4x0 + 1x1 + 0, [n__len](x0) = x0, [len](x0) = x0, [n__add](x0, x1) = 2x0 + x1, [add](x0, x1) = 2x0 + x1, [n__from](x0) = x0, [n__s](x0) = x0, [from](x0) = x0, [n__fst](x0, x1) = 6x0 + 1x1 + 0, [activate](x0) = x0, [cons](x0, x1) = x0 + x1, [s](x0) = x0, [nil] = 1, [fst](x0, x1) = 6x0 + 1x1 + 0, [0] = 0 orientation: len#(cons(X,Z)) = 1X + 1Z + 0 >= 1Z + 0 = activate#(Z) activate#(n__fst(X1,X2)) = 7X1 + 2X2 + 1 >= 1X2 + 0 = activate#(X2) activate#(n__fst(X1,X2)) = 7X1 + 2X2 + 1 >= 1X1 + 0 = activate#(X1) activate#(n__fst(X1,X2)) = 7X1 + 2X2 + 1 >= 4X1 + 1X2 + 0 = fst#(activate(X1),activate(X2)) fst#(s(X),cons(Y,Z)) = 4X + 1Y + 1Z + 0 >= 1Z + 0 = activate#(Z) activate#(n__from(X)) = 1X + 0 >= 1X + 0 = activate#(X) activate#(n__add(X1,X2)) = 3X1 + 1X2 + 0 >= 1X2 + 0 = activate#(X2) activate#(n__add(X1,X2)) = 3X1 + 1X2 + 0 >= 1X1 + 0 = activate#(X1) activate#(n__add(X1,X2)) = 3X1 + 1X2 + 0 >= 1X1 + 1X2 + 0 = add#(activate(X1),activate(X2)) add#(s(X),Y) = 1X + 1Y + 0 >= 1X + 0 = activate#(X) activate#(n__len(X)) = 1X + 0 >= 1X + 0 = activate#(X) activate#(n__len(X)) = 1X + 0 >= 1X + 0 = len#(activate(X)) fst#(s(X),cons(Y,Z)) = 4X + 1Y + 1Z + 0 >= 1X + 0 = activate#(X) fst(0(),Z) = 1Z + 6 >= 1 = nil() fst(s(X),cons(Y,Z)) = 6X + 1Y + 1Z + 0 >= 6X + Y + 1Z + 0 = cons(Y,n__fst(activate(X),activate(Z))) from(X) = X >= X = cons(X,n__from(n__s(X))) add(0(),X) = X + 2 >= X = X add(s(X),Y) = 2X + Y >= 2X + Y = s(n__add(activate(X),Y)) len(nil()) = 1 >= 0 = 0() len(cons(X,Z)) = X + Z >= Z = s(n__len(activate(Z))) fst(X1,X2) = 6X1 + 1X2 + 0 >= 6X1 + 1X2 + 0 = n__fst(X1,X2) from(X) = X >= X = n__from(X) s(X) = X >= X = n__s(X) add(X1,X2) = 2X1 + X2 >= 2X1 + X2 = n__add(X1,X2) len(X) = X >= X = n__len(X) activate(n__fst(X1,X2)) = 6X1 + 1X2 + 0 >= 6X1 + 1X2 + 0 = fst(activate(X1),activate(X2)) activate(n__from(X)) = X >= X = from(activate(X)) activate(n__s(X)) = X >= X = s(X) activate(n__add(X1,X2)) = 2X1 + X2 >= 2X1 + X2 = add(activate(X1),activate(X2)) activate(n__len(X)) = X >= X = len(activate(X)) activate(X) = X >= X = X problem: DPs: len#(cons(X,Z)) -> activate#(Z) fst#(s(X),cons(Y,Z)) -> activate#(Z) activate#(n__from(X)) -> activate#(X) activate#(n__add(X1,X2)) -> activate#(X2) activate#(n__add(X1,X2)) -> activate#(X1) activate#(n__add(X1,X2)) -> add#(activate(X1),activate(X2)) add#(s(X),Y) -> activate#(X) activate#(n__len(X)) -> activate#(X) activate#(n__len(X)) -> len#(activate(X)) fst#(s(X),cons(Y,Z)) -> activate#(X) TRS: fst(0(),Z) -> nil() fst(s(X),cons(Y,Z)) -> cons(Y,n__fst(activate(X),activate(Z))) from(X) -> cons(X,n__from(n__s(X))) add(0(),X) -> X add(s(X),Y) -> s(n__add(activate(X),Y)) len(nil()) -> 0() len(cons(X,Z)) -> s(n__len(activate(Z))) fst(X1,X2) -> n__fst(X1,X2) from(X) -> n__from(X) s(X) -> n__s(X) add(X1,X2) -> n__add(X1,X2) len(X) -> n__len(X) activate(n__fst(X1,X2)) -> fst(activate(X1),activate(X2)) activate(n__from(X)) -> from(activate(X)) activate(n__s(X)) -> s(X) activate(n__add(X1,X2)) -> add(activate(X1),activate(X2)) activate(n__len(X)) -> len(activate(X)) activate(X) -> X Restore Modifier: DPs: len#(cons(X,Z)) -> activate#(Z) fst#(s(X),cons(Y,Z)) -> activate#(Z) activate#(n__from(X)) -> activate#(X) activate#(n__add(X1,X2)) -> activate#(X2) activate#(n__add(X1,X2)) -> activate#(X1) activate#(n__add(X1,X2)) -> add#(activate(X1),activate(X2)) add#(s(X),Y) -> activate#(X) activate#(n__len(X)) -> activate#(X) activate#(n__len(X)) -> len#(activate(X)) fst#(s(X),cons(Y,Z)) -> activate#(X) TRS: fst(0(),Z) -> nil() fst(s(X),cons(Y,Z)) -> cons(Y,n__fst(activate(X),activate(Z))) from(X) -> cons(X,n__from(n__s(X))) add(0(),X) -> X add(s(X),Y) -> s(n__add(activate(X),Y)) len(nil()) -> 0() len(cons(X,Z)) -> s(n__len(activate(Z))) fst(X1,X2) -> n__fst(X1,X2) from(X) -> n__from(X) s(X) -> n__s(X) add(X1,X2) -> n__add(X1,X2) len(X) -> n__len(X) activate(n__fst(X1,X2)) -> fst(activate(X1),activate(X2)) activate(n__from(X)) -> from(activate(X)) activate(n__s(X)) -> s(X) activate(n__add(X1,X2)) -> add(activate(X1),activate(X2)) activate(n__len(X)) -> len(activate(X)) activate(X) -> X SCC Processor: #sccs: 1 #rules: 8 #arcs: 94/100 DPs: len#(cons(X,Z)) -> activate#(Z) activate#(n__from(X)) -> activate#(X) activate#(n__add(X1,X2)) -> activate#(X2) activate#(n__add(X1,X2)) -> activate#(X1) activate#(n__add(X1,X2)) -> add#(activate(X1),activate(X2)) add#(s(X),Y) -> activate#(X) activate#(n__len(X)) -> activate#(X) activate#(n__len(X)) -> len#(activate(X)) TRS: fst(0(),Z) -> nil() fst(s(X),cons(Y,Z)) -> cons(Y,n__fst(activate(X),activate(Z))) from(X) -> cons(X,n__from(n__s(X))) add(0(),X) -> X add(s(X),Y) -> s(n__add(activate(X),Y)) len(nil()) -> 0() len(cons(X,Z)) -> s(n__len(activate(Z))) fst(X1,X2) -> n__fst(X1,X2) from(X) -> n__from(X) s(X) -> n__s(X) add(X1,X2) -> n__add(X1,X2) len(X) -> n__len(X) activate(n__fst(X1,X2)) -> fst(activate(X1),activate(X2)) activate(n__from(X)) -> from(activate(X)) activate(n__s(X)) -> s(X) activate(n__add(X1,X2)) -> add(activate(X1),activate(X2)) activate(n__len(X)) -> len(activate(X)) activate(X) -> X Arctic Interpretation Processor: dimension: 1 usable rules: fst(0(),Z) -> nil() fst(s(X),cons(Y,Z)) -> cons(Y,n__fst(activate(X),activate(Z))) from(X) -> cons(X,n__from(n__s(X))) add(0(),X) -> X add(s(X),Y) -> s(n__add(activate(X),Y)) len(nil()) -> 0() len(cons(X,Z)) -> s(n__len(activate(Z))) fst(X1,X2) -> n__fst(X1,X2) from(X) -> n__from(X) s(X) -> n__s(X) add(X1,X2) -> n__add(X1,X2) len(X) -> n__len(X) activate(n__fst(X1,X2)) -> fst(activate(X1),activate(X2)) activate(n__from(X)) -> from(activate(X)) activate(n__s(X)) -> s(X) activate(n__add(X1,X2)) -> add(activate(X1),activate(X2)) activate(n__len(X)) -> len(activate(X)) activate(X) -> X interpretation: [len#](x0) = x0 + 0, [add#](x0, x1) = x0 + x1 + 0, [activate#](x0) = x0 + 0, [n__len](x0) = x0, [len](x0) = x0 + 0, [n__add](x0, x1) = x0 + x1, [add](x0, x1) = x0 + x1 + 0, [n__from](x0) = 3x0 + 3, [n__s](x0) = x0, [from](x0) = 3x0 + 3, [n__fst](x0, x1) = x0 + x1, [activate](x0) = x0 + 0, [cons](x0, x1) = x1 + 0, [s](x0) = x0 + 0, [nil] = 0, [fst](x0, x1) = x0 + x1 + 0, [0] = 0 orientation: len#(cons(X,Z)) = Z + 0 >= Z + 0 = activate#(Z) activate#(n__from(X)) = 3X + 3 >= X + 0 = activate#(X) activate#(n__add(X1,X2)) = X1 + X2 + 0 >= X2 + 0 = activate#(X2) activate#(n__add(X1,X2)) = X1 + X2 + 0 >= X1 + 0 = activate#(X1) activate#(n__add(X1,X2)) = X1 + X2 + 0 >= X1 + X2 + 0 = add#(activate(X1),activate(X2)) add#(s(X),Y) = X + Y + 0 >= X + 0 = activate#(X) activate#(n__len(X)) = X + 0 >= X + 0 = activate#(X) activate#(n__len(X)) = X + 0 >= X + 0 = len#(activate(X)) fst(0(),Z) = Z + 0 >= 0 = nil() fst(s(X),cons(Y,Z)) = X + Z + 0 >= X + Z + 0 = cons(Y,n__fst(activate(X),activate(Z))) from(X) = 3X + 3 >= 3X + 3 = cons(X,n__from(n__s(X))) add(0(),X) = X + 0 >= X = X add(s(X),Y) = X + Y + 0 >= X + Y + 0 = s(n__add(activate(X),Y)) len(nil()) = 0 >= 0 = 0() len(cons(X,Z)) = Z + 0 >= Z + 0 = s(n__len(activate(Z))) fst(X1,X2) = X1 + X2 + 0 >= X1 + X2 = n__fst(X1,X2) from(X) = 3X + 3 >= 3X + 3 = n__from(X) s(X) = X + 0 >= X = n__s(X) add(X1,X2) = X1 + X2 + 0 >= X1 + X2 = n__add(X1,X2) len(X) = X + 0 >= X = n__len(X) activate(n__fst(X1,X2)) = X1 + X2 + 0 >= X1 + X2 + 0 = fst(activate(X1),activate(X2)) activate(n__from(X)) = 3X + 3 >= 3X + 3 = from(activate(X)) activate(n__s(X)) = X + 0 >= X + 0 = s(X) activate(n__add(X1,X2)) = X1 + X2 + 0 >= X1 + X2 + 0 = add(activate(X1),activate(X2)) activate(n__len(X)) = X + 0 >= X + 0 = len(activate(X)) activate(X) = X + 0 >= X = X problem: DPs: len#(cons(X,Z)) -> activate#(Z) activate#(n__add(X1,X2)) -> activate#(X2) activate#(n__add(X1,X2)) -> activate#(X1) activate#(n__add(X1,X2)) -> add#(activate(X1),activate(X2)) add#(s(X),Y) -> activate#(X) activate#(n__len(X)) -> activate#(X) activate#(n__len(X)) -> len#(activate(X)) TRS: fst(0(),Z) -> nil() fst(s(X),cons(Y,Z)) -> cons(Y,n__fst(activate(X),activate(Z))) from(X) -> cons(X,n__from(n__s(X))) add(0(),X) -> X add(s(X),Y) -> s(n__add(activate(X),Y)) len(nil()) -> 0() len(cons(X,Z)) -> s(n__len(activate(Z))) fst(X1,X2) -> n__fst(X1,X2) from(X) -> n__from(X) s(X) -> n__s(X) add(X1,X2) -> n__add(X1,X2) len(X) -> n__len(X) activate(n__fst(X1,X2)) -> fst(activate(X1),activate(X2)) activate(n__from(X)) -> from(activate(X)) activate(n__s(X)) -> s(X) activate(n__add(X1,X2)) -> add(activate(X1),activate(X2)) activate(n__len(X)) -> len(activate(X)) activate(X) -> X Restore Modifier: DPs: len#(cons(X,Z)) -> activate#(Z) activate#(n__add(X1,X2)) -> activate#(X2) activate#(n__add(X1,X2)) -> activate#(X1) activate#(n__add(X1,X2)) -> add#(activate(X1),activate(X2)) add#(s(X),Y) -> activate#(X) activate#(n__len(X)) -> activate#(X) activate#(n__len(X)) -> len#(activate(X)) TRS: fst(0(),Z) -> nil() fst(s(X),cons(Y,Z)) -> cons(Y,n__fst(activate(X),activate(Z))) from(X) -> cons(X,n__from(n__s(X))) add(0(),X) -> X add(s(X),Y) -> s(n__add(activate(X),Y)) len(nil()) -> 0() len(cons(X,Z)) -> s(n__len(activate(Z))) fst(X1,X2) -> n__fst(X1,X2) from(X) -> n__from(X) s(X) -> n__s(X) add(X1,X2) -> n__add(X1,X2) len(X) -> n__len(X) activate(n__fst(X1,X2)) -> fst(activate(X1),activate(X2)) activate(n__from(X)) -> from(activate(X)) activate(n__s(X)) -> s(X) activate(n__add(X1,X2)) -> add(activate(X1),activate(X2)) activate(n__len(X)) -> len(activate(X)) activate(X) -> X Arctic Interpretation Processor: dimension: 1 usable rules: fst(0(),Z) -> nil() fst(s(X),cons(Y,Z)) -> cons(Y,n__fst(activate(X),activate(Z))) from(X) -> cons(X,n__from(n__s(X))) add(0(),X) -> X add(s(X),Y) -> s(n__add(activate(X),Y)) len(nil()) -> 0() len(cons(X,Z)) -> s(n__len(activate(Z))) fst(X1,X2) -> n__fst(X1,X2) from(X) -> n__from(X) s(X) -> n__s(X) add(X1,X2) -> n__add(X1,X2) len(X) -> n__len(X) activate(n__fst(X1,X2)) -> fst(activate(X1),activate(X2)) activate(n__from(X)) -> from(activate(X)) activate(n__s(X)) -> s(X) activate(n__add(X1,X2)) -> add(activate(X1),activate(X2)) activate(n__len(X)) -> len(activate(X)) activate(X) -> X interpretation: [len#](x0) = x0 + 0, [add#](x0, x1) = x0 + 2, [activate#](x0) = x0 + 0, [n__len](x0) = x0 + 2, [len](x0) = x0 + 2, [n__add](x0, x1) = x0 + 1x1 + 2, [add](x0, x1) = x0 + 1x1 + 2, [n__from](x0) = 1, [n__s](x0) = x0, [from](x0) = 1, [n__fst](x0, x1) = x0 + x1, [activate](x0) = x0 + 0, [cons](x0, x1) = x1, [s](x0) = x0 + 0, [nil] = 0, [fst](x0, x1) = x0 + x1 + 0, [0] = 2 orientation: len#(cons(X,Z)) = Z + 0 >= Z + 0 = activate#(Z) activate#(n__add(X1,X2)) = X1 + 1X2 + 2 >= X2 + 0 = activate#(X2) activate#(n__add(X1,X2)) = X1 + 1X2 + 2 >= X1 + 0 = activate#(X1) activate#(n__add(X1,X2)) = X1 + 1X2 + 2 >= X1 + 2 = add#(activate(X1),activate(X2)) add#(s(X),Y) = X + 2 >= X + 0 = activate#(X) activate#(n__len(X)) = X + 2 >= X + 0 = activate#(X) activate#(n__len(X)) = X + 2 >= X + 0 = len#(activate(X)) fst(0(),Z) = Z + 2 >= 0 = nil() fst(s(X),cons(Y,Z)) = X + Z + 0 >= X + Z + 0 = cons(Y,n__fst(activate(X),activate(Z))) from(X) = 1 >= 1 = cons(X,n__from(n__s(X))) add(0(),X) = 1X + 2 >= X = X add(s(X),Y) = X + 1Y + 2 >= X + 1Y + 2 = s(n__add(activate(X),Y)) len(nil()) = 2 >= 2 = 0() len(cons(X,Z)) = Z + 2 >= Z + 2 = s(n__len(activate(Z))) fst(X1,X2) = X1 + X2 + 0 >= X1 + X2 = n__fst(X1,X2) from(X) = 1 >= 1 = n__from(X) s(X) = X + 0 >= X = n__s(X) add(X1,X2) = X1 + 1X2 + 2 >= X1 + 1X2 + 2 = n__add(X1,X2) len(X) = X + 2 >= X + 2 = n__len(X) activate(n__fst(X1,X2)) = X1 + X2 + 0 >= X1 + X2 + 0 = fst(activate(X1),activate(X2)) activate(n__from(X)) = 1 >= 1 = from(activate(X)) activate(n__s(X)) = X + 0 >= X + 0 = s(X) activate(n__add(X1,X2)) = X1 + 1X2 + 2 >= X1 + 1X2 + 2 = add(activate(X1),activate(X2)) activate(n__len(X)) = X + 2 >= X + 2 = len(activate(X)) activate(X) = X + 0 >= X = X problem: DPs: len#(cons(X,Z)) -> activate#(Z) activate#(n__add(X1,X2)) -> activate#(X1) activate#(n__add(X1,X2)) -> add#(activate(X1),activate(X2)) add#(s(X),Y) -> activate#(X) activate#(n__len(X)) -> activate#(X) activate#(n__len(X)) -> len#(activate(X)) TRS: fst(0(),Z) -> nil() fst(s(X),cons(Y,Z)) -> cons(Y,n__fst(activate(X),activate(Z))) from(X) -> cons(X,n__from(n__s(X))) add(0(),X) -> X add(s(X),Y) -> s(n__add(activate(X),Y)) len(nil()) -> 0() len(cons(X,Z)) -> s(n__len(activate(Z))) fst(X1,X2) -> n__fst(X1,X2) from(X) -> n__from(X) s(X) -> n__s(X) add(X1,X2) -> n__add(X1,X2) len(X) -> n__len(X) activate(n__fst(X1,X2)) -> fst(activate(X1),activate(X2)) activate(n__from(X)) -> from(activate(X)) activate(n__s(X)) -> s(X) activate(n__add(X1,X2)) -> add(activate(X1),activate(X2)) activate(n__len(X)) -> len(activate(X)) activate(X) -> X Restore Modifier: DPs: len#(cons(X,Z)) -> activate#(Z) activate#(n__add(X1,X2)) -> activate#(X1) activate#(n__add(X1,X2)) -> add#(activate(X1),activate(X2)) add#(s(X),Y) -> activate#(X) activate#(n__len(X)) -> activate#(X) activate#(n__len(X)) -> len#(activate(X)) TRS: fst(0(),Z) -> nil() fst(s(X),cons(Y,Z)) -> cons(Y,n__fst(activate(X),activate(Z))) from(X) -> cons(X,n__from(n__s(X))) add(0(),X) -> X add(s(X),Y) -> s(n__add(activate(X),Y)) len(nil()) -> 0() len(cons(X,Z)) -> s(n__len(activate(Z))) fst(X1,X2) -> n__fst(X1,X2) from(X) -> n__from(X) s(X) -> n__s(X) add(X1,X2) -> n__add(X1,X2) len(X) -> n__len(X) activate(n__fst(X1,X2)) -> fst(activate(X1),activate(X2)) activate(n__from(X)) -> from(activate(X)) activate(n__s(X)) -> s(X) activate(n__add(X1,X2)) -> add(activate(X1),activate(X2)) activate(n__len(X)) -> len(activate(X)) activate(X) -> X Arctic Interpretation Processor: dimension: 1 usable rules: fst(0(),Z) -> nil() fst(s(X),cons(Y,Z)) -> cons(Y,n__fst(activate(X),activate(Z))) from(X) -> cons(X,n__from(n__s(X))) add(0(),X) -> X add(s(X),Y) -> s(n__add(activate(X),Y)) len(nil()) -> 0() len(cons(X,Z)) -> s(n__len(activate(Z))) fst(X1,X2) -> n__fst(X1,X2) from(X) -> n__from(X) s(X) -> n__s(X) add(X1,X2) -> n__add(X1,X2) len(X) -> n__len(X) activate(n__fst(X1,X2)) -> fst(activate(X1),activate(X2)) activate(n__from(X)) -> from(activate(X)) activate(n__s(X)) -> s(X) activate(n__add(X1,X2)) -> add(activate(X1),activate(X2)) activate(n__len(X)) -> len(activate(X)) activate(X) -> X interpretation: [len#](x0) = x0, [add#](x0, x1) = x0 + x1, [activate#](x0) = x0, [n__len](x0) = 5x0 + 0, [len](x0) = 5x0 + 0, [n__add](x0, x1) = x0 + x1, [add](x0, x1) = x0 + x1, [n__from](x0) = 4x0, [n__s](x0) = x0, [from](x0) = 4x0, [n__fst](x0, x1) = x0, [activate](x0) = x0, [cons](x0, x1) = x1, [s](x0) = x0, [nil] = 0, [fst](x0, x1) = x0, [0] = 0 orientation: len#(cons(X,Z)) = Z >= Z = activate#(Z) activate#(n__add(X1,X2)) = X1 + X2 >= X1 = activate#(X1) activate#(n__add(X1,X2)) = X1 + X2 >= X1 + X2 = add#(activate(X1),activate(X2)) add#(s(X),Y) = X + Y >= X = activate#(X) activate#(n__len(X)) = 5X + 0 >= X = activate#(X) activate#(n__len(X)) = 5X + 0 >= X = len#(activate(X)) fst(0(),Z) = 0 >= 0 = nil() fst(s(X),cons(Y,Z)) = X >= X = cons(Y,n__fst(activate(X),activate(Z))) from(X) = 4X >= 4X = cons(X,n__from(n__s(X))) add(0(),X) = X + 0 >= X = X add(s(X),Y) = X + Y >= X + Y = s(n__add(activate(X),Y)) len(nil()) = 5 >= 0 = 0() len(cons(X,Z)) = 5Z + 0 >= 5Z + 0 = s(n__len(activate(Z))) fst(X1,X2) = X1 >= X1 = n__fst(X1,X2) from(X) = 4X >= 4X = n__from(X) s(X) = X >= X = n__s(X) add(X1,X2) = X1 + X2 >= X1 + X2 = n__add(X1,X2) len(X) = 5X + 0 >= 5X + 0 = n__len(X) activate(n__fst(X1,X2)) = X1 >= X1 = fst(activate(X1),activate(X2)) activate(n__from(X)) = 4X >= 4X = from(activate(X)) activate(n__s(X)) = X >= X = s(X) activate(n__add(X1,X2)) = X1 + X2 >= X1 + X2 = add(activate(X1),activate(X2)) activate(n__len(X)) = 5X + 0 >= 5X + 0 = len(activate(X)) activate(X) = X >= X = X problem: DPs: len#(cons(X,Z)) -> activate#(Z) activate#(n__add(X1,X2)) -> activate#(X1) activate#(n__add(X1,X2)) -> add#(activate(X1),activate(X2)) add#(s(X),Y) -> activate#(X) TRS: fst(0(),Z) -> nil() fst(s(X),cons(Y,Z)) -> cons(Y,n__fst(activate(X),activate(Z))) from(X) -> cons(X,n__from(n__s(X))) add(0(),X) -> X add(s(X),Y) -> s(n__add(activate(X),Y)) len(nil()) -> 0() len(cons(X,Z)) -> s(n__len(activate(Z))) fst(X1,X2) -> n__fst(X1,X2) from(X) -> n__from(X) s(X) -> n__s(X) add(X1,X2) -> n__add(X1,X2) len(X) -> n__len(X) activate(n__fst(X1,X2)) -> fst(activate(X1),activate(X2)) activate(n__from(X)) -> from(activate(X)) activate(n__s(X)) -> s(X) activate(n__add(X1,X2)) -> add(activate(X1),activate(X2)) activate(n__len(X)) -> len(activate(X)) activate(X) -> X Restore Modifier: DPs: len#(cons(X,Z)) -> activate#(Z) activate#(n__add(X1,X2)) -> activate#(X1) activate#(n__add(X1,X2)) -> add#(activate(X1),activate(X2)) add#(s(X),Y) -> activate#(X) TRS: fst(0(),Z) -> nil() fst(s(X),cons(Y,Z)) -> cons(Y,n__fst(activate(X),activate(Z))) from(X) -> cons(X,n__from(n__s(X))) add(0(),X) -> X add(s(X),Y) -> s(n__add(activate(X),Y)) len(nil()) -> 0() len(cons(X,Z)) -> s(n__len(activate(Z))) fst(X1,X2) -> n__fst(X1,X2) from(X) -> n__from(X) s(X) -> n__s(X) add(X1,X2) -> n__add(X1,X2) len(X) -> n__len(X) activate(n__fst(X1,X2)) -> fst(activate(X1),activate(X2)) activate(n__from(X)) -> from(activate(X)) activate(n__s(X)) -> s(X) activate(n__add(X1,X2)) -> add(activate(X1),activate(X2)) activate(n__len(X)) -> len(activate(X)) activate(X) -> X SCC Processor: #sccs: 1 #rules: 3 #arcs: 38/16 DPs: activate#(n__add(X1,X2)) -> activate#(X1) activate#(n__add(X1,X2)) -> add#(activate(X1),activate(X2)) add#(s(X),Y) -> activate#(X) TRS: fst(0(),Z) -> nil() fst(s(X),cons(Y,Z)) -> cons(Y,n__fst(activate(X),activate(Z))) from(X) -> cons(X,n__from(n__s(X))) add(0(),X) -> X add(s(X),Y) -> s(n__add(activate(X),Y)) len(nil()) -> 0() len(cons(X,Z)) -> s(n__len(activate(Z))) fst(X1,X2) -> n__fst(X1,X2) from(X) -> n__from(X) s(X) -> n__s(X) add(X1,X2) -> n__add(X1,X2) len(X) -> n__len(X) activate(n__fst(X1,X2)) -> fst(activate(X1),activate(X2)) activate(n__from(X)) -> from(activate(X)) activate(n__s(X)) -> s(X) activate(n__add(X1,X2)) -> add(activate(X1),activate(X2)) activate(n__len(X)) -> len(activate(X)) activate(X) -> X Arctic Interpretation Processor: dimension: 1 usable rules: fst(0(),Z) -> nil() fst(s(X),cons(Y,Z)) -> cons(Y,n__fst(activate(X),activate(Z))) from(X) -> cons(X,n__from(n__s(X))) add(0(),X) -> X add(s(X),Y) -> s(n__add(activate(X),Y)) len(nil()) -> 0() len(cons(X,Z)) -> s(n__len(activate(Z))) fst(X1,X2) -> n__fst(X1,X2) from(X) -> n__from(X) s(X) -> n__s(X) add(X1,X2) -> n__add(X1,X2) len(X) -> n__len(X) activate(n__fst(X1,X2)) -> fst(activate(X1),activate(X2)) activate(n__from(X)) -> from(activate(X)) activate(n__s(X)) -> s(X) activate(n__add(X1,X2)) -> add(activate(X1),activate(X2)) activate(n__len(X)) -> len(activate(X)) activate(X) -> X interpretation: [add#](x0, x1) = 4x0, [activate#](x0) = x0, [n__len](x0) = 2x0, [len](x0) = 2x0, [n__add](x0, x1) = 4x0 + x1, [add](x0, x1) = 4x0 + x1, [n__from](x0) = x0 + 0, [n__s](x0) = x0 + 0, [from](x0) = x0 + 0, [n__fst](x0, x1) = 2x0 + 1x1 + 0, [activate](x0) = x0, [cons](x0, x1) = x1 + 0, [s](x0) = x0 + 0, [nil] = 1, [fst](x0, x1) = 2x0 + 1x1 + 0, [0] = 0 orientation: activate#(n__add(X1,X2)) = 4X1 + X2 >= X1 = activate#(X1) activate#(n__add(X1,X2)) = 4X1 + X2 >= 4X1 = add#(activate(X1),activate(X2)) add#(s(X),Y) = 4X + 4 >= X = activate#(X) fst(0(),Z) = 1Z + 2 >= 1 = nil() fst(s(X),cons(Y,Z)) = 2X + 1Z + 2 >= 2X + 1Z + 0 = cons(Y,n__fst(activate(X),activate(Z))) from(X) = X + 0 >= X + 0 = cons(X,n__from(n__s(X))) add(0(),X) = X + 4 >= X = X add(s(X),Y) = 4X + Y + 4 >= 4X + Y + 0 = s(n__add(activate(X),Y)) len(nil()) = 3 >= 0 = 0() len(cons(X,Z)) = 2Z + 2 >= 2Z + 0 = s(n__len(activate(Z))) fst(X1,X2) = 2X1 + 1X2 + 0 >= 2X1 + 1X2 + 0 = n__fst(X1,X2) from(X) = X + 0 >= X + 0 = n__from(X) s(X) = X + 0 >= X + 0 = n__s(X) add(X1,X2) = 4X1 + X2 >= 4X1 + X2 = n__add(X1,X2) len(X) = 2X >= 2X = n__len(X) activate(n__fst(X1,X2)) = 2X1 + 1X2 + 0 >= 2X1 + 1X2 + 0 = fst(activate(X1),activate(X2)) activate(n__from(X)) = X + 0 >= X + 0 = from(activate(X)) activate(n__s(X)) = X + 0 >= X + 0 = s(X) activate(n__add(X1,X2)) = 4X1 + X2 >= 4X1 + X2 = add(activate(X1),activate(X2)) activate(n__len(X)) = 2X >= 2X = len(activate(X)) activate(X) = X >= X = X problem: DPs: activate#(n__add(X1,X2)) -> add#(activate(X1),activate(X2)) TRS: fst(0(),Z) -> nil() fst(s(X),cons(Y,Z)) -> cons(Y,n__fst(activate(X),activate(Z))) from(X) -> cons(X,n__from(n__s(X))) add(0(),X) -> X add(s(X),Y) -> s(n__add(activate(X),Y)) len(nil()) -> 0() len(cons(X,Z)) -> s(n__len(activate(Z))) fst(X1,X2) -> n__fst(X1,X2) from(X) -> n__from(X) s(X) -> n__s(X) add(X1,X2) -> n__add(X1,X2) len(X) -> n__len(X) activate(n__fst(X1,X2)) -> fst(activate(X1),activate(X2)) activate(n__from(X)) -> from(activate(X)) activate(n__s(X)) -> s(X) activate(n__add(X1,X2)) -> add(activate(X1),activate(X2)) activate(n__len(X)) -> len(activate(X)) activate(X) -> X Restore Modifier: DPs: activate#(n__add(X1,X2)) -> add#(activate(X1),activate(X2)) TRS: fst(0(),Z) -> nil() fst(s(X),cons(Y,Z)) -> cons(Y,n__fst(activate(X),activate(Z))) from(X) -> cons(X,n__from(n__s(X))) add(0(),X) -> X add(s(X),Y) -> s(n__add(activate(X),Y)) len(nil()) -> 0() len(cons(X,Z)) -> s(n__len(activate(Z))) fst(X1,X2) -> n__fst(X1,X2) from(X) -> n__from(X) s(X) -> n__s(X) add(X1,X2) -> n__add(X1,X2) len(X) -> n__len(X) activate(n__fst(X1,X2)) -> fst(activate(X1),activate(X2)) activate(n__from(X)) -> from(activate(X)) activate(n__s(X)) -> s(X) activate(n__add(X1,X2)) -> add(activate(X1),activate(X2)) activate(n__len(X)) -> len(activate(X)) activate(X) -> X SCC Processor: #sccs: 0 #rules: 0 #arcs: 5/1