Termination w.r.t. Q proof of /tmp/tmp5mbMa9/Ex4_DLMMU04

Termination w.r.t. Q of the following Term Rewriting System could not be shown:

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

a__and(tt, T) → mark(T)
a__isNatIList(IL) → a__isNatList(IL)
a__isNat(0) → tt
a__isNat(s(N)) → a__isNat(N)
a__isNat(length(L)) → a__isNatList(L)
a__isNatIList(zeros) → tt
a__isNatIList(cons(N, IL)) → a__and(a__isNat(N), a__isNatIList(IL))
a__isNatList(nil) → tt
a__isNatList(cons(N, L)) → a__and(a__isNat(N), a__isNatList(L))
a__isNatList(take(N, IL)) → a__and(a__isNat(N), a__isNatIList(IL))
a__zeros → cons(0, zeros)
a__take(0, IL) → a__uTake1(a__isNatIList(IL))
a__uTake1(tt) → nil
a__take(s(M), cons(N, IL)) → a__uTake2(a__and(a__isNat(M), a__and(a__isNat(N), a__isNatIList(IL))), M, N, IL)
a__uTake2(tt, M, N, IL) → cons(mark(N), take(M, IL))
a__length(cons(N, L)) → a__uLength(a__and(a__isNat(N), a__isNatList(L)), L)
a__uLength(tt, L) → s(a__length(mark(L)))
mark(and(X1, X2)) → a__and(mark(X1), mark(X2))
mark(isNatIList(X)) → a__isNatIList(X)
mark(isNatList(X)) → a__isNatList(X)
mark(isNat(X)) → a__isNat(X)
mark(length(X)) → a__length(mark(X))
mark(zeros) → a__zeros
mark(take(X1, X2)) → a__take(mark(X1), mark(X2))
mark(uTake1(X)) → a__uTake1(mark(X))
mark(uTake2(X1, X2, X3, X4)) → a__uTake2(mark(X1), X2, X3, X4)
mark(uLength(X1, X2)) → a__uLength(mark(X1), X2)
mark(tt) → tt
mark(0) → 0
mark(s(X)) → s(mark(X))
mark(cons(X1, X2)) → cons(mark(X1), X2)
mark(nil) → nil
a__and(X1, X2) → and(X1, X2)
a__isNatIList(X) → isNatIList(X)
a__isNatList(X) → isNatList(X)
a__isNat(X) → isNat(X)
a__length(X) → length(X)
a__zeros → zeros
a__take(X1, X2) → take(X1, X2)
a__uTake1(X) → uTake1(X)
a__uTake2(X1, X2, X3, X4) → uTake2(X1, X2, X3, X4)
a__uLength(X1, X2) → uLength(X1, X2)

Q is empty.

↳ QTRS

  ↳ DependencyPairsProof

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

a__and(tt, T) → mark(T)
a__isNatIList(IL) → a__isNatList(IL)
a__isNat(0) → tt
a__isNat(s(N)) → a__isNat(N)
a__isNat(length(L)) → a__isNatList(L)
a__isNatIList(zeros) → tt
a__isNatIList(cons(N, IL)) → a__and(a__isNat(N), a__isNatIList(IL))
a__isNatList(nil) → tt
a__isNatList(cons(N, L)) → a__and(a__isNat(N), a__isNatList(L))
a__isNatList(take(N, IL)) → a__and(a__isNat(N), a__isNatIList(IL))
a__zeros → cons(0, zeros)
a__take(0, IL) → a__uTake1(a__isNatIList(IL))
a__uTake1(tt) → nil
a__take(s(M), cons(N, IL)) → a__uTake2(a__and(a__isNat(M), a__and(a__isNat(N), a__isNatIList(IL))), M, N, IL)
a__uTake2(tt, M, N, IL) → cons(mark(N), take(M, IL))
a__length(cons(N, L)) → a__uLength(a__and(a__isNat(N), a__isNatList(L)), L)
a__uLength(tt, L) → s(a__length(mark(L)))
mark(and(X1, X2)) → a__and(mark(X1), mark(X2))
mark(isNatIList(X)) → a__isNatIList(X)
mark(isNatList(X)) → a__isNatList(X)
mark(isNat(X)) → a__isNat(X)
mark(length(X)) → a__length(mark(X))
mark(zeros) → a__zeros
mark(take(X1, X2)) → a__take(mark(X1), mark(X2))
mark(uTake1(X)) → a__uTake1(mark(X))
mark(uTake2(X1, X2, X3, X4)) → a__uTake2(mark(X1), X2, X3, X4)
mark(uLength(X1, X2)) → a__uLength(mark(X1), X2)
mark(tt) → tt
mark(0) → 0
mark(s(X)) → s(mark(X))
mark(cons(X1, X2)) → cons(mark(X1), X2)
mark(nil) → nil
a__and(X1, X2) → and(X1, X2)
a__isNatIList(X) → isNatIList(X)
a__isNatList(X) → isNatList(X)
a__isNat(X) → isNat(X)
a__length(X) → length(X)
a__zeros → zeros
a__take(X1, X2) → take(X1, X2)
a__uTake1(X) → uTake1(X)
a__uTake2(X1, X2, X3, X4) → uTake2(X1, X2, X3, X4)
a__uLength(X1, X2) → uLength(X1, X2)

Q is empty.

Using Dependency Pairs [1,15] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:

MARK(take(X1, X2)) → MARK(X2)
A__ISNATLIST(cons(N, L)) → A__ISNATLIST(L)
MARK(zeros) → A__ZEROS
A__LENGTH(cons(N, L)) → A__ISNAT(N)
MARK(s(X)) → MARK(X)
A__TAKE(s(M), cons(N, IL)) → A__ISNATILIST(IL)
A__ISNATILIST(cons(N, IL)) → A__ISNATILIST(IL)
MARK(isNatIList(X)) → A__ISNATILIST(X)
MARK(cons(X1, X2)) → MARK(X1)
MARK(length(X)) → A__LENGTH(mark(X))
MARK(uTake1(X)) → A__UTAKE1(mark(X))
A__AND(tt, T) → MARK(T)
MARK(length(X)) → MARK(X)
A__UTAKE2(tt, M, N, IL) → MARK(N)
MARK(uLength(X1, X2)) → A__ULENGTH(mark(X1), X2)
MARK(uTake2(X1, X2, X3, X4)) → MARK(X1)
A__LENGTH(cons(N, L)) → A__AND(a__isNat(N), a__isNatList(L))
MARK(and(X1, X2)) → MARK(X1)
MARK(take(X1, X2)) → MARK(X1)
A__ISNATLIST(cons(N, L)) → A__ISNAT(N)
A__ULENGTH(tt, L) → A__LENGTH(mark(L))
MARK(and(X1, X2)) → MARK(X2)
A__ISNATILIST(IL) → A__ISNATLIST(IL)
A__LENGTH(cons(N, L)) → A__ISNATLIST(L)
A__TAKE(0, IL) → A__UTAKE1(a__isNatIList(IL))
A__TAKE(s(M), cons(N, IL)) → A__AND(a__isNat(N), a__isNatIList(IL))
MARK(uTake2(X1, X2, X3, X4)) → A__UTAKE2(mark(X1), X2, X3, X4)
MARK(take(X1, X2)) → A__TAKE(mark(X1), mark(X2))
A__TAKE(s(M), cons(N, IL)) → A__AND(a__isNat(M), a__and(a__isNat(N), a__isNatIList(IL)))
A__ISNAT(s(N)) → A__ISNAT(N)
A__TAKE(0, IL) → A__ISNATILIST(IL)
MARK(uLength(X1, X2)) → MARK(X1)
A__ISNATLIST(take(N, IL)) → A__AND(a__isNat(N), a__isNatIList(IL))
A__ISNATILIST(cons(N, IL)) → A__AND(a__isNat(N), a__isNatIList(IL))
A__TAKE(s(M), cons(N, IL)) → A__ISNAT(N)
A__ISNATLIST(cons(N, L)) → A__AND(a__isNat(N), a__isNatList(L))
A__TAKE(s(M), cons(N, IL)) → A__UTAKE2(a__and(a__isNat(M), a__and(a__isNat(N), a__isNatIList(IL))), M, N, IL)
MARK(uTake1(X)) → MARK(X)
A__TAKE(s(M), cons(N, IL)) → A__ISNAT(M)
A__LENGTH(cons(N, L)) → A__ULENGTH(a__and(a__isNat(N), a__isNatList(L)), L)
A__ULENGTH(tt, L) → MARK(L)
A__ISNAT(length(L)) → A__ISNATLIST(L)
MARK(isNat(X)) → A__ISNAT(X)
A__ISNATLIST(take(N, IL)) → A__ISNAT(N)
A__ISNATILIST(cons(N, IL)) → A__ISNAT(N)
MARK(isNatList(X)) → A__ISNATLIST(X)
MARK(and(X1, X2)) → A__AND(mark(X1), mark(X2))
A__ISNATLIST(take(N, IL)) → A__ISNATILIST(IL)

The TRS R consists of the following rules:

a__and(tt, T) → mark(T)
a__isNatIList(IL) → a__isNatList(IL)
a__isNat(0) → tt
a__isNat(s(N)) → a__isNat(N)
a__isNat(length(L)) → a__isNatList(L)
a__isNatIList(zeros) → tt
a__isNatIList(cons(N, IL)) → a__and(a__isNat(N), a__isNatIList(IL))
a__isNatList(nil) → tt
a__isNatList(cons(N, L)) → a__and(a__isNat(N), a__isNatList(L))
a__isNatList(take(N, IL)) → a__and(a__isNat(N), a__isNatIList(IL))
a__zeros → cons(0, zeros)
a__take(0, IL) → a__uTake1(a__isNatIList(IL))
a__uTake1(tt) → nil
a__take(s(M), cons(N, IL)) → a__uTake2(a__and(a__isNat(M), a__and(a__isNat(N), a__isNatIList(IL))), M, N, IL)
a__uTake2(tt, M, N, IL) → cons(mark(N), take(M, IL))
a__length(cons(N, L)) → a__uLength(a__and(a__isNat(N), a__isNatList(L)), L)
a__uLength(tt, L) → s(a__length(mark(L)))
mark(and(X1, X2)) → a__and(mark(X1), mark(X2))
mark(isNatIList(X)) → a__isNatIList(X)
mark(isNatList(X)) → a__isNatList(X)
mark(isNat(X)) → a__isNat(X)
mark(length(X)) → a__length(mark(X))
mark(zeros) → a__zeros
mark(take(X1, X2)) → a__take(mark(X1), mark(X2))
mark(uTake1(X)) → a__uTake1(mark(X))
mark(uTake2(X1, X2, X3, X4)) → a__uTake2(mark(X1), X2, X3, X4)
mark(uLength(X1, X2)) → a__uLength(mark(X1), X2)
mark(tt) → tt
mark(0) → 0
mark(s(X)) → s(mark(X))
mark(cons(X1, X2)) → cons(mark(X1), X2)
mark(nil) → nil
a__and(X1, X2) → and(X1, X2)
a__isNatIList(X) → isNatIList(X)
a__isNatList(X) → isNatList(X)
a__isNat(X) → isNat(X)
a__length(X) → length(X)
a__zeros → zeros
a__take(X1, X2) → take(X1, X2)
a__uTake1(X) → uTake1(X)
a__uTake2(X1, X2, X3, X4) → uTake2(X1, X2, X3, X4)
a__uLength(X1, X2) → uLength(X1, X2)

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

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

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

MARK(take(X1, X2)) → MARK(X2)
A__ISNATLIST(cons(N, L)) → A__ISNATLIST(L)
MARK(zeros) → A__ZEROS
A__LENGTH(cons(N, L)) → A__ISNAT(N)
MARK(s(X)) → MARK(X)
A__TAKE(s(M), cons(N, IL)) → A__ISNATILIST(IL)
A__ISNATILIST(cons(N, IL)) → A__ISNATILIST(IL)
MARK(isNatIList(X)) → A__ISNATILIST(X)
MARK(cons(X1, X2)) → MARK(X1)
MARK(length(X)) → A__LENGTH(mark(X))
MARK(uTake1(X)) → A__UTAKE1(mark(X))
A__AND(tt, T) → MARK(T)
MARK(length(X)) → MARK(X)
A__UTAKE2(tt, M, N, IL) → MARK(N)
MARK(uLength(X1, X2)) → A__ULENGTH(mark(X1), X2)
MARK(uTake2(X1, X2, X3, X4)) → MARK(X1)
A__LENGTH(cons(N, L)) → A__AND(a__isNat(N), a__isNatList(L))
MARK(and(X1, X2)) → MARK(X1)
MARK(take(X1, X2)) → MARK(X1)
A__ISNATLIST(cons(N, L)) → A__ISNAT(N)
A__ULENGTH(tt, L) → A__LENGTH(mark(L))
MARK(and(X1, X2)) → MARK(X2)
A__ISNATILIST(IL) → A__ISNATLIST(IL)
A__LENGTH(cons(N, L)) → A__ISNATLIST(L)
A__TAKE(0, IL) → A__UTAKE1(a__isNatIList(IL))
A__TAKE(s(M), cons(N, IL)) → A__AND(a__isNat(N), a__isNatIList(IL))
MARK(uTake2(X1, X2, X3, X4)) → A__UTAKE2(mark(X1), X2, X3, X4)
MARK(take(X1, X2)) → A__TAKE(mark(X1), mark(X2))
A__TAKE(s(M), cons(N, IL)) → A__AND(a__isNat(M), a__and(a__isNat(N), a__isNatIList(IL)))
A__ISNAT(s(N)) → A__ISNAT(N)
A__TAKE(0, IL) → A__ISNATILIST(IL)
MARK(uLength(X1, X2)) → MARK(X1)
A__ISNATLIST(take(N, IL)) → A__AND(a__isNat(N), a__isNatIList(IL))
A__ISNATILIST(cons(N, IL)) → A__AND(a__isNat(N), a__isNatIList(IL))
A__TAKE(s(M), cons(N, IL)) → A__ISNAT(N)
A__ISNATLIST(cons(N, L)) → A__AND(a__isNat(N), a__isNatList(L))
A__TAKE(s(M), cons(N, IL)) → A__UTAKE2(a__and(a__isNat(M), a__and(a__isNat(N), a__isNatIList(IL))), M, N, IL)
MARK(uTake1(X)) → MARK(X)
A__TAKE(s(M), cons(N, IL)) → A__ISNAT(M)
A__LENGTH(cons(N, L)) → A__ULENGTH(a__and(a__isNat(N), a__isNatList(L)), L)
A__ULENGTH(tt, L) → MARK(L)
A__ISNAT(length(L)) → A__ISNATLIST(L)
MARK(isNat(X)) → A__ISNAT(X)
A__ISNATLIST(take(N, IL)) → A__ISNAT(N)
A__ISNATILIST(cons(N, IL)) → A__ISNAT(N)
MARK(isNatList(X)) → A__ISNATLIST(X)
MARK(and(X1, X2)) → A__AND(mark(X1), mark(X2))
A__ISNATLIST(take(N, IL)) → A__ISNATILIST(IL)

The TRS R consists of the following rules:

