Termination w.r.t. Q proof of /tmp/tmpXBTwh4/LengthOfFiniteLists_nokinds_noand

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

    ↳9 TRUE

  ↳10 QDP

    ↳11 QDPOrderProof (⇔)

    ↳12 QDP

    ↳13 PisEmptyProof (⇔)

    ↳14 TRUE

  ↳15 QDP

(0) Obligation:

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

a__zeros → cons(0, zeros)
a__U11(tt) → tt
a__U21(tt) → tt
a__U31(tt) → tt
a__U41(tt, V2) → a__U42(a__isNatIList(V2))
a__U42(tt) → tt
a__U51(tt, V2) → a__U52(a__isNatList(V2))
a__U52(tt) → tt
a__U61(tt, L, N) → a__U62(a__isNat(N), L)
a__U62(tt, L) → s(a__length(mark(L)))
a__isNat(0) → tt
a__isNat(length(V1)) → a__U11(a__isNatList(V1))
a__isNat(s(V1)) → a__U21(a__isNat(V1))
a__isNatIList(V) → a__U31(a__isNatList(V))
a__isNatIList(zeros) → tt
a__isNatIList(cons(V1, V2)) → a__U41(a__isNat(V1), V2)
a__isNatList(nil) → tt
a__isNatList(cons(V1, V2)) → a__U51(a__isNat(V1), V2)
a__length(nil) → 0
a__length(cons(N, L)) → a__U61(a__isNatList(L), L, N)
mark(zeros) → a__zeros
mark(U11(X)) → a__U11(mark(X))
mark(U21(X)) → a__U21(mark(X))
mark(U31(X)) → a__U31(mark(X))
mark(U41(X1, X2)) → a__U41(mark(X1), X2)
mark(U42(X)) → a__U42(mark(X))
mark(isNatIList(X)) → a__isNatIList(X)
mark(U51(X1, X2)) → a__U51(mark(X1), X2)
mark(U52(X)) → a__U52(mark(X))
mark(isNatList(X)) → a__isNatList(X)
mark(U61(X1, X2, X3)) → a__U61(mark(X1), X2, X3)
mark(U62(X1, X2)) → a__U62(mark(X1), X2)
mark(isNat(X)) → a__isNat(X)
mark(length(X)) → a__length(mark(X))
mark(cons(X1, X2)) → cons(mark(X1), X2)
mark(0) → 0
mark(tt) → tt
mark(s(X)) → s(mark(X))
mark(nil) → nil
a__zeros → zeros
a__U11(X) → U11(X)
a__U21(X) → U21(X)
a__U31(X) → U31(X)
a__U41(X1, X2) → U41(X1, X2)
a__U42(X) → U42(X)
a__isNatIList(X) → isNatIList(X)
a__U51(X1, X2) → U51(X1, X2)
a__U52(X) → U52(X)
a__isNatList(X) → isNatList(X)
a__U61(X1, X2, X3) → U61(X1, X2, X3)
a__U62(X1, X2) → U62(X1, X2)
a__isNat(X) → isNat(X)
a__length(X) → length(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:

A__U41(tt, V2) → A__U42(a__isNatIList(V2))
A__U41(tt, V2) → A__ISNATILIST(V2)
A__U51(tt, V2) → A__U52(a__isNatList(V2))
A__U51(tt, V2) → A__ISNATLIST(V2)
A__U61(tt, L, N) → A__U62(a__isNat(N), L)
A__U61(tt, L, N) → A__ISNAT(N)
A__U62(tt, L) → A__LENGTH(mark(L))
A__U62(tt, L) → MARK(L)
A__ISNAT(length(V1)) → A__U11(a__isNatList(V1))
A__ISNAT(length(V1)) → A__ISNATLIST(V1)
A__ISNAT(s(V1)) → A__U21(a__isNat(V1))
A__ISNAT(s(V1)) → A__ISNAT(V1)
A__ISNATILIST(V) → A__U31(a__isNatList(V))
A__ISNATILIST(V) → A__ISNATLIST(V)
A__ISNATILIST(cons(V1, V2)) → A__U41(a__isNat(V1), V2)
A__ISNATILIST(cons(V1, V2)) → A__ISNAT(V1)
A__ISNATLIST(cons(V1, V2)) → A__U51(a__isNat(V1), V2)
A__ISNATLIST(cons(V1, V2)) → A__ISNAT(V1)
A__LENGTH(cons(N, L)) → A__U61(a__isNatList(L), L, N)
A__LENGTH(cons(N, L)) → A__ISNATLIST(L)
MARK(zeros) → A__ZEROS
MARK(U11(X)) → A__U11(mark(X))
MARK(U11(X)) → MARK(X)
MARK(U21(X)) → A__U21(mark(X))
MARK(U21(X)) → MARK(X)
MARK(U31(X)) → A__U31(mark(X))
MARK(U31(X)) → MARK(X)
MARK(U41(X1, X2)) → A__U41(mark(X1), X2)
MARK(U41(X1, X2)) → MARK(X1)
MARK(U42(X)) → A__U42(mark(X))
MARK(U42(X)) → MARK(X)
MARK(isNatIList(X)) → A__ISNATILIST(X)
MARK(U51(X1, X2)) → A__U51(mark(X1), X2)
MARK(U51(X1, X2)) → MARK(X1)
MARK(U52(X)) → A__U52(mark(X))
MARK(U52(X)) → MARK(X)
MARK(isNatList(X)) → A__ISNATLIST(X)
MARK(U61(X1, X2, X3)) → A__U61(mark(X1), X2, X3)
MARK(U61(X1, X2, X3)) → MARK(X1)
MARK(U62(X1, X2)) → A__U62(mark(X1), X2)
MARK(U62(X1, X2)) → MARK(X1)
MARK(isNat(X)) → A__ISNAT(X)
MARK(length(X)) → A__LENGTH(mark(X))
MARK(length(X)) → MARK(X)
MARK(cons(X1, X2)) → MARK(X1)
MARK(s(X)) → MARK(X)

The TRS R consists of the following rules:

a__zeros → cons(0, zeros)
a__U11(tt) → tt
a__U21(tt) → tt
a__U31(tt) → tt
a__U41(tt, V2) → a__U42(a__isNatIList(V2))
a__U42(tt) → tt
a__U51(tt, V2) → a__U52(a__isNatList(V2))
a__U52(tt) → tt
a__U61(tt, L, N) → a__U62(a__isNat(N), L)
a__U62(tt, L) → s(a__length(mark(L)))
a__isNat(0) → tt
a__isNat(length(V1)) → a__U11(a__isNatList(V1))
a__isNat(s(V1)) → a__U21(a__isNat(V1))
a__isNatIList(V) → a__U31(a__isNatList(V))
a__isNatIList(zeros) → tt
a__isNatIList(cons(V1, V2)) → a__U41(a__isNat(V1), V2)
a__isNatList(nil) → tt
a__isNatList(cons(V1, V2)) → a__U51(a__isNat(V1), V2)
a__length(nil) → 0
a__length(cons(N, L)) → a__U61(a__isNatList(L), L, N)
mark(zeros) → a__zeros
mark(U11(X)) → a__U11(mark(X))
mark(U21(X)) → a__U21(mark(X))
mark(U31(X)) → a__U31(mark(X))
mark(U41(X1, X2)) → a__U41(mark(X1), X2)
mark(U42(X)) → a__U42(mark(X))
mark(isNatIList(X)) → a__isNatIList(X)
mark(U51(X1, X2)) → a__U51(mark(X1), X2)
mark(U52(X)) → a__U52(mark(X))
mark(isNatList(X)) → a__isNatList(X)
mark(U61(X1, X2, X3)) → a__U61(mark(X1), X2, X3)
mark(U62(X1, X2)) → a__U62(mark(X1), X2)
mark(isNat(X)) → a__isNat(X)
mark(length(X)) → a__length(mark(X))
mark(cons(X1, X2)) → cons(mark(X1), X2)
mark(0) → 0
mark(tt) → tt
mark(s(X)) → s(mark(X))
mark(nil) → nil
a__zeros → zeros
a__U11(X) → U11(X)
a__U21(X) → U21(X)
a__U31(X) → U31(X)
a__U41(X1, X2) → U41(X1, X2)
a__U42(X) → U42(X)
a__isNatIList(X) → isNatIList(X)
a__U51(X1, X2) → U51(X1, X2)
a__U52(X) → U52(X)
a__isNatList(X) → isNatList(X)
a__U61(X1, X2, X3) → U61(X1, X2, X3)
a__U62(X1, X2) → U62(X1, X2)
a__isNat(X) → isNat(X)
a__length(X) → length(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 3 SCCs with 20 less nodes.

(4) Complex Obligation (AND)

(5) Obligation:

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

A__U51(tt, V2) → A__ISNATLIST(V2)
A__ISNATLIST(cons(V1, V2)) → A__U51(a__isNat(V1), V2)
A__ISNATLIST(cons(V1, V2)) → A__ISNAT(V1)
A__ISNAT(length(V1)) → A__ISNATLIST(V1)
A__ISNAT(s(V1)) → A__ISNAT(V1)

The TRS R consists of the following rules:

a__zeros → cons(0, zeros)
a__U11(tt) → tt
a__U21(tt) → tt
a__U31(tt) → tt
a__U41(tt, V2) → a__U42(a__isNatIList(V2))
a__U42(tt) → tt
a__U51(tt, V2) → a__U52(a__isNatList(V2))
a__U52(tt) → tt
a__U61(tt, L, N) → a__U62(a__isNat(N), L)
a__U62(tt, L) → s(a__length(mark(L)))
a__isNat(0) → tt
a__isNat(length(V1)) → a__U11(a__isNatList(V1))
a__isNat(s(V1)) → a__U21(a__isNat(V1))
a__isNatIList(V) → a__U31(a__isNatList(V))
a__isNatIList(zeros) → tt
a__isNatIList(cons(V1, V2)) → a__U41(a__isNat(V1), V2)
a__isNatList(nil) → tt
a__isNatList(cons(V1, V2)) → a__U51(a__isNat(V1), V2)
a__length(nil) → 0
a__length(cons(N, L)) → a__U61(a__isNatList(L), L, N)
mark(zeros) → a__zeros
mark(U11(X)) → a__U11(mark(X))
mark(U21(X)) → a__U21(mark(X))
mark(U31(X)) → a__U31(mark(X))
mark(U41(X1, X2)) → a__U41(mark(X1), X2)
mark(U42(X)) → a__U42(mark(X))
mark(isNatIList(X)) → a__isNatIList(X)
mark(U51(X1, X2)) → a__U51(mark(X1), X2)
mark(U52(X)) → a__U52(mark(X))
mark(isNatList(X)) → a__isNatList(X)
mark(U61(X1, X2, X3)) → a__U61(mark(X1), X2, X3)
mark(U62(X1, X2)) → a__U62(mark(X1), X2)
mark(isNat(X)) → a__isNat(X)
mark(length(X)) → a__length(mark(X))
mark(cons(X1, X2)) → cons(mark(X1), X2)
mark(0) → 0
mark(tt) → tt
mark(s(X)) → s(mark(X))
mark(nil) → nil
a__zeros → zeros
a__U11(X) → U11(X)
a__U21(X) → U21(X)
a__U31(X) → U31(X)
a__U41(X1, X2) → U41(X1, X2)
a__U42(X) → U42(X)
a__isNatIList(X) → isNatIList(X)
a__U51(X1, X2) → U51(X1, X2)
a__U52(X) → U52(X)
a__isNatList(X) → isNatList(X)
a__U61(X1, X2, X3) → U61(X1, X2, X3)
a__U62(X1, X2) → U62(X1, X2)
a__isNat(X) → isNat(X)
a__length(X) → length(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.

A__U51(tt, V2) → A__ISNATLIST(V2)
A__ISNATLIST(cons(V1, V2)) → A__U51(a__isNat(V1), V2)
A__ISNATLIST(cons(V1, V2)) → A__ISNAT(V1)
A__ISNAT(s(V1)) → A__ISNAT(V1)

The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
A__U51(x1, x2) = A__U51(x1, x2)
tt = tt
A__ISNATLIST(x1) = x1
cons(x1, x2) = cons(x1, x2)
a__isNat(x1) = x1
A__ISNAT(x1) = x1
length(x1) = x1
s(x1) = s(x1)
a__U52(x1) = a__U52(x1)
a__U11(x1) = x1
U11(x1) = x1
a__U51(x1, x2) = a__U51(x1, x2)
a__isNatList(x1) = x1
a__U21(x1) = x1
U51(x1, x2) = U51(x1, x2)
nil = nil
isNatList(x1) = isNatList
U52(x1) = U52(x1)
U21(x1) = x1
0 = 0
isNat(x1) = x1

Recursive path order with status [RPO].
Precedence:

cons₂ > A_{_U51₂} > isNatList
cons₂ > a_{_U51₂} > a_{_U52₁} > tt > isNatList
cons₂ > a_{_U51₂} > a_{_U52₁} > U52₁ > isNatList
cons₂ > a_{_U51₂} > U51₂ > isNatList
s₁ > isNatList
nil > tt > isNatList
0 > tt > isNatList

Status:

cons₂: multiset
a_{_U52₁}: multiset
tt: multiset
A_{_U51₂}: multiset
isNatList: multiset
U52₁: multiset
s₁: multiset
0: multiset
U51₂: multiset
nil: multiset
a_{_U51₂}: multiset

The following usable rules [FROCOS05] were oriented:

a__U52(tt) → tt
a__U11(X) → U11(X)
a__U51(tt, V2) → a__U52(a__isNatList(V2))
a__U21(tt) → tt
a__U11(tt) → tt
a__U51(X1, X2) → U51(X1, X2)
a__isNatList(nil) → tt
a__isNatList(X) → isNatList(X)
a__U52(X) → U52(X)
a__isNat(s(V1)) → a__U21(a__isNat(V1))
a__isNat(length(V1)) → a__U11(a__isNatList(V1))
a__U21(X) → U21(X)
a__isNat(0) → tt
a__isNat(X) → isNat(X)
a__isNatList(cons(V1, V2)) → a__U51(a__isNat(V1), V2)

(7) Obligation:

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

A__ISNAT(length(V1)) → A__ISNATLIST(V1)

The TRS R consists of the following rules:

a__zeros → cons(0, zeros)
a__U11(tt) → tt
a__U21(tt) → tt
a__U31(tt) → tt
a__U41(tt, V2) → a__U42(a__isNatIList(V2))
a__U42(tt) → tt
a__U51(tt, V2) → a__U52(a__isNatList(V2))
a__U52(tt) → tt
a__U61(tt, L, N) → a__U62(a__isNat(N), L)
a__U62(tt, L) → s(a__length(mark(L)))
a__isNat(0) → tt
a__isNat(length(V1)) → a__U11(a__isNatList(V1))
a__isNat(s(V1)) → a__U21(a__isNat(V1))
a__isNatIList(V) → a__U31(a__isNatList(V))
a__isNatIList(zeros) → tt
a__isNatIList(cons(V1, V2)) → a__U41(a__isNat(V1), V2)
a__isNatList(nil) → tt
a__isNatList(cons(V1, V2)) → a__U51(a__isNat(V1), V2)
a__length(nil) → 0
a__length(cons(N, L)) → a__U61(a__isNatList(L), L, N)
mark(zeros) → a__zeros
mark(U11(X)) → a__U11(mark(X))
mark(U21(X)) → a__U21(mark(X))
mark(U31(X)) → a__U31(mark(X))
mark(U41(X1, X2)) → a__U41(mark(X1), X2)
mark(U42(X)) → a__U42(mark(X))
mark(isNatIList(X)) → a__isNatIList(X)
mark(U51(X1, X2)) → a__U51(mark(X1), X2)
mark(U52(X)) → a__U52(mark(X))
mark(isNatList(X)) → a__isNatList(X)
mark(U61(X1, X2, X3)) → a__U61(mark(X1), X2, X3)
mark(U62(X1, X2)) → a__U62(mark(X1), X2)
mark(isNat(X)) → a__isNat(X)
mark(length(X)) → a__length(mark(X))
mark(cons(X1, X2)) → cons(mark(X1), X2)
mark(0) → 0
mark(tt) → tt
mark(s(X)) → s(mark(X))
mark(nil) → nil
a__zeros → zeros
a__U11(X) → U11(X)
a__U21(X) → U21(X)
a__U31(X) → U31(X)
a__U41(X1, X2) → U41(X1, X2)
a__U42(X) → U42(X)
a__isNatIList(X) → isNatIList(X)
a__U51(X1, X2) → U51(X1, X2)
a__U52(X) → U52(X)
a__isNatList(X) → isNatList(X)
a__U61(X1, X2, X3) → U61(X1, X2, X3)
a__U62(X1, X2) → U62(X1, X2)
a__isNat(X) → isNat(X)
a__length(X) → length(X)

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

(8) DependencyGraphProof (EQUIVALENT transformation)

The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 0 SCCs with 1 less node.

(9) TRUE

(10) Obligation:

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

A__U41(tt, V2) → A__ISNATILIST(V2)
A__ISNATILIST(cons(V1, V2)) → A__U41(a__isNat(V1), V2)

The TRS R consists of the following rules:

a__zeros → cons(0, zeros)
a__U11(tt) → tt
a__U21(tt) → tt
a__U31(tt) → tt
a__U41(tt, V2) → a__U42(a__isNatIList(V2))
a__U42(tt) → tt
a__U51(tt, V2) → a__U52(a__isNatList(V2))
a__U52(tt) → tt
a__U61(tt, L, N) → a__U62(a__isNat(N), L)
a__U62(tt, L) → s(a__length(mark(L)))
a__isNat(0) → tt
a__isNat(length(V1)) → a__U11(a__isNatList(V1))
a__isNat(s(V1)) → a__U21(a__isNat(V1))
a__isNatIList(V) → a__U31(a__isNatList(V))
a__isNatIList(zeros) → tt
a__isNatIList(cons(V1, V2)) → a__U41(a__isNat(V1), V2)
a__isNatList(nil) → tt
a__isNatList(cons(V1, V2)) → a__U51(a__isNat(V1), V2)
a__length(nil) → 0
a__length(cons(N, L)) → a__U61(a__isNatList(L), L, N)
mark(zeros) → a__zeros
mark(U11(X)) → a__U11(mark(X))
mark(U21(X)) → a__U21(mark(X))
mark(U31(X)) → a__U31(mark(X))
mark(U41(X1, X2)) → a__U41(mark(X1), X2)
mark(U42(X)) → a__U42(mark(X))
mark(isNatIList(X)) → a__isNatIList(X)
mark(U51(X1, X2)) → a__U51(mark(X1), X2)
mark(U52(X)) → a__U52(mark(X))
mark(isNatList(X)) → a__isNatList(X)
mark(U61(X1, X2, X3)) → a__U61(mark(X1), X2, X3)
mark(U62(X1, X2)) → a__U62(mark(X1), X2)
mark(isNat(X)) → a__isNat(X)
mark(length(X)) → a__length(mark(X))
mark(cons(X1, X2)) → cons(mark(X1), X2)
mark(0) → 0
mark(tt) → tt
mark(s(X)) → s(mark(X))
mark(nil) → nil
a__zeros → zeros
a__U11(X) → U11(X)
a__U21(X) → U21(X)
a__U31(X) → U31(X)
a__U41(X1, X2) → U41(X1, X2)
a__U42(X) → U42(X)
a__isNatIList(X) → isNatIList(X)
a__U51(X1, X2) → U51(X1, X2)
a__U52(X) → U52(X)
a__isNatList(X) → isNatList(X)
a__U61(X1, X2, X3) → U61(X1, X2, X3)
a__U62(X1, X2) → U62(X1, X2)
a__isNat(X) → isNat(X)
a__length(X) → length(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.

A__U41(tt, V2) → A__ISNATILIST(V2)
A__ISNATILIST(cons(V1, V2)) → A__U41(a__isNat(V1), V2)

The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
A__U41(x1, x2) = A__U41(x1, x2)
tt = tt
A__ISNATILIST(x1) = A__ISNATILIST(x1)
cons(x1, x2) = cons(x1, x2)
a__isNat(x1) = a__isNat
a__U52(x1) = a__U52
a__U11(x1) = a__U11
U11(x1) = U11
a__U51(x1, x2) = a__U51(x1)
a__isNatList(x1) = a__isNatList
a__U21(x1) = x1
U51(x1, x2) = U51(x1)
nil = nil
isNatList(x1) = isNatList(x1)
U52(x1) = U52
s(x1) = s
length(x1) = length(x1)
U21(x1) = U21
0 = 0
isNat(x1) = isNat

Recursive path order with status [RPO].
Precedence:

cons₂ > A_{_U41₂} > A_{_{ISNATILIST₁}} > U21
cons₂ > a_{_isNat} > a_{_U11} > tt > U21
cons₂ > a_{_isNat} > a_{_U11} > U11 > U21
cons₂ > a_{_isNat} > isNat > U21
a_{_isNatList} > a_{_isNat} > a_{_U11} > tt > U21
a_{_isNatList} > a_{_isNat} > a_{_U11} > U11 > U21
a_{_isNatList} > a_{_isNat} > isNat > U21
a_{_isNatList} > a_{_U51₁} > a_{_U52} > tt > U21
a_{_isNatList} > a_{_U51₁} > a_{_U52} > U52 > U21
a_{_isNatList} > a_{_U51₁} > U51₁ > U21
a_{_isNatList} > isNatList₁ > U21
nil > tt > U21
s > U21
length₁ > U21
0 > U21

Status:

U21: multiset
a_{_U11}: multiset
U52: multiset
a_{_U51₁}: multiset
U11: multiset
A_{_U41₂}: multiset
a_{_isNat}: []
s: multiset
a_{_isNatList}: multiset
0: multiset
isNat: multiset
cons₂: multiset
a_{_U52}: multiset
tt: multiset
A_{_{ISNATILIST₁}}: multiset
isNatList₁: multiset
length₁: multiset
nil: multiset
U51₁: multiset

The following usable rules [FROCOS05] were oriented:

a__U52(tt) → tt
a__U11(X) → U11(X)
a__U51(tt, V2) → a__U52(a__isNatList(V2))
a__U21(tt) → tt
a__U11(tt) → tt
a__U51(X1, X2) → U51(X1, X2)
a__U52(X) → U52(X)
a__isNat(s(V1)) → a__U21(a__isNat(V1))
a__isNat(length(V1)) → a__U11(a__isNatList(V1))
a__U21(X) → U21(X)
a__isNat(0) → tt
a__isNat(X) → isNat(X)
a__isNatList(cons(V1, V2)) → a__U51(a__isNat(V1), V2)

(12) Obligation:

Q DP problem:
P is empty.
The TRS R consists of the following rules:

a__zeros → cons(0, zeros)
a__U11(tt) → tt
a__U21(tt) → tt
a__U31(tt) → tt
a__U41(tt, V2) → a__U42(a__isNatIList(V2))
a__U42(tt) → tt
a__U51(tt, V2) → a__U52(a__isNatList(V2))
a__U52(tt) → tt
a__U61(tt, L, N) → a__U62(a__isNat(N), L)
a__U62(tt, L) → s(a__length(mark(L)))
a__isNat(0) → tt
a__isNat(length(V1)) → a__U11(a__isNatList(V1))
a__isNat(s(V1)) → a__U21(a__isNat(V1))
a__isNatIList(V) → a__U31(a__isNatList(V))
a__isNatIList(zeros) → tt
a__isNatIList(cons(V1, V2)) → a__U41(a__isNat(V1), V2)
a__isNatList(nil) → tt
a__isNatList(cons(V1, V2)) → a__U51(a__isNat(V1), V2)
a__length(nil) → 0
a__length(cons(N, L)) → a__U61(a__isNatList(L), L, N)
mark(zeros) → a__zeros
mark(U11(X)) → a__U11(mark(X))
mark(U21(X)) → a__U21(mark(X))
mark(U31(X)) → a__U31(mark(X))
mark(U41(X1, X2)) → a__U41(mark(X1), X2)
mark(U42(X)) → a__U42(mark(X))
mark(isNatIList(X)) → a__isNatIList(X)
mark(U51(X1, X2)) → a__U51(mark(X1), X2)
mark(U52(X)) → a__U52(mark(X))
mark(isNatList(X)) → a__isNatList(X)
mark(U61(X1, X2, X3)) → a__U61(mark(X1), X2, X3)
mark(U62(X1, X2)) → a__U62(mark(X1), X2)
mark(isNat(X)) → a__isNat(X)
mark(length(X)) → a__length(mark(X))
mark(cons(X1, X2)) → cons(mark(X1), X2)
mark(0) → 0
mark(tt) → tt
mark(s(X)) → s(mark(X))
mark(nil) → nil
a__zeros → zeros
a__U11(X) → U11(X)
a__U21(X) → U21(X)
a__U31(X) → U31(X)
a__U41(X1, X2) → U41(X1, X2)
a__U42(X) → U42(X)
a__isNatIList(X) → isNatIList(X)
a__U51(X1, X2) → U51(X1, X2)
a__U52(X) → U52(X)
a__isNatList(X) → isNatList(X)
a__U61(X1, X2, X3) → U61(X1, X2, X3)
a__U62(X1, X2) → U62(X1, X2)
a__isNat(X) → isNat(X)
a__length(X) → length(X)

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

(13) PisEmptyProof (EQUIVALENT transformation)

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

(14) TRUE

(15) Obligation:

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

MARK(U11(X)) → MARK(X)
MARK(U21(X)) → MARK(X)
MARK(U31(X)) → MARK(X)
MARK(U41(X1, X2)) → MARK(X1)
MARK(U42(X)) → MARK(X)
MARK(U51(X1, X2)) → MARK(X1)
MARK(U52(X)) → MARK(X)
MARK(U61(X1, X2, X3)) → A__U61(mark(X1), X2, X3)
A__U61(tt, L, N) → A__U62(a__isNat(N), L)
A__U62(tt, L) → A__LENGTH(mark(L))
A__LENGTH(cons(N, L)) → A__U61(a__isNatList(L), L, N)
A__U62(tt, L) → MARK(L)
MARK(U61(X1, X2, X3)) → MARK(X1)
MARK(U62(X1, X2)) → A__U62(mark(X1), X2)
MARK(U62(X1, X2)) → MARK(X1)
MARK(length(X)) → A__LENGTH(mark(X))
MARK(length(X)) → MARK(X)
MARK(cons(X1, X2)) → MARK(X1)
MARK(s(X)) → MARK(X)

The TRS R consists of the following rules:

a__zeros → cons(0, zeros)
a__U11(tt) → tt
a__U21(tt) → tt
a__U31(tt) → tt
a__U41(tt, V2) → a__U42(a__isNatIList(V2))
a__U42(tt) → tt
a__U51(tt, V2) → a__U52(a__isNatList(V2))
a__U52(tt) → tt
a__U61(tt, L, N) → a__U62(a__isNat(N), L)
a__U62(tt, L) → s(a__length(mark(L)))
a__isNat(0) → tt
a__isNat(length(V1)) → a__U11(a__isNatList(V1))
a__isNat(s(V1)) → a__U21(a__isNat(V1))
a__isNatIList(V) → a__U31(a__isNatList(V))
a__isNatIList(zeros) → tt
a__isNatIList(cons(V1, V2)) → a__U41(a__isNat(V1), V2)
a__isNatList(nil) → tt
a__isNatList(cons(V1, V2)) → a__U51(a__isNat(V1), V2)
a__length(nil) → 0
a__length(cons(N, L)) → a__U61(a__isNatList(L), L, N)
mark(zeros) → a__zeros
mark(U11(X)) → a__U11(mark(X))
mark(U21(X)) → a__U21(mark(X))
mark(U31(X)) → a__U31(mark(X))
mark(U41(X1, X2)) → a__U41(mark(X1), X2)
mark(U42(X)) → a__U42(mark(X))
mark(isNatIList(X)) → a__isNatIList(X)
mark(U51(X1, X2)) → a__U51(mark(X1), X2)
mark(U52(X)) → a__U52(mark(X))
mark(isNatList(X)) → a__isNatList(X)
mark(U61(X1, X2, X3)) → a__U61(mark(X1), X2, X3)
mark(U62(X1, X2)) → a__U62(mark(X1), X2)
mark(isNat(X)) → a__isNat(X)
mark(length(X)) → a__length(mark(X))
mark(cons(X1, X2)) → cons(mark(X1), X2)
mark(0) → 0
mark(tt) → tt
mark(s(X)) → s(mark(X))
mark(nil) → nil
a__zeros → zeros
a__U11(X) → U11(X)
a__U21(X) → U21(X)
a__U31(X) → U31(X)
a__U41(X1, X2) → U41(X1, X2)
a__U42(X) → U42(X)
a__isNatIList(X) → isNatIList(X)
a__U51(X1, X2) → U51(X1, X2)
a__U52(X) → U52(X)
a__isNatList(X) → isNatList(X)
a__U61(X1, X2, X3) → U61(X1, X2, X3)
a__U62(X1, X2) → U62(X1, X2)
a__isNat(X) → isNat(X)
a__length(X) → length(X)

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