Termination w.r.t. Q proof of /tmp/tmp0KyFVD/Ex1_Luc04b

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 QDPOrderProof (⇔)

    ↳7 QDP

    ↳8 QDPOrderProof (⇔)

    ↳9 QDP

    ↳10 PisEmptyProof (⇔)

    ↳11 TRUE

  ↳12 QDP

    ↳13 QDPOrderProof (⇔)

    ↳14 QDP

    ↳15 QDPOrderProof (⇔)

    ↳16 QDP

    ↳17 PisEmptyProof (⇔)

    ↳18 TRUE

  ↳19 QDP

    ↳20 QDPOrderProof (⇔)

    ↳21 QDP

    ↳22 QDPOrderProof (⇔)

    ↳23 QDP

    ↳24 PisEmptyProof (⇔)

    ↳25 TRUE

  ↳26 QDP

    ↳27 QDPOrderProof (⇔)

    ↳28 QDP

    ↳29 QDPOrderProof (⇔)

    ↳30 QDP

    ↳31 PisEmptyProof (⇔)

    ↳32 TRUE

  ↳33 QDP

    ↳34 QDPOrderProof (⇔)

    ↳35 QDP

    ↳36 QDPOrderProof (⇔)

    ↳37 QDP

    ↳38 PisEmptyProof (⇔)

    ↳39 TRUE

  ↳40 QDP

    ↳41 QDPOrderProof (⇔)

    ↳42 QDP

    ↳43 QDPOrderProof (⇔)

    ↳44 QDP

    ↳45 QDPOrderProof (⇔)

    ↳46 QDP

    ↳47 PisEmptyProof (⇔)

    ↳48 TRUE

  ↳49 QDP

    ↳50 QDPOrderProof (⇔)

    ↳51 QDP

    ↳52 QDPOrderProof (⇔)

    ↳53 QDP

    ↳54 QDPOrderProof (⇔)

    ↳55 QDP

    ↳56 PisEmptyProof (⇔)

    ↳57 TRUE

  ↳58 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)