a__and(tt, T) → mark(T)
a__isNatIList(IL) → a__isNatList(IL)
a__isNat(0) → tt
a__isNat(s(N)) → a__isNat(N)
a__isNat(length(L)) → a__isNatList(L)
a__isNatIList(zeros) → tt
a__isNatIList(cons(N, IL)) → a__and(a__isNat(N), a__isNatIList(IL))
a__isNatList(nil) → tt
a__isNatList(cons(N, L)) → a__and(a__isNat(N), a__isNatList(L))
a__isNatList(take(N, IL)) → a__and(a__isNat(N), a__isNatIList(IL))
a__zeros → cons(0, zeros)
a__take(0, IL) → a__uTake1(a__isNatIList(IL))
a__uTake1(tt) → nil
a__take(s(M), cons(N, IL)) → a__uTake2(a__and(a__isNat(M), a__and(a__isNat(N), a__isNatIList(IL))), M, N, IL)
a__uTake2(tt, M, N, IL) → cons(mark(N), take(M, IL))
a__length(cons(N, L)) → a__uLength(a__and(a__isNat(N), a__isNatList(L)), L)
a__uLength(tt, L) → s(a__length(mark(L)))
mark(and(X1, X2)) → a__and(mark(X1), mark(X2))
mark(isNatIList(X)) → a__isNatIList(X)
mark(isNatList(X)) → a__isNatList(X)
mark(isNat(X)) → a__isNat(X)
mark(length(X)) → a__length(mark(X))
mark(zeros) → a__zeros
mark(take(X1, X2)) → a__take(mark(X1), mark(X2))
mark(uTake1(X)) → a__uTake1(mark(X))
mark(uTake2(X1, X2, X3, X4)) → a__uTake2(mark(X1), X2, X3, X4)
mark(uLength(X1, X2)) → a__uLength(mark(X1), X2)
mark(tt) → tt
mark(0) → 0
mark(s(X)) → s(mark(X))
mark(cons(X1, X2)) → cons(mark(X1), X2)
mark(nil) → nil
a__and(X1, X2) → and(X1, X2)
a__isNatIList(X) → isNatIList(X)
a__isNatList(X) → isNatList(X)
a__isNat(X) → isNat(X)
a__length(X) → length(X)
a__zeros → zeros
a__take(X1, X2) → take(X1, X2)
a__uTake1(X) → uTake1(X)
a__uTake2(X1, X2, X3, X4) → uTake2(X1, X2, X3, X4)
a__uLength(X1, X2) → uLength(X1, X2)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 3 less nodes.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ QDP

          ↳ QDPOrderProof

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

MARK(take(X1, X2)) → MARK(X2)
A__ISNATLIST(cons(N, L)) → A__ISNATLIST(L)
A__LENGTH(cons(N, L)) → A__ISNAT(N)
A__TAKE(s(M), cons(N, IL)) → A__ISNATILIST(IL)
MARK(s(X)) → MARK(X)
A__ISNATILIST(cons(N, IL)) → A__ISNATILIST(IL)
MARK(isNatIList(X)) → A__ISNATILIST(X)
MARK(cons(X1, X2)) → MARK(X1)
MARK(length(X)) → A__LENGTH(mark(X))
A__AND(tt, T) → MARK(T)
A__UTAKE2(tt, M, N, IL) → MARK(N)
MARK(length(X)) → MARK(X)
MARK(uLength(X1, X2)) → A__ULENGTH(mark(X1), X2)
MARK(uTake2(X1, X2, X3, X4)) → MARK(X1)
A__LENGTH(cons(N, L)) → A__AND(a__isNat(N), a__isNatList(L))
MARK(and(X1, X2)) → MARK(X1)
MARK(take(X1, X2)) → MARK(X1)
A__ISNATLIST(cons(N, L)) → A__ISNAT(N)
A__ULENGTH(tt, L) → A__LENGTH(mark(L))
A__ISNATILIST(IL) → A__ISNATLIST(IL)
MARK(and(X1, X2)) → MARK(X2)
A__LENGTH(cons(N, L)) → A__ISNATLIST(L)
A__TAKE(s(M), cons(N, IL)) → A__AND(a__isNat(N), a__isNatIList(IL))
MARK(uTake2(X1, X2, X3, X4)) → A__UTAKE2(mark(X1), X2, X3, X4)
MARK(take(X1, X2)) → A__TAKE(mark(X1), mark(X2))
A__TAKE(s(M), cons(N, IL)) → A__AND(a__isNat(M), a__and(a__isNat(N), a__isNatIList(IL)))
A__TAKE(0, IL) → A__ISNATILIST(IL)
A__ISNAT(s(N)) → A__ISNAT(N)
MARK(uLength(X1, X2)) → MARK(X1)
A__ISNATLIST(take(N, IL)) → A__AND(a__isNat(N), a__isNatIList(IL))
A__ISNATILIST(cons(N, IL)) → A__AND(a__isNat(N), a__isNatIList(IL))
A__TAKE(s(M), cons(N, IL)) → A__ISNAT(N)
A__ISNATLIST(cons(N, L)) → A__AND(a__isNat(N), a__isNatList(L))
A__TAKE(s(M), cons(N, IL)) → A__UTAKE2(a__and(a__isNat(M), a__and(a__isNat(N), a__isNatIList(IL))), M, N, IL)
MARK(uTake1(X)) → MARK(X)
A__TAKE(s(M), cons(N, IL)) → A__ISNAT(M)
A__LENGTH(cons(N, L)) → A__ULENGTH(a__and(a__isNat(N), a__isNatList(L)), L)
A__ULENGTH(tt, L) → MARK(L)
A__ISNAT(length(L)) → A__ISNATLIST(L)
A__ISNATLIST(take(N, IL)) → A__ISNAT(N)
A__ISNATILIST(cons(N, IL)) → A__ISNAT(N)
MARK(isNat(X)) → A__ISNAT(X)
MARK(and(X1, X2)) → A__AND(mark(X1), mark(X2))
MARK(isNatList(X)) → A__ISNATLIST(X)
A__ISNATLIST(take(N, IL)) → A__ISNATILIST(IL)

The TRS R consists of the following rules:

a__and(tt, T) → mark(T)
a__isNatIList(IL) → a__isNatList(IL)
a__isNat(0) → tt
a__isNat(s(N)) → a__isNat(N)
a__isNat(length(L)) → a__isNatList(L)
a__isNatIList(zeros) → tt
a__isNatIList(cons(N, IL)) → a__and(a__isNat(N), a__isNatIList(IL))
a__isNatList(nil) → tt
a__isNatList(cons(N, L)) → a__and(a__isNat(N), a__isNatList(L))
a__isNatList(take(N, IL)) → a__and(a__isNat(N), a__isNatIList(IL))
a__zeros → cons(0, zeros)
a__take(0, IL) → a__uTake1(a__isNatIList(IL))
a__uTake1(tt) → nil
a__take(s(M), cons(N, IL)) → a__uTake2(a__and(a__isNat(M), a__and(a__isNat(N), a__isNatIList(IL))), M, N, IL)
a__uTake2(tt, M, N, IL) → cons(mark(N), take(M, IL))
a__length(cons(N, L)) → a__uLength(a__and(a__isNat(N), a__isNatList(L)), L)
a__uLength(tt, L) → s(a__length(mark(L)))
mark(and(X1, X2)) → a__and(mark(X1), mark(X2))
mark(isNatIList(X)) → a__isNatIList(X)
mark(isNatList(X)) → a__isNatList(X)
mark(isNat(X)) → a__isNat(X)
mark(length(X)) → a__length(mark(X))
mark(zeros) → a__zeros
mark(take(X1, X2)) → a__take(mark(X1), mark(X2))
mark(uTake1(X)) → a__uTake1(mark(X))
mark(uTake2(X1, X2, X3, X4)) → a__uTake2(mark(X1), X2, X3, X4)
mark(uLength(X1, X2)) → a__uLength(mark(X1), X2)
mark(tt) → tt
mark(0) → 0
mark(s(X)) → s(mark(X))
mark(cons(X1, X2)) → cons(mark(X1), X2)
mark(nil) → nil
a__and(X1, X2) → and(X1, X2)
a__isNatIList(X) → isNatIList(X)
a__isNatList(X) → isNatList(X)
a__isNat(X) → isNat(X)
a__length(X) → length(X)
a__zeros → zeros
a__take(X1, X2) → take(X1, X2)
a__uTake1(X) → uTake1(X)
a__uTake2(X1, X2, X3, X4) → uTake2(X1, X2, X3, X4)
a__uLength(X1, X2) → uLength(X1, X2)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [15].

The following pairs can be oriented strictly and are deleted.

MARK(length(X)) → A__LENGTH(mark(X))
MARK(length(X)) → MARK(X)
MARK(uLength(X1, X2)) → A__ULENGTH(mark(X1), X2)
MARK(uLength(X1, X2)) → MARK(X1)

The remaining pairs can at least be oriented weakly.

MARK(take(X1, X2)) → MARK(X2)
A__ISNATLIST(cons(N, L)) → A__ISNATLIST(L)
A__LENGTH(cons(N, L)) → A__ISNAT(N)
A__TAKE(s(M), cons(N, IL)) → A__ISNATILIST(IL)
MARK(s(X)) → MARK(X)
A__ISNATILIST(cons(N, IL)) → A__ISNATILIST(IL)
MARK(isNatIList(X)) → A__ISNATILIST(X)
MARK(cons(X1, X2)) → MARK(X1)
A__AND(tt, T) → MARK(T)
A__UTAKE2(tt, M, N, IL) → MARK(N)
MARK(uTake2(X1, X2, X3, X4)) → MARK(X1)
A__LENGTH(cons(N, L)) → A__AND(a__isNat(N), a__isNatList(L))
MARK(and(X1, X2)) → MARK(X1)
MARK(take(X1, X2)) → MARK(X1)
A__ISNATLIST(cons(N, L)) → A__ISNAT(N)
A__ULENGTH(tt, L) → A__LENGTH(mark(L))
A__ISNATILIST(IL) → A__ISNATLIST(IL)
MARK(and(X1, X2)) → MARK(X2)
A__LENGTH(cons(N, L)) → A__ISNATLIST(L)
A__TAKE(s(M), cons(N, IL)) → A__AND(a__isNat(N), a__isNatIList(IL))
MARK(uTake2(X1, X2, X3, X4)) → A__UTAKE2(mark(X1), X2, X3, X4)
MARK(take(X1, X2)) → A__TAKE(mark(X1), mark(X2))
A__TAKE(s(M), cons(N, IL)) → A__AND(a__isNat(M), a__and(a__isNat(N), a__isNatIList(IL)))
A__TAKE(0, IL) → A__ISNATILIST(IL)
A__ISNAT(s(N)) → A__ISNAT(N)
A__ISNATLIST(take(N, IL)) → A__AND(a__isNat(N), a__isNatIList(IL))
A__ISNATILIST(cons(N, IL)) → A__AND(a__isNat(N), a__isNatIList(IL))
A__TAKE(s(M), cons(N, IL)) → A__ISNAT(N)
A__ISNATLIST(cons(N, L)) → A__AND(a__isNat(N), a__isNatList(L))
A__TAKE(s(M), cons(N, IL)) → A__UTAKE2(a__and(a__isNat(M), a__and(a__isNat(N), a__isNatIList(IL))), M, N, IL)
MARK(uTake1(X)) → MARK(X)
A__TAKE(s(M), cons(N, IL)) → A__ISNAT(M)
A__LENGTH(cons(N, L)) → A__ULENGTH(a__and(a__isNat(N), a__isNatList(L)), L)
A__ULENGTH(tt, L) → MARK(L)
A__ISNAT(length(L)) → A__ISNATLIST(L)
A__ISNATLIST(take(N, IL)) → A__ISNAT(N)
A__ISNATILIST(cons(N, IL)) → A__ISNAT(N)
MARK(isNat(X)) → A__ISNAT(X)
MARK(and(X1, X2)) → A__AND(mark(X1), mark(X2))
MARK(isNatList(X)) → A__ISNATLIST(X)
A__ISNATLIST(take(N, IL)) → A__ISNATILIST(IL)

Used ordering: Polynomial interpretation [25,35]:

POL(A__ISNAT(x₁)) = 1
POL(a__zeros) = 0
POL(mark(x₁)) = x_1
POL(a__isNatIList(x₁)) = 0
POL(and(x₁, x₂)) = (4)x_1 + x_2
POL(take(x₁, x₂)) = (2)x_1 + x_2
POL(a__uTake1(x₁)) = (4)x_1
POL(A__ISNATLIST(x₁)) = 1
POL(A__AND(x₁, x₂)) = 1 + (4)x_2
POL(a__uLength(x₁, x₂)) = 1 + x_1 + x_2
POL(a__length(x₁)) = 1 + x_1
POL(tt) = 0
POL(isNatList(x₁)) = 0
POL(zeros) = 0
POL(A__ULENGTH(x₁, x₂)) = 1 + (4)x_2
POL(isNatIList(x₁)) = 0
POL(s(x₁)) = x_1
POL(a__isNat(x₁)) = 0
POL(isNat(x₁)) = 0
POL(a__isNatList(x₁)) = 0
POL(nil) = 0
POL(a__uTake2(x₁, x₂, x₃, x₄)) = (2)x_1 + (2)x_2 + x_3 + x_4
POL(A__LENGTH(x₁)) = 1 + (4)x_1
POL(a__and(x₁, x₂)) = (4)x_1 + x_2
POL(A__UTAKE2(x₁, x₂, x₃, x₄)) = 1 + x_1 + (4)x_3 + x_4
POL(0) = 0
POL(a__take(x₁, x₂)) = (2)x_1 + x_2
POL(A__TAKE(x₁, x₂)) = 1 + (4)x_2
POL(cons(x₁, x₂)) = x_1 + x_2
POL(MARK(x₁)) = 1 + (4)x_1
POL(uTake2(x₁, x₂, x₃, x₄)) = (2)x_1 + (2)x_2 + x_3 + x_4
POL(A__ISNATILIST(x₁)) = 1
POL(uTake1(x₁)) = (4)x_1
POL(length(x₁)) = 1 + x_1
POL(uLength(x₁, x₂)) = 1 + x_1 + x_2

The value of delta used in the strict ordering is 4.
The following usable rules [17] were oriented:

