YES Problem: a____(__(X,Y),Z) -> a____(mark(X),a____(mark(Y),mark(Z))) a____(X,nil()) -> mark(X) a____(nil(),X) -> mark(X) a__and(tt(),X) -> mark(X) a__isNePal(__(I,__(P,I))) -> tt() mark(__(X1,X2)) -> a____(mark(X1),mark(X2)) mark(and(X1,X2)) -> a__and(mark(X1),X2) mark(isNePal(X)) -> a__isNePal(mark(X)) mark(nil()) -> nil() mark(tt()) -> tt() a____(X1,X2) -> __(X1,X2) a__and(X1,X2) -> and(X1,X2) a__isNePal(X) -> isNePal(X) Proof: DP Processor: DPs: a____#(__(X,Y),Z) -> mark#(Z) a____#(__(X,Y),Z) -> mark#(Y) a____#(__(X,Y),Z) -> a____#(mark(Y),mark(Z)) a____#(__(X,Y),Z) -> mark#(X) a____#(__(X,Y),Z) -> a____#(mark(X),a____(mark(Y),mark(Z))) a____#(X,nil()) -> mark#(X) a____#(nil(),X) -> mark#(X) a__and#(tt(),X) -> mark#(X) mark#(__(X1,X2)) -> mark#(X2) mark#(__(X1,X2)) -> mark#(X1) mark#(__(X1,X2)) -> a____#(mark(X1),mark(X2)) mark#(and(X1,X2)) -> mark#(X1) mark#(and(X1,X2)) -> a__and#(mark(X1),X2) mark#(isNePal(X)) -> mark#(X) mark#(isNePal(X)) -> a__isNePal#(mark(X)) TRS: a____(__(X,Y),Z) -> a____(mark(X),a____(mark(Y),mark(Z))) a____(X,nil()) -> mark(X) a____(nil(),X) -> mark(X) a__and(tt(),X) -> mark(X) a__isNePal(__(I,__(P,I))) -> tt() mark(__(X1,X2)) -> a____(mark(X1),mark(X2)) mark(and(X1,X2)) -> a__and(mark(X1),X2) mark(isNePal(X)) -> a__isNePal(mark(X)) mark(nil()) -> nil() mark(tt()) -> tt() a____(X1,X2) -> __(X1,X2) a__and(X1,X2) -> and(X1,X2) a__isNePal(X) -> isNePal(X) Matrix Interpretation Processor: dim=1 interpretation: [a__isNePal#](x0) = x0, [a__and#](x0, x1) = 4x0 + 2x1 + 6, [mark#](x0) = x0 + 4, [a____#](x0, x1) = 2x0 + x1 + 2, [isNePal](x0) = 4x0 + 7, [and](x0, x1) = 4x0 + 2x1 + 3, [a__isNePal](x0) = 4x0 + 7, [a__and](x0, x1) = 4x0 + 2x1 + 3, [tt] = 0, [nil] = 3, [mark](x0) = x0, [a____](x0, x1) = 2x0 + x1 + 2, [__](x0, x1) = 2x0 + x1 + 2 orientation: a____#(__(X,Y),Z) = 4X + 2Y + Z + 6 >= Z + 4 = mark#(Z) a____#(__(X,Y),Z) = 4X + 2Y + Z + 6 >= Y + 4 = mark#(Y) a____#(__(X,Y),Z) = 4X + 2Y + Z + 6 >= 2Y + Z + 2 = a____#(mark(Y),mark(Z)) a____#(__(X,Y),Z) = 4X + 2Y + Z + 6 >= X + 4 = mark#(X) a____#(__(X,Y),Z) = 4X + 2Y + Z + 6 >= 2X + 2Y + Z + 4 = a____#(mark(X),a____(mark(Y),mark(Z))) a____#(X,nil()) = 2X + 5 >= X + 4 = mark#(X) a____#(nil(),X) = X + 8 >= X + 4 = mark#(X) a__and#(tt(),X) = 2X + 6 >= X + 4 = mark#(X) mark#(__(X1,X2)) = 2X1 + X2 + 6 >= X2 + 4 = mark#(X2) mark#(__(X1,X2)) = 2X1 + X2 + 6 >= X1 + 4 = mark#(X1) mark#(__(X1,X2)) = 2X1 + X2 + 6 >= 2X1 + X2 + 2 = a____#(mark(X1),mark(X2)) mark#(and(X1,X2)) = 4X1 + 2X2 + 7 >= X1 + 4 = mark#(X1) mark#(and(X1,X2)) = 4X1 + 2X2 + 7 >= 4X1 + 2X2 + 6 = a__and#(mark(X1),X2) mark#(isNePal(X)) = 4X + 11 >= X + 4 = mark#(X) mark#(isNePal(X)) = 4X + 11 >= X = a__isNePal#(mark(X)) a____(__(X,Y),Z) = 4X + 2Y + Z + 6 >= 2X + 2Y + Z + 4 = a____(mark(X),a____(mark(Y),mark(Z))) a____(X,nil()) = 2X + 5 >= X = mark(X) a____(nil(),X) = X + 8 >= X = mark(X) a__and(tt(),X) = 2X + 3 >= X = mark(X) a__isNePal(__(I,__(P,I))) = 12I + 8P + 23 >= 0 = tt() mark(__(X1,X2)) = 2X1 + X2 + 2 >= 2X1 + X2 + 2 = a____(mark(X1),mark(X2)) mark(and(X1,X2)) = 4X1 + 2X2 + 3 >= 4X1 + 2X2 + 3 = a__and(mark(X1),X2) mark(isNePal(X)) = 4X + 7 >= 4X + 7 = a__isNePal(mark(X)) mark(nil()) = 3 >= 3 = nil() mark(tt()) = 0 >= 0 = tt() a____(X1,X2) = 2X1 + X2 + 2 >= 2X1 + X2 + 2 = __(X1,X2) a__and(X1,X2) = 4X1 + 2X2 + 3 >= 4X1 + 2X2 + 3 = and(X1,X2) a__isNePal(X) = 4X + 7 >= 4X + 7 = isNePal(X) problem: DPs: TRS: a____(__(X,Y),Z) -> a____(mark(X),a____(mark(Y),mark(Z))) a____(X,nil()) -> mark(X) a____(nil(),X) -> mark(X) a__and(tt(),X) -> mark(X) a__isNePal(__(I,__(P,I))) -> tt() mark(__(X1,X2)) -> a____(mark(X1),mark(X2)) mark(and(X1,X2)) -> a__and(mark(X1),X2) mark(isNePal(X)) -> a__isNePal(mark(X)) mark(nil()) -> nil() mark(tt()) -> tt() a____(X1,X2) -> __(X1,X2) a__and(X1,X2) -> and(X1,X2) a__isNePal(X) -> isNePal(X) Qed