YES

Problem 1: 

(VAR v_NonEmpty:S L:S X:S X1:S X2:S)
(RULES
a__adx(cons(X:S,L:S)) -> a__incr(cons(mark(X:S),adx(L:S)))
a__adx(nil) -> nil
a__adx(X:S) -> adx(X:S)
a__head(cons(X:S,L:S)) -> mark(X:S)
a__head(X:S) -> head(X:S)
a__incr(cons(X:S,L:S)) -> cons(s(mark(X:S)),incr(L:S))
a__incr(nil) -> nil
a__incr(X:S) -> incr(X:S)
a__nats -> a__adx(a__zeros)
a__nats -> nats
a__tail(cons(X:S,L:S)) -> mark(L:S)
a__tail(X:S) -> tail(X:S)
a__zeros -> cons(0,zeros)
a__zeros -> zeros
mark(0) -> 0
mark(adx(X:S)) -> a__adx(mark(X:S))
mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S)
mark(head(X:S)) -> a__head(mark(X:S))
mark(incr(X:S)) -> a__incr(mark(X:S))
mark(nats) -> a__nats
mark(nil) -> nil
mark(s(X:S)) -> s(mark(X:S))
mark(tail(X:S)) -> a__tail(mark(X:S))
mark(zeros) -> a__zeros
) 
(STRATEGY INNERMOST)

Problem 1: 

Dependency Pairs Processor:
-> Pairs:
 A__ADX(cons(X:S,L:S)) -> A__INCR(cons(mark(X:S),adx(L:S)))
 A__ADX(cons(X:S,L:S)) -> MARK(X:S)
 A__HEAD(cons(X:S,L:S)) -> MARK(X:S)
 A__INCR(cons(X:S,L:S)) -> MARK(X:S)
 A__NATS -> A__ADX(a__zeros)
 A__NATS -> A__ZEROS
 A__TAIL(cons(X:S,L:S)) -> MARK(L:S)
 MARK(adx(X:S)) -> A__ADX(mark(X:S))
 MARK(adx(X:S)) -> MARK(X:S)
 MARK(cons(X1:S,X2:S)) -> MARK(X1:S)
 MARK(head(X:S)) -> A__HEAD(mark(X:S))
 MARK(head(X:S)) -> MARK(X:S)
 MARK(incr(X:S)) -> A__INCR(mark(X:S))
 MARK(incr(X:S)) -> MARK(X:S)
 MARK(nats) -> A__NATS
 MARK(s(X:S)) -> MARK(X:S)
 MARK(tail(X:S)) -> A__TAIL(mark(X:S))
 MARK(tail(X:S)) -> MARK(X:S)
 MARK(zeros) -> A__ZEROS
-> Rules:
 a__adx(cons(X:S,L:S)) -> a__incr(cons(mark(X:S),adx(L:S)))
 a__adx(nil) -> nil
 a__adx(X:S) -> adx(X:S)
 a__head(cons(X:S,L:S)) -> mark(X:S)
 a__head(X:S) -> head(X:S)
 a__incr(cons(X:S,L:S)) -> cons(s(mark(X:S)),incr(L:S))
 a__incr(nil) -> nil
 a__incr(X:S) -> incr(X:S)
 a__nats -> a__adx(a__zeros)
 a__nats -> nats
 a__tail(cons(X:S,L:S)) -> mark(L:S)
 a__tail(X:S) -> tail(X:S)
 a__zeros -> cons(0,zeros)
 a__zeros -> zeros
 mark(0) -> 0
 mark(adx(X:S)) -> a__adx(mark(X:S))
 mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S)
 mark(head(X:S)) -> a__head(mark(X:S))
 mark(incr(X:S)) -> a__incr(mark(X:S))
 mark(nats) -> a__nats
 mark(nil) -> nil
 mark(s(X:S)) -> s(mark(X:S))
 mark(tail(X:S)) -> a__tail(mark(X:S))
 mark(zeros) -> a__zeros

Problem 1: 

SCC Processor:
-> Pairs:
 A__ADX(cons(X:S,L:S)) -> A__INCR(cons(mark(X:S),adx(L:S)))
 A__ADX(cons(X:S,L:S)) -> MARK(X:S)
 A__HEAD(cons(X:S,L:S)) -> MARK(X:S)
 A__INCR(cons(X:S,L:S)) -> MARK(X:S)
 A__NATS -> A__ADX(a__zeros)
 A__NATS -> A__ZEROS
 A__TAIL(cons(X:S,L:S)) -> MARK(L:S)
 MARK(adx(X:S)) -> A__ADX(mark(X:S))
 MARK(adx(X:S)) -> MARK(X:S)
 MARK(cons(X1:S,X2:S)) -> MARK(X1:S)
 MARK(head(X:S)) -> A__HEAD(mark(X:S))
 MARK(head(X:S)) -> MARK(X:S)
 MARK(incr(X:S)) -> A__INCR(mark(X:S))
 MARK(incr(X:S)) -> MARK(X:S)
 MARK(nats) -> A__NATS
 MARK(s(X:S)) -> MARK(X:S)
 MARK(tail(X:S)) -> A__TAIL(mark(X:S))
 MARK(tail(X:S)) -> MARK(X:S)
 MARK(zeros) -> A__ZEROS
-> Rules:
 a__adx(cons(X:S,L:S)) -> a__incr(cons(mark(X:S),adx(L:S)))
 a__adx(nil) -> nil
 a__adx(X:S) -> adx(X:S)
 a__head(cons(X:S,L:S)) -> mark(X:S)
 a__head(X:S) -> head(X:S)
 a__incr(cons(X:S,L:S)) -> cons(s(mark(X:S)),incr(L:S))
 a__incr(nil) -> nil
 a__incr(X:S) -> incr(X:S)
 a__nats -> a__adx(a__zeros)
 a__nats -> nats
 a__tail(cons(X:S,L:S)) -> mark(L:S)
 a__tail(X:S) -> tail(X:S)
 a__zeros -> cons(0,zeros)
 a__zeros -> zeros
 mark(0) -> 0
 mark(adx(X:S)) -> a__adx(mark(X:S))
 mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S)
 mark(head(X:S)) -> a__head(mark(X:S))
 mark(incr(X:S)) -> a__incr(mark(X:S))
 mark(nats) -> a__nats
 mark(nil) -> nil
 mark(s(X:S)) -> s(mark(X:S))
 mark(tail(X:S)) -> a__tail(mark(X:S))
 mark(zeros) -> a__zeros
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 A__ADX(cons(X:S,L:S)) -> A__INCR(cons(mark(X:S),adx(L:S)))
 A__ADX(cons(X:S,L:S)) -> MARK(X:S)
 A__HEAD(cons(X:S,L:S)) -> MARK(X:S)
 A__INCR(cons(X:S,L:S)) -> MARK(X:S)
 A__NATS -> A__ADX(a__zeros)
 A__TAIL(cons(X:S,L:S)) -> MARK(L:S)
 MARK(adx(X:S)) -> A__ADX(mark(X:S))
 MARK(adx(X:S)) -> MARK(X:S)
 MARK(cons(X1:S,X2:S)) -> MARK(X1:S)
 MARK(head(X:S)) -> A__HEAD(mark(X:S))
 MARK(head(X:S)) -> MARK(X:S)
 MARK(incr(X:S)) -> A__INCR(mark(X:S))
 MARK(incr(X:S)) -> MARK(X:S)
 MARK(nats) -> A__NATS
 MARK(s(X:S)) -> MARK(X:S)
 MARK(tail(X:S)) -> A__TAIL(mark(X:S))
 MARK(tail(X:S)) -> MARK(X:S)
->->-> Rules:
 a__adx(cons(X:S,L:S)) -> a__incr(cons(mark(X:S),adx(L:S)))
 a__adx(nil) -> nil
 a__adx(X:S) -> adx(X:S)
 a__head(cons(X:S,L:S)) -> mark(X:S)
 a__head(X:S) -> head(X:S)
 a__incr(cons(X:S,L:S)) -> cons(s(mark(X:S)),incr(L:S))
 a__incr(nil) -> nil
 a__incr(X:S) -> incr(X:S)
 a__nats -> a__adx(a__zeros)
 a__nats -> nats
 a__tail(cons(X:S,L:S)) -> mark(L:S)
 a__tail(X:S) -> tail(X:S)
 a__zeros -> cons(0,zeros)
 a__zeros -> zeros
 mark(0) -> 0
 mark(adx(X:S)) -> a__adx(mark(X:S))
 mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S)
 mark(head(X:S)) -> a__head(mark(X:S))
 mark(incr(X:S)) -> a__incr(mark(X:S))
 mark(nats) -> a__nats
 mark(nil) -> nil
 mark(s(X:S)) -> s(mark(X:S))
 mark(tail(X:S)) -> a__tail(mark(X:S))
 mark(zeros) -> a__zeros

Problem 1: 

