Termination w.r.t. Q of the given QTRS could not be shown:

0 QTRS
↳1 DependencyPairsProof (⇔)
↳2 QDP
↳3 DependencyGraphProof (⇔)
↳4 AND
  ↳5 QDP
  ↳6 QDP
  ↳7 QDP
  ↳8 QDP
  ↳9 QDP
  ↳10 QDP
    ↳11 QDPOrderProof (⇔)
    ↳12 QDP
    ↳13 QDPOrderProof (⇔)
    ↳14 QDP

(0) Obligation:

Q restricted rewrite system:
The TRS R consists of the following rules:

active(nats) → mark(cons(0, incr(nats)))
active(pairs) → mark(cons(0, incr(odds)))
active(odds) → mark(incr(pairs))
active(incr(cons(X, XS))) → mark(cons(s(X), incr(XS)))
active(head(cons(X, XS))) → mark(X)
active(tail(cons(X, XS))) → mark(XS)
mark(nats) → active(nats)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(0) → active(0)
mark(incr(X)) → active(incr(mark(X)))
mark(pairs) → active(pairs)
mark(odds) → active(odds)
mark(s(X)) → active(s(mark(X)))
mark(head(X)) → active(head(mark(X)))
mark(tail(X)) → active(tail(mark(X)))
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
incr(mark(X)) → incr(X)
incr(active(X)) → incr(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
head(mark(X)) → head(X)
head(active(X)) → head(X)
tail(mark(X)) → tail(X)
tail(active(X)) → tail(X)

Q is empty.

(1) DependencyPairsProof (EQUIVALENT transformation)

Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem.

(2) Obligation:

Q DP problem:
The TRS P consists of the following rules:

ACTIVE(nats) → MARK(cons(0, incr(nats)))
ACTIVE(nats) → CONS(0, incr(nats))
ACTIVE(nats) → INCR(nats)
ACTIVE(pairs) → MARK(cons(0, incr(odds)))
ACTIVE(pairs) → CONS(0, incr(odds))
ACTIVE(pairs) → INCR(odds)
ACTIVE(odds) → MARK(incr(pairs))
ACTIVE(odds) → INCR(pairs)
ACTIVE(incr(cons(X, XS))) → MARK(cons(s(X), incr(XS)))
ACTIVE(incr(cons(X, XS))) → CONS(s(X), incr(XS))
ACTIVE(incr(cons(X, XS))) → S(X)
ACTIVE(incr(cons(X, XS))) → INCR(XS)
ACTIVE(head(cons(X, XS))) → MARK(X)
ACTIVE(tail(cons(X, XS))) → MARK(XS)
MARK(nats) → ACTIVE(nats)
MARK(cons(X1, X2)) → ACTIVE(cons(mark(X1), X2))
MARK(cons(X1, X2)) → CONS(mark(X1), X2)
MARK(cons(X1, X2)) → MARK(X1)
MARK(0) → ACTIVE(0)
MARK(incr(X)) → ACTIVE(incr(mark(X)))
MARK(incr(X)) → INCR(mark(X))
MARK(incr(X)) → MARK(X)
MARK(pairs) → ACTIVE(pairs)
MARK(odds) → ACTIVE(odds)
MARK(s(X)) → ACTIVE(s(mark(X)))
MARK(s(X)) → S(mark(X))
MARK(s(X)) → MARK(X)
MARK(head(X)) → ACTIVE(head(mark(X)))
MARK(head(X)) → HEAD(mark(X))
MARK(head(X)) → MARK(X)
MARK(tail(X)) → ACTIVE(tail(mark(X)))
MARK(tail(X)) → TAIL(mark(X))
MARK(tail(X)) → MARK(X)
CONS(mark(X1), X2) → CONS(X1, X2)
CONS(X1, mark(X2)) → CONS(X1, X2)
CONS(active(X1), X2) → CONS(X1, X2)
CONS(X1, active(X2)) → CONS(X1, X2)
INCR(mark(X)) → INCR(X)
INCR(active(X)) → INCR(X)
S(mark(X)) → S(X)
S(active(X)) → S(X)
HEAD(mark(X)) → HEAD(X)
HEAD(active(X)) → HEAD(X)
TAIL(mark(X)) → TAIL(X)
TAIL(active(X)) → TAIL(X)

The TRS R consists of the following rules:

active(nats) → mark(cons(0, incr(nats)))
active(pairs) → mark(cons(0, incr(odds)))
active(odds) → mark(incr(pairs))
active(incr(cons(X, XS))) → mark(cons(s(X), incr(XS)))
active(head(cons(X, XS))) → mark(X)
active(tail(cons(X, XS))) → mark(XS)
mark(nats) → active(nats)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(0) → active(0)
mark(incr(X)) → active(incr(mark(X)))
mark(pairs) → active(pairs)
mark(odds) → active(odds)
mark(s(X)) → active(s(mark(X)))
mark(head(X)) → active(head(mark(X)))
mark(tail(X)) → active(tail(mark(X)))
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
incr(mark(X)) → incr(X)
incr(active(X)) → incr(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
head(mark(X)) → head(X)
head(active(X)) → head(X)
tail(mark(X)) → tail(X)
tail(active(X)) → tail(X)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(3) DependencyGraphProof (EQUIVALENT transformation)

The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 6 SCCs with 14 less nodes.

(4) Complex Obligation (AND)

(5) Obligation:

Q DP problem:
The TRS P consists of the following rules:

TAIL(active(X)) → TAIL(X)
TAIL(mark(X)) → TAIL(X)

The TRS R consists of the following rules:

active(nats) → mark(cons(0, incr(nats)))
active(pairs) → mark(cons(0, incr(odds)))
active(odds) → mark(incr(pairs))
active(incr(cons(X, XS))) → mark(cons(s(X), incr(XS)))
active(head(cons(X, XS))) → mark(X)
active(tail(cons(X, XS))) → mark(XS)
mark(nats) → active(nats)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(0) → active(0)
mark(incr(X)) → active(incr(mark(X)))
mark(pairs) → active(pairs)
mark(odds) → active(odds)
mark(s(X)) → active(s(mark(X)))
mark(head(X)) → active(head(mark(X)))
mark(tail(X)) → active(tail(mark(X)))
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
incr(mark(X)) → incr(X)
incr(active(X)) → incr(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
head(mark(X)) → head(X)
head(active(X)) → head(X)
tail(mark(X)) → tail(X)
tail(active(X)) → tail(X)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(6) Obligation:

Q DP problem:
The TRS P consists of the following rules:

HEAD(active(X)) → HEAD(X)
HEAD(mark(X)) → HEAD(X)

The TRS R consists of the following rules:

active(nats) → mark(cons(0, incr(nats)))
active(pairs) → mark(cons(0, incr(odds)))
active(odds) → mark(incr(pairs))
active(incr(cons(X, XS))) → mark(cons(s(X), incr(XS)))
active(head(cons(X, XS))) → mark(X)
active(tail(cons(X, XS))) → mark(XS)
mark(nats) → active(nats)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(0) → active(0)
mark(incr(X)) → active(incr(mark(X)))
mark(pairs) → active(pairs)
mark(odds) → active(odds)
mark(s(X)) → active(s(mark(X)))
mark(head(X)) → active(head(mark(X)))
mark(tail(X)) → active(tail(mark(X)))
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
incr(mark(X)) → incr(X)
incr(active(X)) → incr(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
head(mark(X)) → head(X)
head(active(X)) → head(X)
tail(mark(X)) → tail(X)
tail(active(X)) → tail(X)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(7) Obligation:

Q DP problem:
The TRS P consists of the following rules:

S(active(X)) → S(X)
S(mark(X)) → S(X)

The TRS R consists of the following rules:

active(nats) → mark(cons(0, incr(nats)))
active(pairs) → mark(cons(0, incr(odds)))
active(odds) → mark(incr(pairs))
active(incr(cons(X, XS))) → mark(cons(s(X), incr(XS)))
active(head(cons(X, XS))) → mark(X)
active(tail(cons(X, XS))) → mark(XS)
mark(nats) → active(nats)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(0) → active(0)
mark(incr(X)) → active(incr(mark(X)))
mark(pairs) → active(pairs)
mark(odds) → active(odds)
mark(s(X)) → active(s(mark(X)))
mark(head(X)) → active(head(mark(X)))
mark(tail(X)) → active(tail(mark(X)))
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
incr(mark(X)) → incr(X)
incr(active(X)) → incr(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
head(mark(X)) → head(X)
head(active(X)) → head(X)
tail(mark(X)) → tail(X)
tail(active(X)) → tail(X)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(8) Obligation:

Q DP problem:
The TRS P consists of the following rules:

INCR(active(X)) → INCR(X)
INCR(mark(X)) → INCR(X)

The TRS R consists of the following rules:

active(nats) → mark(cons(0, incr(nats)))
active(pairs) → mark(cons(0, incr(odds)))
active(odds) → mark(incr(pairs))
active(incr(cons(X, XS))) → mark(cons(s(X), incr(XS)))
active(head(cons(X, XS))) → mark(X)
active(tail(cons(X, XS))) → mark(XS)
mark(nats) → active(nats)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(0) → active(0)
mark(incr(X)) → active(incr(mark(X)))
mark(pairs) → active(pairs)
mark(odds) → active(odds)
mark(s(X)) → active(s(mark(X)))
mark(head(X)) → active(head(mark(X)))
mark(tail(X)) → active(tail(mark(X)))
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
incr(mark(X)) → incr(X)
incr(active(X)) → incr(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
head(mark(X)) → head(X)
head(active(X)) → head(X)
tail(mark(X)) → tail(X)
tail(active(X)) → tail(X)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(9) Obligation:

Q DP problem:
The TRS P consists of the following rules:

CONS(X1, mark(X2)) → CONS(X1, X2)
CONS(mark(X1), X2) → CONS(X1, X2)
CONS(active(X1), X2) → CONS(X1, X2)
CONS(X1, active(X2)) → CONS(X1, X2)

The TRS R consists of the following rules:

active(nats) → mark(cons(0, incr(nats)))
active(pairs) → mark(cons(0, incr(odds)))
active(odds) → mark(incr(pairs))
active(incr(cons(X, XS))) → mark(cons(s(X), incr(XS)))
active(head(cons(X, XS))) → mark(X)
active(tail(cons(X, XS))) → mark(XS)
mark(nats) → active(nats)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(0) → active(0)
mark(incr(X)) → active(incr(mark(X)))
mark(pairs) → active(pairs)
mark(odds) → active(odds)
mark(s(X)) → active(s(mark(X)))
mark(head(X)) → active(head(mark(X)))
mark(tail(X)) → active(tail(mark(X)))
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
incr(mark(X)) → incr(X)
incr(active(X)) → incr(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
head(mark(X)) → head(X)
head(active(X)) → head(X)
tail(mark(X)) → tail(X)
tail(active(X)) → tail(X)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(10) Obligation:

Q DP problem:
The TRS P consists of the following rules:

MARK(cons(X1, X2)) → ACTIVE(cons(mark(X1), X2))
ACTIVE(incr(cons(X, XS))) → MARK(cons(s(X), incr(XS)))
MARK(cons(X1, X2)) → MARK(X1)
MARK(nats) → ACTIVE(nats)
ACTIVE(nats) → MARK(cons(0, incr(nats)))
MARK(incr(X)) → ACTIVE(incr(mark(X)))
ACTIVE(head(cons(X, XS))) → MARK(X)
MARK(incr(X)) → MARK(X)
MARK(pairs) → ACTIVE(pairs)
ACTIVE(pairs) → MARK(cons(0, incr(odds)))
MARK(odds) → ACTIVE(odds)
ACTIVE(odds) → MARK(incr(pairs))
MARK(s(X)) → ACTIVE(s(mark(X)))
ACTIVE(tail(cons(X, XS))) → MARK(XS)
MARK(s(X)) → MARK(X)
MARK(head(X)) → ACTIVE(head(mark(X)))
MARK(head(X)) → MARK(X)
MARK(tail(X)) → ACTIVE(tail(mark(X)))
MARK(tail(X)) → MARK(X)

The TRS R consists of the following rules:

active(nats) → mark(cons(0, incr(nats)))
active(pairs) → mark(cons(0, incr(odds)))
active(odds) → mark(incr(pairs))
active(incr(cons(X, XS))) → mark(cons(s(X), incr(XS)))
active(head(cons(X, XS))) → mark(X)
active(tail(cons(X, XS))) → mark(XS)
mark(nats) → active(nats)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(0) → active(0)
mark(incr(X)) → active(incr(mark(X)))
mark(pairs) → active(pairs)
mark(odds) → active(odds)
mark(s(X)) → active(s(mark(X)))
mark(head(X)) → active(head(mark(X)))
mark(tail(X)) → active(tail(mark(X)))
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
incr(mark(X)) → incr(X)
incr(active(X)) → incr(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
head(mark(X)) → head(X)
head(active(X)) → head(X)
tail(mark(X)) → tail(X)
tail(active(X)) → tail(X)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(11) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].


The following pairs can be oriented strictly and are deleted.


MARK(s(X)) → ACTIVE(s(mark(X)))
The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
MARK(x1)  =  MARK
cons(x1, x2)  =  cons
ACTIVE(x1)  =  x1
mark(x1)  =  mark
incr(x1)  =  incr
s(x1)  =  s
nats  =  nats
0  =  0
head(x1)  =  head
pairs  =  pairs
odds  =  odds
tail(x1)  =  tail
active(x1)  =  active

Recursive Path Order [RPO].
Precedence:
[MARK, cons, incr, nats, head, pairs, odds, tail] > [mark, s, active]
0 > [mark, s, active]


The following usable rules [FROCOS05] were oriented:

active(nats) → mark(cons(0, incr(nats)))
active(pairs) → mark(cons(0, incr(odds)))
active(odds) → mark(incr(pairs))
active(incr(cons(X, XS))) → mark(cons(s(X), incr(XS)))
active(head(cons(X, XS))) → mark(X)
active(tail(cons(X, XS))) → mark(XS)
mark(nats) → active(nats)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(0) → active(0)
mark(incr(X)) → active(incr(mark(X)))
mark(pairs) → active(pairs)
mark(odds) → active(odds)
mark(s(X)) → active(s(mark(X)))
mark(head(X)) → active(head(mark(X)))
mark(tail(X)) → active(tail(mark(X)))
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
incr(mark(X)) → incr(X)
incr(active(X)) → incr(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
head(mark(X)) → head(X)
head(active(X)) → head(X)
tail(mark(X)) → tail(X)
tail(active(X)) → tail(X)

(12) Obligation:

Q DP problem:
The TRS P consists of the following rules:

MARK(cons(X1, X2)) → ACTIVE(cons(mark(X1), X2))
ACTIVE(incr(cons(X, XS))) → MARK(cons(s(X), incr(XS)))
MARK(cons(X1, X2)) → MARK(X1)
MARK(nats) → ACTIVE(nats)
ACTIVE(nats) → MARK(cons(0, incr(nats)))
MARK(incr(X)) → ACTIVE(incr(mark(X)))
ACTIVE(head(cons(X, XS))) → MARK(X)
MARK(incr(X)) → MARK(X)
MARK(pairs) → ACTIVE(pairs)
ACTIVE(pairs) → MARK(cons(0, incr(odds)))
MARK(odds) → ACTIVE(odds)
ACTIVE(odds) → MARK(incr(pairs))
ACTIVE(tail(cons(X, XS))) → MARK(XS)
MARK(s(X)) → MARK(X)
MARK(head(X)) → ACTIVE(head(mark(X)))
MARK(head(X)) → MARK(X)
MARK(tail(X)) → ACTIVE(tail(mark(X)))
MARK(tail(X)) → MARK(X)

The TRS R consists of the following rules:

active(nats) → mark(cons(0, incr(nats)))
active(pairs) → mark(cons(0, incr(odds)))
active(odds) → mark(incr(pairs))
active(incr(cons(X, XS))) → mark(cons(s(X), incr(XS)))
active(head(cons(X, XS))) → mark(X)
active(tail(cons(X, XS))) → mark(XS)
mark(nats) → active(nats)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(0) → active(0)
mark(incr(X)) → active(incr(mark(X)))
mark(pairs) → active(pairs)
mark(odds) → active(odds)
mark(s(X)) → active(s(mark(X)))
mark(head(X)) → active(head(mark(X)))
mark(tail(X)) → active(tail(mark(X)))
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
incr(mark(X)) → incr(X)
incr(active(X)) → incr(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
head(mark(X)) → head(X)
head(active(X)) → head(X)
tail(mark(X)) → tail(X)
tail(active(X)) → tail(X)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(13) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].


The following pairs can be oriented strictly and are deleted.


MARK(cons(X1, X2)) → ACTIVE(cons(mark(X1), X2))
The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
MARK(x1)  =  MARK
cons(x1, x2)  =  cons
ACTIVE(x1)  =  x1
mark(x1)  =  mark
incr(x1)  =  incr
s(x1)  =  s
nats  =  nats
0  =  0
head(x1)  =  head
pairs  =  pairs
odds  =  odds
tail(x1)  =  tail
active(x1)  =  active

Recursive Path Order [RPO].
Precedence:
[MARK, incr, nats, head, pairs, odds, tail] > cons > [mark, s, active]
[MARK, incr, nats, head, pairs, odds, tail] > 0 > [mark, s, active]


The following usable rules [FROCOS05] were oriented:

active(nats) → mark(cons(0, incr(nats)))
active(pairs) → mark(cons(0, incr(odds)))
active(odds) → mark(incr(pairs))
active(incr(cons(X, XS))) → mark(cons(s(X), incr(XS)))
active(head(cons(X, XS))) → mark(X)
active(tail(cons(X, XS))) → mark(XS)
mark(nats) → active(nats)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(0) → active(0)
mark(incr(X)) → active(incr(mark(X)))
mark(pairs) → active(pairs)
mark(odds) → active(odds)
mark(s(X)) → active(s(mark(X)))
mark(head(X)) → active(head(mark(X)))
mark(tail(X)) → active(tail(mark(X)))
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
incr(mark(X)) → incr(X)
incr(active(X)) → incr(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
head(mark(X)) → head(X)
head(active(X)) → head(X)
tail(mark(X)) → tail(X)
tail(active(X)) → tail(X)

(14) Obligation:

Q DP problem:
The TRS P consists of the following rules:

ACTIVE(incr(cons(X, XS))) → MARK(cons(s(X), incr(XS)))
MARK(cons(X1, X2)) → MARK(X1)
MARK(nats) → ACTIVE(nats)
ACTIVE(nats) → MARK(cons(0, incr(nats)))
MARK(incr(X)) → ACTIVE(incr(mark(X)))
ACTIVE(head(cons(X, XS))) → MARK(X)
MARK(incr(X)) → MARK(X)
MARK(pairs) → ACTIVE(pairs)
ACTIVE(pairs) → MARK(cons(0, incr(odds)))
MARK(odds) → ACTIVE(odds)
ACTIVE(odds) → MARK(incr(pairs))
ACTIVE(tail(cons(X, XS))) → MARK(XS)
MARK(s(X)) → MARK(X)
MARK(head(X)) → ACTIVE(head(mark(X)))
MARK(head(X)) → MARK(X)
MARK(tail(X)) → ACTIVE(tail(mark(X)))
MARK(tail(X)) → MARK(X)

The TRS R consists of the following rules:

active(nats) → mark(cons(0, incr(nats)))
active(pairs) → mark(cons(0, incr(odds)))
active(odds) → mark(incr(pairs))
active(incr(cons(X, XS))) → mark(cons(s(X), incr(XS)))
active(head(cons(X, XS))) → mark(X)
active(tail(cons(X, XS))) → mark(XS)
mark(nats) → active(nats)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(0) → active(0)
mark(incr(X)) → active(incr(mark(X)))
mark(pairs) → active(pairs)
mark(odds) → active(odds)
mark(s(X)) → active(s(mark(X)))
mark(head(X)) → active(head(mark(X)))
mark(tail(X)) → active(tail(mark(X)))
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
incr(mark(X)) → incr(X)
incr(active(X)) → incr(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
head(mark(X)) → head(X)
head(active(X)) → head(X)
tail(mark(X)) → tail(X)
tail(active(X)) → tail(X)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.