YES

Problem 1: 

(VAR v_NonEmpty:S X:S X1:S X2:S XS:S)
(RULES
a__tail(cons(X:S,XS:S)) -> mark(XS:S)
a__tail(X:S) -> tail(X:S)
a__zeros -> cons(0,zeros)
a__zeros -> zeros
mark(0) -> 0
mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S)
mark(tail(X:S)) -> a__tail(mark(X:S))
mark(zeros) -> a__zeros
) 
(STRATEGY INNERMOST)

Problem 1: 

Dependency Pairs Processor:
-> Pairs:
 A__TAIL(cons(X:S,XS:S)) -> MARK(XS:S)
 MARK(cons(X1:S,X2:S)) -> MARK(X1:S)
 MARK(tail(X:S)) -> A__TAIL(mark(X:S))
 MARK(tail(X:S)) -> MARK(X:S)
 MARK(zeros) -> A__ZEROS
-> Rules:
 a__tail(cons(X:S,XS:S)) -> mark(XS:S)
 a__tail(X:S) -> tail(X:S)
 a__zeros -> cons(0,zeros)
 a__zeros -> zeros
 mark(0) -> 0
 mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S)
 mark(tail(X:S)) -> a__tail(mark(X:S))
 mark(zeros) -> a__zeros

Problem 1: 

SCC Processor:
-> Pairs:
 A__TAIL(cons(X:S,XS:S)) -> MARK(XS:S)
 MARK(cons(X1:S,X2:S)) -> MARK(X1:S)
 MARK(tail(X:S)) -> A__TAIL(mark(X:S))
 MARK(tail(X:S)) -> MARK(X:S)
 MARK(zeros) -> A__ZEROS
-> Rules:
 a__tail(cons(X:S,XS:S)) -> mark(XS:S)
 a__tail(X:S) -> tail(X:S)
 a__zeros -> cons(0,zeros)
 a__zeros -> zeros
 mark(0) -> 0
 mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S)
 mark(tail(X:S)) -> a__tail(mark(X:S))
 mark(zeros) -> a__zeros
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 A__TAIL(cons(X:S,XS:S)) -> MARK(XS:S)
 MARK(cons(X1:S,X2:S)) -> MARK(X1:S)
 MARK(tail(X:S)) -> A__TAIL(mark(X:S))
 MARK(tail(X:S)) -> MARK(X:S)
->->-> Rules:
 a__tail(cons(X:S,XS:S)) -> mark(XS:S)
 a__tail(X:S) -> tail(X:S)
 a__zeros -> cons(0,zeros)
 a__zeros -> zeros
 mark(0) -> 0
 mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S)
 mark(tail(X:S)) -> a__tail(mark(X:S))
 mark(zeros) -> a__zeros

Problem 1: 

Reduction Pairs Processor:
-> Pairs:
 A__TAIL(cons(X:S,XS:S)) -> MARK(XS:S)
 MARK(cons(X1:S,X2:S)) -> MARK(X1:S)
 MARK(tail(X:S)) -> A__TAIL(mark(X:S))
 MARK(tail(X:S)) -> MARK(X:S)
-> Rules:
 a__tail(cons(X:S,XS:S)) -> mark(XS:S)
 a__tail(X:S) -> tail(X:S)
 a__zeros -> cons(0,zeros)
 a__zeros -> zeros
 mark(0) -> 0
 mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S)
 mark(tail(X:S)) -> a__tail(mark(X:S))
 mark(zeros) -> a__zeros
-> Usable rules:
 a__tail(cons(X:S,XS:S)) -> mark(XS:S)
 a__tail(X:S) -> tail(X:S)
 a__zeros -> cons(0,zeros)
 a__zeros -> zeros
 mark(0) -> 0
 mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S)
 mark(tail(X:S)) -> a__tail(mark(X:S))
 mark(zeros) -> a__zeros
->Interpretation type:
 Linear
->Coefficients:
 Natural Numbers
->Dimension:
 1
->Bound:
 2
->Interpretation:
 
[a__tail](X) = 2.X
[a__zeros] = 2
[mark](X) = 2.X
[0] = 0
[cons](X1,X2) = 2.X1 + X2 + 1
[fSNonEmpty] = 0
[tail](X) = 2.X
[zeros] = 1
[A__TAIL](X) = 2.X + 1
[A__ZEROS] = 0
[MARK](X) = 2.X + 2

Problem 1: 

SCC Processor:
-> Pairs:
 MARK(cons(X1:S,X2:S)) -> MARK(X1:S)
 MARK(tail(X:S)) -> A__TAIL(mark(X:S))
 MARK(tail(X:S)) -> MARK(X:S)
-> Rules:
 a__tail(cons(X:S,XS:S)) -> mark(XS:S)
 a__tail(X:S) -> tail(X:S)
 a__zeros -> cons(0,zeros)
 a__zeros -> zeros
 mark(0) -> 0
 mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S)
 mark(tail(X:S)) -> a__tail(mark(X:S))
 mark(zeros) -> a__zeros
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 MARK(cons(X1:S,X2:S)) -> MARK(X1:S)
 MARK(tail(X:S)) -> MARK(X:S)
->->-> Rules:
 a__tail(cons(X:S,XS:S)) -> mark(XS:S)
 a__tail(X:S) -> tail(X:S)
 a__zeros -> cons(0,zeros)
 a__zeros -> zeros
 mark(0) -> 0
 mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S)
 mark(tail(X:S)) -> a__tail(mark(X:S))
 mark(zeros) -> a__zeros

Problem 1: 

Subterm Processor:
-> Pairs:
 MARK(cons(X1:S,X2:S)) -> MARK(X1:S)
 MARK(tail(X:S)) -> MARK(X:S)
-> Rules:
 a__tail(cons(X:S,XS:S)) -> mark(XS:S)
 a__tail(X:S) -> tail(X:S)
 a__zeros -> cons(0,zeros)
 a__zeros -> zeros
 mark(0) -> 0
 mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S)
 mark(tail(X:S)) -> a__tail(mark(X:S))
 mark(zeros) -> a__zeros
->Projection:
 pi(MARK) = 1

Problem 1: 

SCC Processor:
-> Pairs:
 Empty
-> Rules:
 a__tail(cons(X:S,XS:S)) -> mark(XS:S)
 a__tail(X:S) -> tail(X:S)
 a__zeros -> cons(0,zeros)
 a__zeros -> zeros
 mark(0) -> 0
 mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S)
 mark(tail(X:S)) -> a__tail(mark(X:S))
 mark(zeros) -> a__zeros
->Strongly Connected Components:
 There is no strongly connected component

The problem is finite.