Reduction Pairs Processor:
-> Pairs:
 A__ADX(cons(X:S,L:S)) -> A__INCR(cons(mark(X:S),adx(L:S)))
 A__ADX(cons(X:S,L:S)) -> MARK(X:S)
 A__HEAD(cons(X:S,L:S)) -> MARK(X:S)
 A__INCR(cons(X:S,L:S)) -> MARK(X:S)
 A__NATS -> A__ADX(a__zeros)
 A__TAIL(cons(X:S,L:S)) -> MARK(L:S)
 MARK(adx(X:S)) -> A__ADX(mark(X:S))
 MARK(adx(X:S)) -> MARK(X:S)
 MARK(cons(X1:S,X2:S)) -> MARK(X1:S)
 MARK(head(X:S)) -> A__HEAD(mark(X:S))
 MARK(head(X:S)) -> MARK(X:S)
 MARK(incr(X:S)) -> A__INCR(mark(X:S))
 MARK(incr(X:S)) -> MARK(X:S)
 MARK(nats) -> A__NATS
 MARK(s(X:S)) -> MARK(X:S)
 MARK(tail(X:S)) -> A__TAIL(mark(X:S))
 MARK(tail(X:S)) -> MARK(X:S)
-> Rules:
 a__adx(cons(X:S,L:S)) -> a__incr(cons(mark(X:S),adx(L:S)))
 a__adx(nil) -> nil
 a__adx(X:S) -> adx(X:S)
 a__head(cons(X:S,L:S)) -> mark(X:S)
 a__head(X:S) -> head(X:S)
 a__incr(cons(X:S,L:S)) -> cons(s(mark(X:S)),incr(L:S))
 a__incr(nil) -> nil
 a__incr(X:S) -> incr(X:S)
 a__nats -> a__adx(a__zeros)
 a__nats -> nats
 a__tail(cons(X:S,L:S)) -> mark(L:S)
 a__tail(X:S) -> tail(X:S)
 a__zeros -> cons(0,zeros)
 a__zeros -> zeros
 mark(0) -> 0
 mark(adx(X:S)) -> a__adx(mark(X:S))
 mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S)
 mark(head(X:S)) -> a__head(mark(X:S))
 mark(incr(X:S)) -> a__incr(mark(X:S))
 mark(nats) -> a__nats
 mark(nil) -> nil
 mark(s(X:S)) -> s(mark(X:S))
 mark(tail(X:S)) -> a__tail(mark(X:S))
 mark(zeros) -> a__zeros
-> Usable rules:
 a__adx(cons(X:S,L:S)) -> a__incr(cons(mark(X:S),adx(L:S)))
 a__adx(nil) -> nil
 a__adx(X:S) -> adx(X:S)
 a__head(cons(X:S,L:S)) -> mark(X:S)
 a__head(X:S) -> head(X:S)
 a__incr(cons(X:S,L:S)) -> cons(s(mark(X:S)),incr(L:S))
 a__incr(nil) -> nil
 a__incr(X:S) -> incr(X:S)
 a__nats -> a__adx(a__zeros)
 a__nats -> nats
 a__tail(cons(X:S,L:S)) -> mark(L:S)
 a__tail(X:S) -> tail(X:S)
 a__zeros -> cons(0,zeros)
 a__zeros -> zeros
 mark(0) -> 0
 mark(adx(X:S)) -> a__adx(mark(X:S))
 mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S)
 mark(head(X:S)) -> a__head(mark(X:S))
 mark(incr(X:S)) -> a__incr(mark(X:S))
 mark(nats) -> a__nats
 mark(nil) -> nil
 mark(s(X:S)) -> s(mark(X: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__adx](X) = 2.X + 1
[a__head](X) = X + 2
[a__incr](X) = X
[a__nats] = 2
[a__tail](X) = 2.X + 2
[a__zeros] = 0
[mark](X) = X
[0] = 0
[adx](X) = 2.X + 1
[cons](X1,X2) = 2.X1 + X2
[fSNonEmpty] = 0
[head](X) = X + 2
[incr](X) = X
[nats] = 2
[nil] = 1
[s](X) = X
[tail](X) = 2.X + 2
[zeros] = 0
[A__ADX](X) = 2.X + 2
[A__HEAD](X) = X
[A__INCR](X) = X
[A__NATS] = 2
[A__TAIL](X) = 2.X + 1
[A__ZEROS] = 0
[MARK](X) = 2.X

Problem 1: 

SCC Processor:
-> Pairs:
 A__ADX(cons(X:S,L:S)) -> MARK(X:S)
 A__HEAD(cons(X:S,L:S)) -> MARK(X:S)
 A__INCR(cons(X:S,L:S)) -> MARK(X:S)
 A__NATS -> A__ADX(a__zeros)
 A__TAIL(cons(X:S,L:S)) -> MARK(L:S)
 MARK(adx(X:S)) -> A__ADX(mark(X:S))
 MARK(adx(X:S)) -> MARK(X:S)
 MARK(cons(X1:S,X2:S)) -> MARK(X1:S)
 MARK(head(X:S)) -> A__HEAD(mark(X:S))
 MARK(head(X:S)) -> MARK(X:S)
 MARK(incr(X:S)) -> A__INCR(mark(X:S))
 MARK(incr(X:S)) -> MARK(X:S)
 MARK(nats) -> A__NATS
 MARK(s(X:S)) -> MARK(X:S)
 MARK(tail(X:S)) -> A__TAIL(mark(X:S))
 MARK(tail(X:S)) -> MARK(X:S)
-> Rules:
 a__adx(cons(X:S,L:S)) -> a__incr(cons(mark(X:S),adx(L:S)))
 a__adx(nil) -> nil
 a__adx(X:S) -> adx(X:S)
 a__head(cons(X:S,L:S)) -> mark(X:S)
 a__head(X:S) -> head(X:S)
 a__incr(cons(X:S,L:S)) -> cons(s(mark(X:S)),incr(L:S))
 a__incr(nil) -> nil
 a__incr(X:S) -> incr(X:S)
 a__nats -> a__adx(a__zeros)
 a__nats -> nats
 a__tail(cons(X:S,L:S)) -> mark(L:S)
 a__tail(X:S) -> tail(X:S)
 a__zeros -> cons(0,zeros)
 a__zeros -> zeros
 mark(0) -> 0
 mark(adx(X:S)) -> a__adx(mark(X:S))
 mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S)
 mark(head(X:S)) -> a__head(mark(X:S))
 mark(incr(X:S)) -> a__incr(mark(X:S))
 mark(nats) -> a__nats
 mark(nil) -> nil
 mark(s(X:S)) -> s(mark(X:S))
 mark(tail(X:S)) -> a__tail(mark(X:S))
 mark(zeros) -> a__zeros
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 A__ADX(cons(X:S,L:S)) -> MARK(X:S)
 A__HEAD(cons(X:S,L:S)) -> MARK(X:S)
 A__INCR(cons(X:S,L:S)) -> MARK(X:S)
 A__NATS -> A__ADX(a__zeros)
 A__TAIL(cons(X:S,L:S)) -> MARK(L:S)
 MARK(adx(X:S)) -> A__ADX(mark(X:S))
 MARK(adx(X:S)) -> MARK(X:S)
 MARK(cons(X1:S,X2:S)) -> MARK(X1:S)
 MARK(head(X:S)) -> A__HEAD(mark(X:S))
 MARK(head(X:S)) -> MARK(X:S)
 MARK(incr(X:S)) -> A__INCR(mark(X:S))
 MARK(incr(X:S)) -> MARK(X:S)
 MARK(nats) -> A__NATS
 MARK(s(X:S)) -> MARK(X:S)
 MARK(tail(X:S)) -> A__TAIL(mark(X:S))
 MARK(tail(X:S)) -> MARK(X:S)
->->-> Rules:
 a__adx(cons(X:S,L:S)) -> a__incr(cons(mark(X:S),adx(L:S)))
 a__adx(nil) -> nil
 a__adx(X:S) -> adx(X:S)
 a__head(cons(X:S,L:S)) -> mark(X:S)
 a__head(X:S) -> head(X:S)
 a__incr(cons(X:S,L:S)) -> cons(s(mark(X:S)),incr(L:S))
 a__incr(nil) -> nil
 a__incr(X:S) -> incr(X:S)
 a__nats -> a__adx(a__zeros)
 a__nats -> nats
 a__tail(cons(X:S,L:S)) -> mark(L:S)
 a__tail(X:S) -> tail(X:S)
 a__zeros -> cons(0,zeros)
 a__zeros -> zeros
 mark(0) -> 0
 mark(adx(X:S)) -> a__adx(mark(X:S))
 mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S)
 mark(head(X:S)) -> a__head(mark(X:S))
 mark(incr(X:S)) -> a__incr(mark(X:S))
 mark(nats) -> a__nats
 mark(nil) -> nil
 mark(s(X:S)) -> s(mark(X:S))
 mark(tail(X:S)) -> a__tail(mark(X:S))
 mark(zeros) -> a__zeros

Problem 1: 