mark(length(X)) → a__length(mark(X))
mark(zeros) → a__zeros
a__length(cons(N, L)) → a__uLength(a__and(a__isNat(N), a__isNatList(L)), L)
a__uLength(tt, L) → s(a__length(mark(L)))
a__isNatIList(IL) → a__isNatList(IL)
mark(isNat(X)) → a__isNat(X)
a__isNat(s(N)) → a__isNat(N)
a__and(tt, T) → mark(T)
mark(isNatList(X)) → a__isNatList(X)
a__isNatIList(cons(N, IL)) → a__and(a__isNat(N), a__isNatIList(IL))
mark(isNatIList(X)) → a__isNatIList(X)
a__isNat(length(L)) → a__isNatList(L)
mark(and(X1, X2)) → a__and(mark(X1), mark(X2))
a__isNatList(cons(N, L)) → a__and(a__isNat(N), a__isNatList(L))
a__isNatList(take(N, IL)) → a__and(a__isNat(N), a__isNatIList(IL))
mark(tt) → tt
mark(0) → 0
mark(s(X)) → s(mark(X))
mark(cons(X1, X2)) → cons(mark(X1), X2)
mark(take(X1, X2)) → a__take(mark(X1), mark(X2))
mark(uTake1(X)) → a__uTake1(mark(X))
mark(uTake2(X1, X2, X3, X4)) → a__uTake2(mark(X1), X2, X3, X4)
mark(uLength(X1, X2)) → a__uLength(mark(X1), X2)
a__length(X) → length(X)
a__isNat(X) → isNat(X)
a__take(X1, X2) → take(X1, X2)
a__zeros → zeros
a__and(X1, X2) → and(X1, X2)
mark(nil) → nil
a__isNatList(X) → isNatList(X)
a__isNatIList(X) → isNatIList(X)
a__uTake2(X1, X2, X3, X4) → uTake2(X1, X2, X3, X4)
a__uTake1(X) → uTake1(X)
a__uLength(X1, X2) → uLength(X1, X2)
a__isNat(0) → tt
a__isNatIList(zeros) → tt
a__zeros → cons(0, zeros)
a__isNatList(nil) → tt
a__uTake2(tt, M, N, IL) → cons(mark(N), take(M, IL))
a__take(s(M), cons(N, IL)) → a__uTake2(a__and(a__isNat(M), a__and(a__isNat(N), a__isNatIList(IL))), M, N, IL)
a__uTake1(tt) → nil
a__take(0, IL) → a__uTake1(a__isNatIList(IL))

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ QDP

          ↳ QDPOrderProof

            ↳ QDP

              ↳ DependencyGraphProof

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

MARK(take(X1, X2)) → MARK(X2)
A__ISNATLIST(cons(N, L)) → A__ISNATLIST(L)
A__LENGTH(cons(N, L)) → A__ISNAT(N)
MARK(s(X)) → MARK(X)
A__TAKE(s(M), cons(N, IL)) → A__ISNATILIST(IL)
A__ISNATILIST(cons(N, IL)) → A__ISNATILIST(IL)
MARK(isNatIList(X)) → A__ISNATILIST(X)
MARK(cons(X1, X2)) → MARK(X1)
A__AND(tt, T) → MARK(T)
A__UTAKE2(tt, M, N, IL) → MARK(N)
MARK(uTake2(X1, X2, X3, X4)) → MARK(X1)
A__LENGTH(cons(N, L)) → A__AND(a__isNat(N), a__isNatList(L))
MARK(and(X1, X2)) → MARK(X1)
MARK(take(X1, X2)) → MARK(X1)
A__ISNATLIST(cons(N, L)) → A__ISNAT(N)
A__ULENGTH(tt, L) → A__LENGTH(mark(L))
A__ISNATILIST(IL) → A__ISNATLIST(IL)
MARK(and(X1, X2)) → MARK(X2)
A__LENGTH(cons(N, L)) → A__ISNATLIST(L)
A__TAKE(s(M), cons(N, IL)) → A__AND(a__isNat(N), a__isNatIList(IL))
MARK(uTake2(X1, X2, X3, X4)) → A__UTAKE2(mark(X1), X2, X3, X4)
MARK(take(X1, X2)) → A__TAKE(mark(X1), mark(X2))
A__TAKE(s(M), cons(N, IL)) → A__AND(a__isNat(M), a__and(a__isNat(N), a__isNatIList(IL)))
A__TAKE(0, IL) → A__ISNATILIST(IL)
A__ISNAT(s(N)) → A__ISNAT(N)
A__ISNATILIST(cons(N, IL)) → A__AND(a__isNat(N), a__isNatIList(IL))
A__ISNATLIST(take(N, IL)) → A__AND(a__isNat(N), a__isNatIList(IL))
A__TAKE(s(M), cons(N, IL)) → A__ISNAT(N)
A__ISNATLIST(cons(N, L)) → A__AND(a__isNat(N), a__isNatList(L))
A__TAKE(s(M), cons(N, IL)) → A__UTAKE2(a__and(a__isNat(M), a__and(a__isNat(N), a__isNatIList(IL))), M, N, IL)
MARK(uTake1(X)) → MARK(X)
A__TAKE(s(M), cons(N, IL)) → A__ISNAT(M)
A__LENGTH(cons(N, L)) → A__ULENGTH(a__and(a__isNat(N), a__isNatList(L)), L)
A__ISNAT(length(L)) → A__ISNATLIST(L)
A__ULENGTH(tt, L) → MARK(L)
MARK(isNat(X)) → A__ISNAT(X)
A__ISNATILIST(cons(N, IL)) → A__ISNAT(N)
A__ISNATLIST(take(N, IL)) → A__ISNAT(N)
MARK(isNatList(X)) → A__ISNATLIST(X)
MARK(and(X1, X2)) → A__AND(mark(X1), mark(X2))
A__ISNATLIST(take(N, IL)) → A__ISNATILIST(IL)

The TRS R consists of the following rules:

a__and(tt, T) → mark(T)
a__isNatIList(IL) → a__isNatList(IL)
a__isNat(0) → tt
a__isNat(s(N)) → a__isNat(N)
a__isNat(length(L)) → a__isNatList(L)
a__isNatIList(zeros) → tt
a__isNatIList(cons(N, IL)) → a__and(a__isNat(N), a__isNatIList(IL))
a__isNatList(nil) → tt
a__isNatList(cons(N, L)) → a__and(a__isNat(N), a__isNatList(L))
a__isNatList(take(N, IL)) → a__and(a__isNat(N), a__isNatIList(IL))
a__zeros → cons(0, zeros)
a__take(0, IL) → a__uTake1(a__isNatIList(IL))
a__uTake1(tt) → nil
a__take(s(M), cons(N, IL)) → a__uTake2(a__and(a__isNat(M), a__and(a__isNat(N), a__isNatIList(IL))), M, N, IL)
a__uTake2(tt, M, N, IL) → cons(mark(N), take(M, IL))
a__length(cons(N, L)) → a__uLength(a__and(a__isNat(N), a__isNatList(L)), L)
a__uLength(tt, L) → s(a__length(mark(L)))
mark(and(X1, X2)) → a__and(mark(X1), mark(X2))
mark(isNatIList(X)) → a__isNatIList(X)
mark(isNatList(X)) → a__isNatList(X)
mark(isNat(X)) → a__isNat(X)
mark(length(X)) → a__length(mark(X))
mark(zeros) → a__zeros
mark(take(X1, X2)) → a__take(mark(X1), mark(X2))
mark(uTake1(X)) → a__uTake1(mark(X))
mark(uTake2(X1, X2, X3, X4)) → a__uTake2(mark(X1), X2, X3, X4)
mark(uLength(X1, X2)) → a__uLength(mark(X1), X2)
mark(tt) → tt
mark(0) → 0
mark(s(X)) → s(mark(X))
mark(cons(X1, X2)) → cons(mark(X1), X2)
mark(nil) → nil
a__and(X1, X2) → and(X1, X2)
a__isNatIList(X) → isNatIList(X)
a__isNatList(X) → isNatList(X)
a__isNat(X) → isNat(X)
a__length(X) → length(X)
a__zeros → zeros
a__take(X1, X2) → take(X1, X2)
a__uTake1(X) → uTake1(X)
a__uTake2(X1, X2, X3, X4) → uTake2(X1, X2, X3, X4)
a__uLength(X1, X2) → uLength(X1, X2)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 2 SCCs with 4 less nodes.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ QDP

          ↳ QDPOrderProof

            ↳ QDP

              ↳ DependencyGraphProof

                ↳ AND

                  ↳ QDP

                    ↳ QDPOrderProof

                  ↳ QDP

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

MARK(take(X1, X2)) → MARK(X2)
A__ISNATLIST(cons(N, L)) → A__ISNATLIST(L)
A__TAKE(s(M), cons(N, IL)) → A__ISNATILIST(IL)
MARK(s(X)) → MARK(X)
A__ISNATILIST(cons(N, IL)) → A__ISNATILIST(IL)
MARK(isNatIList(X)) → A__ISNATILIST(X)
MARK(cons(X1, X2)) → MARK(X1)
A__AND(tt, T) → MARK(T)
A__UTAKE2(tt, M, N, IL) → MARK(N)
MARK(uTake2(X1, X2, X3, X4)) → MARK(X1)
MARK(and(X1, X2)) → MARK(X1)
MARK(take(X1, X2)) → MARK(X1)
A__ISNATLIST(cons(N, L)) → A__ISNAT(N)
A__ISNATILIST(IL) → A__ISNATLIST(IL)
MARK(and(X1, X2)) → MARK(X2)
A__TAKE(s(M), cons(N, IL)) → A__AND(a__isNat(N), a__isNatIList(IL))
MARK(uTake2(X1, X2, X3, X4)) → A__UTAKE2(mark(X1), X2, X3, X4)
MARK(take(X1, X2)) → A__TAKE(mark(X1), mark(X2))
A__TAKE(s(M), cons(N, IL)) → A__AND(a__isNat(M), a__and(a__isNat(N), a__isNatIList(IL)))
A__ISNAT(s(N)) → A__ISNAT(N)
A__TAKE(0, IL) → A__ISNATILIST(IL)
A__ISNATLIST(take(N, IL)) → A__AND(a__isNat(N), a__isNatIList(IL))
A__ISNATILIST(cons(N, IL)) → A__AND(a__isNat(N), a__isNatIList(IL))
A__TAKE(s(M), cons(N, IL)) → A__ISNAT(N)
A__ISNATLIST(cons(N, L)) → A__AND(a__isNat(N), a__isNatList(L))
A__TAKE(s(M), cons(N, IL)) → A__UTAKE2(a__and(a__isNat(M), a__and(a__isNat(N), a__isNatIList(IL))), M, N, IL)
MARK(uTake1(X)) → MARK(X)
A__TAKE(s(M), cons(N, IL)) → A__ISNAT(M)
A__ISNAT(length(L)) → A__ISNATLIST(L)
A__ISNATLIST(take(N, IL)) → A__ISNAT(N)
A__ISNATILIST(cons(N, IL)) → A__ISNAT(N)
MARK(isNat(X)) → A__ISNAT(X)
MARK(and(X1, X2)) → A__AND(mark(X1), mark(X2))
MARK(isNatList(X)) → A__ISNATLIST(X)
A__ISNATLIST(take(N, IL)) → A__ISNATILIST(IL)

The TRS R consists of the following rules:

a__and(tt, T) → mark(T)
a__isNatIList(IL) → a__isNatList(IL)
a__isNat(0) → tt
a__isNat(s(N)) → a__isNat(N)
a__isNat(length(L)) → a__isNatList(L)
a__isNatIList(zeros) → tt
a__isNatIList(cons(N, IL)) → a__and(a__isNat(N), a__isNatIList(IL))
a__isNatList(nil) → tt
a__isNatList(cons(N, L)) → a__and(a__isNat(N), a__isNatList(L))
a__isNatList(take(N, IL)) → a__and(a__isNat(N), a__isNatIList(IL))
a__zeros → cons(0, zeros)
a__take(0, IL) → a__uTake1(a__isNatIList(IL))
a__uTake1(tt) → nil
a__take(s(M), cons(N, IL)) → a__uTake2(a__and(a__isNat(M), a__and(a__isNat(N), a__isNatIList(IL))), M, N, IL)
a__uTake2(tt, M, N, IL) → cons(mark(N), take(M, IL))
a__length(cons(N, L)) → a__uLength(a__and(a__isNat(N), a__isNatList(L)), L)
a__uLength(tt, L) → s(a__length(mark(L)))
mark(and(X1, X2)) → a__and(mark(X1), mark(X2))
mark(isNatIList(X)) → a__isNatIList(X)
mark(isNatList(X)) → a__isNatList(X)
mark(isNat(X)) → a__isNat(X)
mark(length(X)) → a__length(mark(X))
mark(zeros) → a__zeros
mark(take(X1, X2)) → a__take(mark(X1), mark(X2))
mark(uTake1(X)) → a__uTake1(mark(X))
mark(uTake2(X1, X2, X3, X4)) → a__uTake2(mark(X1), X2, X3, X4)
mark(uLength(X1, X2)) → a__uLength(mark(X1), X2)
mark(tt) → tt
mark(0) → 0
mark(s(X)) → s(mark(X))
mark(cons(X1, X2)) → cons(mark(X1), X2)
mark(nil) → nil
a__and(X1, X2) → and(X1, X2)
a__isNatIList(X) → isNatIList(X)
a__isNatList(X) → isNatList(X)
a__isNat(X) → isNat(X)
a__length(X) → length(X)
a__zeros → zeros
a__take(X1, X2) → take(X1, X2)
a__uTake1(X) → uTake1(X)
a__uTake2(X1, X2, X3, X4) → uTake2(X1, X2, X3, X4)
a__uLength(X1, X2) → uLength(X1, X2)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [15].

The following pairs can be oriented strictly and are deleted.

MARK(uTake1(X)) → MARK(X)

The remaining pairs can at least be oriented weakly.

MARK(take(X1, X2)) → MARK(X2)
A__ISNATLIST(cons(N, L)) → A__ISNATLIST(L)
A__TAKE(s(M), cons(N, IL)) → A__ISNATILIST(IL)
MARK(s(X)) → MARK(X)
A__ISNATILIST(cons(N, IL)) → A__ISNATILIST(IL)
MARK(isNatIList(X)) → A__ISNATILIST(X)
MARK(cons(X1, X2)) → MARK(X1)
A__AND(tt, T) → MARK(T)
A__UTAKE2(tt, M, N, IL) → MARK(N)
MARK(uTake2(X1, X2, X3, X4)) → MARK(X1)
MARK(and(X1, X2)) → MARK(X1)
MARK(take(X1, X2)) → MARK(X1)
A__ISNATLIST(cons(N, L)) → A__ISNAT(N)
A__ISNATILIST(IL) → A__ISNATLIST(IL)
MARK(and(X1, X2)) → MARK(X2)
A__TAKE(s(M), cons(N, IL)) → A__AND(a__isNat(N), a__isNatIList(IL))
MARK(uTake2(X1, X2, X3, X4)) → A__UTAKE2(mark(X1), X2, X3, X4)
MARK(take(X1, X2)) → A__TAKE(mark(X1), mark(X2))
A__TAKE(s(M), cons(N, IL)) → A__AND(a__isNat(M), a__and(a__isNat(N), a__isNatIList(IL)))
A__ISNAT(s(N)) → A__ISNAT(N)
A__TAKE(0, IL) → A__ISNATILIST(IL)
A__ISNATLIST(take(N, IL)) → A__AND(a__isNat(N), a__isNatIList(IL))
A__ISNATILIST(cons(N, IL)) → A__AND(a__isNat(N), a__isNatIList(IL))
A__TAKE(s(M), cons(N, IL)) → A__ISNAT(N)
A__ISNATLIST(cons(N, L)) → A__AND(a__isNat(N), a__isNatList(L))
A__TAKE(s(M), cons(N, IL)) → A__UTAKE2(a__and(a__isNat(M), a__and(a__isNat(N), a__isNatIList(IL))), M, N, IL)
A__TAKE(s(M), cons(N, IL)) → A__ISNAT(M)
A__ISNAT(length(L)) → A__ISNATLIST(L)
A__ISNATLIST(take(N, IL)) → A__ISNAT(N)
A__ISNATILIST(cons(N, IL)) → A__ISNAT(N)
MARK(isNat(X)) → A__ISNAT(X)
MARK(and(X1, X2)) → A__AND(mark(X1), mark(X2))
MARK(isNatList(X)) → A__ISNATLIST(X)
A__ISNATLIST(take(N, IL)) → A__ISNATILIST(IL)

