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__U11(tt()) -> tt()
 a__U21(tt(),V2) -> a__U22(a__isList(V2))
 a__U22(tt()) -> tt()
 a__U31(tt()) -> tt()
 a__U41(tt(),V2) -> a__U42(a__isNeList(V2))
 a__U42(tt()) -> tt()
 a__U51(tt(),V2) -> a__U52(a__isList(V2))
 a__U52(tt()) -> tt()
 a__U61(tt()) -> tt()
 a__U71(tt(),P) -> a__U72(a__isPal(P))
 a__U72(tt()) -> tt()
 a__U81(tt()) -> tt()
 a__isList(V) -> a__U11(a__isNeList(V))
 a__isList(nil()) -> tt()
 a__isList(__(V1,V2)) -> a__U21(a__isList(V1),V2)
 a__isNeList(V) -> a__U31(a__isQid(V))
 a__isNeList(__(V1,V2)) -> a__U41(a__isList(V1),V2)
 a__isNeList(__(V1,V2)) -> a__U51(a__isNeList(V1),V2)
 a__isNePal(V) -> a__U61(a__isQid(V))
 a__isNePal(__(I,__(P,I))) -> a__U71(a__isQid(I),P)
 a__isPal(V) -> a__U81(a__isNePal(V))
 a__isPal(nil()) -> tt()
 a__isQid(a()) -> tt()
 a__isQid(e()) -> tt()
 a__isQid(i()) -> tt()
 a__isQid(o()) -> tt()
 a__isQid(u()) -> tt()
 mark(__(X1,X2)) -> a____(mark(X1),mark(X2))
 mark(U11(X)) -> a__U11(mark(X))
 mark(U21(X1,X2)) -> a__U21(mark(X1),X2)
 mark(U22(X)) -> a__U22(mark(X))
 mark(isList(X)) -> a__isList(X)
 mark(U31(X)) -> a__U31(mark(X))
 mark(U41(X1,X2)) -> a__U41(mark(X1),X2)
 mark(U42(X)) -> a__U42(mark(X))
 mark(isNeList(X)) -> a__isNeList(X)
 mark(U51(X1,X2)) -> a__U51(mark(X1),X2)
 mark(U52(X)) -> a__U52(mark(X))
 mark(U61(X)) -> a__U61(mark(X))
 mark(U71(X1,X2)) -> a__U71(mark(X1),X2)
 mark(U72(X)) -> a__U72(mark(X))
 mark(isPal(X)) -> a__isPal(X)
 mark(U81(X)) -> a__U81(mark(X))
 mark(isQid(X)) -> a__isQid(X)
 mark(isNePal(X)) -> a__isNePal(X)
 mark(nil()) -> nil()
 mark(tt()) -> tt()
 mark(a()) -> a()
 mark(e()) -> e()
 mark(i()) -> i()
 mark(o()) -> o()
 mark(u()) -> u()
 a____(X1,X2) -> __(X1,X2)
 a__U11(X) -> U11(X)
 a__U21(X1,X2) -> U21(X1,X2)
 a__U22(X) -> U22(X)
 a__isList(X) -> isList(X)
 a__U31(X) -> U31(X)
 a__U41(X1,X2) -> U41(X1,X2)
 a__U42(X) -> U42(X)
 a__isNeList(X) -> isNeList(X)
 a__U51(X1,X2) -> U51(X1,X2)
 a__U52(X) -> U52(X)
 a__U61(X) -> U61(X)
 a__U71(X1,X2) -> U71(X1,X2)
 a__U72(X) -> U72(X)
 a__isPal(X) -> isPal(X)
 a__U81(X) -> U81(X)
 a__isQid(X) -> isQid(X)
 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__U21#(tt(),V2) -> a__isList#(V2)
   a__U21#(tt(),V2) -> a__U22#(a__isList(V2))
   a__U41#(tt(),V2) -> a__isNeList#(V2)
   a__U41#(tt(),V2) -> a__U42#(a__isNeList(V2))
   a__U51#(tt(),V2) -> a__isList#(V2)
   a__U51#(tt(),V2) -> a__U52#(a__isList(V2))
   a__U71#(tt(),P) -> a__isPal#(P)
   a__U71#(tt(),P) -> a__U72#(a__isPal(P))
   a__isList#(V) -> a__isNeList#(V)
   a__isList#(V) -> a__U11#(a__isNeList(V))
   a__isList#(__(V1,V2)) -> a__isList#(V1)
   a__isList#(__(V1,V2)) -> a__U21#(a__isList(V1),V2)
   a__isNeList#(V) -> a__isQid#(V)
   a__isNeList#(V) -> a__U31#(a__isQid(V))
   a__isNeList#(__(V1,V2)) -> a__isList#(V1)
   a__isNeList#(__(V1,V2)) -> a__U41#(a__isList(V1),V2)
   a__isNeList#(__(V1,V2)) -> a__isNeList#(V1)
   a__isNeList#(__(V1,V2)) -> a__U51#(a__isNeList(V1),V2)
   a__isNePal#(V) -> a__isQid#(V)
   a__isNePal#(V) -> a__U61#(a__isQid(V))
   a__isNePal#(__(I,__(P,I))) -> a__isQid#(I)
   a__isNePal#(__(I,__(P,I))) -> a__U71#(a__isQid(I),P)
   a__isPal#(V) -> a__isNePal#(V)
   a__isPal#(V) -> a__U81#(a__isNePal(V))
   mark#(__(X1,X2)) -> mark#(X2)
   mark#(__(X1,X2)) -> mark#(X1)
   mark#(__(X1,X2)) -> a____#(mark(X1),mark(X2))
   mark#(U11(X)) -> mark#(X)
   mark#(U11(X)) -> a__U11#(mark(X))
   mark#(U21(X1,X2)) -> mark#(X1)
   mark#(U21(X1,X2)) -> a__U21#(mark(X1),X2)
   mark#(U22(X)) -> mark#(X)
   mark#(U22(X)) -> a__U22#(mark(X))
   mark#(isList(X)) -> a__isList#(X)
   mark#(U31(X)) -> mark#(X)
   mark#(U31(X)) -> a__U31#(mark(X))
   mark#(U41(X1,X2)) -> mark#(X1)
   mark#(U41(X1,X2)) -> a__U41#(mark(X1),X2)
   mark#(U42(X)) -> mark#(X)
   mark#(U42(X)) -> a__U42#(mark(X))
   mark#(isNeList(X)) -> a__isNeList#(X)
   mark#(U51(X1,X2)) -> mark#(X1)
   mark#(U51(X1,X2)) -> a__U51#(mark(X1),X2)
   mark#(U52(X)) -> mark#(X)
   mark#(U52(X)) -> a__U52#(mark(X))
   mark#(U61(X)) -> mark#(X)
   mark#(U61(X)) -> a__U61#(mark(X))
   mark#(U71(X1,X2)) -> mark#(X1)
   mark#(U71(X1,X2)) -> a__U71#(mark(X1),X2)
   mark#(U72(X)) -> mark#(X)
   mark#(U72(X)) -> a__U72#(mark(X))
   mark#(isPal(X)) -> a__isPal#(X)
   mark#(U81(X)) -> mark#(X)
   mark#(U81(X)) -> a__U81#(mark(X))
   mark#(isQid(X)) -> a__isQid#(X)
   mark#(isNePal(X)) -> a__isNePal#(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__U11(tt()) -> tt()
   a__U21(tt(),V2) -> a__U22(a__isList(V2))
   a__U22(tt()) -> tt()
   a__U31(tt()) -> tt()
   a__U41(tt(),V2) -> a__U42(a__isNeList(V2))
   a__U42(tt()) -> tt()
   a__U51(tt(),V2) -> a__U52(a__isList(V2))
   a__U52(tt()) -> tt()
   a__U61(tt()) -> tt()
   a__U71(tt(),P) -> a__U72(a__isPal(P))
   a__U72(tt()) -> tt()
   a__U81(tt()) -> tt()
   a__isList(V) -> a__U11(a__isNeList(V))
   a__isList(nil()) -> tt()
   a__isList(__(V1,V2)) -> a__U21(a__isList(V1),V2)
   a__isNeList(V) -> a__U31(a__isQid(V))
   a__isNeList(__(V1,V2)) -> a__U41(a__isList(V1),V2)
   a__isNeList(__(V1,V2)) -> a__U51(a__isNeList(V1),V2)
   a__isNePal(V) -> a__U61(a__isQid(V))
   a__isNePal(__(I,__(P,I))) -> a__U71(a__isQid(I),P)
   a__isPal(V) -> a__U81(a__isNePal(V))
   a__isPal(nil()) -> tt()
   a__isQid(a()) -> tt()
   a__isQid(e()) -> tt()
   a__isQid(i()) -> tt()
   a__isQid(o()) -> tt()
   a__isQid(u()) -> tt()
   mark(__(X1,X2)) -> a____(mark(X1),mark(X2))
   mark(U11(X)) -> a__U11(mark(X))
   mark(U21(X1,X2)) -> a__U21(mark(X1),X2)
   mark(U22(X)) -> a__U22(mark(X))
   mark(isList(X)) -> a__isList(X)
   mark(U31(X)) -> a__U31(mark(X))
   mark(U41(X1,X2)) -> a__U41(mark(X1),X2)
   mark(U42(X)) -> a__U42(mark(X))
   mark(isNeList(X)) -> a__isNeList(X)
   mark(U51(X1,X2)) -> a__U51(mark(X1),X2)
   mark(U52(X)) -> a__U52(mark(X))
   mark(U61(X)) -> a__U61(mark(X))
   mark(U71(X1,X2)) -> a__U71(mark(X1),X2)
   mark(U72(X)) -> a__U72(mark(X))
   mark(isPal(X)) -> a__isPal(X)
   mark(U81(X)) -> a__U81(mark(X))
   mark(isQid(X)) -> a__isQid(X)
   mark(isNePal(X)) -> a__isNePal(X)
   mark(nil()) -> nil()
   mark(tt()) -> tt()
   mark(a()) -> a()
   mark(e()) -> e()
   mark(i()) -> i()
   mark(o()) -> o()
   mark(u()) -> u()
   a____(X1,X2) -> __(X1,X2)
   a__U11(X) -> U11(X)
   a__U21(X1,X2) -> U21(X1,X2)
   a__U22(X) -> U22(X)
   a__isList(X) -> isList(X)
   a__U31(X) -> U31(X)
   a__U41(X1,X2) -> U41(X1,X2)
   a__U42(X) -> U42(X)
   a__isNeList(X) -> isNeList(X)
   a__U51(X1,X2) -> U51(X1,X2)
   a__U52(X) -> U52(X)
   a__U61(X) -> U61(X)
   a__U71(X1,X2) -> U71(X1,X2)
   a__U72(X) -> U72(X)
   a__isPal(X) -> isPal(X)
   a__U81(X) -> U81(X)
   a__isQid(X) -> isQid(X)
   a__isNePal(X) -> isNePal(X)
  Matrix Interpretation Processor: dim=1
   
   interpretation:
    [a__isNePal#](x0) = x0 + 2,
    
    [a__isQid#](x0) = 0,
    
    [a__U81#](x0) = 0,
    
    [a__U72#](x0) = 0,
    
    [a__isPal#](x0) = x0 + 3,
    
    [a__U71#](x0, x1) = 6x0 + 4x1,
    
    [a__U61#](x0) = x0,
    
    [a__U52#](x0) = 0,
    
    [a__U51#](x0, x1) = x0 + x1 + 1,
    
    [a__U42#](x0) = x0,
    
    [a__isNeList#](x0) = x0 + 1,
    
    [a__U41#](x0, x1) = x0 + x1,
    
    [a__U31#](x0) = 0,
    
    [a__U22#](x0) = 0,
    
    [a__isList#](x0) = x0 + 2,
    
    [a__U21#](x0, x1) = 2x0 + x1,
    
    [a__U11#](x0) = x0,
    
    [mark#](x0) = x0 + 1,
    
    [a____#](x0, x1) = 5x0 + x1,
    
    [isNePal](x0) = x0 + 4,
    
    [isQid](x0) = x0,
    
    [U81](x0) = x0 + 2,
    
    [isPal](x0) = 4x0 + 6,
    
    [U72](x0) = x0 + 1,
    
    [U71](x0, x1) = 6x0 + 4x1 + 5,
    
    [U61](x0) = x0 + 2,
    
    [U52](x0) = x0 + 2,
    
    [U51](x0, x1) = x0 + x1 + 2,
    
    [isNeList](x0) = x0 + 1,
    
    [U42](x0) = x0 + 4,
    
    [U41](x0, x1) = 2x0 + x1 + 1,
    
    [U31](x0) = x0 + 1,
    
    [isList](x0) = x0 + 2,
    
    [U22](x0) = x0 + 2,
    
    [U21](x0, x1) = 2x0 + x1 + 1,
    
    [U11](x0) = x0 + 1,
    
    [u] = 4,
    
    [o] = 4,
    
    [i] = 3,
    
    [e] = 4,
    
    [a] = 2,
    
    [a__isNePal](x0) = x0 + 4,
    
    [a__isQid](x0) = x0,
    
    [a__U81](x0) = x0 + 2,
    
    [a__U72](x0) = x0 + 1,
    
    [a__isPal](x0) = 4x0 + 6,
    
    [a__U71](x0, x1) = 6x0 + 4x1 + 5,
    
    [a__U61](x0) = x0 + 2,
    
    [a__U52](x0) = x0 + 2,
    
    [a__U51](x0, x1) = x0 + x1 + 2,
    
    [a__U42](x0) = x0 + 4,
    
    [a__isNeList](x0) = x0 + 1,
    
    [a__U41](x0, x1) = 2x0 + x1 + 1,
    
    [a__U31](x0) = x0 + 1,
    
    [a__U22](x0) = x0 + 2,
    
    [a__isList](x0) = x0 + 2,
    
    [a__U21](x0, x1) = 2x0 + x1 + 1,
    
    [a__U11](x0) = x0 + 1,
    
    [tt] = 2,
    
    [nil] = 4,
    
    [mark](x0) = x0,
    
    [a____](x0, x1) = 5x0 + x1 + 4,
    
    [__](x0, x1) = 5x0 + x1 + 4
   orientation:
    a____#(__(X,Y),Z) = 25X + 5Y + Z + 20 >= Z + 1 = mark#(Z)
    
    a____#(__(X,Y),Z) = 25X + 5Y + Z + 20 >= Y + 1 = mark#(Y)
    
    a____#(__(X,Y),Z) = 25X + 5Y + Z + 20 >= 5Y + Z = a____#(mark(Y),mark(Z))
    
    a____#(__(X,Y),Z) = 25X + 5Y + Z + 20 >= X + 1 = mark#(X)
    
    a____#(__(X,Y),Z) = 25X + 5Y + Z + 20 >= 5X + 5Y + Z + 4 = a____#(mark(X),a____(mark(Y),mark(Z)))
    
    a____#(X,nil()) = 5X + 4 >= X + 1 = mark#(X)
    
    a____#(nil(),X) = X + 20 >= X + 1 = mark#(X)
    
    a__U21#(tt(),V2) = V2 + 4 >= V2 + 2 = a__isList#(V2)
    
    a__U21#(tt(),V2) = V2 + 4 >= 0 = a__U22#(a__isList(V2))
    
    a__U41#(tt(),V2) = V2 + 2 >= V2 + 1 = a__isNeList#(V2)
    
    a__U41#(tt(),V2) = V2 + 2 >= V2 + 1 = a__U42#(a__isNeList(V2))
    
    a__U51#(tt(),V2) = V2 + 3 >= V2 + 2 = a__isList#(V2)
    
    a__U51#(tt(),V2) = V2 + 3 >= 0 = a__U52#(a__isList(V2))
    
    a__U71#(tt(),P) = 4P + 12 >= P + 3 = a__isPal#(P)
    
    a__U71#(tt(),P) = 4P + 12 >= 0 = a__U72#(a__isPal(P))
    
    a__isList#(V) = V + 2 >= V + 1 = a__isNeList#(V)
    
    a__isList#(V) = V + 2 >= V + 1 = a__U11#(a__isNeList(V))
    
    a__isList#(__(V1,V2)) = 5V1 + V2 + 6 >= V1 + 2 = a__isList#(V1)
    
    a__isList#(__(V1,V2)) = 5V1 + V2 + 6 >= 2V1 + V2 + 4 = a__U21#(a__isList(V1),V2)
    
    a__isNeList#(V) = V + 1 >= 0 = a__isQid#(V)
    
    a__isNeList#(V) = V + 1 >= 0 = a__U31#(a__isQid(V))
    
    a__isNeList#(__(V1,V2)) = 5V1 + V2 + 5 >= V1 + 2 = a__isList#(V1)
    
    a__isNeList#(__(V1,V2)) = 5V1 + V2 + 5 >= V1 + V2 + 2 = a__U41#(a__isList(V1),V2)
    
    a__isNeList#(__(V1,V2)) = 5V1 + V2 + 5 >= V1 + 1 = a__isNeList#(V1)
    
    a__isNeList#(__(V1,V2)) = 5V1 + V2 + 5 >= V1 + V2 + 2 = a__U51#(a__isNeList(V1),V2)
    
    a__isNePal#(V) = V + 2 >= 0 = a__isQid#(V)
    
    a__isNePal#(V) = V + 2 >= V = a__U61#(a__isQid(V))
    
    a__isNePal#(__(I,__(P,I))) = 6I + 5P + 10 >= 0 = a__isQid#(I)
    
    a__isNePal#(__(I,__(P,I))) = 6I + 5P + 10 >= 6I + 4P = a__U71#(a__isQid(I),P)
    
    a__isPal#(V) = V + 3 >= V + 2 = a__isNePal#(V)
    
    a__isPal#(V) = V + 3 >= 0 = a__U81#(a__isNePal(V))
    
    mark#(__(X1,X2)) = 5X1 + X2 + 5 >= X2 + 1 = mark#(X2)
    
    mark#(__(X1,X2)) = 5X1 + X2 + 5 >= X1 + 1 = mark#(X1)
    
    mark#(__(X1,X2)) = 5X1 + X2 + 5 >= 5X1 + X2 = a____#(mark(X1),mark(X2))
    
    mark#(U11(X)) = X + 2 >= X + 1 = mark#(X)
    
    mark#(U11(X)) = X + 2 >= X = a__U11#(mark(X))
    
    mark#(U21(X1,X2)) = 2X1 + X2 + 2 >= X1 + 1 = mark#(X1)
    
    mark#(U21(X1,X2)) = 2X1 + X2 + 2 >= 2X1 + X2 = a__U21#(mark(X1),X2)
    
    mark#(U22(X)) = X + 3 >= X + 1 = mark#(X)
    
    mark#(U22(X)) = X + 3 >= 0 = a__U22#(mark(X))
    
    mark#(isList(X)) = X + 3 >= X + 2 = a__isList#(X)
    
    mark#(U31(X)) = X + 2 >= X + 1 = mark#(X)
    
    mark#(U31(X)) = X + 2 >= 0 = a__U31#(mark(X))
    
    mark#(U41(X1,X2)) = 2X1 + X2 + 2 >= X1 + 1 = mark#(X1)
    
    mark#(U41(X1,X2)) = 2X1 + X2 + 2 >= X1 + X2 = a__U41#(mark(X1),X2)
    
    mark#(U42(X)) = X + 5 >= X + 1 = mark#(X)
    
    mark#(U42(X)) = X + 5 >= X = a__U42#(mark(X))
    
    mark#(isNeList(X)) = X + 2 >= X + 1 = a__isNeList#(X)
    
    mark#(U51(X1,X2)) = X1 + X2 + 3 >= X1 + 1 = mark#(X1)
    
    mark#(U51(X1,X2)) = X1 + X2 + 3 >= X1 + X2 + 1 = a__U51#(mark(X1),X2)
    
    mark#(U52(X)) = X + 3 >= X + 1 = mark#(X)
    
    mark#(U52(X)) = X + 3 >= 0 = a__U52#(mark(X))
    
    mark#(U61(X)) = X + 3 >= X + 1 = mark#(X)
    
    mark#(U61(X)) = X + 3 >= X = a__U61#(mark(X))
    
    mark#(U71(X1,X2)) = 6X1 + 4X2 + 6 >= X1 + 1 = mark#(X1)
    
    mark#(U71(X1,X2)) = 6X1 + 4X2 + 6 >= 6X1 + 4X2 = a__U71#(mark(X1),X2)
    
    mark#(U72(X)) = X + 2 >= X + 1 = mark#(X)
    
    mark#(U72(X)) = X + 2 >= 0 = a__U72#(mark(X))
    
    mark#(isPal(X)) = 4X + 7 >= X + 3 = a__isPal#(X)
    
    mark#(U81(X)) = X + 3 >= X + 1 = mark#(X)
    
    mark#(U81(X)) = X + 3 >= 0 = a__U81#(mark(X))
    
    mark#(isQid(X)) = X + 1 >= 0 = a__isQid#(X)
    
    mark#(isNePal(X)) = X + 5 >= X + 2 = a__isNePal#(X)
    
    a____(__(X,Y),Z) = 25X + 5Y + Z + 24 >= 5X + 5Y + Z + 8 = a____(mark(X),a____(mark(Y),mark(Z)))
    
    a____(X,nil()) = 5X + 8 >= X = mark(X)
    
    a____(nil(),X) = X + 24 >= X = mark(X)
    
    a__U11(tt()) = 3 >= 2 = tt()
    
    a__U21(tt(),V2) = V2 + 5 >= V2 + 4 = a__U22(a__isList(V2))
    
    a__U22(tt()) = 4 >= 2 = tt()
    
    a__U31(tt()) = 3 >= 2 = tt()
    
    a__U41(tt(),V2) = V2 + 5 >= V2 + 5 = a__U42(a__isNeList(V2))
    
    a__U42(tt()) = 6 >= 2 = tt()
    
    a__U51(tt(),V2) = V2 + 4 >= V2 + 4 = a__U52(a__isList(V2))
    
    a__U52(tt()) = 4 >= 2 = tt()
    
    a__U61(tt()) = 4 >= 2 = tt()
    
    a__U71(tt(),P) = 4P + 17 >= 4P + 7 = a__U72(a__isPal(P))
    
    a__U72(tt()) = 3 >= 2 = tt()
    
    a__U81(tt()) = 4 >= 2 = tt()
    
    a__isList(V) = V + 2 >= V + 2 = a__U11(a__isNeList(V))
    
    a__isList(nil()) = 6 >= 2 = tt()
    
    a__isList(__(V1,V2)) = 5V1 + V2 + 6 >= 2V1 + V2 + 5 = a__U21(a__isList(V1),V2)
    
    a__isNeList(V) = V + 1 >= V + 1 = a__U31(a__isQid(V))
    
    a__isNeList(__(V1,V2)) = 5V1 + V2 + 5 >= 2V1 + V2 + 5 = a__U41(a__isList(V1),V2)
    
    a__isNeList(__(V1,V2)) = 5V1 + V2 + 5 >= V1 + V2 + 3 = a__U51(a__isNeList(V1),V2)
    
    a__isNePal(V) = V + 4 >= V + 2 = a__U61(a__isQid(V))
    
    a__isNePal(__(I,__(P,I))) = 6I + 5P + 12 >= 6I + 4P + 5 = a__U71(a__isQid(I),P)
    
    a__isPal(V) = 4V + 6 >= V + 6 = a__U81(a__isNePal(V))
    
    a__isPal(nil()) = 22 >= 2 = tt()
    
    a__isQid(a()) = 2 >= 2 = tt()
    
    a__isQid(e()) = 4 >= 2 = tt()
    
    a__isQid(i()) = 3 >= 2 = tt()
    
    a__isQid(o()) = 4 >= 2 = tt()
    
    a__isQid(u()) = 4 >= 2 = tt()
    
    mark(__(X1,X2)) = 5X1 + X2 + 4 >= 5X1 + X2 + 4 = a____(mark(X1),mark(X2))
    
    mark(U11(X)) = X + 1 >= X + 1 = a__U11(mark(X))
    
    mark(U21(X1,X2)) = 2X1 + X2 + 1 >= 2X1 + X2 + 1 = a__U21(mark(X1),X2)
    
    mark(U22(X)) = X + 2 >= X + 2 = a__U22(mark(X))
    
    mark(isList(X)) = X + 2 >= X + 2 = a__isList(X)
    
    mark(U31(X)) = X + 1 >= X + 1 = a__U31(mark(X))
    
    mark(U41(X1,X2)) = 2X1 + X2 + 1 >= 2X1 + X2 + 1 = a__U41(mark(X1),X2)
    
    mark(U42(X)) = X + 4 >= X + 4 = a__U42(mark(X))
    
    mark(isNeList(X)) = X + 1 >= X + 1 = a__isNeList(X)
    
    mark(U51(X1,X2)) = X1 + X2 + 2 >= X1 + X2 + 2 = a__U51(mark(X1),X2)
    
    mark(U52(X)) = X + 2 >= X + 2 = a__U52(mark(X))
    
    mark(U61(X)) = X + 2 >= X + 2 = a__U61(mark(X))
    
    mark(U71(X1,X2)) = 6X1 + 4X2 + 5 >= 6X1 + 4X2 + 5 = a__U71(mark(X1),X2)
    
    mark(U72(X)) = X + 1 >= X + 1 = a__U72(mark(X))
    
    mark(isPal(X)) = 4X + 6 >= 4X + 6 = a__isPal(X)
    
    mark(U81(X)) = X + 2 >= X + 2 = a__U81(mark(X))
    
    mark(isQid(X)) = X >= X = a__isQid(X)
    
    mark(isNePal(X)) = X + 4 >= X + 4 = a__isNePal(X)
    
    mark(nil()) = 4 >= 4 = nil()
    
    mark(tt()) = 2 >= 2 = tt()
    
    mark(a()) = 2 >= 2 = a()
    
    mark(e()) = 4 >= 4 = e()
    
    mark(i()) = 3 >= 3 = i()
    
    mark(o()) = 4 >= 4 = o()
    
    mark(u()) = 4 >= 4 = u()
    
    a____(X1,X2) = 5X1 + X2 + 4 >= 5X1 + X2 + 4 = __(X1,X2)
    
    a__U11(X) = X + 1 >= X + 1 = U11(X)
    
    a__U21(X1,X2) = 2X1 + X2 + 1 >= 2X1 + X2 + 1 = U21(X1,X2)
    
    a__U22(X) = X + 2 >= X + 2 = U22(X)
    
    a__isList(X) = X + 2 >= X + 2 = isList(X)
    
    a__U31(X) = X + 1 >= X + 1 = U31(X)
    
    a__U41(X1,X2) = 2X1 + X2 + 1 >= 2X1 + X2 + 1 = U41(X1,X2)
    
    a__U42(X) = X + 4 >= X + 4 = U42(X)
    
    a__isNeList(X) = X + 1 >= X + 1 = isNeList(X)
    
    a__U51(X1,X2) = X1 + X2 + 2 >= X1 + X2 + 2 = U51(X1,X2)
    
    a__U52(X) = X + 2 >= X + 2 = U52(X)
    
    a__U61(X) = X + 2 >= X + 2 = U61(X)
    
    a__U71(X1,X2) = 6X1 + 4X2 + 5 >= 6X1 + 4X2 + 5 = U71(X1,X2)
    
    a__U72(X) = X + 1 >= X + 1 = U72(X)
    
    a__isPal(X) = 4X + 6 >= 4X + 6 = isPal(X)
    
    a__U81(X) = X + 2 >= X + 2 = U81(X)
    
    a__isQid(X) = X >= X = isQid(X)
    
    a__isNePal(X) = X + 4 >= X + 4 = 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__U11(tt()) -> tt()
     a__U21(tt(),V2) -> a__U22(a__isList(V2))
     a__U22(tt()) -> tt()
     a__U31(tt()) -> tt()
     a__U41(tt(),V2) -> a__U42(a__isNeList(V2))
     a__U42(tt()) -> tt()
     a__U51(tt(),V2) -> a__U52(a__isList(V2))
     a__U52(tt()) -> tt()
     a__U61(tt()) -> tt()
     a__U71(tt(),P) -> a__U72(a__isPal(P))
     a__U72(tt()) -> tt()
     a__U81(tt()) -> tt()
     a__isList(V) -> a__U11(a__isNeList(V))
     a__isList(nil()) -> tt()
     a__isList(__(V1,V2)) -> a__U21(a__isList(V1),V2)
     a__isNeList(V) -> a__U31(a__isQid(V))
     a__isNeList(__(V1,V2)) -> a__U41(a__isList(V1),V2)
     a__isNeList(__(V1,V2)) -> a__U51(a__isNeList(V1),V2)
     a__isNePal(V) -> a__U61(a__isQid(V))
     a__isNePal(__(I,__(P,I))) -> a__U71(a__isQid(I),P)
     a__isPal(V) -> a__U81(a__isNePal(V))
     a__isPal(nil()) -> tt()
     a__isQid(a()) -> tt()
     a__isQid(e()) -> tt()
     a__isQid(i()) -> tt()
     a__isQid(o()) -> tt()
     a__isQid(u()) -> tt()
     mark(__(X1,X2)) -> a____(mark(X1),mark(X2))
     mark(U11(X)) -> a__U11(mark(X))
     mark(U21(X1,X2)) -> a__U21(mark(X1),X2)
     mark(U22(X)) -> a__U22(mark(X))
     mark(isList(X)) -> a__isList(X)
     mark(U31(X)) -> a__U31(mark(X))
     mark(U41(X1,X2)) -> a__U41(mark(X1),X2)
     mark(U42(X)) -> a__U42(mark(X))
     mark(isNeList(X)) -> a__isNeList(X)
     mark(U51(X1,X2)) -> a__U51(mark(X1),X2)
     mark(U52(X)) -> a__U52(mark(X))
     mark(U61(X)) -> a__U61(mark(X))
     mark(U71(X1,X2)) -> a__U71(mark(X1),X2)
     mark(U72(X)) -> a__U72(mark(X))
     mark(isPal(X)) -> a__isPal(X)
     mark(U81(X)) -> a__U81(mark(X))
     mark(isQid(X)) -> a__isQid(X)
     mark(isNePal(X)) -> a__isNePal(X)
     mark(nil()) -> nil()
     mark(tt()) -> tt()
     mark(a()) -> a()
     mark(e()) -> e()
     mark(i()) -> i()
     mark(o()) -> o()
     mark(u()) -> u()
     a____(X1,X2) -> __(X1,X2)
     a__U11(X) -> U11(X)
     a__U21(X1,X2) -> U21(X1,X2)
     a__U22(X) -> U22(X)
     a__isList(X) -> isList(X)
     a__U31(X) -> U31(X)
     a__U41(X1,X2) -> U41(X1,X2)
     a__U42(X) -> U42(X)
     a__isNeList(X) -> isNeList(X)
     a__U51(X1,X2) -> U51(X1,X2)
     a__U52(X) -> U52(X)
     a__U61(X) -> U61(X)
     a__U71(X1,X2) -> U71(X1,X2)
     a__U72(X) -> U72(X)
     a__isPal(X) -> isPal(X)
     a__U81(X) -> U81(X)
     a__isQid(X) -> isQid(X)
     a__isNePal(X) -> isNePal(X)
   Qed