Reduction Pairs Processor:
-> Pairs:
 A__ADX(cons(X:S,L:S)) -> MARK(X:S)
 A__HEAD(cons(X:S,L:S)) -> MARK(X:S)
 A__INCR(cons(X:S,L:S)) -> MARK(X:S)
 A__NATS -> A__ADX(a__zeros)
 A__TAIL(cons(X:S,L:S)) -> MARK(L:S)
 MARK(adx(X:S)) -> A__ADX(mark(X:S))
 MARK(adx(X:S)) -> MARK(X:S)
 MARK(cons(X1:S,X2:S)) -> MARK(X1:S)
 MARK(head(X:S)) -> A__HEAD(mark(X:S))
 MARK(head(X:S)) -> MARK(X:S)
 MARK(incr(X:S)) -> A__INCR(mark(X:S))
 MARK(incr(X:S)) -> MARK(X:S)
 MARK(nats) -> A__NATS
 MARK(s(X:S)) -> MARK(X:S)
 MARK(tail(X:S)) -> A__TAIL(mark(X:S))
 MARK(tail(X:S)) -> MARK(X:S)
-> Rules:
 a__adx(cons(X:S,L:S)) -> a__incr(cons(mark(X:S),adx(L:S)))
 a__adx(nil) -> nil
 a__adx(X:S) -> adx(X:S)
 a__head(cons(X:S,L:S)) -> mark(X:S)
 a__head(X:S) -> head(X:S)
 a__incr(cons(X:S,L:S)) -> cons(s(mark(X:S)),incr(L:S))
 a__incr(nil) -> nil
 a__incr(X:S) -> incr(X:S)
 a__nats -> a__adx(a__zeros)
 a__nats -> nats
 a__tail(cons(X:S,L:S)) -> mark(L:S)
 a__tail(X:S) -> tail(X:S)
 a__zeros -> cons(0,zeros)
 a__zeros -> zeros
 mark(0) -> 0
 mark(adx(X:S)) -> a__adx(mark(X:S))
 mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S)
 mark(head(X:S)) -> a__head(mark(X:S))
 mark(incr(X:S)) -> a__incr(mark(X:S))
 mark(nats) -> a__nats
 mark(nil) -> nil
 mark(s(X:S)) -> s(mark(X:S))
 mark(tail(X:S)) -> a__tail(mark(X:S))
 mark(zeros) -> a__zeros
-> Usable rules:
 a__adx(cons(X:S,L:S)) -> a__incr(cons(mark(X:S),adx(L:S)))
 a__adx(nil) -> nil
 a__adx(X:S) -> adx(X:S)
 a__head(cons(X:S,L:S)) -> mark(X:S)
 a__head(X:S) -> head(X:S)
 a__incr(cons(X:S,L:S)) -> cons(s(mark(X:S)),incr(L:S))
 a__incr(nil) -> nil
 a__incr(X:S) -> incr(X:S)
 a__nats -> a__adx(a__zeros)
 a__nats -> nats
 a__tail(cons(X:S,L:S)) -> mark(L:S)
 a__tail(X:S) -> tail(X:S)
 a__zeros -> cons(0,zeros)
 a__zeros -> zeros
 mark(0) -> 0
 mark(adx(X:S)) -> a__adx(mark(X:S))
 mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S)
 mark(head(X:S)) -> a__head(mark(X:S))
 mark(incr(X:S)) -> a__incr(mark(X:S))
 mark(nats) -> a__nats
 mark(nil) -> nil
 mark(s(X:S)) -> s(mark(X: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__adx](X) = 2.X + 2
[a__head](X) = 2.X + 2
[a__incr](X) = X
[a__nats] = 2
[a__tail](X) = 2.X + 2
[a__zeros] = 0
[mark](X) = X
[0] = 0
[adx](X) = 2.X + 2
[cons](X1,X2) = 2.X1 + X2
[fSNonEmpty] = 0
[head](X) = 2.X + 2
[incr](X) = X
[nats] = 2
[nil] = 2
[s](X) = X
[tail](X) = 2.X + 2
[zeros] = 0
[A__ADX](X) = 2.X + 2
[A__HEAD](X) = 2.X + 2
[A__INCR](X) = X + 1
[A__NATS] = 2
[A__TAIL](X) = 2.X + 1
[A__ZEROS] = 0
[MARK](X) = 2.X + 1

Problem 1: 

SCC Processor:
-> Pairs:
 A__HEAD(cons(X:S,L:S)) -> MARK(X:S)
 A__INCR(cons(X:S,L:S)) -> MARK(X:S)
 A__NATS -> A__ADX(a__zeros)
 A__TAIL(cons(X:S,L:S)) -> MARK(L:S)
 MARK(adx(X:S)) -> A__ADX(mark(X:S))
 MARK(adx(X:S)) -> MARK(X:S)
 MARK(cons(X1:S,X2:S)) -> MARK(X1:S)
 MARK(head(X:S)) -> A__HEAD(mark(X:S))
 MARK(head(X:S)) -> MARK(X:S)
 MARK(incr(X:S)) -> A__INCR(mark(X:S))
 MARK(incr(X:S)) -> MARK(X:S)
 MARK(nats) -> A__NATS
 MARK(s(X:S)) -> MARK(X:S)
 MARK(tail(X:S)) -> A__TAIL(mark(X:S))
 MARK(tail(X:S)) -> MARK(X:S)
-> Rules:
 a__adx(cons(X:S,L:S)) -> a__incr(cons(mark(X:S),adx(L:S)))
 a__adx(nil) -> nil
 a__adx(X:S) -> adx(X:S)
 a__head(cons(X:S,L:S)) -> mark(X:S)
 a__head(X:S) -> head(X:S)
 a__incr(cons(X:S,L:S)) -> cons(s(mark(X:S)),incr(L:S))
 a__incr(nil) -> nil
 a__incr(X:S) -> incr(X:S)
 a__nats -> a__adx(a__zeros)
 a__nats -> nats
 a__tail(cons(X:S,L:S)) -> mark(L:S)
 a__tail(X:S) -> tail(X:S)
 a__zeros -> cons(0,zeros)
 a__zeros -> zeros
 mark(0) -> 0
 mark(adx(X:S)) -> a__adx(mark(X:S))
 mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S)
 mark(head(X:S)) -> a__head(mark(X:S))
 mark(incr(X:S)) -> a__incr(mark(X:S))
 mark(nats) -> a__nats
 mark(nil) -> nil
 mark(s(X:S)) -> s(mark(X:S))
 mark(tail(X:S)) -> a__tail(mark(X:S))
 mark(zeros) -> a__zeros
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 A__HEAD(cons(X:S,L:S)) -> MARK(X:S)
 A__INCR(cons(X:S,L:S)) -> MARK(X:S)
 A__TAIL(cons(X:S,L:S)) -> MARK(L:S)
 MARK(adx(X:S)) -> MARK(X:S)
 MARK(cons(X1:S,X2:S)) -> MARK(X1:S)
 MARK(head(X:S)) -> A__HEAD(mark(X:S))
 MARK(head(X:S)) -> MARK(X:S)
 MARK(incr(X:S)) -> A__INCR(mark(X:S))
 MARK(incr(X:S)) -> MARK(X:S)
 MARK(s(X:S)) -> MARK(X:S)
 MARK(tail(X:S)) -> A__TAIL(mark(X:S))
 MARK(tail(X:S)) -> MARK(X:S)
->->-> Rules:
 a__adx(cons(X:S,L:S)) -> a__incr(cons(mark(X:S),adx(L:S)))
 a__adx(nil) -> nil
 a__adx(X:S) -> adx(X:S)
 a__head(cons(X:S,L:S)) -> mark(X:S)
 a__head(X:S) -> head(X:S)
 a__incr(cons(X:S,L:S)) -> cons(s(mark(X:S)),incr(L:S))
 a__incr(nil) -> nil
 a__incr(X:S) -> incr(X:S)
 a__nats -> a__adx(a__zeros)
 a__nats -> nats
 a__tail(cons(X:S,L:S)) -> mark(L:S)
 a__tail(X:S) -> tail(X:S)
 a__zeros -> cons(0,zeros)
 a__zeros -> zeros
 mark(0) -> 0
 mark(adx(X:S)) -> a__adx(mark(X:S))
 mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S)
 mark(head(X:S)) -> a__head(mark(X:S))
 mark(incr(X:S)) -> a__incr(mark(X:S))
 mark(nats) -> a__nats
 mark(nil) -> nil
 mark(s(X:S)) -> s(mark(X:S))
 mark(tail(X:S)) -> a__tail(mark(X:S))
 mark(zeros) -> a__zeros

Problem 1: 

Reduction Pairs Processor:
-> Pairs:
 A__HEAD(cons(X:S,L:S)) -> MARK(X:S)
 A__INCR(cons(X:S,L:S)) -> MARK(X:S)
 A__TAIL(cons(X:S,L:S)) -> MARK(L:S)
 MARK(adx(X:S)) -> MARK(X:S)
 MARK(cons(X1:S,X2:S)) -> MARK(X1:S)
 MARK(head(X:S)) -> A__HEAD(mark(X:S))
 MARK(head(X:S)) -> MARK(X:S)
 MARK(incr(X:S)) -> A__INCR(mark(X:S))
 MARK(incr(X:S)) -> MARK(X:S)
 MARK(s(X:S)) -> MARK(X:S)
 MARK(tail(X:S)) -> A__TAIL(mark(X:S))
 MARK(tail(X:S)) -> MARK(X:S)