Used ordering: Polynomial interpretation [25,35]:

POL(A__ISNAT(x₁)) = 0
POL(a__zeros) = 4
POL(mark(x₁)) = (4)x_1
POL(a__isNatIList(x₁)) = 0
POL(and(x₁, x₂)) = x_1 + (4)x_2
POL(take(x₁, x₂)) = (2)x_1 + (4)x_2
POL(a__uTake1(x₁)) = 2 + (4)x_1
POL(A__ISNATLIST(x₁)) = 0
POL(A__AND(x₁, x₂)) = (2)x_2
POL(a__uLength(x₁, x₂)) = 0
POL(a__length(x₁)) = 0
POL(tt) = 0
POL(isNatList(x₁)) = 0
POL(zeros) = 1
POL(isNatIList(x₁)) = 0
POL(s(x₁)) = x_1
POL(a__isNat(x₁)) = 0
POL(isNat(x₁)) = 0
POL(a__isNatList(x₁)) = 0
POL(nil) = 2
POL(a__uTake2(x₁, x₂, x₃, x₄)) = (4)x_1 + (4)x_3
POL(a__and(x₁, x₂)) = x_1 + (4)x_2
POL(A__UTAKE2(x₁, x₂, x₃, x₄)) = (2)x_3
POL(a__take(x₁, x₂)) = (2)x_1 + (4)x_2
POL(0) = 2
POL(A__TAKE(x₁, x₂)) = (2)x_2
POL(cons(x₁, x₂)) = x_1
POL(MARK(x₁)) = (2)x_1
POL(A__ISNATILIST(x₁)) = 0
POL(uTake2(x₁, x₂, x₃, x₄)) = (4)x_1 + (4)x_3
POL(uTake1(x₁)) = 2 + (4)x_1
POL(length(x₁)) = 0
POL(uLength(x₁, x₂)) = 0

The value of delta used in the strict ordering is 4.
The following usable rules [17] were oriented:

mark(length(X)) → a__length(mark(X))
mark(zeros) → a__zeros
a__length(cons(N, L)) → a__uLength(a__and(a__isNat(N), a__isNatList(L)), L)
a__uLength(tt, L) → s(a__length(mark(L)))
a__isNatIList(IL) → a__isNatList(IL)
mark(isNat(X)) → a__isNat(X)
a__isNat(s(N)) → a__isNat(N)
a__and(tt, T) → mark(T)
mark(isNatList(X)) → a__isNatList(X)
a__isNatIList(cons(N, IL)) → a__and(a__isNat(N), a__isNatIList(IL))
mark(isNatIList(X)) → a__isNatIList(X)
a__isNat(length(L)) → a__isNatList(L)
mark(and(X1, X2)) → a__and(mark(X1), mark(X2))
a__isNatList(cons(N, L)) → a__and(a__isNat(N), a__isNatList(L))
a__isNatList(take(N, IL)) → a__and(a__isNat(N), a__isNatIList(IL))
mark(tt) → tt
mark(0) → 0
mark(s(X)) → s(mark(X))
mark(cons(X1, X2)) → cons(mark(X1), X2)
mark(take(X1, X2)) → a__take(mark(X1), mark(X2))
mark(uTake1(X)) → a__uTake1(mark(X))
mark(uTake2(X1, X2, X3, X4)) → a__uTake2(mark(X1), X2, X3, X4)
mark(uLength(X1, X2)) → a__uLength(mark(X1), X2)
a__length(X) → length(X)
a__isNat(X) → isNat(X)
a__take(X1, X2) → take(X1, X2)
a__zeros → zeros
a__and(X1, X2) → and(X1, X2)
mark(nil) → nil
a__isNatList(X) → isNatList(X)
a__isNatIList(X) → isNatIList(X)
a__uTake2(X1, X2, X3, X4) → uTake2(X1, X2, X3, X4)
a__uTake1(X) → uTake1(X)
a__uLength(X1, X2) → uLength(X1, X2)
a__isNat(0) → tt
a__isNatIList(zeros) → tt
a__zeros → cons(0, zeros)
a__isNatList(nil) → tt
a__uTake2(tt, M, N, IL) → cons(mark(N), take(M, IL))
a__take(s(M), cons(N, IL)) → a__uTake2(a__and(a__isNat(M), a__and(a__isNat(N), a__isNatIList(IL))), M, N, IL)
a__uTake1(tt) → nil
a__take(0, IL) → a__uTake1(a__isNatIList(IL))

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ QDP

          ↳ QDPOrderProof

            ↳ QDP

              ↳ DependencyGraphProof

                ↳ AND

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ QDPOrderProof

                  ↳ QDP

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

MARK(take(X1, X2)) → MARK(X2)
A__ISNATLIST(cons(N, L)) → A__ISNATLIST(L)
MARK(s(X)) → MARK(X)
A__TAKE(s(M), cons(N, IL)) → A__ISNATILIST(IL)
A__ISNATILIST(cons(N, IL)) → A__ISNATILIST(IL)
MARK(isNatIList(X)) → A__ISNATILIST(X)
MARK(cons(X1, X2)) → MARK(X1)
A__AND(tt, T) → MARK(T)
A__UTAKE2(tt, M, N, IL) → MARK(N)
MARK(uTake2(X1, X2, X3, X4)) → MARK(X1)
MARK(and(X1, X2)) → MARK(X1)
MARK(take(X1, X2)) → MARK(X1)
A__ISNATLIST(cons(N, L)) → A__ISNAT(N)
A__ISNATILIST(IL) → A__ISNATLIST(IL)
MARK(and(X1, X2)) → MARK(X2)
A__TAKE(s(M), cons(N, IL)) → A__AND(a__isNat(N), a__isNatIList(IL))
MARK(uTake2(X1, X2, X3, X4)) → A__UTAKE2(mark(X1), X2, X3, X4)
MARK(take(X1, X2)) → A__TAKE(mark(X1), mark(X2))
A__TAKE(s(M), cons(N, IL)) → A__AND(a__isNat(M), a__and(a__isNat(N), a__isNatIList(IL)))
A__ISNAT(s(N)) → A__ISNAT(N)
A__TAKE(0, IL) → A__ISNATILIST(IL)
A__ISNATLIST(take(N, IL)) → A__AND(a__isNat(N), a__isNatIList(IL))
A__ISNATILIST(cons(N, IL)) → A__AND(a__isNat(N), a__isNatIList(IL))
A__TAKE(s(M), cons(N, IL)) → A__ISNAT(N)
A__ISNATLIST(cons(N, L)) → A__AND(a__isNat(N), a__isNatList(L))
A__TAKE(s(M), cons(N, IL)) → A__UTAKE2(a__and(a__isNat(M), a__and(a__isNat(N), a__isNatIList(IL))), M, N, IL)
A__TAKE(s(M), cons(N, IL)) → A__ISNAT(M)
A__ISNAT(length(L)) → A__ISNATLIST(L)
MARK(isNat(X)) → A__ISNAT(X)
A__ISNATILIST(cons(N, IL)) → A__ISNAT(N)
A__ISNATLIST(take(N, IL)) → A__ISNAT(N)
MARK(isNatList(X)) → A__ISNATLIST(X)
MARK(and(X1, X2)) → A__AND(mark(X1), mark(X2))
A__ISNATLIST(take(N, IL)) → A__ISNATILIST(IL)

The TRS R consists of the following rules:

a__and(tt, T) → mark(T)
a__isNatIList(IL) → a__isNatList(IL)
a__isNat(0) → tt
a__isNat(s(N)) → a__isNat(N)
a__isNat(length(L)) → a__isNatList(L)
a__isNatIList(zeros) → tt
a__isNatIList(cons(N, IL)) → a__and(a__isNat(N), a__isNatIList(IL))
a__isNatList(nil) → tt
a__isNatList(cons(N, L)) → a__and(a__isNat(N), a__isNatList(L))
a__isNatList(take(N, IL)) → a__and(a__isNat(N), a__isNatIList(IL))
a__zeros → cons(0, zeros)
a__take(0, IL) → a__uTake1(a__isNatIList(IL))
a__uTake1(tt) → nil
a__take(s(M), cons(N, IL)) → a__uTake2(a__and(a__isNat(M), a__and(a__isNat(N), a__isNatIList(IL))), M, N, IL)
a__uTake2(tt, M, N, IL) → cons(mark(N), take(M, IL))
a__length(cons(N, L)) → a__uLength(a__and(a__isNat(N), a__isNatList(L)), L)
a__uLength(tt, L) → s(a__length(mark(L)))
mark(and(X1, X2)) → a__and(mark(X1), mark(X2))
mark(isNatIList(X)) → a__isNatIList(X)
mark(isNatList(X)) → a__isNatList(X)
mark(isNat(X)) → a__isNat(X)
mark(length(X)) → a__length(mark(X))
mark(zeros) → a__zeros
mark(take(X1, X2)) → a__take(mark(X1), mark(X2))
mark(uTake1(X)) → a__uTake1(mark(X))
mark(uTake2(X1, X2, X3, X4)) → a__uTake2(mark(X1), X2, X3, X4)
mark(uLength(X1, X2)) → a__uLength(mark(X1), X2)
mark(tt) → tt
mark(0) → 0
mark(s(X)) → s(mark(X))
mark(cons(X1, X2)) → cons(mark(X1), X2)
mark(nil) → nil
a__and(X1, X2) → and(X1, X2)
a__isNatIList(X) → isNatIList(X)
a__isNatList(X) → isNatList(X)
a__isNat(X) → isNat(X)
a__length(X) → length(X)
a__zeros → zeros
a__take(X1, X2) → take(X1, X2)
a__uTake1(X) → uTake1(X)
a__uTake2(X1, X2, X3, X4) → uTake2(X1, X2, X3, X4)
a__uLength(X1, X2) → uLength(X1, X2)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [15].

The following pairs can be oriented strictly and are deleted.

A__TAKE(0, IL) → A__ISNATILIST(IL)

The remaining pairs can at least be oriented weakly.

MARK(take(X1, X2)) → MARK(X2)
A__ISNATLIST(cons(N, L)) → A__ISNATLIST(L)
MARK(s(X)) → MARK(X)
A__TAKE(s(M), cons(N, IL)) → A__ISNATILIST(IL)
A__ISNATILIST(cons(N, IL)) → A__ISNATILIST(IL)
MARK(isNatIList(X)) → A__ISNATILIST(X)
MARK(cons(X1, X2)) → MARK(X1)
A__AND(tt, T) → MARK(T)
A__UTAKE2(tt, M, N, IL) → MARK(N)
MARK(uTake2(X1, X2, X3, X4)) → MARK(X1)
MARK(and(X1, X2)) → MARK(X1)
MARK(take(X1, X2)) → MARK(X1)
A__ISNATLIST(cons(N, L)) → A__ISNAT(N)
A__ISNATILIST(IL) → A__ISNATLIST(IL)
MARK(and(X1, X2)) → MARK(X2)
A__TAKE(s(M), cons(N, IL)) → A__AND(a__isNat(N), a__isNatIList(IL))
MARK(uTake2(X1, X2, X3, X4)) → A__UTAKE2(mark(X1), X2, X3, X4)
MARK(take(X1, X2)) → A__TAKE(mark(X1), mark(X2))
A__TAKE(s(M), cons(N, IL)) → A__AND(a__isNat(M), a__and(a__isNat(N), a__isNatIList(IL)))
A__ISNAT(s(N)) → A__ISNAT(N)
A__ISNATLIST(take(N, IL)) → A__AND(a__isNat(N), a__isNatIList(IL))
A__ISNATILIST(cons(N, IL)) → A__AND(a__isNat(N), a__isNatIList(IL))
A__TAKE(s(M), cons(N, IL)) → A__ISNAT(N)
A__ISNATLIST(cons(N, L)) → A__AND(a__isNat(N), a__isNatList(L))
A__TAKE(s(M), cons(N, IL)) → A__UTAKE2(a__and(a__isNat(M), a__and(a__isNat(N), a__isNatIList(IL))), M, N, IL)
A__TAKE(s(M), cons(N, IL)) → A__ISNAT(M)
A__ISNAT(length(L)) → A__ISNATLIST(L)
MARK(isNat(X)) → A__ISNAT(X)
A__ISNATILIST(cons(N, IL)) → A__ISNAT(N)
A__ISNATLIST(take(N, IL)) → A__ISNAT(N)
MARK(isNatList(X)) → A__ISNATLIST(X)
MARK(and(X1, X2)) → A__AND(mark(X1), mark(X2))
A__ISNATLIST(take(N, IL)) → A__ISNATILIST(IL)

Used ordering: Polynomial interpretation [25,35]:

POL(A__ISNAT(x₁)) = 0
POL(a__zeros) = 4
POL(mark(x₁)) = x_1
POL(a__isNatIList(x₁)) = 0
POL(and(x₁, x₂)) = (4)x_1 + (3)x_2
POL(take(x₁, x₂)) = x_1 + x_2
POL(a__uTake1(x₁)) = 0
POL(A__ISNATLIST(x₁)) = 0
POL(A__AND(x₁, x₂)) = (4)x_2
POL(a__uLength(x₁, x₂)) = 0
POL(a__length(x₁)) = 0
POL(tt) = 0
POL(isNatList(x₁)) = 0
POL(zeros) = 4
POL(isNatIList(x₁)) = 0
POL(s(x₁)) = (4)x_1
POL(a__isNat(x₁)) = 0
POL(isNat(x₁)) = 0
POL(a__isNatList(x₁)) = 0
POL(nil) = 0
POL(a__uTake2(x₁, x₂, x₃, x₄)) = x_1 + (3)x_3
POL(a__and(x₁, x₂)) = (4)x_1 + (3)x_2
POL(A__UTAKE2(x₁, x₂, x₃, x₄)) = (4)x_3
POL(a__take(x₁, x₂)) = x_1 + x_2
POL(0) = 1
POL(A__TAKE(x₁, x₂)) = (2)x_1 + (2)x_2
POL(cons(x₁, x₂)) = (3)x_1
POL(MARK(x₁)) = (2)x_1
POL(A__ISNATILIST(x₁)) = 0
POL(uTake2(x₁, x₂, x₃, x₄)) = x_1 + (3)x_3
POL(uTake1(x₁)) = 0
POL(length(x₁)) = 0
POL(uLength(x₁, x₂)) = 0

The value of delta used in the strict ordering is 2.
The following usable rules [17] were oriented:

