YES TRS: active(eq(0(),0())) -> mark(true()) active(eq(s(X),s(Y))) -> mark(eq(X,Y)) active(eq(X,Y)) -> mark(false()) active(inf(X)) -> mark(cons(X,inf(s(X)))) active(take(0(),X)) -> mark(nil()) active(take(s(X),cons(Y,L))) -> mark(cons(Y,take(X,L))) active(length(nil())) -> mark(0()) active(length(cons(X,L))) -> mark(s(length(L))) mark(eq(X1,X2)) -> active(eq(X1,X2)) mark(0()) -> active(0()) mark(true()) -> active(true()) mark(s(X)) -> active(s(X)) mark(false()) -> active(false()) mark(inf(X)) -> active(inf(mark(X))) mark(cons(X1,X2)) -> active(cons(X1,X2)) mark(take(X1,X2)) -> active(take(mark(X1),mark(X2))) mark(nil()) -> active(nil()) mark(length(X)) -> active(length(mark(X))) eq(mark(X1),X2) -> eq(X1,X2) eq(X1,mark(X2)) -> eq(X1,X2) eq(active(X1),X2) -> eq(X1,X2) eq(X1,active(X2)) -> eq(X1,X2) s(mark(X)) -> s(X) s(active(X)) -> s(X) inf(mark(X)) -> inf(X) inf(active(X)) -> inf(X) cons(mark(X1),X2) -> cons(X1,X2) cons(X1,mark(X2)) -> cons(X1,X2) cons(active(X1),X2) -> cons(X1,X2) cons(X1,active(X2)) -> cons(X1,X2) take(mark(X1),X2) -> take(X1,X2) take(X1,mark(X2)) -> take(X1,X2) take(active(X1),X2) -> take(X1,X2) take(X1,active(X2)) -> take(X1,X2) length(mark(X)) -> length(X) length(active(X)) -> length(X) max/plus interpretations on N: active_A(x1) = max{25, x1} active#_A(x1) = max{61, 3 + x1} eq_A(x1,x2) = max{12, -89, -39} eq#_A(x1,x2) = max{67, 67, -87} 0_A = 28 0#_A = 54 mark_A(x1) = max{13, 13 + x1} mark#_A(x1) = max{63, 53 + x1} true_A = 12 true#_A = 16 s_A(x1) = max{1, 12} s#_A(x1) = max{0, -25} false_A = 12 false#_A = 66 inf_A(x1) = max{0, 79 + x1} inf#_A(x1) = max{62, 1} cons_A(x1,x2) = max{7, 20, -51} cons#_A(x1,x2) = max{82, 82, 81} take_A(x1,x2) = max{11, 68 + x1, 49 + x2} take#_A(x1,x2) = max{101, 101, 0} nil_A = 47 nil#_A = 64 length_A(x1) = max{180, 129 + x1} length#_A(x1) = max{80, 55} precedence: eq > false = nil > active > take > cons > length > s > mark > 0 = inf > true