-> Rules:
 a__adx(cons(X:S,L:S)) -> a__incr(cons(mark(X:S),adx(L:S)))
 a__adx(nil) -> nil
 a__adx(X:S) -> adx(X:S)
 a__head(cons(X:S,L:S)) -> mark(X:S)
 a__head(X:S) -> head(X:S)
 a__incr(cons(X:S,L:S)) -> cons(s(mark(X:S)),incr(L:S))
 a__incr(nil) -> nil
 a__incr(X:S) -> incr(X:S)
 a__nats -> a__adx(a__zeros)
 a__nats -> nats
 a__tail(cons(X:S,L:S)) -> mark(L:S)
 a__tail(X:S) -> tail(X:S)
 a__zeros -> cons(0,zeros)
 a__zeros -> zeros
 mark(0) -> 0
 mark(adx(X:S)) -> a__adx(mark(X:S))
 mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S)
 mark(head(X:S)) -> a__head(mark(X:S))
 mark(incr(X:S)) -> a__incr(mark(X:S))
 mark(nats) -> a__nats
 mark(nil) -> nil
 mark(s(X:S)) -> s(mark(X:S))
 mark(tail(X:S)) -> a__tail(mark(X:S))
 mark(zeros) -> a__zeros
-> Usable rules:
 a__adx(cons(X:S,L:S)) -> a__incr(cons(mark(X:S),adx(L:S)))
 a__adx(nil) -> nil
 a__adx(X:S) -> adx(X:S)
 a__head(cons(X:S,L:S)) -> mark(X:S)
 a__head(X:S) -> head(X:S)
 a__incr(cons(X:S,L:S)) -> cons(s(mark(X:S)),incr(L:S))
 a__incr(nil) -> nil
 a__incr(X:S) -> incr(X:S)
 a__nats -> a__adx(a__zeros)
 a__nats -> nats
 a__tail(cons(X:S,L:S)) -> mark(L:S)
 a__tail(X:S) -> tail(X:S)
 a__zeros -> cons(0,zeros)
 a__zeros -> zeros
 mark(0) -> 0
 mark(adx(X:S)) -> a__adx(mark(X:S))
 mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S)
 mark(head(X:S)) -> a__head(mark(X:S))
 mark(incr(X:S)) -> a__incr(mark(X:S))
 mark(nats) -> a__nats
 mark(nil) -> nil
 mark(s(X:S)) -> s(mark(X: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__adx](X) = 2.X + 2
[a__head](X) = 2.X + 2
[a__incr](X) = X
[a__nats] = 2
[a__tail](X) = 2.X + 2
[a__zeros] = 0
[mark](X) = X
[0] = 0
[adx](X) = 2.X + 2
[cons](X1,X2) = 2.X1 + X2
[fSNonEmpty] = 0
[head](X) = 2.X + 2
[incr](X) = X
[nats] = 2
[nil] = 2
[s](X) = X
[tail](X) = 2.X + 2
[zeros] = 0
[A__ADX](X) = 0
[A__HEAD](X) = X + 2
[A__INCR](X) = X + 1
[A__NATS] = 0
[A__TAIL](X) = 2.X + 2
[A__ZEROS] = 0
[MARK](X) = 2.X + 1

Problem 1: 

SCC Processor:
-> Pairs:
 A__INCR(cons(X:S,L:S)) -> MARK(X:S)
 A__TAIL(cons(X:S,L:S)) -> MARK(L:S)
 MARK(adx(X:S)) -> MARK(X:S)
 MARK(cons(X1:S,X2:S)) -> MARK(X1:S)
 MARK(head(X:S)) -> A__HEAD(mark(X:S))
 MARK(head(X:S)) -> MARK(X:S)
 MARK(incr(X:S)) -> A__INCR(mark(X:S))
 MARK(incr(X:S)) -> MARK(X:S)
 MARK(s(X:S)) -> MARK(X:S)
 MARK(tail(X:S)) -> A__TAIL(mark(X:S))
 MARK(tail(X:S)) -> MARK(X:S)
-> Rules:
 a__adx(cons(X:S,L:S)) -> a__incr(cons(mark(X:S),adx(L:S)))
 a__adx(nil) -> nil
 a__adx(X:S) -> adx(X:S)
 a__head(cons(X:S,L:S)) -> mark(X:S)
 a__head(X:S) -> head(X:S)
 a__incr(cons(X:S,L:S)) -> cons(s(mark(X:S)),incr(L:S))
 a__incr(nil) -> nil
 a__incr(X:S) -> incr(X:S)
 a__nats -> a__adx(a__zeros)
 a__nats -> nats
 a__tail(cons(X:S,L:S)) -> mark(L:S)
 a__tail(X:S) -> tail(X:S)
 a__zeros -> cons(0,zeros)
 a__zeros -> zeros
 mark(0) -> 0
 mark(adx(X:S)) -> a__adx(mark(X:S))
 mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S)
 mark(head(X:S)) -> a__head(mark(X:S))
 mark(incr(X:S)) -> a__incr(mark(X:S))
 mark(nats) -> a__nats
 mark(nil) -> nil
 mark(s(X:S)) -> s(mark(X:S))
 mark(tail(X:S)) -> a__tail(mark(X:S))
 mark(zeros) -> a__zeros
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 A__INCR(cons(X:S,L:S)) -> MARK(X:S)
 A__TAIL(cons(X:S,L:S)) -> MARK(L:S)
 MARK(adx(X:S)) -> MARK(X:S)
 MARK(cons(X1:S,X2:S)) -> MARK(X1:S)
 MARK(head(X:S)) -> MARK(X:S)
 MARK(incr(X:S)) -> A__INCR(mark(X:S))
 MARK(incr(X:S)) -> MARK(X:S)
 MARK(s(X:S)) -> MARK(X:S)
 MARK(tail(X:S)) -> A__TAIL(mark(X:S))
 MARK(tail(X:S)) -> MARK(X:S)
->->-> Rules:
 a__adx(cons(X:S,L:S)) -> a__incr(cons(mark(X:S),adx(L:S)))
 a__adx(nil) -> nil
 a__adx(X:S) -> adx(X:S)
 a__head(cons(X:S,L:S)) -> mark(X:S)
 a__head(X:S) -> head(X:S)
 a__incr(cons(X:S,L:S)) -> cons(s(mark(X:S)),incr(L:S))
 a__incr(nil) -> nil
 a__incr(X:S) -> incr(X:S)
 a__nats -> a__adx(a__zeros)
 a__nats -> nats
 a__tail(cons(X:S,L:S)) -> mark(L:S)
 a__tail(X:S) -> tail(X:S)
 a__zeros -> cons(0,zeros)
 a__zeros -> zeros
 mark(0) -> 0
 mark(adx(X:S)) -> a__adx(mark(X:S))
 mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S)
 mark(head(X:S)) -> a__head(mark(X:S))
 mark(incr(X:S)) -> a__incr(mark(X:S))
 mark(nats) -> a__nats
 mark(nil) -> nil
 mark(s(X:S)) -> s(mark(X:S))
 mark(tail(X:S)) -> a__tail(mark(X:S))
 mark(zeros) -> a__zeros

Problem 1: 

Reduction Pairs Processor:
-> Pairs:
 A__INCR(cons(X:S,L:S)) -> MARK(X:S)
 A__TAIL(cons(X:S,L:S)) -> MARK(L:S)
 MARK(adx(X:S)) -> MARK(X:S)
 MARK(cons(X1:S,X2:S)) -> MARK(X1:S)
 MARK(head(X:S)) -> MARK(X:S)
 MARK(incr(X:S)) -> A__INCR(mark(X:S))
 MARK(incr(X:S)) -> MARK(X:S)
 MARK(s(X:S)) -> MARK(X:S)
 MARK(tail(X:S)) -> A__TAIL(mark(X:S))
 MARK(tail(X:S)) -> MARK(X:S)
-> Rules:
 a__adx(cons(X:S,L:S)) -> a__incr(cons(mark(X:S),adx(L:S)))
 a__adx(nil) -> nil
 a__adx(X:S) -> adx(X:S)
 a__head(cons(X:S,L:S)) -> mark(X:S)
 a__head(X:S) -> head(X:S)
 a__incr(cons(X:S,L:S)) -> cons(s(mark(X:S)),incr(L:S))
 a__incr(nil) -> nil
 a__incr(X:S) -> incr(X:S)
 a__nats -> a__adx(a__zeros)
 a__nats -> nats
 a__tail(cons(X:S,L:S)) -> mark(L:S)
 a__tail(X:S) -> tail(X:S)
 a__zeros -> cons(0,zeros)
 a__zeros -> zeros
 mark(0) -> 0
 mark(adx(X:S)) -> a__adx(mark(X:S))
 mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S)
 mark(head(X:S)) -> a__head(mark(X:S))
 mark(incr(X:S)) -> a__incr(mark(X:S))
 mark(nats) -> a__nats
 mark(nil) -> nil
 mark(s(X:S)) -> s(mark(X:S))
 mark(tail(X:S)) -> a__tail(mark(X:S))
 mark(zeros) -> a__zeros