mark(length(X)) → a__length(mark(X))
mark(zeros) → a__zeros
a__length(cons(N, L)) → a__uLength(a__and(a__isNat(N), a__isNatList(L)), L)
a__uLength(tt, L) → s(a__length(mark(L)))
a__isNatIList(IL) → a__isNatList(IL)
mark(isNat(X)) → a__isNat(X)
a__isNat(s(N)) → a__isNat(N)
a__and(tt, T) → mark(T)
mark(isNatList(X)) → a__isNatList(X)
a__isNatIList(cons(N, IL)) → a__and(a__isNat(N), a__isNatIList(IL))
mark(isNatIList(X)) → a__isNatIList(X)
a__isNat(length(L)) → a__isNatList(L)
mark(and(X1, X2)) → a__and(mark(X1), mark(X2))
a__isNatList(cons(N, L)) → a__and(a__isNat(N), a__isNatList(L))
a__isNatList(take(N, IL)) → a__and(a__isNat(N), a__isNatIList(IL))
mark(tt) → tt
mark(0) → 0
mark(s(X)) → s(mark(X))
mark(cons(X1, X2)) → cons(mark(X1), X2)
mark(take(X1, X2)) → a__take(mark(X1), mark(X2))
mark(uTake1(X)) → a__uTake1(mark(X))
mark(uTake2(X1, X2, X3, X4)) → a__uTake2(mark(X1), X2, X3, X4)
mark(uLength(X1, X2)) → a__uLength(mark(X1), X2)
a__length(X) → length(X)
a__isNat(X) → isNat(X)
a__take(X1, X2) → take(X1, X2)
a__zeros → zeros
a__and(X1, X2) → and(X1, X2)
mark(nil) → nil
a__isNatList(X) → isNatList(X)
a__isNatIList(X) → isNatIList(X)
a__uTake2(X1, X2, X3, X4) → uTake2(X1, X2, X3, X4)
a__uTake1(X) → uTake1(X)
a__uLength(X1, X2) → uLength(X1, X2)
a__isNat(0) → tt
a__isNatIList(zeros) → tt
a__zeros → cons(0, zeros)
a__isNatList(nil) → tt
a__uTake2(tt, M, N, IL) → cons(mark(N), take(M, IL))
a__take(s(M), cons(N, IL)) → a__uTake2(a__and(a__isNat(M), a__and(a__isNat(N), a__isNatIList(IL))), M, N, IL)
a__uTake1(tt) → nil
a__take(0, IL) → a__uTake1(a__isNatIList(IL))

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ QDP

          ↳ QDPOrderProof

            ↳ QDP

              ↳ DependencyGraphProof

                ↳ AND

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ QDPOrderProof

                          ↳ QDP

                            ↳ QDPOrderProof

                  ↳ QDP

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

MARK(take(X1, X2)) → MARK(X2)
A__ISNATLIST(cons(N, L)) → A__ISNATLIST(L)
A__TAKE(s(M), cons(N, IL)) → A__ISNATILIST(IL)
MARK(s(X)) → MARK(X)
A__ISNATILIST(cons(N, IL)) → A__ISNATILIST(IL)
MARK(isNatIList(X)) → A__ISNATILIST(X)
MARK(cons(X1, X2)) → MARK(X1)
A__AND(tt, T) → MARK(T)
A__UTAKE2(tt, M, N, IL) → MARK(N)
MARK(uTake2(X1, X2, X3, X4)) → MARK(X1)
MARK(and(X1, X2)) → MARK(X1)
MARK(take(X1, X2)) → MARK(X1)
A__ISNATLIST(cons(N, L)) → A__ISNAT(N)
A__ISNATILIST(IL) → A__ISNATLIST(IL)
MARK(and(X1, X2)) → MARK(X2)
A__TAKE(s(M), cons(N, IL)) → A__AND(a__isNat(N), a__isNatIList(IL))
MARK(uTake2(X1, X2, X3, X4)) → A__UTAKE2(mark(X1), X2, X3, X4)
MARK(take(X1, X2)) → A__TAKE(mark(X1), mark(X2))
A__TAKE(s(M), cons(N, IL)) → A__AND(a__isNat(M), a__and(a__isNat(N), a__isNatIList(IL)))
A__ISNAT(s(N)) → A__ISNAT(N)
A__ISNATLIST(take(N, IL)) → A__AND(a__isNat(N), a__isNatIList(IL))
A__ISNATILIST(cons(N, IL)) → A__AND(a__isNat(N), a__isNatIList(IL))
A__TAKE(s(M), cons(N, IL)) → A__ISNAT(N)
A__ISNATLIST(cons(N, L)) → A__AND(a__isNat(N), a__isNatList(L))
A__TAKE(s(M), cons(N, IL)) → A__UTAKE2(a__and(a__isNat(M), a__and(a__isNat(N), a__isNatIList(IL))), M, N, IL)
A__TAKE(s(M), cons(N, IL)) → A__ISNAT(M)
A__ISNAT(length(L)) → A__ISNATLIST(L)
A__ISNATLIST(take(N, IL)) → A__ISNAT(N)
A__ISNATILIST(cons(N, IL)) → A__ISNAT(N)
MARK(isNat(X)) → A__ISNAT(X)
MARK(and(X1, X2)) → A__AND(mark(X1), mark(X2))
MARK(isNatList(X)) → A__ISNATLIST(X)
A__ISNATLIST(take(N, IL)) → A__ISNATILIST(IL)

The TRS R consists of the following rules:

a__and(tt, T) → mark(T)
a__isNatIList(IL) → a__isNatList(IL)
a__isNat(0) → tt
a__isNat(s(N)) → a__isNat(N)
a__isNat(length(L)) → a__isNatList(L)
a__isNatIList(zeros) → tt
a__isNatIList(cons(N, IL)) → a__and(a__isNat(N), a__isNatIList(IL))
a__isNatList(nil) → tt
a__isNatList(cons(N, L)) → a__and(a__isNat(N), a__isNatList(L))
a__isNatList(take(N, IL)) → a__and(a__isNat(N), a__isNatIList(IL))
a__zeros → cons(0, zeros)
a__take(0, IL) → a__uTake1(a__isNatIList(IL))
a__uTake1(tt) → nil
a__take(s(M), cons(N, IL)) → a__uTake2(a__and(a__isNat(M), a__and(a__isNat(N), a__isNatIList(IL))), M, N, IL)
a__uTake2(tt, M, N, IL) → cons(mark(N), take(M, IL))
a__length(cons(N, L)) → a__uLength(a__and(a__isNat(N), a__isNatList(L)), L)
a__uLength(tt, L) → s(a__length(mark(L)))
mark(and(X1, X2)) → a__and(mark(X1), mark(X2))
mark(isNatIList(X)) → a__isNatIList(X)
mark(isNatList(X)) → a__isNatList(X)
mark(isNat(X)) → a__isNat(X)
mark(length(X)) → a__length(mark(X))
mark(zeros) → a__zeros
mark(take(X1, X2)) → a__take(mark(X1), mark(X2))
mark(uTake1(X)) → a__uTake1(mark(X))
mark(uTake2(X1, X2, X3, X4)) → a__uTake2(mark(X1), X2, X3, X4)
mark(uLength(X1, X2)) → a__uLength(mark(X1), X2)
mark(tt) → tt
mark(0) → 0
mark(s(X)) → s(mark(X))
mark(cons(X1, X2)) → cons(mark(X1), X2)
mark(nil) → nil
a__and(X1, X2) → and(X1, X2)
a__isNatIList(X) → isNatIList(X)
a__isNatList(X) → isNatList(X)
a__isNat(X) → isNat(X)
a__length(X) → length(X)
a__zeros → zeros
a__take(X1, X2) → take(X1, X2)
a__uTake1(X) → uTake1(X)
a__uTake2(X1, X2, X3, X4) → uTake2(X1, X2, X3, X4)
a__uLength(X1, X2) → uLength(X1, X2)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [15].

The following pairs can be oriented strictly and are deleted.

MARK(take(X1, X2)) → MARK(X2)
A__TAKE(s(M), cons(N, IL)) → A__ISNATILIST(IL)
MARK(cons(X1, X2)) → MARK(X1)
A__UTAKE2(tt, M, N, IL) → MARK(N)
MARK(uTake2(X1, X2, X3, X4)) → MARK(X1)
MARK(take(X1, X2)) → MARK(X1)
A__TAKE(s(M), cons(N, IL)) → A__AND(a__isNat(N), a__isNatIList(IL))
MARK(uTake2(X1, X2, X3, X4)) → A__UTAKE2(mark(X1), X2, X3, X4)
MARK(take(X1, X2)) → A__TAKE(mark(X1), mark(X2))
A__TAKE(s(M), cons(N, IL)) → A__AND(a__isNat(M), a__and(a__isNat(N), a__isNatIList(IL)))
A__TAKE(s(M), cons(N, IL)) → A__ISNAT(N)
A__TAKE(s(M), cons(N, IL)) → A__UTAKE2(a__and(a__isNat(M), a__and(a__isNat(N), a__isNatIList(IL))), M, N, IL)
A__TAKE(s(M), cons(N, IL)) → A__ISNAT(M)

The remaining pairs can at least be oriented weakly.

A__ISNATLIST(cons(N, L)) → A__ISNATLIST(L)
MARK(s(X)) → MARK(X)
A__ISNATILIST(cons(N, IL)) → A__ISNATILIST(IL)
MARK(isNatIList(X)) → A__ISNATILIST(X)
A__AND(tt, T) → MARK(T)
MARK(and(X1, X2)) → MARK(X1)
A__ISNATLIST(cons(N, L)) → A__ISNAT(N)
A__ISNATILIST(IL) → A__ISNATLIST(IL)
MARK(and(X1, X2)) → MARK(X2)
A__ISNAT(s(N)) → A__ISNAT(N)
A__ISNATLIST(take(N, IL)) → A__AND(a__isNat(N), a__isNatIList(IL))
A__ISNATILIST(cons(N, IL)) → A__AND(a__isNat(N), a__isNatIList(IL))
A__ISNATLIST(cons(N, L)) → A__AND(a__isNat(N), a__isNatList(L))
A__ISNAT(length(L)) → A__ISNATLIST(L)
A__ISNATLIST(take(N, IL)) → A__ISNAT(N)
A__ISNATILIST(cons(N, IL)) → A__ISNAT(N)
MARK(isNat(X)) → A__ISNAT(X)
MARK(and(X1, X2)) → A__AND(mark(X1), mark(X2))
MARK(isNatList(X)) → A__ISNATLIST(X)
A__ISNATLIST(take(N, IL)) → A__ISNATILIST(IL)

Used ordering: Polynomial interpretation [25,35]:

POL(A__ISNAT(x₁)) = 0
POL(a__zeros) = 3
POL(mark(x₁)) = x_1
POL(a__isNatIList(x₁)) = 0
POL(and(x₁, x₂)) = (4)x_1 + (4)x_2
POL(take(x₁, x₂)) = 4 + x_1 + (4)x_2
POL(a__uTake1(x₁)) = 1
POL(A__ISNATLIST(x₁)) = 0
POL(A__AND(x₁, x₂)) = (2)x_2
POL(a__uLength(x₁, x₂)) = 0
POL(a__length(x₁)) = 0
POL(tt) = 0
POL(isNatList(x₁)) = 0
POL(zeros) = 3
POL(isNatIList(x₁)) = 0
POL(s(x₁)) = (2)x_1
POL(a__isNat(x₁)) = 0
POL(isNat(x₁)) = 0
POL(a__isNatList(x₁)) = 0
POL(nil) = 1
POL(a__uTake2(x₁, x₂, x₃, x₄)) = 4 + (2)x_1 + (2)x_3
POL(a__and(x₁, x₂)) = (4)x_1 + (4)x_2
POL(A__UTAKE2(x₁, x₂, x₃, x₄)) = 1 + (4)x_3
POL(a__take(x₁, x₂)) = 4 + x_1 + (4)x_2
POL(0) = 0
POL(A__TAKE(x₁, x₂)) = (3)x_2
POL(cons(x₁, x₂)) = 2 + (2)x_1
POL(MARK(x₁)) = (2)x_1
POL(A__ISNATILIST(x₁)) = 0
POL(uTake2(x₁, x₂, x₃, x₄)) = 4 + (2)x_1 + (2)x_3
POL(uTake1(x₁)) = 1
POL(length(x₁)) = 0
POL(uLength(x₁, x₂)) = 0

The value of delta used in the strict ordering is 1.
The following usable rules [17] were oriented:

mark(length(X)) → a__length(mark(X))
mark(zeros) → a__zeros
a__length(cons(N, L)) → a__uLength(a__and(a__isNat(N), a__isNatList(L)), L)
a__uLength(tt, L) → s(a__length(mark(L)))
a__isNatIList(IL) → a__isNatList(IL)
mark(isNat(X)) → a__isNat(X)
a__isNat(s(N)) → a__isNat(N)
a__and(tt, T) → mark(T)
mark(isNatList(X)) → a__isNatList(X)
a__isNatIList(cons(N, IL)) → a__and(a__isNat(N), a__isNatIList(IL))
mark(isNatIList(X)) → a__isNatIList(X)
a__isNat(length(L)) → a__isNatList(L)
mark(and(X1, X2)) → a__and(mark(X1), mark(X2))
a__isNatList(cons(N, L)) → a__and(a__isNat(N), a__isNatList(L))
a__isNatList(take(N, IL)) → a__and(a__isNat(N), a__isNatIList(IL))
mark(tt) → tt
mark(0) → 0
mark(s(X)) → s(mark(X))
mark(cons(X1, X2)) → cons(mark(X1), X2)
mark(take(X1, X2)) → a__take(mark(X1), mark(X2))
mark(uTake1(X)) → a__uTake1(mark(X))
mark(uTake2(X1, X2, X3, X4)) → a__uTake2(mark(X1), X2, X3, X4)
mark(uLength(X1, X2)) → a__uLength(mark(X1), X2)
a__length(X) → length(X)
a__isNat(X) → isNat(X)
a__take(X1, X2) → take(X1, X2)
a__zeros → zeros
a__and(X1, X2) → and(X1, X2)
mark(nil) → nil
a__isNatList(X) → isNatList(X)
a__isNatIList(X) → isNatIList(X)
a__uTake2(X1, X2, X3, X4) → uTake2(X1, X2, X3, X4)
a__uTake1(X) → uTake1(X)
a__uLength(X1, X2) → uLength(X1, X2)
a__isNat(0) → tt
a__isNatIList(zeros) → tt
a__zeros → cons(0, zeros)
a__isNatList(nil) → tt
a__uTake2(tt, M, N, IL) → cons(mark(N), take(M, IL))
a__take(s(M), cons(N, IL)) → a__uTake2(a__and(a__isNat(M), a__and(a__isNat(N), a__isNatIList(IL))), M, N, IL)
a__uTake1(tt) → nil
a__take(0, IL) → a__uTake1(a__isNatIList(IL))

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ QDP

          ↳ QDPOrderProof

            ↳ QDP

              ↳ DependencyGraphProof

                ↳ AND

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ QDPOrderProof

                          ↳ QDP

                            ↳ QDPOrderProof

                              ↳ QDP

                                ↳ QDPOrderProof

                  ↳ QDP

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

