(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:
Polynomial interpretation [POLO]:
POL(0) = 0
POL(a__adx(x1)) = x1
POL(a__hd(x1)) = 3 + x1
POL(a__incr(x1)) = x1
POL(a__nats) = 2
POL(a__tl(x1)) = 3 + x1
POL(a__zeros) = 1
POL(adx(x1)) = x1
POL(cons(x1, x2)) = x1 + x2
POL(hd(x1)) = 3 + x1
POL(incr(x1)) = x1
POL(mark(x1)) = 2 + x1
POL(nats) = 1
POL(s(x1)) = x1
POL(tl(x1)) = 3 + x1
POL(zeros) = 0
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__hd(cons(X, Y)) → mark(X)
a__tl(cons(X, Y)) → mark(Y)
mark(nats) → a__nats
mark(zeros) → a__zeros
mark(cons(X1, X2)) → cons(X1, X2)
mark(0) → 0
mark(s(X)) → s(X)
a__nats → nats
a__zeros → zeros
(2) Obligation:
Q restricted rewrite system:
The TRS R consists of the following rules:
a__incr(cons(X, Y)) → cons(s(X), incr(Y))
a__adx(cons(X, Y)) → a__incr(cons(X, adx(Y)))
mark(adx(X)) → a__adx(mark(X))
mark(incr(X)) → a__incr(mark(X))
mark(hd(X)) → a__hd(mark(X))
mark(tl(X)) → a__tl(mark(X))
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:
Recursive path order with status [RPO].
Quasi-Precedence:
mark1 > aadx1 > aincr1 > cons2
mark1 > aadx1 > aincr1 > s1
mark1 > aadx1 > aincr1 > incr1
mark1 > aadx1 > adx1
mark1 > ahd1 > hd1
mark1 > atl1 > tl1
Status:
trivial
With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly:
a__incr(cons(X, Y)) → cons(s(X), incr(Y))
a__adx(cons(X, Y)) → a__incr(cons(X, adx(Y)))
mark(adx(X)) → a__adx(mark(X))
mark(incr(X)) → a__incr(mark(X))
mark(hd(X)) → a__hd(mark(X))
mark(tl(X)) → a__tl(mark(X))
a__adx(X) → adx(X)
a__incr(X) → incr(X)
a__hd(X) → hd(X)
a__tl(X) → tl(X)
(4) Obligation:
Q restricted rewrite system:
R is empty.
Q is empty.
(5) RisEmptyProof (EQUIVALENT transformation)
The TRS R is empty. Hence, termination is trivially proven.
(6) TRUE
(7) RisEmptyProof (EQUIVALENT transformation)
The TRS R is empty. Hence, termination is trivially proven.
(8) TRUE
(9) RisEmptyProof (EQUIVALENT transformation)
The TRS R is empty. Hence, termination is trivially proven.
(10) TRUE