-> Usable rules:
 a__adx(cons(X:S,L:S)) -> a__incr(cons(mark(X:S),adx(L:S)))
 a__adx(nil) -> nil
 a__adx(X:S) -> adx(X:S)
 a__head(cons(X:S,L:S)) -> mark(X:S)
 a__head(X:S) -> head(X:S)
 a__incr(cons(X:S,L:S)) -> cons(s(mark(X:S)),incr(L:S))
 a__incr(nil) -> nil
 a__incr(X:S) -> incr(X:S)
 a__nats -> a__adx(a__zeros)
 a__nats -> nats
 a__tail(cons(X:S,L:S)) -> mark(L:S)
 a__tail(X:S) -> tail(X:S)
 a__zeros -> cons(0,zeros)
 a__zeros -> zeros
 mark(0) -> 0
 mark(adx(X:S)) -> a__adx(mark(X:S))
 mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S)
 mark(head(X:S)) -> a__head(mark(X:S))
 mark(incr(X:S)) -> a__incr(mark(X:S))
 mark(nats) -> a__nats
 mark(nil) -> nil
 mark(s(X:S)) -> s(mark(X: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__adx](X) = 2.X
[a__head](X) = 2.X + 2
[a__incr](X) = X
[a__nats] = 2
[a__tail](X) = 2.X + 1
[a__zeros] = 0
[mark](X) = X
[0] = 0
[adx](X) = 2.X
[cons](X1,X2) = X1 + 2.X2
[fSNonEmpty] = 0
[head](X) = 2.X + 2
[incr](X) = X
[nats] = 2
[nil] = 1
[s](X) = X
[tail](X) = 2.X + 1
[zeros] = 0
[A__ADX](X) = 0
[A__HEAD](X) = 0
[A__INCR](X) = 2.X + 1
[A__NATS] = 0
[A__TAIL](X) = X + 2
[A__ZEROS] = 0
[MARK](X) = 2.X + 1

Problem 1: 

SCC Processor:
-> Pairs:
 A__INCR(cons(X:S,L:S)) -> MARK(X:S)
 MARK(adx(X:S)) -> MARK(X:S)
 MARK(cons(X1:S,X2:S)) -> MARK(X1:S)
 MARK(head(X:S)) -> MARK(X:S)
 MARK(incr(X:S)) -> A__INCR(mark(X:S))
 MARK(incr(X:S)) -> MARK(X:S)
 MARK(s(X:S)) -> MARK(X:S)
 MARK(tail(X:S)) -> A__TAIL(mark(X:S))
 MARK(tail(X:S)) -> MARK(X:S)
-> Rules:
 a__adx(cons(X:S,L:S)) -> a__incr(cons(mark(X:S),adx(L:S)))
 a__adx(nil) -> nil
 a__adx(X:S) -> adx(X:S)
 a__head(cons(X:S,L:S)) -> mark(X:S)
 a__head(X:S) -> head(X:S)
 a__incr(cons(X:S,L:S)) -> cons(s(mark(X:S)),incr(L:S))
 a__incr(nil) -> nil
 a__incr(X:S) -> incr(X:S)
 a__nats -> a__adx(a__zeros)
 a__nats -> nats
 a__tail(cons(X:S,L:S)) -> mark(L:S)
 a__tail(X:S) -> tail(X:S)
 a__zeros -> cons(0,zeros)
 a__zeros -> zeros
 mark(0) -> 0
 mark(adx(X:S)) -> a__adx(mark(X:S))
 mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S)
 mark(head(X:S)) -> a__head(mark(X:S))
 mark(incr(X:S)) -> a__incr(mark(X:S))
 mark(nats) -> a__nats
 mark(nil) -> nil
 mark(s(X:S)) -> s(mark(X:S))
 mark(tail(X:S)) -> a__tail(mark(X:S))
 mark(zeros) -> a__zeros
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 A__INCR(cons(X:S,L:S)) -> MARK(X:S)
 MARK(adx(X:S)) -> MARK(X:S)
 MARK(cons(X1:S,X2:S)) -> MARK(X1:S)
 MARK(head(X:S)) -> MARK(X:S)
 MARK(incr(X:S)) -> A__INCR(mark(X:S))
 MARK(incr(X:S)) -> MARK(X:S)
 MARK(s(X:S)) -> MARK(X:S)
 MARK(tail(X:S)) -> MARK(X:S)
->->-> Rules:
 a__adx(cons(X:S,L:S)) -> a__incr(cons(mark(X:S),adx(L:S)))
 a__adx(nil) -> nil
 a__adx(X:S) -> adx(X:S)
 a__head(cons(X:S,L:S)) -> mark(X:S)
 a__head(X:S) -> head(X:S)
 a__incr(cons(X:S,L:S)) -> cons(s(mark(X:S)),incr(L:S))
 a__incr(nil) -> nil
 a__incr(X:S) -> incr(X:S)
 a__nats -> a__adx(a__zeros)
 a__nats -> nats
 a__tail(cons(X:S,L:S)) -> mark(L:S)
 a__tail(X:S) -> tail(X:S)
 a__zeros -> cons(0,zeros)
 a__zeros -> zeros
 mark(0) -> 0
 mark(adx(X:S)) -> a__adx(mark(X:S))
 mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S)
 mark(head(X:S)) -> a__head(mark(X:S))
 mark(incr(X:S)) -> a__incr(mark(X:S))
 mark(nats) -> a__nats
 mark(nil) -> nil
 mark(s(X:S)) -> s(mark(X:S))
 mark(tail(X:S)) -> a__tail(mark(X:S))
 mark(zeros) -> a__zeros

Problem 1: 

Reduction Pairs Processor:
-> Pairs:
 A__INCR(cons(X:S,L:S)) -> MARK(X:S)
 MARK(adx(X:S)) -> MARK(X:S)
 MARK(cons(X1:S,X2:S)) -> MARK(X1:S)
 MARK(head(X:S)) -> MARK(X:S)
 MARK(incr(X:S)) -> A__INCR(mark(X:S))
 MARK(incr(X:S)) -> MARK(X:S)
 MARK(s(X:S)) -> MARK(X:S)
 MARK(tail(X:S)) -> MARK(X:S)
-> Rules:
 a__adx(cons(X:S,L:S)) -> a__incr(cons(mark(X:S),adx(L:S)))
 a__adx(nil) -> nil
 a__adx(X:S) -> adx(X:S)
 a__head(cons(X:S,L:S)) -> mark(X:S)
 a__head(X:S) -> head(X:S)
 a__incr(cons(X:S,L:S)) -> cons(s(mark(X:S)),incr(L:S))
 a__incr(nil) -> nil
 a__incr(X:S) -> incr(X:S)
 a__nats -> a__adx(a__zeros)
 a__nats -> nats
 a__tail(cons(X:S,L:S)) -> mark(L:S)
 a__tail(X:S) -> tail(X:S)
 a__zeros -> cons(0,zeros)
 a__zeros -> zeros
 mark(0) -> 0
 mark(adx(X:S)) -> a__adx(mark(X:S))
 mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S)
 mark(head(X:S)) -> a__head(mark(X:S))
 mark(incr(X:S)) -> a__incr(mark(X:S))
 mark(nats) -> a__nats
 mark(nil) -> nil
 mark(s(X:S)) -> s(mark(X:S))
 mark(tail(X:S)) -> a__tail(mark(X:S))
 mark(zeros) -> a__zeros
