(0) Obligation:
Q restricted rewrite system:
The TRS R consists of the following rules:
a__nats → a__adx(a__zeros)
a__zeros → cons(0, zeros)
a__incr(cons(X, Y)) → cons(s(X), incr(Y))
a__adx(cons(X, Y)) → a__incr(cons(X, adx(Y)))
a__hd(cons(X, Y)) → mark(X)
a__tl(cons(X, Y)) → mark(Y)
mark(nats) → a__nats
mark(adx(X)) → a__adx(mark(X))
mark(zeros) → a__zeros
mark(incr(X)) → a__incr(mark(X))
mark(hd(X)) → a__hd(mark(X))
mark(tl(X)) → a__tl(mark(X))
mark(cons(X1, X2)) → cons(X1, X2)
mark(0) → 0
mark(s(X)) → s(X)
a__nats → nats
a__adx(X) → adx(X)
a__zeros → zeros
a__incr(X) → incr(X)
a__hd(X) → hd(X)
a__tl(X) → tl(X)
Q is empty.
(1) QTRSRRRProof (EQUIVALENT transformation)
Used ordering:
Lexicographic Path Order [LPO].
Precedence:
[anats, nats] > [azeros, ahd1, mark1, atl1, hd1, tl1] > [aadx1, adx1] > [cons2, aincr1, incr1] > s1
[anats, nats] > [azeros, ahd1, mark1, atl1, hd1, tl1] > 0
[anats, nats] > [azeros, ahd1, mark1, atl1, hd1, tl1] > zeros
With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly:
a__nats → a__adx(a__zeros)
a__zeros → cons(0, zeros)
a__incr(cons(X, Y)) → cons(s(X), incr(Y))
a__adx(cons(X, Y)) → a__incr(cons(X, adx(Y)))
a__hd(cons(X, Y)) → mark(X)
a__tl(cons(X, Y)) → mark(Y)
mark(nats) → a__nats
mark(adx(X)) → a__adx(mark(X))
mark(zeros) → a__zeros
mark(incr(X)) → a__incr(mark(X))
mark(cons(X1, X2)) → cons(X1, X2)
mark(0) → 0
mark(s(X)) → s(X)
a__zeros → zeros
(2) Obligation:
Q restricted rewrite system:
The TRS R consists of the following rules:
mark(hd(X)) → a__hd(mark(X))
mark(tl(X)) → a__tl(mark(X))
a__nats → nats
a__adx(X) → adx(X)
a__incr(X) → incr(X)
a__hd(X) → hd(X)
a__tl(X) → tl(X)
Q is empty.
(3) QTRSRRRProof (EQUIVALENT transformation)
Used ordering:
Lexicographic Path Order [LPO].
Precedence:
mark1 > ahd1 > hd1
mark1 > atl1 > tl1
anats > nats
[aadx1, adx1]
[aincr1, incr1]
With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly:
mark(hd(X)) → a__hd(mark(X))
mark(tl(X)) → a__tl(mark(X))
a__nats → nats
a__hd(X) → hd(X)
a__tl(X) → tl(X)
(4) Obligation:
Q restricted rewrite system:
The TRS R consists of the following rules:
a__adx(X) → adx(X)
a__incr(X) → incr(X)
Q is empty.
(5) QTRSRRRProof (EQUIVALENT transformation)
Used ordering:
Lexicographic Path Order [LPO].
Precedence:
aadx1 > [adx1, incr1]
aincr1 > [adx1, incr1]
With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly:
a__adx(X) → adx(X)
a__incr(X) → incr(X)
(6) Obligation:
Q restricted rewrite system:
R is empty.
Q is empty.
(7) RisEmptyProof (EQUIVALENT transformation)
The TRS R is empty. Hence, termination is trivially proven.
(8) TRUE