active(cons(X1, X2)) → cons(active(X1), X2)
active(incr(X)) → incr(active(X))
active(s(X)) → s(active(X))
active(head(X)) → head(active(X))
active(tail(X)) → tail(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
incr(mark(X)) → mark(incr(X))
s(mark(X)) → mark(s(X))
head(mark(X)) → mark(head(X))
tail(mark(X)) → mark(tail(X))
proper(nats) → ok(nats)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0) → ok(0)
proper(incr(X)) → incr(proper(X))
proper(pairs) → ok(pairs)
proper(odds) → ok(odds)
proper(s(X)) → s(proper(X))
proper(head(X)) → head(proper(X))
proper(tail(X)) → tail(proper(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
incr(ok(X)) → ok(incr(X))
s(ok(X)) → ok(s(X))
head(ok(X)) → ok(head(X))
tail(ok(X)) → ok(tail(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(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) → CONS(0, incr(nats))
ACTIVE(nats) → INCR(nats)
ACTIVE(pairs) → CONS(0, incr(odds))
ACTIVE(pairs) → INCR(odds)
ACTIVE(odds) → INCR(pairs)
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(cons(X1, X2)) → CONS(active(X1), X2)
ACTIVE(cons(X1, X2)) → ACTIVE(X1)
ACTIVE(incr(X)) → INCR(active(X))
ACTIVE(incr(X)) → ACTIVE(X)
ACTIVE(s(X)) → S(active(X))
ACTIVE(s(X)) → ACTIVE(X)
ACTIVE(head(X)) → HEAD(active(X))
ACTIVE(head(X)) → ACTIVE(X)
ACTIVE(tail(X)) → TAIL(active(X))
ACTIVE(tail(X)) → ACTIVE(X)
CONS(mark(X1), X2) → CONS(X1, X2)
INCR(mark(X)) → INCR(X)
S(mark(X)) → S(X)
HEAD(mark(X)) → HEAD(X)
TAIL(mark(X)) → TAIL(X)
PROPER(cons(X1, X2)) → CONS(proper(X1), proper(X2))
PROPER(cons(X1, X2)) → PROPER(X1)
PROPER(cons(X1, X2)) → PROPER(X2)
PROPER(incr(X)) → INCR(proper(X))
PROPER(incr(X)) → PROPER(X)
PROPER(s(X)) → S(proper(X))
PROPER(s(X)) → PROPER(X)
PROPER(head(X)) → HEAD(proper(X))
PROPER(head(X)) → PROPER(X)
PROPER(tail(X)) → TAIL(proper(X))
PROPER(tail(X)) → PROPER(X)
CONS(ok(X1), ok(X2)) → CONS(X1, X2)
INCR(ok(X)) → INCR(X)
S(ok(X)) → S(X)
HEAD(ok(X)) → HEAD(X)
TAIL(ok(X)) → TAIL(X)
TOP(mark(X)) → TOP(proper(X))
TOP(mark(X)) → PROPER(X)
TOP(ok(X)) → TOP(active(X))
TOP(ok(X)) → ACTIVE(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)
active(cons(X1, X2)) → cons(active(X1), X2)
active(incr(X)) → incr(active(X))
active(s(X)) → s(active(X))
active(head(X)) → head(active(X))
active(tail(X)) → tail(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
incr(mark(X)) → mark(incr(X))
s(mark(X)) → mark(s(X))
head(mark(X)) → mark(head(X))
tail(mark(X)) → mark(tail(X))
proper(nats) → ok(nats)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0) → ok(0)
proper(incr(X)) → incr(proper(X))
proper(pairs) → ok(pairs)
proper(odds) → ok(odds)
proper(s(X)) → s(proper(X))
proper(head(X)) → head(proper(X))
proper(tail(X)) → tail(proper(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
incr(ok(X)) → ok(incr(X))
s(ok(X)) → ok(s(X))
head(ok(X)) → ok(head(X))
tail(ok(X)) → ok(tail(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(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 8 SCCs with 20 less nodes.

(4) Complex Obligation (AND)

(5) Obligation:

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

TAIL(ok(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)
active(cons(X1, X2)) → cons(active(X1), X2)
active(incr(X)) → incr(active(X))
active(s(X)) → s(active(X))
active(head(X)) → head(active(X))
active(tail(X)) → tail(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
incr(mark(X)) → mark(incr(X))
s(mark(X)) → mark(s(X))
head(mark(X)) → mark(head(X))
tail(mark(X)) → mark(tail(X))
proper(nats) → ok(nats)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0) → ok(0)
proper(incr(X)) → incr(proper(X))
proper(pairs) → ok(pairs)
proper(odds) → ok(odds)
proper(s(X)) → s(proper(X))
proper(head(X)) → head(proper(X))
proper(tail(X)) → tail(proper(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
incr(ok(X)) → ok(incr(X))
s(ok(X)) → ok(s(X))
head(ok(X)) → ok(head(X))
tail(ok(X)) → ok(tail(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(6) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

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

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

Recursive path order with status [RPO].
Quasi-Precedence:

active₁ > [cons₂, s₁] > [TAIL₁, mark₁, incr₁, head₁, tail₁, top]
nats > [cons₂, s₁] > [TAIL₁, mark₁, incr₁, head₁, tail₁, top]
nats > 0 > [TAIL₁, mark₁, incr₁, head₁, tail₁, top]
[pairs, odds] > [cons₂, s₁] > [TAIL₁, mark₁, incr₁, head₁, tail₁, top]
[pairs, odds] > 0 > [TAIL₁, mark₁, incr₁, head₁, tail₁, top]
proper₁ > [cons₂, s₁] > [TAIL₁, mark₁, incr₁, head₁, tail₁, top]

Status:

TAIL₁: multiset
mark₁: multiset
active₁: multiset
nats: multiset
cons₂: multiset
0: multiset
incr₁: multiset
pairs: multiset
odds: multiset
s₁: multiset
head₁: multiset
tail₁: multiset
proper₁: multiset
top: multiset

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)
active(cons(X1, X2)) → cons(active(X1), X2)
active(incr(X)) → incr(active(X))
active(s(X)) → s(active(X))
active(head(X)) → head(active(X))
active(tail(X)) → tail(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
incr(mark(X)) → mark(incr(X))
s(mark(X)) → mark(s(X))
head(mark(X)) → mark(head(X))
tail(mark(X)) → mark(tail(X))
proper(nats) → ok(nats)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0) → ok(0)
proper(incr(X)) → incr(proper(X))
proper(pairs) → ok(pairs)
proper(odds) → ok(odds)
proper(s(X)) → s(proper(X))
proper(head(X)) → head(proper(X))
proper(tail(X)) → tail(proper(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
incr(ok(X)) → ok(incr(X))
s(ok(X)) → ok(s(X))
head(ok(X)) → ok(head(X))
tail(ok(X)) → ok(tail(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

(7) Obligation:

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

TAIL(ok(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)
active(cons(X1, X2)) → cons(active(X1), X2)
active(incr(X)) → incr(active(X))
active(s(X)) → s(active(X))
active(head(X)) → head(active(X))
active(tail(X)) → tail(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
incr(mark(X)) → mark(incr(X))
s(mark(X)) → mark(s(X))
head(mark(X)) → mark(head(X))
tail(mark(X)) → mark(tail(X))
proper(nats) → ok(nats)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0) → ok(0)
proper(incr(X)) → incr(proper(X))
proper(pairs) → ok(pairs)
proper(odds) → ok(odds)
proper(s(X)) → s(proper(X))
proper(head(X)) → head(proper(X))
proper(tail(X)) → tail(proper(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
incr(ok(X)) → ok(incr(X))
s(ok(X)) → ok(s(X))
head(ok(X)) → ok(head(X))
tail(ok(X)) → ok(tail(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(8) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

TAIL(ok(X)) → TAIL(X)

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

Recursive path order with status [RPO].
Quasi-Precedence:

[ok₁, pairs, proper₁] > TAIL₁ > [mark, odds, top]
[ok₁, pairs, proper₁] > [active₁, nats] > 0 > [mark, odds, top]

Status:

TAIL₁: [1]
ok₁: multiset
active₁: multiset
nats: multiset
mark: multiset
0: multiset
pairs: multiset
odds: multiset
proper₁: multiset
top: []

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)
active(cons(X1, X2)) → cons(active(X1), X2)
active(incr(X)) → incr(active(X))
active(s(X)) → s(active(X))
active(head(X)) → head(active(X))
active(tail(X)) → tail(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
incr(mark(X)) → mark(incr(X))
s(mark(X)) → mark(s(X))
head(mark(X)) → mark(head(X))
tail(mark(X)) → mark(tail(X))
proper(nats) → ok(nats)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0) → ok(0)
proper(incr(X)) → incr(proper(X))
proper(pairs) → ok(pairs)
proper(odds) → ok(odds)
proper(s(X)) → s(proper(X))
proper(head(X)) → head(proper(X))
proper(tail(X)) → tail(proper(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
incr(ok(X)) → ok(incr(X))
s(ok(X)) → ok(s(X))
head(ok(X)) → ok(head(X))
tail(ok(X)) → ok(tail(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

(9) Obligation:

Q DP problem:
P is empty.
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)
active(cons(X1, X2)) → cons(active(X1), X2)
active(incr(X)) → incr(active(X))
active(s(X)) → s(active(X))
active(head(X)) → head(active(X))
active(tail(X)) → tail(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
incr(mark(X)) → mark(incr(X))
s(mark(X)) → mark(s(X))
head(mark(X)) → mark(head(X))
tail(mark(X)) → mark(tail(X))
proper(nats) → ok(nats)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0) → ok(0)
proper(incr(X)) → incr(proper(X))
proper(pairs) → ok(pairs)
proper(odds) → ok(odds)
proper(s(X)) → s(proper(X))
proper(head(X)) → head(proper(X))
proper(tail(X)) → tail(proper(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
incr(ok(X)) → ok(incr(X))
s(ok(X)) → ok(s(X))
head(ok(X)) → ok(head(X))
tail(ok(X)) → ok(tail(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(10) PisEmptyProof (EQUIVALENT transformation)

The TRS P is empty. Hence, there is no (P,Q,R) chain.

(11) TRUE

(12) Obligation:

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

HEAD(ok(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)
active(cons(X1, X2)) → cons(active(X1), X2)
active(incr(X)) → incr(active(X))
active(s(X)) → s(active(X))
active(head(X)) → head(active(X))
active(tail(X)) → tail(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
incr(mark(X)) → mark(incr(X))
s(mark(X)) → mark(s(X))
head(mark(X)) → mark(head(X))
tail(mark(X)) → mark(tail(X))
proper(nats) → ok(nats)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0) → ok(0)
proper(incr(X)) → incr(proper(X))
proper(pairs) → ok(pairs)
proper(odds) → ok(odds)
proper(s(X)) → s(proper(X))
proper(head(X)) → head(proper(X))
proper(tail(X)) → tail(proper(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
incr(ok(X)) → ok(incr(X))
s(ok(X)) → ok(s(X))
head(ok(X)) → ok(head(X))
tail(ok(X)) → ok(tail(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(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.

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

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

Recursive path order with status [RPO].
Quasi-Precedence:

active₁ > [cons₂, s₁] > [HEAD₁, mark₁, incr₁, head₁, tail₁, top]
nats > [cons₂, s₁] > [HEAD₁, mark₁, incr₁, head₁, tail₁, top]
nats > 0 > [HEAD₁, mark₁, incr₁, head₁, tail₁, top]
[pairs, odds] > [cons₂, s₁] > [HEAD₁, mark₁, incr₁, head₁, tail₁, top]
[pairs, odds] > 0 > [HEAD₁, mark₁, incr₁, head₁, tail₁, top]
proper₁ > [cons₂, s₁] > [HEAD₁, mark₁, incr₁, head₁, tail₁, top]

Status:

HEAD₁: multiset
mark₁: multiset
active₁: multiset
nats: multiset
cons₂: multiset
0: multiset
incr₁: multiset
pairs: multiset
odds: multiset
s₁: multiset
head₁: multiset
tail₁: multiset
proper₁: multiset
top: multiset

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)
active(cons(X1, X2)) → cons(active(X1), X2)
active(incr(X)) → incr(active(X))
active(s(X)) → s(active(X))
active(head(X)) → head(active(X))
active(tail(X)) → tail(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
incr(mark(X)) → mark(incr(X))
s(mark(X)) → mark(s(X))
head(mark(X)) → mark(head(X))
tail(mark(X)) → mark(tail(X))
proper(nats) → ok(nats)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0) → ok(0)
proper(incr(X)) → incr(proper(X))
proper(pairs) → ok(pairs)
proper(odds) → ok(odds)
proper(s(X)) → s(proper(X))
proper(head(X)) → head(proper(X))
proper(tail(X)) → tail(proper(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
incr(ok(X)) → ok(incr(X))
s(ok(X)) → ok(s(X))
head(ok(X)) → ok(head(X))
tail(ok(X)) → ok(tail(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

(14) Obligation:

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

HEAD(ok(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)
active(cons(X1, X2)) → cons(active(X1), X2)
active(incr(X)) → incr(active(X))
active(s(X)) → s(active(X))
active(head(X)) → head(active(X))
active(tail(X)) → tail(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
incr(mark(X)) → mark(incr(X))
s(mark(X)) → mark(s(X))
head(mark(X)) → mark(head(X))
tail(mark(X)) → mark(tail(X))
proper(nats) → ok(nats)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0) → ok(0)
proper(incr(X)) → incr(proper(X))
proper(pairs) → ok(pairs)
proper(odds) → ok(odds)
proper(s(X)) → s(proper(X))
proper(head(X)) → head(proper(X))
proper(tail(X)) → tail(proper(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
incr(ok(X)) → ok(incr(X))
s(ok(X)) → ok(s(X))
head(ok(X)) → ok(head(X))
tail(ok(X)) → ok(tail(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(15) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

HEAD(ok(X)) → HEAD(X)

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

Recursive path order with status [RPO].
Quasi-Precedence:

[ok₁, pairs, proper₁] > HEAD₁ > [mark, odds, top]
[ok₁, pairs, proper₁] > [active₁, nats] > 0 > [mark, odds, top]

Status:

HEAD₁: [1]
ok₁: multiset
active₁: multiset
nats: multiset
mark: multiset
0: multiset
pairs: multiset
odds: multiset
proper₁: multiset
top: []

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)
active(cons(X1, X2)) → cons(active(X1), X2)
active(incr(X)) → incr(active(X))
active(s(X)) → s(active(X))
active(head(X)) → head(active(X))
active(tail(X)) → tail(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
incr(mark(X)) → mark(incr(X))
s(mark(X)) → mark(s(X))
head(mark(X)) → mark(head(X))
tail(mark(X)) → mark(tail(X))
proper(nats) → ok(nats)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0) → ok(0)
proper(incr(X)) → incr(proper(X))
proper(pairs) → ok(pairs)
proper(odds) → ok(odds)
proper(s(X)) → s(proper(X))
proper(head(X)) → head(proper(X))
proper(tail(X)) → tail(proper(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
incr(ok(X)) → ok(incr(X))
s(ok(X)) → ok(s(X))
head(ok(X)) → ok(head(X))
tail(ok(X)) → ok(tail(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

(16) Obligation:

Q DP problem:
P is empty.
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)
active(cons(X1, X2)) → cons(active(X1), X2)
active(incr(X)) → incr(active(X))
active(s(X)) → s(active(X))
active(head(X)) → head(active(X))
active(tail(X)) → tail(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
incr(mark(X)) → mark(incr(X))
s(mark(X)) → mark(s(X))
head(mark(X)) → mark(head(X))
tail(mark(X)) → mark(tail(X))
proper(nats) → ok(nats)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0) → ok(0)
proper(incr(X)) → incr(proper(X))
proper(pairs) → ok(pairs)
proper(odds) → ok(odds)
proper(s(X)) → s(proper(X))
proper(head(X)) → head(proper(X))
proper(tail(X)) → tail(proper(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
incr(ok(X)) → ok(incr(X))
s(ok(X)) → ok(s(X))
head(ok(X)) → ok(head(X))
tail(ok(X)) → ok(tail(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(17) PisEmptyProof (EQUIVALENT transformation)

The TRS P is empty. Hence, there is no (P,Q,R) chain.

(18) TRUE

(19) Obligation:

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

S(ok(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)
active(cons(X1, X2)) → cons(active(X1), X2)
active(incr(X)) → incr(active(X))
active(s(X)) → s(active(X))
active(head(X)) → head(active(X))
active(tail(X)) → tail(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
incr(mark(X)) → mark(incr(X))
s(mark(X)) → mark(s(X))
head(mark(X)) → mark(head(X))
tail(mark(X)) → mark(tail(X))
proper(nats) → ok(nats)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0) → ok(0)
proper(incr(X)) → incr(proper(X))
proper(pairs) → ok(pairs)
proper(odds) → ok(odds)
proper(s(X)) → s(proper(X))
proper(head(X)) → head(proper(X))
proper(tail(X)) → tail(proper(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
incr(ok(X)) → ok(incr(X))
s(ok(X)) → ok(s(X))
head(ok(X)) → ok(head(X))
tail(ok(X)) → ok(tail(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(20) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

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

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

Recursive path order with status [RPO].
Quasi-Precedence:

active₁ > [cons₂, s₁] > [S₁, mark₁, incr₁, head₁, tail₁, top]
nats > [cons₂, s₁] > [S₁, mark₁, incr₁, head₁, tail₁, top]
nats > 0 > [S₁, mark₁, incr₁, head₁, tail₁, top]
[pairs, odds] > [cons₂, s₁] > [S₁, mark₁, incr₁, head₁, tail₁, top]
[pairs, odds] > 0 > [S₁, mark₁, incr₁, head₁, tail₁, top]
proper₁ > [cons₂, s₁] > [S₁, mark₁, incr₁, head₁, tail₁, top]

Status:

S₁: multiset
mark₁: multiset
active₁: multiset
nats: multiset
cons₂: multiset
0: multiset
incr₁: multiset
pairs: multiset
odds: multiset
s₁: multiset
head₁: multiset
tail₁: multiset
proper₁: multiset
top: multiset

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)
active(cons(X1, X2)) → cons(active(X1), X2)
active(incr(X)) → incr(active(X))
active(s(X)) → s(active(X))
active(head(X)) → head(active(X))
active(tail(X)) → tail(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
incr(mark(X)) → mark(incr(X))
s(mark(X)) → mark(s(X))
head(mark(X)) → mark(head(X))
tail(mark(X)) → mark(tail(X))
proper(nats) → ok(nats)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0) → ok(0)
proper(incr(X)) → incr(proper(X))
proper(pairs) → ok(pairs)
proper(odds) → ok(odds)
proper(s(X)) → s(proper(X))
proper(head(X)) → head(proper(X))
proper(tail(X)) → tail(proper(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
incr(ok(X)) → ok(incr(X))
s(ok(X)) → ok(s(X))
head(ok(X)) → ok(head(X))
tail(ok(X)) → ok(tail(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

(21) Obligation:

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

S(ok(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)
active(cons(X1, X2)) → cons(active(X1), X2)
active(incr(X)) → incr(active(X))
active(s(X)) → s(active(X))
active(head(X)) → head(active(X))
active(tail(X)) → tail(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
incr(mark(X)) → mark(incr(X))
s(mark(X)) → mark(s(X))
head(mark(X)) → mark(head(X))
tail(mark(X)) → mark(tail(X))
proper(nats) → ok(nats)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0) → ok(0)
proper(incr(X)) → incr(proper(X))
proper(pairs) → ok(pairs)
proper(odds) → ok(odds)
proper(s(X)) → s(proper(X))
proper(head(X)) → head(proper(X))
proper(tail(X)) → tail(proper(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
incr(ok(X)) → ok(incr(X))
s(ok(X)) → ok(s(X))
head(ok(X)) → ok(head(X))
tail(ok(X)) → ok(tail(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(22) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

S(ok(X)) → S(X)

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

Recursive path order with status [RPO].
Quasi-Precedence:

[ok₁, pairs, proper₁] > S₁ > [mark, odds, top]
[ok₁, pairs, proper₁] > [active₁, nats] > 0 > [mark, odds, top]

Status:

S₁: [1]
ok₁: multiset
active₁: multiset
nats: multiset
mark: multiset
0: multiset
pairs: multiset
odds: multiset
proper₁: multiset
top: []

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)
active(cons(X1, X2)) → cons(active(X1), X2)
active(incr(X)) → incr(active(X))
active(s(X)) → s(active(X))
active(head(X)) → head(active(X))
active(tail(X)) → tail(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
incr(mark(X)) → mark(incr(X))
s(mark(X)) → mark(s(X))
head(mark(X)) → mark(head(X))
tail(mark(X)) → mark(tail(X))
proper(nats) → ok(nats)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0) → ok(0)
proper(incr(X)) → incr(proper(X))
proper(pairs) → ok(pairs)
proper(odds) → ok(odds)
proper(s(X)) → s(proper(X))
proper(head(X)) → head(proper(X))
proper(tail(X)) → tail(proper(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
incr(ok(X)) → ok(incr(X))
s(ok(X)) → ok(s(X))
head(ok(X)) → ok(head(X))
tail(ok(X)) → ok(tail(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

(23) Obligation:

Q DP problem:
P is empty.
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)
active(cons(X1, X2)) → cons(active(X1), X2)
active(incr(X)) → incr(active(X))
active(s(X)) → s(active(X))
active(head(X)) → head(active(X))
active(tail(X)) → tail(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
incr(mark(X)) → mark(incr(X))
s(mark(X)) → mark(s(X))
head(mark(X)) → mark(head(X))
tail(mark(X)) → mark(tail(X))
proper(nats) → ok(nats)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0) → ok(0)
proper(incr(X)) → incr(proper(X))
proper(pairs) → ok(pairs)
proper(odds) → ok(odds)
proper(s(X)) → s(proper(X))
proper(head(X)) → head(proper(X))
proper(tail(X)) → tail(proper(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
incr(ok(X)) → ok(incr(X))
s(ok(X)) → ok(s(X))
head(ok(X)) → ok(head(X))
tail(ok(X)) → ok(tail(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(24) PisEmptyProof (EQUIVALENT transformation)

The TRS P is empty. Hence, there is no (P,Q,R) chain.

(25) TRUE

(26) Obligation:

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

INCR(ok(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)
active(cons(X1, X2)) → cons(active(X1), X2)
active(incr(X)) → incr(active(X))
active(s(X)) → s(active(X))
active(head(X)) → head(active(X))
active(tail(X)) → tail(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
incr(mark(X)) → mark(incr(X))
s(mark(X)) → mark(s(X))
head(mark(X)) → mark(head(X))
tail(mark(X)) → mark(tail(X))
proper(nats) → ok(nats)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0) → ok(0)
proper(incr(X)) → incr(proper(X))
proper(pairs) → ok(pairs)
proper(odds) → ok(odds)
proper(s(X)) → s(proper(X))
proper(head(X)) → head(proper(X))
proper(tail(X)) → tail(proper(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
incr(ok(X)) → ok(incr(X))
s(ok(X)) → ok(s(X))
head(ok(X)) → ok(head(X))
tail(ok(X)) → ok(tail(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(27) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

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

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

Recursive path order with status [RPO].
Quasi-Precedence:

active₁ > [cons₂, s₁] > [INCR₁, mark₁, incr₁, head₁, tail₁, top]
nats > [cons₂, s₁] > [INCR₁, mark₁, incr₁, head₁, tail₁, top]
nats > 0 > [INCR₁, mark₁, incr₁, head₁, tail₁, top]
[pairs, odds] > [cons₂, s₁] > [INCR₁, mark₁, incr₁, head₁, tail₁, top]
[pairs, odds] > 0 > [INCR₁, mark₁, incr₁, head₁, tail₁, top]
proper₁ > [cons₂, s₁] > [INCR₁, mark₁, incr₁, head₁, tail₁, top]

Status:

INCR₁: multiset
mark₁: multiset
active₁: multiset
nats: multiset
cons₂: multiset
0: multiset
incr₁: multiset
pairs: multiset
odds: multiset
s₁: multiset
head₁: multiset
tail₁: multiset
proper₁: multiset
top: multiset

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)
active(cons(X1, X2)) → cons(active(X1), X2)
active(incr(X)) → incr(active(X))
active(s(X)) → s(active(X))
active(head(X)) → head(active(X))
active(tail(X)) → tail(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
incr(mark(X)) → mark(incr(X))
s(mark(X)) → mark(s(X))
head(mark(X)) → mark(head(X))
tail(mark(X)) → mark(tail(X))
proper(nats) → ok(nats)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0) → ok(0)
proper(incr(X)) → incr(proper(X))
proper(pairs) → ok(pairs)
proper(odds) → ok(odds)
proper(s(X)) → s(proper(X))
proper(head(X)) → head(proper(X))
proper(tail(X)) → tail(proper(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
incr(ok(X)) → ok(incr(X))
s(ok(X)) → ok(s(X))
head(ok(X)) → ok(head(X))
tail(ok(X)) → ok(tail(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

(28) Obligation:

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

INCR(ok(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)
active(cons(X1, X2)) → cons(active(X1), X2)
active(incr(X)) → incr(active(X))
active(s(X)) → s(active(X))
active(head(X)) → head(active(X))
active(tail(X)) → tail(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
incr(mark(X)) → mark(incr(X))
s(mark(X)) → mark(s(X))
head(mark(X)) → mark(head(X))
tail(mark(X)) → mark(tail(X))
proper(nats) → ok(nats)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0) → ok(0)
proper(incr(X)) → incr(proper(X))
proper(pairs) → ok(pairs)
proper(odds) → ok(odds)
proper(s(X)) → s(proper(X))
proper(head(X)) → head(proper(X))
proper(tail(X)) → tail(proper(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
incr(ok(X)) → ok(incr(X))
s(ok(X)) → ok(s(X))
head(ok(X)) → ok(head(X))
tail(ok(X)) → ok(tail(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(29) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

INCR(ok(X)) → INCR(X)

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

Recursive path order with status [RPO].
Quasi-Precedence:

[ok₁, pairs, proper₁] > INCR₁ > [mark, odds, top]
[ok₁, pairs, proper₁] > [active₁, nats] > 0 > [mark, odds, top]

Status:

INCR₁: [1]
ok₁: multiset
active₁: multiset
nats: multiset
mark: multiset
0: multiset
pairs: multiset
odds: multiset
proper₁: multiset
top: []

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)
active(cons(X1, X2)) → cons(active(X1), X2)
active(incr(X)) → incr(active(X))
active(s(X)) → s(active(X))
active(head(X)) → head(active(X))
active(tail(X)) → tail(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
incr(mark(X)) → mark(incr(X))
s(mark(X)) → mark(s(X))
head(mark(X)) → mark(head(X))
tail(mark(X)) → mark(tail(X))
proper(nats) → ok(nats)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0) → ok(0)
proper(incr(X)) → incr(proper(X))
proper(pairs) → ok(pairs)
proper(odds) → ok(odds)
proper(s(X)) → s(proper(X))
proper(head(X)) → head(proper(X))
proper(tail(X)) → tail(proper(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
incr(ok(X)) → ok(incr(X))
s(ok(X)) → ok(s(X))
head(ok(X)) → ok(head(X))
tail(ok(X)) → ok(tail(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

(30) Obligation:

Q DP problem:
P is empty.
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)
active(cons(X1, X2)) → cons(active(X1), X2)
active(incr(X)) → incr(active(X))
active(s(X)) → s(active(X))
active(head(X)) → head(active(X))
active(tail(X)) → tail(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
incr(mark(X)) → mark(incr(X))
s(mark(X)) → mark(s(X))
head(mark(X)) → mark(head(X))
tail(mark(X)) → mark(tail(X))
proper(nats) → ok(nats)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0) → ok(0)
proper(incr(X)) → incr(proper(X))
proper(pairs) → ok(pairs)
proper(odds) → ok(odds)
proper(s(X)) → s(proper(X))
proper(head(X)) → head(proper(X))
proper(tail(X)) → tail(proper(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
incr(ok(X)) → ok(incr(X))
s(ok(X)) → ok(s(X))
head(ok(X)) → ok(head(X))
tail(ok(X)) → ok(tail(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(31) PisEmptyProof (EQUIVALENT transformation)

The TRS P is empty. Hence, there is no (P,Q,R) chain.

(32) TRUE

(33) Obligation:

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

CONS(ok(X1), ok(X2)) → CONS(X1, X2)
CONS(mark(X1), 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)
active(cons(X1, X2)) → cons(active(X1), X2)
active(incr(X)) → incr(active(X))
active(s(X)) → s(active(X))
active(head(X)) → head(active(X))
active(tail(X)) → tail(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
incr(mark(X)) → mark(incr(X))
s(mark(X)) → mark(s(X))
head(mark(X)) → mark(head(X))
tail(mark(X)) → mark(tail(X))
proper(nats) → ok(nats)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0) → ok(0)
proper(incr(X)) → incr(proper(X))
proper(pairs) → ok(pairs)
proper(odds) → ok(odds)
proper(s(X)) → s(proper(X))
proper(head(X)) → head(proper(X))
proper(tail(X)) → tail(proper(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
incr(ok(X)) → ok(incr(X))
s(ok(X)) → ok(s(X))
head(ok(X)) → ok(head(X))
tail(ok(X)) → ok(tail(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(34) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

CONS(ok(X1), ok(X2)) → CONS(X1, X2)

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

Recursive path order with status [RPO].
Quasi-Precedence:

active₁ > [CONS₁, ok₁, mark, cons₁, incr₁, s₁, head₁, tail₁, top]
nats > 0 > [CONS₁, ok₁, mark, cons₁, incr₁, s₁, head₁, tail₁, top]
[pairs, odds] > 0 > [CONS₁, ok₁, mark, cons₁, incr₁, s₁, head₁, tail₁, top]
proper₁ > [CONS₁, ok₁, mark, cons₁, incr₁, s₁, head₁, tail₁, top]

Status:

CONS₁: [1]
ok₁: [1]
mark: multiset
active₁: multiset
nats: multiset
cons₁: [1]
0: multiset
incr₁: [1]
pairs: multiset
odds: multiset
s₁: [1]
head₁: [1]
tail₁: [1]
proper₁: multiset
top: multiset

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)
active(cons(X1, X2)) → cons(active(X1), X2)
active(incr(X)) → incr(active(X))
active(s(X)) → s(active(X))
active(head(X)) → head(active(X))
active(tail(X)) → tail(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
incr(mark(X)) → mark(incr(X))
s(mark(X)) → mark(s(X))
head(mark(X)) → mark(head(X))
tail(mark(X)) → mark(tail(X))
proper(nats) → ok(nats)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0) → ok(0)
proper(incr(X)) → incr(proper(X))
proper(pairs) → ok(pairs)
proper(odds) → ok(odds)
proper(s(X)) → s(proper(X))
proper(head(X)) → head(proper(X))
proper(tail(X)) → tail(proper(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
incr(ok(X)) → ok(incr(X))
s(ok(X)) → ok(s(X))
head(ok(X)) → ok(head(X))
tail(ok(X)) → ok(tail(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

(35) Obligation:

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

CONS(mark(X1), 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)
active(cons(X1, X2)) → cons(active(X1), X2)
active(incr(X)) → incr(active(X))
active(s(X)) → s(active(X))
active(head(X)) → head(active(X))
active(tail(X)) → tail(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
incr(mark(X)) → mark(incr(X))
s(mark(X)) → mark(s(X))
head(mark(X)) → mark(head(X))
tail(mark(X)) → mark(tail(X))
proper(nats) → ok(nats)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0) → ok(0)
proper(incr(X)) → incr(proper(X))
proper(pairs) → ok(pairs)
proper(odds) → ok(odds)
proper(s(X)) → s(proper(X))
proper(head(X)) → head(proper(X))
proper(tail(X)) → tail(proper(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
incr(ok(X)) → ok(incr(X))
s(ok(X)) → ok(s(X))
head(ok(X)) → ok(head(X))
tail(ok(X)) → ok(tail(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(36) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

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

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

Recursive path order with status [RPO].
Quasi-Precedence:

nats > [active₁, cons₂] > [CONS₂, mark₁, 0, incr₁, head₁, tail₁, ok, top]
[pairs, odds] > [active₁, cons₂] > [CONS₂, mark₁, 0, incr₁, head₁, tail₁, ok, top]

Status:

CONS₂: [1,2]
mark₁: multiset
active₁: [1]
nats: multiset
cons₂: [1,2]
0: multiset
incr₁: multiset
pairs: multiset
odds: multiset
head₁: multiset
tail₁: multiset
ok: multiset
top: []

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)
active(cons(X1, X2)) → cons(active(X1), X2)
active(incr(X)) → incr(active(X))
active(s(X)) → s(active(X))
active(head(X)) → head(active(X))
active(tail(X)) → tail(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
incr(mark(X)) → mark(incr(X))
s(mark(X)) → mark(s(X))
head(mark(X)) → mark(head(X))
tail(mark(X)) → mark(tail(X))
proper(nats) → ok(nats)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0) → ok(0)
proper(incr(X)) → incr(proper(X))
proper(pairs) → ok(pairs)
proper(odds) → ok(odds)
proper(s(X)) → s(proper(X))
proper(head(X)) → head(proper(X))
proper(tail(X)) → tail(proper(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
incr(ok(X)) → ok(incr(X))
s(ok(X)) → ok(s(X))
head(ok(X)) → ok(head(X))
tail(ok(X)) → ok(tail(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

(37) Obligation:

Q DP problem:
P is empty.
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)
active(cons(X1, X2)) → cons(active(X1), X2)
active(incr(X)) → incr(active(X))
active(s(X)) → s(active(X))
active(head(X)) → head(active(X))
active(tail(X)) → tail(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
incr(mark(X)) → mark(incr(X))
s(mark(X)) → mark(s(X))
head(mark(X)) → mark(head(X))
tail(mark(X)) → mark(tail(X))
proper(nats) → ok(nats)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0) → ok(0)
proper(incr(X)) → incr(proper(X))
proper(pairs) → ok(pairs)
proper(odds) → ok(odds)
proper(s(X)) → s(proper(X))
proper(head(X)) → head(proper(X))
proper(tail(X)) → tail(proper(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
incr(ok(X)) → ok(incr(X))
s(ok(X)) → ok(s(X))
head(ok(X)) → ok(head(X))
tail(ok(X)) → ok(tail(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(38) PisEmptyProof (EQUIVALENT transformation)

The TRS P is empty. Hence, there is no (P,Q,R) chain.

(39) TRUE

(40) Obligation:

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

PROPER(cons(X1, X2)) → PROPER(X2)
PROPER(cons(X1, X2)) → PROPER(X1)
PROPER(incr(X)) → PROPER(X)
PROPER(s(X)) → PROPER(X)
PROPER(head(X)) → PROPER(X)
PROPER(tail(X)) → PROPER(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)
active(cons(X1, X2)) → cons(active(X1), X2)
active(incr(X)) → incr(active(X))
active(s(X)) → s(active(X))
active(head(X)) → head(active(X))
active(tail(X)) → tail(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
incr(mark(X)) → mark(incr(X))
s(mark(X)) → mark(s(X))
head(mark(X)) → mark(head(X))
tail(mark(X)) → mark(tail(X))
proper(nats) → ok(nats)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0) → ok(0)
proper(incr(X)) → incr(proper(X))
proper(pairs) → ok(pairs)
proper(odds) → ok(odds)
proper(s(X)) → s(proper(X))
proper(head(X)) → head(proper(X))
proper(tail(X)) → tail(proper(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
incr(ok(X)) → ok(incr(X))
s(ok(X)) → ok(s(X))
head(ok(X)) → ok(head(X))
tail(ok(X)) → ok(tail(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(41) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

PROPER(cons(X1, X2)) → PROPER(X2)
PROPER(cons(X1, X2)) → PROPER(X1)

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

Recursive path order with status [RPO].
Quasi-Precedence:

active₁ > [PROPER₁, cons₂, mark, proper₁, ok, top]
nats > 0 > [PROPER₁, cons₂, mark, proper₁, ok, top]
[pairs, odds] > 0 > [PROPER₁, cons₂, mark, proper₁, ok, top]

Status:

PROPER₁: [1]
cons₂: [2,1]
active₁: multiset
nats: multiset
mark: multiset
0: multiset
pairs: multiset
odds: multiset
proper₁: [1]
ok: multiset
top: multiset

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)
active(cons(X1, X2)) → cons(active(X1), X2)
active(incr(X)) → incr(active(X))
active(s(X)) → s(active(X))
active(head(X)) → head(active(X))
active(tail(X)) → tail(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
incr(mark(X)) → mark(incr(X))
s(mark(X)) → mark(s(X))
head(mark(X)) → mark(head(X))
tail(mark(X)) → mark(tail(X))
proper(nats) → ok(nats)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0) → ok(0)
proper(incr(X)) → incr(proper(X))
proper(pairs) → ok(pairs)
proper(odds) → ok(odds)
proper(s(X)) → s(proper(X))
proper(head(X)) → head(proper(X))
proper(tail(X)) → tail(proper(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
incr(ok(X)) → ok(incr(X))
s(ok(X)) → ok(s(X))
head(ok(X)) → ok(head(X))
tail(ok(X)) → ok(tail(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

(42) Obligation:

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

PROPER(incr(X)) → PROPER(X)
PROPER(s(X)) → PROPER(X)
PROPER(head(X)) → PROPER(X)
PROPER(tail(X)) → PROPER(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)
active(cons(X1, X2)) → cons(active(X1), X2)
active(incr(X)) → incr(active(X))
active(s(X)) → s(active(X))
active(head(X)) → head(active(X))
active(tail(X)) → tail(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
incr(mark(X)) → mark(incr(X))
s(mark(X)) → mark(s(X))
head(mark(X)) → mark(head(X))
tail(mark(X)) → mark(tail(X))
proper(nats) → ok(nats)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0) → ok(0)
proper(incr(X)) → incr(proper(X))
proper(pairs) → ok(pairs)
proper(odds) → ok(odds)
proper(s(X)) → s(proper(X))
proper(head(X)) → head(proper(X))
proper(tail(X)) → tail(proper(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
incr(ok(X)) → ok(incr(X))
s(ok(X)) → ok(s(X))
head(ok(X)) → ok(head(X))
tail(ok(X)) → ok(tail(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(43) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

PROPER(incr(X)) → PROPER(X)
PROPER(s(X)) → PROPER(X)
PROPER(head(X)) → PROPER(X)

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

Recursive path order with status [RPO].
Quasi-Precedence:

[pairs, odds] > 0 > [PROPER₁, incr₁, s₁, head₁, nats, mark, cons₂, ok, top]
proper₁ > [PROPER₁, incr₁, s₁, head₁, nats, mark, cons₂, ok, top]

Status:

PROPER₁: multiset
incr₁: multiset
s₁: multiset
head₁: multiset
nats: multiset
mark: multiset
cons₂: multiset
0: multiset
pairs: multiset
odds: multiset
proper₁: multiset
ok: multiset
top: multiset

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)
active(cons(X1, X2)) → cons(active(X1), X2)
active(incr(X)) → incr(active(X))
active(s(X)) → s(active(X))
active(head(X)) → head(active(X))
active(tail(X)) → tail(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
incr(mark(X)) → mark(incr(X))
s(mark(X)) → mark(s(X))
head(mark(X)) → mark(head(X))
tail(mark(X)) → mark(tail(X))
proper(nats) → ok(nats)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0) → ok(0)
proper(incr(X)) → incr(proper(X))
proper(pairs) → ok(pairs)
proper(odds) → ok(odds)
proper(s(X)) → s(proper(X))
proper(head(X)) → head(proper(X))
proper(tail(X)) → tail(proper(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
incr(ok(X)) → ok(incr(X))
s(ok(X)) → ok(s(X))
head(ok(X)) → ok(head(X))
tail(ok(X)) → ok(tail(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

(44) Obligation:

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

PROPER(tail(X)) → PROPER(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)
active(cons(X1, X2)) → cons(active(X1), X2)
active(incr(X)) → incr(active(X))
active(s(X)) → s(active(X))
active(head(X)) → head(active(X))
active(tail(X)) → tail(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
incr(mark(X)) → mark(incr(X))
s(mark(X)) → mark(s(X))
head(mark(X)) → mark(head(X))
tail(mark(X)) → mark(tail(X))
proper(nats) → ok(nats)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0) → ok(0)
proper(incr(X)) → incr(proper(X))
proper(pairs) → ok(pairs)
proper(odds) → ok(odds)
proper(s(X)) → s(proper(X))
proper(head(X)) → head(proper(X))
proper(tail(X)) → tail(proper(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
incr(ok(X)) → ok(incr(X))
s(ok(X)) → ok(s(X))
head(ok(X)) → ok(head(X))
tail(ok(X)) → ok(tail(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(45) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

PROPER(tail(X)) → PROPER(X)

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

Recursive path order with status [RPO].
Quasi-Precedence:

nats > 0 > [PROPER₁, tail₁, mark, cons₂, incr, s, head₁, ok, top]
[pairs, odds] > 0 > [PROPER₁, tail₁, mark, cons₂, incr, s, head₁, ok, top]

Status:

PROPER₁: [1]
tail₁: multiset
nats: multiset
mark: multiset
cons₂: multiset
0: multiset
incr: multiset
pairs: multiset
odds: multiset
s: multiset
head₁: multiset
ok: multiset
top: multiset

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)
active(cons(X1, X2)) → cons(active(X1), X2)
active(incr(X)) → incr(active(X))
active(s(X)) → s(active(X))
active(head(X)) → head(active(X))
active(tail(X)) → tail(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
incr(mark(X)) → mark(incr(X))
s(mark(X)) → mark(s(X))
head(mark(X)) → mark(head(X))
tail(mark(X)) → mark(tail(X))
proper(nats) → ok(nats)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0) → ok(0)
proper(incr(X)) → incr(proper(X))
proper(pairs) → ok(pairs)
proper(odds) → ok(odds)
proper(s(X)) → s(proper(X))
proper(head(X)) → head(proper(X))
proper(tail(X)) → tail(proper(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
incr(ok(X)) → ok(incr(X))
s(ok(X)) → ok(s(X))
head(ok(X)) → ok(head(X))
tail(ok(X)) → ok(tail(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

(46) Obligation:

Q DP problem:
P is empty.
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)
active(cons(X1, X2)) → cons(active(X1), X2)
active(incr(X)) → incr(active(X))
active(s(X)) → s(active(X))
active(head(X)) → head(active(X))
active(tail(X)) → tail(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
incr(mark(X)) → mark(incr(X))
s(mark(X)) → mark(s(X))
head(mark(X)) → mark(head(X))
tail(mark(X)) → mark(tail(X))
proper(nats) → ok(nats)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0) → ok(0)
proper(incr(X)) → incr(proper(X))
proper(pairs) → ok(pairs)
proper(odds) → ok(odds)
proper(s(X)) → s(proper(X))
proper(head(X)) → head(proper(X))
proper(tail(X)) → tail(proper(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
incr(ok(X)) → ok(incr(X))
s(ok(X)) → ok(s(X))
head(ok(X)) → ok(head(X))
tail(ok(X)) → ok(tail(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(47) PisEmptyProof (EQUIVALENT transformation)

The TRS P is empty. Hence, there is no (P,Q,R) chain.

(48) TRUE

(49) Obligation:

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

ACTIVE(incr(X)) → ACTIVE(X)
ACTIVE(cons(X1, X2)) → ACTIVE(X1)
ACTIVE(s(X)) → ACTIVE(X)
ACTIVE(head(X)) → ACTIVE(X)
ACTIVE(tail(X)) → ACTIVE(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)
active(cons(X1, X2)) → cons(active(X1), X2)
active(incr(X)) → incr(active(X))
active(s(X)) → s(active(X))
active(head(X)) → head(active(X))
active(tail(X)) → tail(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
incr(mark(X)) → mark(incr(X))
s(mark(X)) → mark(s(X))
head(mark(X)) → mark(head(X))
tail(mark(X)) → mark(tail(X))
proper(nats) → ok(nats)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0) → ok(0)
proper(incr(X)) → incr(proper(X))
proper(pairs) → ok(pairs)
proper(odds) → ok(odds)
proper(s(X)) → s(proper(X))
proper(head(X)) → head(proper(X))
proper(tail(X)) → tail(proper(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
incr(ok(X)) → ok(incr(X))
s(ok(X)) → ok(s(X))
head(ok(X)) → ok(head(X))
tail(ok(X)) → ok(tail(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(50) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

ACTIVE(tail(X)) → ACTIVE(X)

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

Recursive path order with status [RPO].
Quasi-Precedence:

active₁ > [ACTIVE₁, tail₁, mark, ok₁, top]
nats > 0 > [ACTIVE₁, tail₁, mark, ok₁, top]
[pairs, odds] > 0 > [ACTIVE₁, tail₁, mark, ok₁, top]
proper₁ > [ACTIVE₁, tail₁, mark, ok₁, top]

Status:

ACTIVE₁: [1]
tail₁: multiset
active₁: multiset
nats: multiset
mark: multiset
0: multiset
pairs: multiset
odds: multiset
proper₁: multiset
ok₁: multiset
top: multiset

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)
active(cons(X1, X2)) → cons(active(X1), X2)
active(incr(X)) → incr(active(X))
active(s(X)) → s(active(X))
active(head(X)) → head(active(X))
active(tail(X)) → tail(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
incr(mark(X)) → mark(incr(X))
s(mark(X)) → mark(s(X))
head(mark(X)) → mark(head(X))
tail(mark(X)) → mark(tail(X))
proper(nats) → ok(nats)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0) → ok(0)
proper(incr(X)) → incr(proper(X))
proper(pairs) → ok(pairs)
proper(odds) → ok(odds)
proper(s(X)) → s(proper(X))
proper(head(X)) → head(proper(X))
proper(tail(X)) → tail(proper(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
incr(ok(X)) → ok(incr(X))
s(ok(X)) → ok(s(X))
head(ok(X)) → ok(head(X))
tail(ok(X)) → ok(tail(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

(51) Obligation:

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

ACTIVE(incr(X)) → ACTIVE(X)
ACTIVE(cons(X1, X2)) → ACTIVE(X1)
ACTIVE(s(X)) → ACTIVE(X)
ACTIVE(head(X)) → ACTIVE(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)
active(cons(X1, X2)) → cons(active(X1), X2)
active(incr(X)) → incr(active(X))
active(s(X)) → s(active(X))
active(head(X)) → head(active(X))
active(tail(X)) → tail(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
incr(mark(X)) → mark(incr(X))
s(mark(X)) → mark(s(X))
head(mark(X)) → mark(head(X))
tail(mark(X)) → mark(tail(X))
proper(nats) → ok(nats)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0) → ok(0)
proper(incr(X)) → incr(proper(X))
proper(pairs) → ok(pairs)
proper(odds) → ok(odds)
proper(s(X)) → s(proper(X))
proper(head(X)) → head(proper(X))
proper(tail(X)) → tail(proper(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
incr(ok(X)) → ok(incr(X))
s(ok(X)) → ok(s(X))
head(ok(X)) → ok(head(X))
tail(ok(X)) → ok(tail(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(52) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

ACTIVE(incr(X)) → ACTIVE(X)
ACTIVE(cons(X1, X2)) → ACTIVE(X1)

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

Recursive path order with status [RPO].
Quasi-Precedence:

active₁ > [ACTIVE₁, incr₁, cons₂, mark, tail₁, ok, top]
nats > 0 > [ACTIVE₁, incr₁, cons₂, mark, tail₁, ok, top]
[pairs, odds] > 0 > [ACTIVE₁, incr₁, cons₂, mark, tail₁, ok, top]
proper₁ > [ACTIVE₁, incr₁, cons₂, mark, tail₁, ok, top]

Status:

ACTIVE₁: multiset
incr₁: multiset
cons₂: multiset
active₁: multiset
nats: multiset
mark: multiset
0: multiset
pairs: multiset
odds: multiset
tail₁: multiset
proper₁: multiset
ok: multiset
top: multiset

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)
active(cons(X1, X2)) → cons(active(X1), X2)
active(incr(X)) → incr(active(X))
active(s(X)) → s(active(X))
active(head(X)) → head(active(X))
active(tail(X)) → tail(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
incr(mark(X)) → mark(incr(X))
s(mark(X)) → mark(s(X))
head(mark(X)) → mark(head(X))
tail(mark(X)) → mark(tail(X))
proper(nats) → ok(nats)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0) → ok(0)
proper(incr(X)) → incr(proper(X))
proper(pairs) → ok(pairs)
proper(odds) → ok(odds)
proper(s(X)) → s(proper(X))
proper(head(X)) → head(proper(X))
proper(tail(X)) → tail(proper(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
incr(ok(X)) → ok(incr(X))
s(ok(X)) → ok(s(X))
head(ok(X)) → ok(head(X))
tail(ok(X)) → ok(tail(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

(53) Obligation:

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

ACTIVE(s(X)) → ACTIVE(X)
ACTIVE(head(X)) → ACTIVE(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)
active(cons(X1, X2)) → cons(active(X1), X2)
active(incr(X)) → incr(active(X))
active(s(X)) → s(active(X))
active(head(X)) → head(active(X))
active(tail(X)) → tail(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
incr(mark(X)) → mark(incr(X))
s(mark(X)) → mark(s(X))
head(mark(X)) → mark(head(X))
tail(mark(X)) → mark(tail(X))
proper(nats) → ok(nats)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0) → ok(0)
proper(incr(X)) → incr(proper(X))
proper(pairs) → ok(pairs)
proper(odds) → ok(odds)
proper(s(X)) → s(proper(X))
proper(head(X)) → head(proper(X))
proper(tail(X)) → tail(proper(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
incr(ok(X)) → ok(incr(X))
s(ok(X)) → ok(s(X))
head(ok(X)) → ok(head(X))
tail(ok(X)) → ok(tail(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(54) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

ACTIVE(s(X)) → ACTIVE(X)
ACTIVE(head(X)) → ACTIVE(X)

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

Recursive path order with status [RPO].
Quasi-Precedence:

active₁ > [ACTIVE₁, s₁, head₁, mark, cons₂, tail₁, ok, top]
nats > 0 > [ACTIVE₁, s₁, head₁, mark, cons₂, tail₁, ok, top]
[pairs, odds] > 0 > [ACTIVE₁, s₁, head₁, mark, cons₂, tail₁, ok, top]
proper₁ > [ACTIVE₁, s₁, head₁, mark, cons₂, tail₁, ok, top]

Status:

ACTIVE₁: multiset
s₁: multiset
head₁: multiset
active₁: multiset
nats: multiset
mark: multiset
cons₂: multiset
0: multiset
pairs: multiset
odds: multiset
tail₁: multiset
proper₁: multiset
ok: multiset
top: multiset

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)
active(cons(X1, X2)) → cons(active(X1), X2)
active(incr(X)) → incr(active(X))
active(s(X)) → s(active(X))
active(head(X)) → head(active(X))
active(tail(X)) → tail(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
incr(mark(X)) → mark(incr(X))
s(mark(X)) → mark(s(X))
head(mark(X)) → mark(head(X))
tail(mark(X)) → mark(tail(X))
proper(nats) → ok(nats)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0) → ok(0)
proper(incr(X)) → incr(proper(X))
proper(pairs) → ok(pairs)
proper(odds) → ok(odds)
proper(s(X)) → s(proper(X))
proper(head(X)) → head(proper(X))
proper(tail(X)) → tail(proper(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
incr(ok(X)) → ok(incr(X))
s(ok(X)) → ok(s(X))
head(ok(X)) → ok(head(X))
tail(ok(X)) → ok(tail(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

(55) Obligation:

Q DP problem:
P is empty.
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)
active(cons(X1, X2)) → cons(active(X1), X2)
active(incr(X)) → incr(active(X))
active(s(X)) → s(active(X))
active(head(X)) → head(active(X))
active(tail(X)) → tail(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
incr(mark(X)) → mark(incr(X))
s(mark(X)) → mark(s(X))
head(mark(X)) → mark(head(X))
tail(mark(X)) → mark(tail(X))
proper(nats) → ok(nats)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0) → ok(0)
proper(incr(X)) → incr(proper(X))
proper(pairs) → ok(pairs)
proper(odds) → ok(odds)
proper(s(X)) → s(proper(X))
proper(head(X)) → head(proper(X))
proper(tail(X)) → tail(proper(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
incr(ok(X)) → ok(incr(X))
s(ok(X)) → ok(s(X))
head(ok(X)) → ok(head(X))
tail(ok(X)) → ok(tail(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(56) PisEmptyProof (EQUIVALENT transformation)

The TRS P is empty. Hence, there is no (P,Q,R) chain.

(57) TRUE

(58) Obligation:

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

TOP(ok(X)) → TOP(active(X))
TOP(mark(X)) → TOP(proper(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)
active(cons(X1, X2)) → cons(active(X1), X2)
active(incr(X)) → incr(active(X))
active(s(X)) → s(active(X))
active(head(X)) → head(active(X))
active(tail(X)) → tail(active(X))
cons(mark(X1), X2) → mark(cons(X1, X2))
incr(mark(X)) → mark(incr(X))
s(mark(X)) → mark(s(X))
head(mark(X)) → mark(head(X))
tail(mark(X)) → mark(tail(X))
proper(nats) → ok(nats)
proper(cons(X1, X2)) → cons(proper(X1), proper(X2))
proper(0) → ok(0)
proper(incr(X)) → incr(proper(X))
proper(pairs) → ok(pairs)
proper(odds) → ok(odds)
proper(s(X)) → s(proper(X))
proper(head(X)) → head(proper(X))
proper(tail(X)) → tail(proper(X))
cons(ok(X1), ok(X2)) → ok(cons(X1, X2))
incr(ok(X)) → ok(incr(X))
s(ok(X)) → ok(s(X))
head(ok(X)) → ok(head(X))
tail(ok(X)) → ok(tail(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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