-> Usable rules:
 a__adx(cons(X:S,L:S)) -> a__incr(cons(mark(X:S),adx(L:S)))
 a__adx(nil) -> nil
 a__adx(X:S) -> adx(X:S)
 a__head(cons(X:S,L:S)) -> mark(X:S)
 a__head(X:S) -> head(X:S)
 a__incr(cons(X:S,L:S)) -> cons(s(mark(X:S)),incr(L:S))
 a__incr(nil) -> nil
 a__incr(X:S) -> incr(X:S)
 a__nats -> a__adx(a__zeros)
 a__nats -> nats
 a__tail(cons(X:S,L:S)) -> mark(L:S)
 a__tail(X:S) -> tail(X:S)
 a__zeros -> cons(0,zeros)
 a__zeros -> zeros
 mark(0) -> 0
 mark(adx(X:S)) -> a__adx(mark(X:S))
 mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S)
 mark(head(X:S)) -> a__head(mark(X:S))
 mark(incr(X:S)) -> a__incr(mark(X:S))
 mark(nats) -> a__nats
 mark(nil) -> nil
 mark(s(X:S)) -> s(mark(X: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__adx](X) = 2.X + 2
[a__head](X) = 2.X + 2
[a__incr](X) = X
[a__nats] = 2
[a__tail](X) = X + 1
[a__zeros] = 0
[mark](X) = X
[0] = 0
[adx](X) = 2.X + 2
[cons](X1,X2) = 2.X1 + X2
[fSNonEmpty] = 0
[head](X) = 2.X + 2
[incr](X) = X
[nats] = 2
[nil] = 1
[s](X) = X
[tail](X) = X + 1
[zeros] = 0
[A__ADX](X) = 0
[A__HEAD](X) = 0
[A__INCR](X) = 2.X + 2
[A__NATS] = 0
[A__TAIL](X) = 0
[A__ZEROS] = 0
[MARK](X) = 2.X + 2

Problem 1: 

SCC Processor:
-> Pairs:
 A__INCR(cons(X:S,L:S)) -> MARK(X:S)
 MARK(cons(X1:S,X2:S)) -> MARK(X1:S)
 MARK(head(X:S)) -> MARK(X:S)
 MARK(incr(X:S)) -> A__INCR(mark(X:S))
 MARK(incr(X:S)) -> MARK(X:S)
 MARK(s(X:S)) -> MARK(X:S)
 MARK(tail(X:S)) -> MARK(X:S)
-> Rules:
 a__adx(cons(X:S,L:S)) -> a__incr(cons(mark(X:S),adx(L:S)))
 a__adx(nil) -> nil
 a__adx(X:S) -> adx(X:S)
 a__head(cons(X:S,L:S)) -> mark(X:S)
 a__head(X:S) -> head(X:S)
 a__incr(cons(X:S,L:S)) -> cons(s(mark(X:S)),incr(L:S))
 a__incr(nil) -> nil
 a__incr(X:S) -> incr(X:S)
 a__nats -> a__adx(a__zeros)
 a__nats -> nats
 a__tail(cons(X:S,L:S)) -> mark(L:S)
 a__tail(X:S) -> tail(X:S)
 a__zeros -> cons(0,zeros)
 a__zeros -> zeros
 mark(0) -> 0
 mark(adx(X:S)) -> a__adx(mark(X:S))
 mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S)
 mark(head(X:S)) -> a__head(mark(X:S))
 mark(incr(X:S)) -> a__incr(mark(X:S))
 mark(nats) -> a__nats
 mark(nil) -> nil
 mark(s(X:S)) -> s(mark(X:S))
 mark(tail(X:S)) -> a__tail(mark(X:S))
 mark(zeros) -> a__zeros
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 A__INCR(cons(X:S,L:S)) -> MARK(X:S)
 MARK(cons(X1:S,X2:S)) -> MARK(X1:S)
 MARK(head(X:S)) -> MARK(X:S)
 MARK(incr(X:S)) -> A__INCR(mark(X:S))
 MARK(incr(X:S)) -> MARK(X:S)
 MARK(s(X:S)) -> MARK(X:S)
 MARK(tail(X:S)) -> MARK(X:S)
->->-> Rules:
 a__adx(cons(X:S,L:S)) -> a__incr(cons(mark(X:S),adx(L:S)))
 a__adx(nil) -> nil
 a__adx(X:S) -> adx(X:S)
 a__head(cons(X:S,L:S)) -> mark(X:S)
 a__head(X:S) -> head(X:S)
 a__incr(cons(X:S,L:S)) -> cons(s(mark(X:S)),incr(L:S))
 a__incr(nil) -> nil
 a__incr(X:S) -> incr(X:S)
 a__nats -> a__adx(a__zeros)
 a__nats -> nats
 a__tail(cons(X:S,L:S)) -> mark(L:S)
 a__tail(X:S) -> tail(X:S)
 a__zeros -> cons(0,zeros)
 a__zeros -> zeros
 mark(0) -> 0
 mark(adx(X:S)) -> a__adx(mark(X:S))
 mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S)
 mark(head(X:S)) -> a__head(mark(X:S))
 mark(incr(X:S)) -> a__incr(mark(X:S))
 mark(nats) -> a__nats
 mark(nil) -> nil
 mark(s(X:S)) -> s(mark(X:S))
 mark(tail(X:S)) -> a__tail(mark(X:S))
 mark(zeros) -> a__zeros

Problem 1: 

Reduction Pairs Processor:
-> Pairs:
 A__INCR(cons(X:S,L:S)) -> MARK(X:S)
 MARK(cons(X1:S,X2:S)) -> MARK(X1:S)
 MARK(head(X:S)) -> MARK(X:S)
 MARK(incr(X:S)) -> A__INCR(mark(X:S))
 MARK(incr(X:S)) -> MARK(X:S)
 MARK(s(X:S)) -> MARK(X:S)
 MARK(tail(X:S)) -> MARK(X:S)
-> Rules:
 a__adx(cons(X:S,L:S)) -> a__incr(cons(mark(X:S),adx(L:S)))
 a__adx(nil) -> nil
 a__adx(X:S) -> adx(X:S)
 a__head(cons(X:S,L:S)) -> mark(X:S)
 a__head(X:S) -> head(X:S)
 a__incr(cons(X:S,L:S)) -> cons(s(mark(X:S)),incr(L:S))
 a__incr(nil) -> nil
 a__incr(X:S) -> incr(X:S)
 a__nats -> a__adx(a__zeros)
 a__nats -> nats
 a__tail(cons(X:S,L:S)) -> mark(L:S)
 a__tail(X:S) -> tail(X:S)
 a__zeros -> cons(0,zeros)
 a__zeros -> zeros
 mark(0) -> 0
 mark(adx(X:S)) -> a__adx(mark(X:S))
 mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S)
 mark(head(X:S)) -> a__head(mark(X:S))
 mark(incr(X:S)) -> a__incr(mark(X:S))
 mark(nats) -> a__nats
 mark(nil) -> nil
 mark(s(X:S)) -> s(mark(X:S))
 mark(tail(X:S)) -> a__tail(mark(X:S))
 mark(zeros) -> a__zeros
-> Usable rules:
 a__adx(cons(X:S,L:S)) -> a__incr(cons(mark(X:S),adx(L:S)))
 a__adx(nil) -> nil
 a__adx(X:S) -> adx(X:S)
 a__head(cons(X:S,L:S)) -> mark(X:S)
 a__head(X:S) -> head(X:S)
 a__incr(cons(X:S,L:S)) -> cons(s(mark(X:S)),incr(L:S))
 a__incr(nil) -> nil
 a__incr(X:S) -> incr(X:S)
 a__nats -> a__adx(a__zeros)
 a__nats -> nats
 a__tail(cons(X:S,L:S)) -> mark(L:S)
 a__tail(X:S) -> tail(X:S)
 a__zeros -> cons(0,zeros)
 a__zeros -> zeros
 mark(0) -> 0
 mark(adx(X:S)) -> a__adx(mark(X:S))
 mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S)
 mark(head(X:S)) -> a__head(mark(X:S))
 mark(incr(X:S)) -> a__incr(mark(X:S))
 mark(nats) -> a__nats
 mark(nil) -> nil
 mark(s(X:S)) -> s(mark(X: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__adx](X) = X
[a__head](X) = X + 2
[a__incr](X) = X
[a__nats] = 2
[a__tail](X) = X + 1
[a__zeros] = 2
[mark](X) = X
[0] = 0
[adx](X) = X
[cons](X1,X2) = X1 + X2
[fSNonEmpty] = 0
[head](X) = X + 2
[incr](X) = X
[nats] = 2
[nil] = 1
[s](X) = X
[tail](X) = X + 1
[zeros] = 2
[A__ADX](X) = 0
[A__HEAD](X) = 0
[A__INCR](X) = 2.X + 2
[A__NATS] = 0
[A__TAIL](X) = 0
[A__ZEROS] = 0
[MARK](X) = 2.X + 2

Problem 1: 

SCC Processor:
-> Pairs:
 A__INCR(cons(X:S,L:S)) -> MARK(X:S)
 MARK(cons(X1:S,X2:S)) -> MARK(X1:S)
 MARK(incr(X:S)) -> A__INCR(mark(X:S))
 MARK(incr(X:S)) -> MARK(X:S)
 MARK(s(X:S)) -> MARK(X:S)
 MARK(tail(X:S)) -> MARK(X:S)
-> Rules:
 a__adx(cons(X:S,L:S)) -> a__incr(cons(mark(X:S),adx(L:S)))
 a__adx(nil) -> nil
 a__adx(X:S) -> adx(X:S)
 a__head(cons(X:S,L:S)) -> mark(X:S)
 a__head(X:S) -> head(X:S)
 a__incr(cons(X:S,L:S)) -> cons(s(mark(X:S)),incr(L:S))
 a__incr(nil) -> nil
 a__incr(X:S) -> incr(X:S)
 a__nats -> a__adx(a__zeros)
 a__nats -> nats
 a__tail(cons(X:S,L:S)) -> mark(L:S)
 a__tail(X:S) -> tail(X:S)
 a__zeros -> cons(0,zeros)
 a__zeros -> zeros
 mark(0) -> 0
 mark(adx(X:S)) -> a__adx(mark(X:S))
 mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S)
 mark(head(X:S)) -> a__head(mark(X:S))
 mark(incr(X:S)) -> a__incr(mark(X:S))
 mark(nats) -> a__nats
 mark(nil) -> nil
 mark(s(X:S)) -> s(mark(X:S))
 mark(tail(X:S)) -> a__tail(mark(X:S))
 mark(zeros) -> a__zeros
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 A__INCR(cons(X:S,L:S)) -> MARK(X:S)
 MARK(cons(X1:S,X2:S)) -> MARK(X1:S)
 MARK(incr(X:S)) -> A__INCR(mark(X:S))
 MARK(incr(X:S)) -> MARK(X:S)
 MARK(s(X:S)) -> MARK(X:S)
 MARK(tail(X:S)) -> MARK(X:S)