A__ISNATLIST(cons(N, L)) → A__ISNATLIST(L)
MARK(s(X)) → MARK(X)
A__ISNATILIST(cons(N, IL)) → A__ISNATILIST(IL)
MARK(isNatIList(X)) → A__ISNATILIST(X)
A__ISNAT(s(N)) → A__ISNAT(N)
A__AND(tt, T) → MARK(T)
A__ISNATLIST(take(N, IL)) → A__AND(a__isNat(N), a__isNatIList(IL))
A__ISNATILIST(cons(N, IL)) → A__AND(a__isNat(N), a__isNatIList(IL))
A__ISNATLIST(cons(N, L)) → A__AND(a__isNat(N), a__isNatList(L))
MARK(and(X1, X2)) → MARK(X1)
A__ISNAT(length(L)) → A__ISNATLIST(L)
MARK(isNat(X)) → A__ISNAT(X)
A__ISNATILIST(cons(N, IL)) → A__ISNAT(N)
A__ISNATLIST(take(N, IL)) → A__ISNAT(N)
A__ISNATLIST(cons(N, L)) → A__ISNAT(N)
MARK(isNatList(X)) → A__ISNATLIST(X)
MARK(and(X1, X2)) → A__AND(mark(X1), mark(X2))
A__ISNATLIST(take(N, IL)) → A__ISNATILIST(IL)
A__ISNATILIST(IL) → A__ISNATLIST(IL)
MARK(and(X1, X2)) → MARK(X2)

The TRS R consists of the following rules:

a__and(tt, T) → mark(T)
a__isNatIList(IL) → a__isNatList(IL)
a__isNat(0) → tt
a__isNat(s(N)) → a__isNat(N)
a__isNat(length(L)) → a__isNatList(L)
a__isNatIList(zeros) → tt
a__isNatIList(cons(N, IL)) → a__and(a__isNat(N), a__isNatIList(IL))
a__isNatList(nil) → tt
a__isNatList(cons(N, L)) → a__and(a__isNat(N), a__isNatList(L))
a__isNatList(take(N, IL)) → a__and(a__isNat(N), a__isNatIList(IL))
a__zeros → cons(0, zeros)
a__take(0, IL) → a__uTake1(a__isNatIList(IL))
a__uTake1(tt) → nil
a__take(s(M), cons(N, IL)) → a__uTake2(a__and(a__isNat(M), a__and(a__isNat(N), a__isNatIList(IL))), M, N, IL)
a__uTake2(tt, M, N, IL) → cons(mark(N), take(M, IL))
a__length(cons(N, L)) → a__uLength(a__and(a__isNat(N), a__isNatList(L)), L)
a__uLength(tt, L) → s(a__length(mark(L)))
mark(and(X1, X2)) → a__and(mark(X1), mark(X2))
mark(isNatIList(X)) → a__isNatIList(X)
mark(isNatList(X)) → a__isNatList(X)
mark(isNat(X)) → a__isNat(X)
mark(length(X)) → a__length(mark(X))
mark(zeros) → a__zeros
mark(take(X1, X2)) → a__take(mark(X1), mark(X2))
mark(uTake1(X)) → a__uTake1(mark(X))
mark(uTake2(X1, X2, X3, X4)) → a__uTake2(mark(X1), X2, X3, X4)
mark(uLength(X1, X2)) → a__uLength(mark(X1), X2)
mark(tt) → tt
mark(0) → 0
mark(s(X)) → s(mark(X))
mark(cons(X1, X2)) → cons(mark(X1), X2)
mark(nil) → nil
a__and(X1, X2) → and(X1, X2)
a__isNatIList(X) → isNatIList(X)
a__isNatList(X) → isNatList(X)
a__isNat(X) → isNat(X)
a__length(X) → length(X)
a__zeros → zeros
a__take(X1, X2) → take(X1, X2)
a__uTake1(X) → uTake1(X)
a__uTake2(X1, X2, X3, X4) → uTake2(X1, X2, X3, X4)
a__uLength(X1, X2) → uLength(X1, X2)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [15].

The following pairs can be oriented strictly and are deleted.

A__ISNATLIST(take(N, IL)) → A__AND(a__isNat(N), a__isNatIList(IL))
A__ISNATLIST(take(N, IL)) → A__ISNAT(N)
A__ISNATLIST(take(N, IL)) → A__ISNATILIST(IL)

The remaining pairs can at least be oriented weakly.

A__ISNATLIST(cons(N, L)) → A__ISNATLIST(L)
MARK(s(X)) → MARK(X)
A__ISNATILIST(cons(N, IL)) → A__ISNATILIST(IL)
MARK(isNatIList(X)) → A__ISNATILIST(X)
A__ISNAT(s(N)) → A__ISNAT(N)
A__AND(tt, T) → MARK(T)
A__ISNATILIST(cons(N, IL)) → A__AND(a__isNat(N), a__isNatIList(IL))
A__ISNATLIST(cons(N, L)) → A__AND(a__isNat(N), a__isNatList(L))
MARK(and(X1, X2)) → MARK(X1)
A__ISNAT(length(L)) → A__ISNATLIST(L)
MARK(isNat(X)) → A__ISNAT(X)
A__ISNATILIST(cons(N, IL)) → A__ISNAT(N)
A__ISNATLIST(cons(N, L)) → A__ISNAT(N)
MARK(isNatList(X)) → A__ISNATLIST(X)
MARK(and(X1, X2)) → A__AND(mark(X1), mark(X2))
A__ISNATILIST(IL) → A__ISNATLIST(IL)
MARK(and(X1, X2)) → MARK(X2)

Used ordering: Polynomial interpretation [25,35]:

POL(A__ISNAT(x₁)) = 3 + (4)x_1
POL(a__zeros) = 0
POL(mark(x₁)) = x_1
POL(a__isNatIList(x₁)) = x_1
POL(and(x₁, x₂)) = (4)x_1 + x_2
POL(take(x₁, x₂)) = 4 + (4)x_1 + x_2
POL(a__uTake1(x₁)) = 0
POL(A__ISNATLIST(x₁)) = 3 + (4)x_1
POL(a__uLength(x₁, x₂)) = x_2
POL(A__AND(x₁, x₂)) = 3 + (4)x_2
POL(a__length(x₁)) = x_1
POL(tt) = 0
POL(isNatList(x₁)) = x_1
POL(zeros) = 0
POL(isNatIList(x₁)) = x_1
POL(a__isNat(x₁)) = x_1
POL(s(x₁)) = x_1
POL(isNat(x₁)) = x_1
POL(a__isNatList(x₁)) = x_1
POL(nil) = 0
POL(a__uTake2(x₁, x₂, x₃, x₄)) = 4 + (4)x_2 + (4)x_3 + x_4
POL(a__and(x₁, x₂)) = (4)x_1 + x_2
POL(0) = 0
POL(a__take(x₁, x₂)) = 4 + (4)x_1 + x_2
POL(cons(x₁, x₂)) = (4)x_1 + x_2
POL(MARK(x₁)) = 3 + (4)x_1
POL(A__ISNATILIST(x₁)) = 3 + (4)x_1
POL(uTake2(x₁, x₂, x₃, x₄)) = 4 + (4)x_2 + (4)x_3 + x_4
POL(uTake1(x₁)) = 0
POL(length(x₁)) = x_1
POL(uLength(x₁, x₂)) = x_2

The value of delta used in the strict ordering is 16.
The following usable rules [17] were oriented:

mark(length(X)) → a__length(mark(X))
mark(zeros) → a__zeros
a__length(cons(N, L)) → a__uLength(a__and(a__isNat(N), a__isNatList(L)), L)
a__uLength(tt, L) → s(a__length(mark(L)))
a__isNatIList(IL) → a__isNatList(IL)
mark(isNat(X)) → a__isNat(X)
a__isNat(s(N)) → a__isNat(N)
a__and(tt, T) → mark(T)
mark(isNatList(X)) → a__isNatList(X)
a__isNatIList(cons(N, IL)) → a__and(a__isNat(N), a__isNatIList(IL))
mark(isNatIList(X)) → a__isNatIList(X)
a__isNat(length(L)) → a__isNatList(L)
mark(and(X1, X2)) → a__and(mark(X1), mark(X2))
a__isNatList(cons(N, L)) → a__and(a__isNat(N), a__isNatList(L))
a__isNatList(take(N, IL)) → a__and(a__isNat(N), a__isNatIList(IL))
mark(tt) → tt
mark(0) → 0
mark(s(X)) → s(mark(X))
mark(cons(X1, X2)) → cons(mark(X1), X2)
mark(take(X1, X2)) → a__take(mark(X1), mark(X2))
mark(uTake1(X)) → a__uTake1(mark(X))
mark(uTake2(X1, X2, X3, X4)) → a__uTake2(mark(X1), X2, X3, X4)
mark(uLength(X1, X2)) → a__uLength(mark(X1), X2)
a__length(X) → length(X)
a__isNat(X) → isNat(X)
a__take(X1, X2) → take(X1, X2)
a__zeros → zeros
a__and(X1, X2) → and(X1, X2)
mark(nil) → nil
a__isNatList(X) → isNatList(X)
a__isNatIList(X) → isNatIList(X)
a__uTake2(X1, X2, X3, X4) → uTake2(X1, X2, X3, X4)
a__uTake1(X) → uTake1(X)
a__uLength(X1, X2) → uLength(X1, X2)
a__isNat(0) → tt
a__isNatIList(zeros) → tt
a__zeros → cons(0, zeros)
a__isNatList(nil) → tt
a__uTake2(tt, M, N, IL) → cons(mark(N), take(M, IL))
a__take(s(M), cons(N, IL)) → a__uTake2(a__and(a__isNat(M), a__and(a__isNat(N), a__isNatIList(IL))), M, N, IL)
a__uTake1(tt) → nil
a__take(0, IL) → a__uTake1(a__isNatIList(IL))

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ QDP

          ↳ QDPOrderProof

            ↳ QDP

              ↳ DependencyGraphProof

                ↳ AND

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ QDPOrderProof

                          ↳ QDP

                            ↳ QDPOrderProof

                              ↳ QDP

                                ↳ QDPOrderProof

                                  ↳ QDP

                                    ↳ QDPOrderProof

                  ↳ QDP

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

A__ISNATLIST(cons(N, L)) → A__ISNATLIST(L)
MARK(s(X)) → MARK(X)
A__ISNATILIST(cons(N, IL)) → A__ISNATILIST(IL)
MARK(isNatIList(X)) → A__ISNATILIST(X)
A__ISNAT(s(N)) → A__ISNAT(N)
A__AND(tt, T) → MARK(T)
A__ISNATILIST(cons(N, IL)) → A__AND(a__isNat(N), a__isNatIList(IL))
A__ISNATLIST(cons(N, L)) → A__AND(a__isNat(N), a__isNatList(L))
MARK(and(X1, X2)) → MARK(X1)
A__ISNAT(length(L)) → A__ISNATLIST(L)
MARK(isNat(X)) → A__ISNAT(X)
A__ISNATILIST(cons(N, IL)) → A__ISNAT(N)
A__ISNATLIST(cons(N, L)) → A__ISNAT(N)
MARK(and(X1, X2)) → A__AND(mark(X1), mark(X2))
MARK(isNatList(X)) → A__ISNATLIST(X)
MARK(and(X1, X2)) → MARK(X2)
A__ISNATILIST(IL) → A__ISNATLIST(IL)

The TRS R consists of the following rules:

a__and(tt, T) → mark(T)
a__isNatIList(IL) → a__isNatList(IL)
a__isNat(0) → tt
a__isNat(s(N)) → a__isNat(N)
a__isNat(length(L)) → a__isNatList(L)
a__isNatIList(zeros) → tt
a__isNatIList(cons(N, IL)) → a__and(a__isNat(N), a__isNatIList(IL))
a__isNatList(nil) → tt
a__isNatList(cons(N, L)) → a__and(a__isNat(N), a__isNatList(L))
a__isNatList(take(N, IL)) → a__and(a__isNat(N), a__isNatIList(IL))
a__zeros → cons(0, zeros)
a__take(0, IL) → a__uTake1(a__isNatIList(IL))
a__uTake1(tt) → nil
a__take(s(M), cons(N, IL)) → a__uTake2(a__and(a__isNat(M), a__and(a__isNat(N), a__isNatIList(IL))), M, N, IL)
a__uTake2(tt, M, N, IL) → cons(mark(N), take(M, IL))
a__length(cons(N, L)) → a__uLength(a__and(a__isNat(N), a__isNatList(L)), L)
a__uLength(tt, L) → s(a__length(mark(L)))
mark(and(X1, X2)) → a__and(mark(X1), mark(X2))
mark(isNatIList(X)) → a__isNatIList(X)
mark(isNatList(X)) → a__isNatList(X)
mark(isNat(X)) → a__isNat(X)
mark(length(X)) → a__length(mark(X))
mark(zeros) → a__zeros
mark(take(X1, X2)) → a__take(mark(X1), mark(X2))
mark(uTake1(X)) → a__uTake1(mark(X))
mark(uTake2(X1, X2, X3, X4)) → a__uTake2(mark(X1), X2, X3, X4)
mark(uLength(X1, X2)) → a__uLength(mark(X1), X2)
mark(tt) → tt
mark(0) → 0
mark(s(X)) → s(mark(X))
mark(cons(X1, X2)) → cons(mark(X1), X2)
mark(nil) → nil
a__and(X1, X2) → and(X1, X2)
a__isNatIList(X) → isNatIList(X)
a__isNatList(X) → isNatList(X)
a__isNat(X) → isNat(X)
a__length(X) → length(X)
a__zeros → zeros
a__take(X1, X2) → take(X1, X2)
a__uTake1(X) → uTake1(X)
a__uTake2(X1, X2, X3, X4) → uTake2(X1, X2, X3, X4)
a__uLength(X1, X2) → uLength(X1, X2)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [15].

The following pairs can be oriented strictly and are deleted.

A__ISNATILIST(cons(N, IL)) → A__ISNAT(N)
A__ISNATILIST(IL) → A__ISNATLIST(IL)

The remaining pairs can at least be oriented weakly.

A__ISNATLIST(cons(N, L)) → A__ISNATLIST(L)
MARK(s(X)) → MARK(X)
A__ISNATILIST(cons(N, IL)) → A__ISNATILIST(IL)
MARK(isNatIList(X)) → A__ISNATILIST(X)
A__ISNAT(s(N)) → A__ISNAT(N)
A__AND(tt, T) → MARK(T)
A__ISNATILIST(cons(N, IL)) → A__AND(a__isNat(N), a__isNatIList(IL))
A__ISNATLIST(cons(N, L)) → A__AND(a__isNat(N), a__isNatList(L))
MARK(and(X1, X2)) → MARK(X1)
A__ISNAT(length(L)) → A__ISNATLIST(L)
MARK(isNat(X)) → A__ISNAT(X)
A__ISNATLIST(cons(N, L)) → A__ISNAT(N)
MARK(and(X1, X2)) → A__AND(mark(X1), mark(X2))
MARK(isNatList(X)) → A__ISNATLIST(X)
MARK(and(X1, X2)) → MARK(X2)

Used ordering: Polynomial interpretation [25,35]:

