YES Problem: a__and(true(),X) -> mark(X) a__and(false(),Y) -> false() a__if(true(),X,Y) -> mark(X) a__if(false(),X,Y) -> mark(Y) a__add(0(),X) -> mark(X) a__add(s(X),Y) -> s(add(X,Y)) a__first(0(),X) -> nil() a__first(s(X),cons(Y,Z)) -> cons(Y,first(X,Z)) a__from(X) -> cons(X,from(s(X))) mark(and(X1,X2)) -> a__and(mark(X1),X2) mark(if(X1,X2,X3)) -> a__if(mark(X1),X2,X3) mark(add(X1,X2)) -> a__add(mark(X1),X2) mark(first(X1,X2)) -> a__first(mark(X1),mark(X2)) mark(from(X)) -> a__from(X) mark(true()) -> true() mark(false()) -> false() mark(0()) -> 0() mark(s(X)) -> s(X) mark(nil()) -> nil() mark(cons(X1,X2)) -> cons(X1,X2) a__and(X1,X2) -> and(X1,X2) a__if(X1,X2,X3) -> if(X1,X2,X3) a__add(X1,X2) -> add(X1,X2) a__first(X1,X2) -> first(X1,X2) a__from(X) -> from(X) Proof: DP Processor: DPs: a__and#(true(),X) -> mark#(X) a__if#(true(),X,Y) -> mark#(X) a__if#(false(),X,Y) -> mark#(Y) a__add#(0(),X) -> mark#(X) mark#(and(X1,X2)) -> mark#(X1) mark#(and(X1,X2)) -> a__and#(mark(X1),X2) mark#(if(X1,X2,X3)) -> mark#(X1) mark#(if(X1,X2,X3)) -> a__if#(mark(X1),X2,X3) mark#(add(X1,X2)) -> mark#(X1) mark#(add(X1,X2)) -> a__add#(mark(X1),X2) mark#(first(X1,X2)) -> mark#(X2) mark#(first(X1,X2)) -> mark#(X1) mark#(first(X1,X2)) -> a__first#(mark(X1),mark(X2)) mark#(from(X)) -> a__from#(X) TRS: a__and(true(),X) -> mark(X) a__and(false(),Y) -> false() a__if(true(),X,Y) -> mark(X) a__if(false(),X,Y) -> mark(Y) a__add(0(),X) -> mark(X) a__add(s(X),Y) -> s(add(X,Y)) a__first(0(),X) -> nil() a__first(s(X),cons(Y,Z)) -> cons(Y,first(X,Z)) a__from(X) -> cons(X,from(s(X))) mark(and(X1,X2)) -> a__and(mark(X1),X2) mark(if(X1,X2,X3)) -> a__if(mark(X1),X2,X3) mark(add(X1,X2)) -> a__add(mark(X1),X2) mark(first(X1,X2)) -> a__first(mark(X1),mark(X2)) mark(from(X)) -> a__from(X) mark(true()) -> true() mark(false()) -> false() mark(0()) -> 0() mark(s(X)) -> s(X) mark(nil()) -> nil() mark(cons(X1,X2)) -> cons(X1,X2) a__and(X1,X2) -> and(X1,X2) a__if(X1,X2,X3) -> if(X1,X2,X3) a__add(X1,X2) -> add(X1,X2) a__first(X1,X2) -> first(X1,X2) a__from(X) -> from(X) Matrix Interpretation Processor: dim=1 interpretation: [a__from#](x0) = 0, [a__first#](x0, x1) = 4x1, [a__add#](x0, x1) = 4x1 + 2, [a__if#](x0, x1, x2) = x0 + 6x1 + 4x2, [mark#](x0) = 4x0, [a__and#](x0, x1) = 4x1 + 2, [if](x0, x1, x2) = 4x0 + 2x1 + x2 + 1, [and](x0, x1) = 5x0 + 2x1 + 1, [from](x0) = 1, [a__from](x0) = 1, [first](x0, x1) = 2x0 + x1 + 2, [cons](x0, x1) = 1, [nil] = 0, [a__first](x0, x1) = 2x0 + x1 + 2, [add](x0, x1) = x0 + x1 + 1, [s](x0) = 4, [a__add](x0, x1) = x0 + x1 + 1, [0] = 0, [a__if](x0, x1, x2) = 4x0 + 2x1 + x2 + 1, [false] = 3, [mark](x0) = x0, [a__and](x0, x1) = 5x0 + 2x1 + 1, [true] = 4 orientation: a__and#(true(),X) = 4X + 2 >= 4X = mark#(X) a__if#(true(),X,Y) = 6X + 4Y + 4 >= 4X = mark#(X) a__if#(false(),X,Y) = 6X + 4Y + 3 >= 4Y = mark#(Y) a__add#(0(),X) = 4X + 2 >= 4X = mark#(X) mark#(and(X1,X2)) = 20X1 + 8X2 + 4 >= 4X1 = mark#(X1) mark#(and(X1,X2)) = 20X1 + 8X2 + 4 >= 4X2 + 2 = a__and#(mark(X1),X2) mark#(if(X1,X2,X3)) = 16X1 + 8X2 + 4X3 + 4 >= 4X1 = mark#(X1) mark#(if(X1,X2,X3)) = 16X1 + 8X2 + 4X3 + 4 >= X1 + 6X2 + 4X3 = a__if#(mark(X1),X2,X3) mark#(add(X1,X2)) = 4X1 + 4X2 + 4 >= 4X1 = mark#(X1) mark#(add(X1,X2)) = 4X1 + 4X2 + 4 >= 4X2 + 2 = a__add#(mark(X1),X2) mark#(first(X1,X2)) = 8X1 + 4X2 + 8 >= 4X2 = mark#(X2) mark#(first(X1,X2)) = 8X1 + 4X2 + 8 >= 4X1 = mark#(X1) mark#(first(X1,X2)) = 8X1 + 4X2 + 8 >= 4X2 = a__first#(mark(X1),mark(X2)) mark#(from(X)) = 4 >= 0 = a__from#(X) a__and(true(),X) = 2X + 21 >= X = mark(X) a__and(false(),Y) = 2Y + 16 >= 3 = false() a__if(true(),X,Y) = 2X + Y + 17 >= X = mark(X) a__if(false(),X,Y) = 2X + Y + 13 >= Y = mark(Y) a__add(0(),X) = X + 1 >= X = mark(X) a__add(s(X),Y) = Y + 5 >= 4 = s(add(X,Y)) a__first(0(),X) = X + 2 >= 0 = nil() a__first(s(X),cons(Y,Z)) = 11 >= 1 = cons(Y,first(X,Z)) a__from(X) = 1 >= 1 = cons(X,from(s(X))) mark(and(X1,X2)) = 5X1 + 2X2 + 1 >= 5X1 + 2X2 + 1 = a__and(mark(X1),X2) mark(if(X1,X2,X3)) = 4X1 + 2X2 + X3 + 1 >= 4X1 + 2X2 + X3 + 1 = a__if(mark(X1),X2,X3) mark(add(X1,X2)) = X1 + X2 + 1 >= X1 + X2 + 1 = a__add(mark(X1),X2) mark(first(X1,X2)) = 2X1 + X2 + 2 >= 2X1 + X2 + 2 = a__first(mark(X1),mark(X2)) mark(from(X)) = 1 >= 1 = a__from(X) mark(true()) = 4 >= 4 = true() mark(false()) = 3 >= 3 = false() mark(0()) = 0 >= 0 = 0() mark(s(X)) = 4 >= 4 = s(X) mark(nil()) = 0 >= 0 = nil() mark(cons(X1,X2)) = 1 >= 1 = cons(X1,X2) a__and(X1,X2) = 5X1 + 2X2 + 1 >= 5X1 + 2X2 + 1 = and(X1,X2) a__if(X1,X2,X3) = 4X1 + 2X2 + X3 + 1 >= 4X1 + 2X2 + X3 + 1 = if(X1,X2,X3) a__add(X1,X2) = X1 + X2 + 1 >= X1 + X2 + 1 = add(X1,X2) a__first(X1,X2) = 2X1 + X2 + 2 >= 2X1 + X2 + 2 = first(X1,X2) a__from(X) = 1 >= 1 = from(X) problem: DPs: TRS: a__and(true(),X) -> mark(X) a__and(false(),Y) -> false() a__if(true(),X,Y) -> mark(X) a__if(false(),X,Y) -> mark(Y) a__add(0(),X) -> mark(X) a__add(s(X),Y) -> s(add(X,Y)) a__first(0(),X) -> nil() a__first(s(X),cons(Y,Z)) -> cons(Y,first(X,Z)) a__from(X) -> cons(X,from(s(X))) mark(and(X1,X2)) -> a__and(mark(X1),X2) mark(if(X1,X2,X3)) -> a__if(mark(X1),X2,X3) mark(add(X1,X2)) -> a__add(mark(X1),X2) mark(first(X1,X2)) -> a__first(mark(X1),mark(X2)) mark(from(X)) -> a__from(X) mark(true()) -> true() mark(false()) -> false() mark(0()) -> 0() mark(s(X)) -> s(X) mark(nil()) -> nil() mark(cons(X1,X2)) -> cons(X1,X2) a__and(X1,X2) -> and(X1,X2) a__if(X1,X2,X3) -> if(X1,X2,X3) a__add(X1,X2) -> add(X1,X2) a__first(X1,X2) -> first(X1,X2) a__from(X) -> from(X) Qed