->->-> Rules:
 a__adx(cons(X:S,L:S)) -> a__incr(cons(mark(X:S),adx(L:S)))
 a__adx(nil) -> nil
 a__adx(X:S) -> adx(X:S)
 a__head(cons(X:S,L:S)) -> mark(X:S)
 a__head(X:S) -> head(X:S)
 a__incr(cons(X:S,L:S)) -> cons(s(mark(X:S)),incr(L:S))
 a__incr(nil) -> nil
 a__incr(X:S) -> incr(X:S)
 a__nats -> a__adx(a__zeros)
 a__nats -> nats
 a__tail(cons(X:S,L:S)) -> mark(L:S)
 a__tail(X:S) -> tail(X:S)
 a__zeros -> cons(0,zeros)
 a__zeros -> zeros
 mark(0) -> 0
 mark(adx(X:S)) -> a__adx(mark(X:S))
 mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S)
 mark(head(X:S)) -> a__head(mark(X:S))
 mark(incr(X:S)) -> a__incr(mark(X:S))
 mark(nats) -> a__nats
 mark(nil) -> nil
 mark(s(X:S)) -> s(mark(X:S))
 mark(tail(X:S)) -> a__tail(mark(X:S))
 mark(zeros) -> a__zeros

Problem 1: 

Reduction Pairs Processor:
-> Pairs:
 A__INCR(cons(X:S,L:S)) -> MARK(X:S)
 MARK(cons(X1:S,X2:S)) -> MARK(X1:S)
 MARK(incr(X:S)) -> A__INCR(mark(X:S))
 MARK(incr(X:S)) -> MARK(X:S)
 MARK(s(X:S)) -> MARK(X:S)
 MARK(tail(X:S)) -> MARK(X:S)
-> Rules:
 a__adx(cons(X:S,L:S)) -> a__incr(cons(mark(X:S),adx(L:S)))
 a__adx(nil) -> nil
 a__adx(X:S) -> adx(X:S)
 a__head(cons(X:S,L:S)) -> mark(X:S)
 a__head(X:S) -> head(X:S)
 a__incr(cons(X:S,L:S)) -> cons(s(mark(X:S)),incr(L:S))
 a__incr(nil) -> nil
 a__incr(X:S) -> incr(X:S)
 a__nats -> a__adx(a__zeros)
 a__nats -> nats
 a__tail(cons(X:S,L:S)) -> mark(L:S)
 a__tail(X:S) -> tail(X:S)
 a__zeros -> cons(0,zeros)
 a__zeros -> zeros
 mark(0) -> 0
 mark(adx(X:S)) -> a__adx(mark(X:S))
 mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S)
 mark(head(X:S)) -> a__head(mark(X:S))
 mark(incr(X:S)) -> a__incr(mark(X:S))
 mark(nats) -> a__nats
 mark(nil) -> nil
 mark(s(X:S)) -> s(mark(X:S))
 mark(tail(X:S)) -> a__tail(mark(X:S))
 mark(zeros) -> a__zeros
-> Usable rules:
 a__adx(cons(X:S,L:S)) -> a__incr(cons(mark(X:S),adx(L:S)))
 a__adx(nil) -> nil
 a__adx(X:S) -> adx(X:S)
 a__head(cons(X:S,L:S)) -> mark(X:S)
 a__head(X:S) -> head(X:S)
 a__incr(cons(X:S,L:S)) -> cons(s(mark(X:S)),incr(L:S))
 a__incr(nil) -> nil
 a__incr(X:S) -> incr(X:S)
 a__nats -> a__adx(a__zeros)
 a__nats -> nats
 a__tail(cons(X:S,L:S)) -> mark(L:S)
 a__tail(X:S) -> tail(X:S)
 a__zeros -> cons(0,zeros)
 a__zeros -> zeros
 mark(0) -> 0
 mark(adx(X:S)) -> a__adx(mark(X:S))
 mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S)
 mark(head(X:S)) -> a__head(mark(X:S))
 mark(incr(X:S)) -> a__incr(mark(X:S))
 mark(nats) -> a__nats
 mark(nil) -> nil
 mark(s(X:S)) -> s(mark(X: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__adx](X) = X + 1
[a__head](X) = 2.X + 1
[a__incr](X) = X
[a__nats] = 2
[a__tail](X) = 2.X + 2
[a__zeros] = 1
[mark](X) = X
[0] = 0
[adx](X) = X + 1
[cons](X1,X2) = 2.X1 + X2
[fSNonEmpty] = 0
[head](X) = 2.X + 1
[incr](X) = X
[nats] = 2
[nil] = 0
[s](X) = X
[tail](X) = 2.X + 2
[zeros] = 1
[A__ADX](X) = 0
[A__HEAD](X) = 0
[A__INCR](X) = 2.X + 2
[A__NATS] = 0
[A__TAIL](X) = 0
[A__ZEROS] = 0
[MARK](X) = 2.X + 2

Problem 1: 

SCC Processor:
-> Pairs:
 A__INCR(cons(X:S,L:S)) -> MARK(X:S)
 MARK(cons(X1:S,X2:S)) -> MARK(X1:S)
 MARK(incr(X:S)) -> A__INCR(mark(X:S))
 MARK(incr(X:S)) -> MARK(X:S)
 MARK(s(X:S)) -> MARK(X:S)
-> Rules:
 a__adx(cons(X:S,L:S)) -> a__incr(cons(mark(X:S),adx(L:S)))
 a__adx(nil) -> nil
 a__adx(X:S) -> adx(X:S)
 a__head(cons(X:S,L:S)) -> mark(X:S)
 a__head(X:S) -> head(X:S)
 a__incr(cons(X:S,L:S)) -> cons(s(mark(X:S)),incr(L:S))
 a__incr(nil) -> nil
 a__incr(X:S) -> incr(X:S)
 a__nats -> a__adx(a__zeros)
 a__nats -> nats
 a__tail(cons(X:S,L:S)) -> mark(L:S)
 a__tail(X:S) -> tail(X:S)
 a__zeros -> cons(0,zeros)
 a__zeros -> zeros
 mark(0) -> 0
 mark(adx(X:S)) -> a__adx(mark(X:S))
 mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S)
 mark(head(X:S)) -> a__head(mark(X:S))
 mark(incr(X:S)) -> a__incr(mark(X:S))
 mark(nats) -> a__nats
 mark(nil) -> nil
 mark(s(X:S)) -> s(mark(X:S))
 mark(tail(X:S)) -> a__tail(mark(X:S))
 mark(zeros) -> a__zeros
->Strongly Connected Components:
->->Cycle:
->->-> Pairs:
 A__INCR(cons(X:S,L:S)) -> MARK(X:S)
 MARK(cons(X1:S,X2:S)) -> MARK(X1:S)
 MARK(incr(X:S)) -> A__INCR(mark(X:S))
 MARK(incr(X:S)) -> MARK(X:S)
 MARK(s(X:S)) -> MARK(X:S)
->->-> Rules:
 a__adx(cons(X:S,L:S)) -> a__incr(cons(mark(X:S),adx(L:S)))
 a__adx(nil) -> nil
 a__adx(X:S) -> adx(X:S)
 a__head(cons(X:S,L:S)) -> mark(X:S)
 a__head(X:S) -> head(X:S)
 a__incr(cons(X:S,L:S)) -> cons(s(mark(X:S)),incr(L:S))
 a__incr(nil) -> nil
 a__incr(X:S) -> incr(X:S)
 a__nats -> a__adx(a__zeros)
 a__nats -> nats
 a__tail(cons(X:S,L:S)) -> mark(L:S)
 a__tail(X:S) -> tail(X:S)
 a__zeros -> cons(0,zeros)
 a__zeros -> zeros
 mark(0) -> 0
 mark(adx(X:S)) -> a__adx(mark(X:S))
 mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S)
 mark(head(X:S)) -> a__head(mark(X:S))
 mark(incr(X:S)) -> a__incr(mark(X:S))
 mark(nats) -> a__nats
 mark(nil) -> nil
 mark(s(X:S)) -> s(mark(X:S))
 mark(tail(X:S)) -> a__tail(mark(X:S))
 mark(zeros) -> a__zeros