POL(A__ISNAT(x₁)) = x_1
POL(a__zeros) = 0
POL(mark(x₁)) = x_1
POL(a__isNatIList(x₁)) = 1 + (2)x_1
POL(and(x₁, x₂)) = x_1 + x_2
POL(take(x₁, x₂)) = 4 + x_1 + x_2
POL(a__uTake1(x₁)) = 3
POL(A__ISNATLIST(x₁)) = (2)x_1
POL(a__uLength(x₁, x₂)) = (2)x_2
POL(A__AND(x₁, x₂)) = x_2
POL(a__length(x₁)) = (2)x_1
POL(tt) = 0
POL(isNatList(x₁)) = (2)x_1
POL(zeros) = 0
POL(isNatIList(x₁)) = 1 + (2)x_1
POL(a__isNat(x₁)) = x_1
POL(s(x₁)) = x_1
POL(isNat(x₁)) = x_1
POL(a__isNatList(x₁)) = (2)x_1
POL(nil) = 0
POL(a__uTake2(x₁, x₂, x₃, x₄)) = 4 + x_2 + (4)x_3 + x_4
POL(a__and(x₁, x₂)) = x_1 + x_2
POL(0) = 0
POL(a__take(x₁, x₂)) = 4 + x_1 + x_2
POL(cons(x₁, x₂)) = (4)x_1 + x_2
POL(MARK(x₁)) = x_1
POL(A__ISNATILIST(x₁)) = 1 + (2)x_1
POL(uTake2(x₁, x₂, x₃, x₄)) = 4 + x_2 + (4)x_3 + x_4
POL(uTake1(x₁)) = 3
POL(length(x₁)) = (2)x_1
POL(uLength(x₁, x₂)) = (2)x_2

The value of delta used in the strict ordering is 1.
The following usable rules [17] were oriented:

mark(length(X)) → a__length(mark(X))
mark(zeros) → a__zeros
a__length(cons(N, L)) → a__uLength(a__and(a__isNat(N), a__isNatList(L)), L)
a__uLength(tt, L) → s(a__length(mark(L)))
a__isNatIList(IL) → a__isNatList(IL)
mark(isNat(X)) → a__isNat(X)
a__isNat(s(N)) → a__isNat(N)
a__and(tt, T) → mark(T)
mark(isNatList(X)) → a__isNatList(X)
a__isNatIList(cons(N, IL)) → a__and(a__isNat(N), a__isNatIList(IL))
mark(isNatIList(X)) → a__isNatIList(X)
a__isNat(length(L)) → a__isNatList(L)
mark(and(X1, X2)) → a__and(mark(X1), mark(X2))
a__isNatList(cons(N, L)) → a__and(a__isNat(N), a__isNatList(L))
a__isNatList(take(N, IL)) → a__and(a__isNat(N), a__isNatIList(IL))
mark(tt) → tt
mark(0) → 0
mark(s(X)) → s(mark(X))
mark(cons(X1, X2)) → cons(mark(X1), X2)
mark(take(X1, X2)) → a__take(mark(X1), mark(X2))
mark(uTake1(X)) → a__uTake1(mark(X))
mark(uTake2(X1, X2, X3, X4)) → a__uTake2(mark(X1), X2, X3, X4)
mark(uLength(X1, X2)) → a__uLength(mark(X1), X2)
a__length(X) → length(X)
a__isNat(X) → isNat(X)
a__take(X1, X2) → take(X1, X2)
a__zeros → zeros
a__and(X1, X2) → and(X1, X2)
mark(nil) → nil
a__isNatList(X) → isNatList(X)
a__isNatIList(X) → isNatIList(X)
a__uTake2(X1, X2, X3, X4) → uTake2(X1, X2, X3, X4)
a__uTake1(X) → uTake1(X)
a__uLength(X1, X2) → uLength(X1, X2)
a__isNat(0) → tt
a__isNatIList(zeros) → tt
a__zeros → cons(0, zeros)
a__isNatList(nil) → tt
a__uTake2(tt, M, N, IL) → cons(mark(N), take(M, IL))
a__take(s(M), cons(N, IL)) → a__uTake2(a__and(a__isNat(M), a__and(a__isNat(N), a__isNatIList(IL))), M, N, IL)
a__uTake1(tt) → nil
a__take(0, IL) → a__uTake1(a__isNatIList(IL))

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ QDP

          ↳ QDPOrderProof

            ↳ QDP

              ↳ DependencyGraphProof

                ↳ AND

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ QDPOrderProof

                          ↳ QDP

                            ↳ QDPOrderProof

                              ↳ QDP

                                ↳ QDPOrderProof

                                  ↳ QDP

                                    ↳ QDPOrderProof

                                      ↳ QDP

                                        ↳ QDPOrderProof

                  ↳ QDP

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

A__ISNATLIST(cons(N, L)) → A__ISNATLIST(L)
MARK(s(X)) → MARK(X)
A__ISNATILIST(cons(N, IL)) → A__ISNATILIST(IL)
MARK(isNatIList(X)) → A__ISNATILIST(X)
A__ISNAT(s(N)) → A__ISNAT(N)
A__AND(tt, T) → MARK(T)
A__ISNATILIST(cons(N, IL)) → A__AND(a__isNat(N), a__isNatIList(IL))
A__ISNATLIST(cons(N, L)) → A__AND(a__isNat(N), a__isNatList(L))
MARK(and(X1, X2)) → MARK(X1)
A__ISNAT(length(L)) → A__ISNATLIST(L)
MARK(isNat(X)) → A__ISNAT(X)
A__ISNATLIST(cons(N, L)) → A__ISNAT(N)
MARK(isNatList(X)) → A__ISNATLIST(X)
MARK(and(X1, X2)) → A__AND(mark(X1), mark(X2))
MARK(and(X1, X2)) → MARK(X2)

The TRS R consists of the following rules:

a__and(tt, T) → mark(T)
a__isNatIList(IL) → a__isNatList(IL)
a__isNat(0) → tt
a__isNat(s(N)) → a__isNat(N)
a__isNat(length(L)) → a__isNatList(L)
a__isNatIList(zeros) → tt
a__isNatIList(cons(N, IL)) → a__and(a__isNat(N), a__isNatIList(IL))
a__isNatList(nil) → tt
a__isNatList(cons(N, L)) → a__and(a__isNat(N), a__isNatList(L))
a__isNatList(take(N, IL)) → a__and(a__isNat(N), a__isNatIList(IL))
a__zeros → cons(0, zeros)
a__take(0, IL) → a__uTake1(a__isNatIList(IL))
a__uTake1(tt) → nil
a__take(s(M), cons(N, IL)) → a__uTake2(a__and(a__isNat(M), a__and(a__isNat(N), a__isNatIList(IL))), M, N, IL)
a__uTake2(tt, M, N, IL) → cons(mark(N), take(M, IL))
a__length(cons(N, L)) → a__uLength(a__and(a__isNat(N), a__isNatList(L)), L)
a__uLength(tt, L) → s(a__length(mark(L)))
mark(and(X1, X2)) → a__and(mark(X1), mark(X2))
mark(isNatIList(X)) → a__isNatIList(X)
mark(isNatList(X)) → a__isNatList(X)
mark(isNat(X)) → a__isNat(X)
mark(length(X)) → a__length(mark(X))
mark(zeros) → a__zeros
mark(take(X1, X2)) → a__take(mark(X1), mark(X2))
mark(uTake1(X)) → a__uTake1(mark(X))
mark(uTake2(X1, X2, X3, X4)) → a__uTake2(mark(X1), X2, X3, X4)
mark(uLength(X1, X2)) → a__uLength(mark(X1), X2)
mark(tt) → tt
mark(0) → 0
mark(s(X)) → s(mark(X))
mark(cons(X1, X2)) → cons(mark(X1), X2)
mark(nil) → nil
a__and(X1, X2) → and(X1, X2)
a__isNatIList(X) → isNatIList(X)
a__isNatList(X) → isNatList(X)
a__isNat(X) → isNat(X)
a__length(X) → length(X)
a__zeros → zeros
a__take(X1, X2) → take(X1, X2)
a__uTake1(X) → uTake1(X)
a__uTake2(X1, X2, X3, X4) → uTake2(X1, X2, X3, X4)
a__uLength(X1, X2) → uLength(X1, X2)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [15].

The following pairs can be oriented strictly and are deleted.

A__ISNAT(length(L)) → A__ISNATLIST(L)

The remaining pairs can at least be oriented weakly.

A__ISNATLIST(cons(N, L)) → A__ISNATLIST(L)
MARK(s(X)) → MARK(X)
A__ISNATILIST(cons(N, IL)) → A__ISNATILIST(IL)
MARK(isNatIList(X)) → A__ISNATILIST(X)
A__ISNAT(s(N)) → A__ISNAT(N)
A__AND(tt, T) → MARK(T)
A__ISNATILIST(cons(N, IL)) → A__AND(a__isNat(N), a__isNatIList(IL))
A__ISNATLIST(cons(N, L)) → A__AND(a__isNat(N), a__isNatList(L))
MARK(and(X1, X2)) → MARK(X1)
MARK(isNat(X)) → A__ISNAT(X)
A__ISNATLIST(cons(N, L)) → A__ISNAT(N)
MARK(isNatList(X)) → A__ISNATLIST(X)
MARK(and(X1, X2)) → A__AND(mark(X1), mark(X2))
MARK(and(X1, X2)) → MARK(X2)

Used ordering: Polynomial interpretation [25,35]:

POL(A__ISNAT(x₁)) = x_1
POL(a__zeros) = 0
POL(mark(x₁)) = x_1
POL(a__isNatIList(x₁)) = (2)x_1
POL(and(x₁, x₂)) = x_1 + x_2
POL(take(x₁, x₂)) = x_1 + x_2
POL(a__uTake1(x₁)) = 0
POL(A__ISNATLIST(x₁)) = (2)x_1
POL(a__uLength(x₁, x₂)) = 1 + (2)x_2
POL(A__AND(x₁, x₂)) = x_1 + x_2
POL(a__length(x₁)) = 1 + (2)x_1
POL(tt) = 0
POL(isNatList(x₁)) = (2)x_1
POL(zeros) = 0
POL(isNatIList(x₁)) = (2)x_1
POL(a__isNat(x₁)) = (2)x_1
POL(s(x₁)) = x_1
POL(isNat(x₁)) = (2)x_1
POL(a__isNatList(x₁)) = (2)x_1
POL(nil) = 0
POL(a__uTake2(x₁, x₂, x₃, x₄)) = x_2 + x_3 + x_4
POL(a__and(x₁, x₂)) = x_1 + x_2
POL(0) = 0
POL(a__take(x₁, x₂)) = x_1 + x_2
POL(cons(x₁, x₂)) = x_1 + x_2
POL(MARK(x₁)) = x_1
POL(A__ISNATILIST(x₁)) = (2)x_1
POL(uTake2(x₁, x₂, x₃, x₄)) = x_2 + x_3 + x_4
POL(uTake1(x₁)) = 0
POL(length(x₁)) = 1 + (2)x_1
POL(uLength(x₁, x₂)) = 1 + (2)x_2

The value of delta used in the strict ordering is 1.
The following usable rules [17] were oriented:

mark(length(X)) → a__length(mark(X))
mark(zeros) → a__zeros
a__length(cons(N, L)) → a__uLength(a__and(a__isNat(N), a__isNatList(L)), L)
a__uLength(tt, L) → s(a__length(mark(L)))
a__isNatIList(IL) → a__isNatList(IL)
mark(isNat(X)) → a__isNat(X)
a__isNat(s(N)) → a__isNat(N)
a__and(tt, T) → mark(T)
mark(isNatList(X)) → a__isNatList(X)
a__isNatIList(cons(N, IL)) → a__and(a__isNat(N), a__isNatIList(IL))
mark(isNatIList(X)) → a__isNatIList(X)
a__isNat(length(L)) → a__isNatList(L)
mark(and(X1, X2)) → a__and(mark(X1), mark(X2))
a__isNatList(cons(N, L)) → a__and(a__isNat(N), a__isNatList(L))
a__isNatList(take(N, IL)) → a__and(a__isNat(N), a__isNatIList(IL))
mark(tt) → tt
mark(0) → 0
mark(s(X)) → s(mark(X))
mark(cons(X1, X2)) → cons(mark(X1), X2)
mark(take(X1, X2)) → a__take(mark(X1), mark(X2))
mark(uTake1(X)) → a__uTake1(mark(X))
mark(uTake2(X1, X2, X3, X4)) → a__uTake2(mark(X1), X2, X3, X4)
mark(uLength(X1, X2)) → a__uLength(mark(X1), X2)
a__length(X) → length(X)
a__isNat(X) → isNat(X)
a__take(X1, X2) → take(X1, X2)
a__zeros → zeros
a__and(X1, X2) → and(X1, X2)
mark(nil) → nil
a__isNatList(X) → isNatList(X)
a__isNatIList(X) → isNatIList(X)
a__uTake2(X1, X2, X3, X4) → uTake2(X1, X2, X3, X4)
a__uTake1(X) → uTake1(X)
a__uLength(X1, X2) → uLength(X1, X2)
a__isNat(0) → tt
a__isNatIList(zeros) → tt
a__zeros → cons(0, zeros)
a__isNatList(nil) → tt
a__uTake2(tt, M, N, IL) → cons(mark(N), take(M, IL))
a__take(s(M), cons(N, IL)) → a__uTake2(a__and(a__isNat(M), a__and(a__isNat(N), a__isNatIList(IL))), M, N, IL)
a__uTake1(tt) → nil
a__take(0, IL) → a__uTake1(a__isNatIList(IL))

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ QDP

          ↳ QDPOrderProof

            ↳ QDP

              ↳ DependencyGraphProof

                ↳ AND

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ QDPOrderProof

                          ↳ QDP

                            ↳ QDPOrderProof

                              ↳ QDP

                                ↳ QDPOrderProof

                                  ↳ QDP

                                    ↳ QDPOrderProof

                                      ↳ QDP

                                        ↳ QDPOrderProof

                                          ↳ QDP

                                            ↳ DependencyGraphProof

                  ↳ QDP

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

A__ISNATLIST(cons(N, L)) → A__ISNATLIST(L)
MARK(s(X)) → MARK(X)
A__ISNATILIST(cons(N, IL)) → A__ISNATILIST(IL)
MARK(isNatIList(X)) → A__ISNATILIST(X)
A__ISNAT(s(N)) → A__ISNAT(N)
A__AND(tt, T) → MARK(T)
A__ISNATILIST(cons(N, IL)) → A__AND(a__isNat(N), a__isNatIList(IL))
A__ISNATLIST(cons(N, L)) → A__AND(a__isNat(N), a__isNatList(L))
MARK(and(X1, X2)) → MARK(X1)
MARK(isNat(X)) → A__ISNAT(X)
A__ISNATLIST(cons(N, L)) → A__ISNAT(N)
MARK(isNatList(X)) → A__ISNATLIST(X)
MARK(and(X1, X2)) → A__AND(mark(X1), mark(X2))
MARK(and(X1, X2)) → MARK(X2)

The TRS R consists of the following rules:

a__and(tt, T) → mark(T)
a__isNatIList(IL) → a__isNatList(IL)
a__isNat(0) → tt
a__isNat(s(N)) → a__isNat(N)
a__isNat(length(L)) → a__isNatList(L)
a__isNatIList(zeros) → tt
a__isNatIList(cons(N, IL)) → a__and(a__isNat(N), a__isNatIList(IL))
a__isNatList(nil) → tt
a__isNatList(cons(N, L)) → a__and(a__isNat(N), a__isNatList(L))
a__isNatList(take(N, IL)) → a__and(a__isNat(N), a__isNatIList(IL))
a__zeros → cons(0, zeros)
a__take(0, IL) → a__uTake1(a__isNatIList(IL))
a__uTake1(tt) → nil
a__take(s(M), cons(N, IL)) → a__uTake2(a__and(a__isNat(M), a__and(a__isNat(N), a__isNatIList(IL))), M, N, IL)
a__uTake2(tt, M, N, IL) → cons(mark(N), take(M, IL))
a__length(cons(N, L)) → a__uLength(a__and(a__isNat(N), a__isNatList(L)), L)
a__uLength(tt, L) → s(a__length(mark(L)))
mark(and(X1, X2)) → a__and(mark(X1), mark(X2))
mark(isNatIList(X)) → a__isNatIList(X)
mark(isNatList(X)) → a__isNatList(X)
mark(isNat(X)) → a__isNat(X)
mark(length(X)) → a__length(mark(X))
mark(zeros) → a__zeros
mark(take(X1, X2)) → a__take(mark(X1), mark(X2))
mark(uTake1(X)) → a__uTake1(mark(X))
mark(uTake2(X1, X2, X3, X4)) → a__uTake2(mark(X1), X2, X3, X4)
mark(uLength(X1, X2)) → a__uLength(mark(X1), X2)
mark(tt) → tt
mark(0) → 0
mark(s(X)) → s(mark(X))
mark(cons(X1, X2)) → cons(mark(X1), X2)
mark(nil) → nil
a__and(X1, X2) → and(X1, X2)
a__isNatIList(X) → isNatIList(X)
a__isNatList(X) → isNatList(X)
a__isNat(X) → isNat(X)
a__length(X) → length(X)
a__zeros → zeros
a__take(X1, X2) → take(X1, X2)
a__uTake1(X) → uTake1(X)
a__uTake2(X1, X2, X3, X4) → uTake2(X1, X2, X3, X4)
a__uLength(X1, X2) → uLength(X1, X2)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 2 SCCs with 2 less nodes.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ QDP

          ↳ QDPOrderProof

            ↳ QDP

              ↳ DependencyGraphProof

                ↳ AND

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ QDPOrderProof

                          ↳ QDP

                            ↳ QDPOrderProof

                              ↳ QDP

                                ↳ QDPOrderProof

                                  ↳ QDP

                                    ↳ QDPOrderProof

                                      ↳ QDP

                                        ↳ QDPOrderProof

                                          ↳ QDP

                                            ↳ DependencyGraphProof

                                              ↳ AND

                                                ↳ QDP

                                                  ↳ QDPOrderProof

                                                ↳ QDP

                  ↳ QDP

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

A__ISNAT(s(N)) → A__ISNAT(N)

The TRS R consists of the following rules:

a__and(tt, T) → mark(T)
a__isNatIList(IL) → a__isNatList(IL)
a__isNat(0) → tt
a__isNat(s(N)) → a__isNat(N)
a__isNat(length(L)) → a__isNatList(L)
a__isNatIList(zeros) → tt
a__isNatIList(cons(N, IL)) → a__and(a__isNat(N), a__isNatIList(IL))
a__isNatList(nil) → tt
a__isNatList(cons(N, L)) → a__and(a__isNat(N), a__isNatList(L))
a__isNatList(take(N, IL)) → a__and(a__isNat(N), a__isNatIList(IL))
a__zeros → cons(0, zeros)
a__take(0, IL) → a__uTake1(a__isNatIList(IL))
a__uTake1(tt) → nil
a__take(s(M), cons(N, IL)) → a__uTake2(a__and(a__isNat(M), a__and(a__isNat(N), a__isNatIList(IL))), M, N, IL)
a__uTake2(tt, M, N, IL) → cons(mark(N), take(M, IL))
a__length(cons(N, L)) → a__uLength(a__and(a__isNat(N), a__isNatList(L)), L)
a__uLength(tt, L) → s(a__length(mark(L)))
mark(and(X1, X2)) → a__and(mark(X1), mark(X2))
mark(isNatIList(X)) → a__isNatIList(X)
mark(isNatList(X)) → a__isNatList(X)
mark(isNat(X)) → a__isNat(X)
mark(length(X)) → a__length(mark(X))
mark(zeros) → a__zeros
mark(take(X1, X2)) → a__take(mark(X1), mark(X2))
mark(uTake1(X)) → a__uTake1(mark(X))
mark(uTake2(X1, X2, X3, X4)) → a__uTake2(mark(X1), X2, X3, X4)
mark(uLength(X1, X2)) → a__uLength(mark(X1), X2)
mark(tt) → tt
mark(0) → 0
mark(s(X)) → s(mark(X))
mark(cons(X1, X2)) → cons(mark(X1), X2)
mark(nil) → nil
a__and(X1, X2) → and(X1, X2)
a__isNatIList(X) → isNatIList(X)
a__isNatList(X) → isNatList(X)
a__isNat(X) → isNat(X)
a__length(X) → length(X)
a__zeros → zeros
a__take(X1, X2) → take(X1, X2)
a__uTake1(X) → uTake1(X)
a__uTake2(X1, X2, X3, X4) → uTake2(X1, X2, X3, X4)
a__uLength(X1, X2) → uLength(X1, X2)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [15].

The following pairs can be oriented strictly and are deleted.

A__ISNAT(s(N)) → A__ISNAT(N)

The remaining pairs can at least be oriented weakly.
none
Used ordering: Polynomial interpretation [25,35]:

POL(A__ISNAT(x₁)) = (4)x_1
POL(s(x₁)) = 1 + (4)x_1

The value of delta used in the strict ordering is 4.
The following usable rules [17] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ QDP

          ↳ QDPOrderProof

            ↳ QDP

              ↳ DependencyGraphProof

                ↳ AND

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ QDPOrderProof

                          ↳ QDP

                            ↳ QDPOrderProof

                              ↳ QDP

                                ↳ QDPOrderProof

                                  ↳ QDP

                                    ↳ QDPOrderProof

                                      ↳ QDP

                                        ↳ QDPOrderProof

                                          ↳ QDP

                                            ↳ DependencyGraphProof

                                              ↳ AND

                                                ↳ QDP

                                                  ↳ QDPOrderProof

                                                    ↳ QDP

                                                      ↳ PisEmptyProof

                                                ↳ QDP

                  ↳ QDP

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

a__and(tt, T) → mark(T)
a__isNatIList(IL) → a__isNatList(IL)
a__isNat(0) → tt
a__isNat(s(N)) → a__isNat(N)
a__isNat(length(L)) → a__isNatList(L)
a__isNatIList(zeros) → tt
a__isNatIList(cons(N, IL)) → a__and(a__isNat(N), a__isNatIList(IL))
a__isNatList(nil) → tt
a__isNatList(cons(N, L)) → a__and(a__isNat(N), a__isNatList(L))
a__isNatList(take(N, IL)) → a__and(a__isNat(N), a__isNatIList(IL))
a__zeros → cons(0, zeros)
a__take(0, IL) → a__uTake1(a__isNatIList(IL))
a__uTake1(tt) → nil
a__take(s(M), cons(N, IL)) → a__uTake2(a__and(a__isNat(M), a__and(a__isNat(N), a__isNatIList(IL))), M, N, IL)
a__uTake2(tt, M, N, IL) → cons(mark(N), take(M, IL))
a__length(cons(N, L)) → a__uLength(a__and(a__isNat(N), a__isNatList(L)), L)
a__uLength(tt, L) → s(a__length(mark(L)))
mark(and(X1, X2)) → a__and(mark(X1), mark(X2))
mark(isNatIList(X)) → a__isNatIList(X)
mark(isNatList(X)) → a__isNatList(X)
mark(isNat(X)) → a__isNat(X)
mark(length(X)) → a__length(mark(X))
mark(zeros) → a__zeros
mark(take(X1, X2)) → a__take(mark(X1), mark(X2))
mark(uTake1(X)) → a__uTake1(mark(X))
mark(uTake2(X1, X2, X3, X4)) → a__uTake2(mark(X1), X2, X3, X4)
mark(uLength(X1, X2)) → a__uLength(mark(X1), X2)
mark(tt) → tt
mark(0) → 0
mark(s(X)) → s(mark(X))
mark(cons(X1, X2)) → cons(mark(X1), X2)
mark(nil) → nil
a__and(X1, X2) → and(X1, X2)
a__isNatIList(X) → isNatIList(X)
a__isNatList(X) → isNatList(X)
a__isNat(X) → isNat(X)
a__length(X) → length(X)
a__zeros → zeros
a__take(X1, X2) → take(X1, X2)
a__uTake1(X) → uTake1(X)
a__uTake2(X1, X2, X3, X4) → uTake2(X1, X2, X3, X4)
a__uLength(X1, X2) → uLength(X1, X2)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ QDP

          ↳ QDPOrderProof

            ↳ QDP

              ↳ DependencyGraphProof

                ↳ AND

                  ↳ QDP

                    ↳ QDPOrderProof

                      ↳ QDP

                        ↳ QDPOrderProof

                          ↳ QDP

                            ↳ QDPOrderProof

                              ↳ QDP

                                ↳ QDPOrderProof

                                  ↳ QDP

                                    ↳ QDPOrderProof

                                      ↳ QDP

                                        ↳ QDPOrderProof

                                          ↳ QDP

                                            ↳ DependencyGraphProof

                                              ↳ AND

                                                ↳ QDP

                                                ↳ QDP

                  ↳ QDP

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

A__ISNATLIST(cons(N, L)) → A__AND(a__isNat(N), a__isNatList(L))
A__ISNATLIST(cons(N, L)) → A__ISNATLIST(L)
MARK(s(X)) → MARK(X)
A__ISNATILIST(cons(N, IL)) → A__ISNATILIST(IL)
MARK(and(X1, X2)) → MARK(X1)
MARK(isNatIList(X)) → A__ISNATILIST(X)
MARK(isNatList(X)) → A__ISNATLIST(X)
MARK(and(X1, X2)) → A__AND(mark(X1), mark(X2))
MARK(and(X1, X2)) → MARK(X2)
A__ISNATILIST(cons(N, IL)) → A__AND(a__isNat(N), a__isNatIList(IL))
A__AND(tt, T) → MARK(T)

The TRS R consists of the following rules:

a__and(tt, T) → mark(T)
a__isNatIList(IL) → a__isNatList(IL)
a__isNat(0) → tt
a__isNat(s(N)) → a__isNat(N)
a__isNat(length(L)) → a__isNatList(L)
a__isNatIList(zeros) → tt
a__isNatIList(cons(N, IL)) → a__and(a__isNat(N), a__isNatIList(IL))
a__isNatList(nil) → tt
a__isNatList(cons(N, L)) → a__and(a__isNat(N), a__isNatList(L))
a__isNatList(take(N, IL)) → a__and(a__isNat(N), a__isNatIList(IL))
a__zeros → cons(0, zeros)
a__take(0, IL) → a__uTake1(a__isNatIList(IL))
a__uTake1(tt) → nil
a__take(s(M), cons(N, IL)) → a__uTake2(a__and(a__isNat(M), a__and(a__isNat(N), a__isNatIList(IL))), M, N, IL)
a__uTake2(tt, M, N, IL) → cons(mark(N), take(M, IL))
a__length(cons(N, L)) → a__uLength(a__and(a__isNat(N), a__isNatList(L)), L)
a__uLength(tt, L) → s(a__length(mark(L)))
mark(and(X1, X2)) → a__and(mark(X1), mark(X2))
mark(isNatIList(X)) → a__isNatIList(X)
mark(isNatList(X)) → a__isNatList(X)
mark(isNat(X)) → a__isNat(X)
mark(length(X)) → a__length(mark(X))
mark(zeros) → a__zeros
mark(take(X1, X2)) → a__take(mark(X1), mark(X2))
mark(uTake1(X)) → a__uTake1(mark(X))
mark(uTake2(X1, X2, X3, X4)) → a__uTake2(mark(X1), X2, X3, X4)
mark(uLength(X1, X2)) → a__uLength(mark(X1), X2)
mark(tt) → tt
mark(0) → 0
mark(s(X)) → s(mark(X))
mark(cons(X1, X2)) → cons(mark(X1), X2)
mark(nil) → nil
a__and(X1, X2) → and(X1, X2)
a__isNatIList(X) → isNatIList(X)
a__isNatList(X) → isNatList(X)
a__isNat(X) → isNat(X)
a__length(X) → length(X)
a__zeros → zeros
a__take(X1, X2) → take(X1, X2)
a__uTake1(X) → uTake1(X)
a__uTake2(X1, X2, X3, X4) → uTake2(X1, X2, X3, X4)
a__uLength(X1, X2) → uLength(X1, X2)

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

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ QDP

          ↳ QDPOrderProof

            ↳ QDP

              ↳ DependencyGraphProof

                ↳ AND

                  ↳ QDP

                  ↳ QDP

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

A__LENGTH(cons(N, L)) → A__ULENGTH(a__and(a__isNat(N), a__isNatList(L)), L)
A__ULENGTH(tt, L) → A__LENGTH(mark(L))

The TRS R consists of the following rules:

a__and(tt, T) → mark(T)
a__isNatIList(IL) → a__isNatList(IL)
a__isNat(0) → tt
a__isNat(s(N)) → a__isNat(N)
a__isNat(length(L)) → a__isNatList(L)
a__isNatIList(zeros) → tt
a__isNatIList(cons(N, IL)) → a__and(a__isNat(N), a__isNatIList(IL))
a__isNatList(nil) → tt
a__isNatList(cons(N, L)) → a__and(a__isNat(N), a__isNatList(L))
a__isNatList(take(N, IL)) → a__and(a__isNat(N), a__isNatIList(IL))
a__zeros → cons(0, zeros)
a__take(0, IL) → a__uTake1(a__isNatIList(IL))
a__uTake1(tt) → nil
a__take(s(M), cons(N, IL)) → a__uTake2(a__and(a__isNat(M), a__and(a__isNat(N), a__isNatIList(IL))), M, N, IL)
a__uTake2(tt, M, N, IL) → cons(mark(N), take(M, IL))
a__length(cons(N, L)) → a__uLength(a__and(a__isNat(N), a__isNatList(L)), L)
a__uLength(tt, L) → s(a__length(mark(L)))
mark(and(X1, X2)) → a__and(mark(X1), mark(X2))
mark(isNatIList(X)) → a__isNatIList(X)
mark(isNatList(X)) → a__isNatList(X)
mark(isNat(X)) → a__isNat(X)
mark(length(X)) → a__length(mark(X))
mark(zeros) → a__zeros
mark(take(X1, X2)) → a__take(mark(X1), mark(X2))
mark(uTake1(X)) → a__uTake1(mark(X))
mark(uTake2(X1, X2, X3, X4)) → a__uTake2(mark(X1), X2, X3, X4)
mark(uLength(X1, X2)) → a__uLength(mark(X1), X2)
mark(tt) → tt
mark(0) → 0
mark(s(X)) → s(mark(X))
mark(cons(X1, X2)) → cons(mark(X1), X2)
mark(nil) → nil
a__and(X1, X2) → and(X1, X2)
a__isNatIList(X) → isNatIList(X)
a__isNatList(X) → isNatList(X)
a__isNat(X) → isNat(X)
a__length(X) → length(X)
a__zeros → zeros
a__take(X1, X2) → take(X1, X2)
a__uTake1(X) → uTake1(X)
a__uTake2(X1, X2, X3, X4) → uTake2(X1, X2, X3, X4)
a__uLength(X1, X2) → uLength(X1, X2)

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