Problem 1: 

Reduction Pairs Processor:
-> Pairs:
 A__INCR(cons(X:S,L:S)) -> MARK(X:S)
 MARK(cons(X1:S,X2:S)) -> MARK(X1:S)
 MARK(incr(X:S)) -> A__INCR(mark(X:S))
 MARK(incr(X:S)) -> MARK(X:S)
 MARK(s(X:S)) -> MARK(X:S)
-> Rules:
 a__adx(cons(X:S,L:S)) -> a__incr(cons(mark(X:S),adx(L:S)))
 a__adx(nil) -> nil
 a__adx(X:S) -> adx(X:S)
 a__head(cons(X:S,L:S)) -> mark(X:S)
 a__head(X:S) -> head(X:S)
 a__incr(cons(X:S,L:S)) -> cons(s(mark(X:S)),incr(L:S))
 a__incr(nil) -> nil
 a__incr(X:S) -> incr(X:S)
 a__nats -> a__adx(a__zeros)
 a__nats -> nats
 a__tail(cons(X:S,L:S)) -> mark(L:S)
 a__tail(X:S) -> tail(X:S)
 a__zeros -> cons(0,zeros)
 a__zeros -> zeros
 mark(0) -> 0
 mark(adx(X:S)) -> a__adx(mark(X:S))
 mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S)
 mark(head(X:S)) -> a__head(mark(X:S))
 mark(incr(X:S)) -> a__incr(mark(X:S))
 mark(nats) -> a__nats
 mark(nil) -> nil
 mark(s(X:S)) -> s(mark(X:S))
 mark(tail(X:S)) -> a__tail(mark(X:S))
 mark(zeros) -> a__zeros
-> Usable rules:
 a__adx(cons(X:S,L:S)) -> a__incr(cons(mark(X:S),adx(L:S)))
 a__adx(nil) -> nil
 a__adx(X:S) -> adx(X:S)
 a__head(cons(X:S,L:S)) -> mark(X:S)
 a__head(X:S) -> head(X:S)
 a__incr(cons(X:S,L:S)) -> cons(s(mark(X:S)),incr(L:S))
 a__incr(nil) -> nil
 a__incr(X:S) -> incr(X:S)
 a__nats -> a__adx(a__zeros)
 a__nats -> nats
 a__tail(cons(X:S,L:S)) -> mark(L:S)
 a__tail(X:S) -> tail(X:S)
 a__zeros -> cons(0,zeros)
 a__zeros -> zeros
 mark(0) -> 0
 mark(adx(X:S)) -> a__adx(mark(X:S))
 mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S)
 mark(head(X:S)) -> a__head(mark(X:S))
 mark(incr(X:S)) -> a__incr(mark(X:S))
 mark(nats) -> a__nats
 mark(nil) -> nil
 mark(s(X:S)) -> s(mark(X:S))
 mark(tail(X:S)) -> a__tail(mark(X:S))
 mark(zeros) -> a__zeros
->Interpretation type:
 Linear
->Coefficients:
 All rationals
->Dimension:
 1
->Bound:
 2
->Interpretation:
 
[a__adx](X) = 2.X
[a__head](X) = 2.X + 2
[a__incr](X) = X + 1/2
[a__nats] = 2
[a__tail](X) = 2.X
[a__zeros] = 1
[mark](X) = X
[0] = 0
[adx](X) = 2.X
[cons](X1,X2) = 2.X1 + 1/2.X2 + 1/2
[fSNonEmpty] = 0
[head](X) = 2.X + 2
[incr](X) = X + 1/2
[nats] = 2
[nil] = 2
[s](X) = X
[tail](X) = 2.X
[zeros] = 1
[A__ADX](X) = 0
[A__HEAD](X) = 0
[A__INCR](X) = X
[A__NATS] = 0
[A__TAIL](X) = 0
[A__ZEROS] = 0
[MARK](X) = 2.X

Problem 1: 

SCC Processor:
-> Pairs:
 MARK(cons(X1:S,X2:S)) -> MARK(X1:S)
 MARK(incr(X:S)) -> A__INCR(mark(X:S))
 MARK(incr(X:S)) -> MARK(X:S)
 MARK(s(X:S)) -> MARK(X:S)
-> Rules:
 a__adx(cons(X:S,L:S)) -> a__incr(cons(mark(X:S),adx(L:S)))
 a__adx(nil) -> nil
 a__adx(X:S) -> adx(X:S)
 a__head(cons(X:S,L:S)) -> mark(X:S)
 a__head(X:S) -> head(X:S)
 a__incr(cons(X:S,L:S)) -> cons(s(mark(X:S)),incr(L:S))
 a__incr(nil) -> nil
 a__incr(X:S) -> incr(X:S)
 a__nats -> a__adx(a__zeros)
 a__nats -> nats
 a__tail(cons(X:S,L:S)) -> mark(L:S)
 a__tail(X:S) -> tail(X:S)
 a__zeros -> cons(0,zeros)
 a__zeros -> zeros
 mark(0) -> 0
 mark(adx(X:S)) -> a__adx(mark(X:S))
 mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S)
 mark(head(X:S)) -> a__head(mark(X:S))
 mark(incr(X:S)) -> a__incr(mark(X:S))
 mark(nats) -> a__nats
 mark(nil) -> nil
 mark(s(X:S)) -> s(mark(X: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(incr(X:S)) -> MARK(X:S)
 MARK(s(X:S)) -> MARK(X:S)
->->-> Rules:
 a__adx(cons(X:S,L:S)) -> a__incr(cons(mark(X:S),adx(L:S)))
 a__adx(nil) -> nil
 a__adx(X:S) -> adx(X:S)
 a__head(cons(X:S,L:S)) -> mark(X:S)
 a__head(X:S) -> head(X:S)
 a__incr(cons(X:S,L:S)) -> cons(s(mark(X:S)),incr(L:S))
 a__incr(nil) -> nil
 a__incr(X:S) -> incr(X:S)
 a__nats -> a__adx(a__zeros)
 a__nats -> nats
 a__tail(cons(X:S,L:S)) -> mark(L:S)
 a__tail(X:S) -> tail(X:S)
 a__zeros -> cons(0,zeros)
 a__zeros -> zeros
 mark(0) -> 0
 mark(adx(X:S)) -> a__adx(mark(X:S))
 mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S)
 mark(head(X:S)) -> a__head(mark(X:S))
 mark(incr(X:S)) -> a__incr(mark(X:S))
 mark(nats) -> a__nats
 mark(nil) -> nil
 mark(s(X:S)) -> s(mark(X: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(incr(X:S)) -> MARK(X:S)
 MARK(s(X:S)) -> MARK(X:S)
-> Rules:
 a__adx(cons(X:S,L:S)) -> a__incr(cons(mark(X:S),adx(L:S)))
 a__adx(nil) -> nil
 a__adx(X:S) -> adx(X:S)
 a__head(cons(X:S,L:S)) -> mark(X:S)
 a__head(X:S) -> head(X:S)
 a__incr(cons(X:S,L:S)) -> cons(s(mark(X:S)),incr(L:S))
 a__incr(nil) -> nil
 a__incr(X:S) -> incr(X:S)
 a__nats -> a__adx(a__zeros)
 a__nats -> nats
 a__tail(cons(X:S,L:S)) -> mark(L:S)
 a__tail(X:S) -> tail(X:S)
 a__zeros -> cons(0,zeros)
 a__zeros -> zeros
 mark(0) -> 0
 mark(adx(X:S)) -> a__adx(mark(X:S))
 mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S)
 mark(head(X:S)) -> a__head(mark(X:S))
 mark(incr(X:S)) -> a__incr(mark(X:S))
 mark(nats) -> a__nats
 mark(nil) -> nil
 mark(s(X:S)) -> s(mark(X: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__adx(cons(X:S,L:S)) -> a__incr(cons(mark(X:S),adx(L:S)))
 a__adx(nil) -> nil
 a__adx(X:S) -> adx(X:S)
 a__head(cons(X:S,L:S)) -> mark(X:S)
 a__head(X:S) -> head(X:S)
 a__incr(cons(X:S,L:S)) -> cons(s(mark(X:S)),incr(L:S))
 a__incr(nil) -> nil
 a__incr(X:S) -> incr(X:S)
 a__nats -> a__adx(a__zeros)
 a__nats -> nats
 a__tail(cons(X:S,L:S)) -> mark(L:S)
 a__tail(X:S) -> tail(X:S)
 a__zeros -> cons(0,zeros)
 a__zeros -> zeros
 mark(0) -> 0
 mark(adx(X:S)) -> a__adx(mark(X:S))
 mark(cons(X1:S,X2:S)) -> cons(mark(X1:S),X2:S)
 mark(head(X:S)) -> a__head(mark(X:S))
 mark(incr(X:S)) -> a__incr(mark(X:S))
 mark(nats) -> a__nats
 mark(nil) -> nil
 mark(s(X:S)) -> s(mark(X: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.