Termination w.r.t. Q proof of /tmp/tmpxNEg1M/LengthOfFiniteLists_nokinds

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

0 QTRS

↳1 QTRSRRRProof (⇔, 180 ms)

↳2 QTRS

↳3 QTRSRRRProof (⇔, 78 ms)

↳4 QTRS

↳5 QTRSRRRProof (⇔, 70 ms)

↳6 QTRS

↳7 DependencyPairsProof (⇔, 0 ms)

↳8 QDP

↳9 DependencyGraphProof (⇔, 0 ms)

↳10 QDP

↳11 MRRProof (⇔, 41 ms)

↳12 QDP

↳13 DependencyGraphProof (⇔, 0 ms)

↳14 AND

    ↳15 QDP

        ↳16 MRRProof (⇔, 79 ms)

        ↳17 QDP

        ↳18 QDPOrderProof (⇔, 95 ms)

        ↳19 QDP

        ↳20 QDPOrderProof (⇔, 77 ms)

        ↳21 QDP

        ↳22 DependencyGraphProof (⇔, 0 ms)

        ↳23 AND

            ↳24 QDP

                ↳25 Narrowing (⇔, 0 ms)

                ↳26 QDP

                ↳27 DependencyGraphProof (⇔, 0 ms)

                ↳28 QDP

                ↳29 Narrowing (⇔, 0 ms)

                ↳30 QDP

                ↳31 DependencyGraphProof (⇔, 0 ms)

                ↳32 QDP

                ↳33 Instantiation (⇔, 0 ms)

                ↳34 QDP

                ↳35 DependencyGraphProof (⇔, 0 ms)

                ↳36 AND

                    ↳37 QDP

                        ↳38 MRRProof (⇔, 43 ms)

                        ↳39 QDP

                        ↳40 MRRProof (⇔, 32 ms)

                        ↳41 QDP

                        ↳42 MRRProof (⇔, 35 ms)

                        ↳43 QDP

                        ↳44 QDPOrderProof (⇔, 20 ms)

                        ↳45 QDP

                        ↳46 QDPOrderProof (⇔, 6 ms)

                        ↳47 QDP

                        ↳48 QDPOrderProof (⇔, 19 ms)

                        ↳49 QDP

                        ↳50 QDPOrderProof (⇔, 24 ms)

                        ↳51 QDP

                        ↳52 QDPOrderProof (⇔, 13 ms)

                        ↳53 QDP

                        ↳54 NonTerminationLoopProof (⇔, 2254 ms)

                        ↳55 NO

                    ↳56 QDP

                        ↳57 MRRProof (⇔, 41 ms)

                        ↳58 QDP

                        ↳59 MRRProof (⇔, 38 ms)

                        ↳60 QDP

                        ↳61 MRRProof (⇔, 34 ms)

                        ↳62 QDP

                        ↳63 QDPOrderProof (⇔, 35 ms)

                        ↳64 QDP

                        ↳65 QDPOrderProof (⇔, 0 ms)

                        ↳66 QDP

                        ↳67 QDPOrderProof (⇔, 15 ms)

                        ↳68 QDP

                        ↳69 QDPOrderProof (⇔, 24 ms)

                        ↳70 QDP

                        ↳71 QDPOrderProof (⇔, 0 ms)

                        ↳72 QDP

            ↳73 QDP

                ↳74 QDPOrderProof (⇔, 80 ms)

                ↳75 QDP

                ↳76 PisEmptyProof (⇔, 0 ms)

                ↳77 YES

    ↳78 QDP

        ↳79 QDPOrderProof (⇔, 124 ms)

        ↳80 QDP

        ↳81 DependencyGraphProof (⇔, 0 ms)

        ↳82 TRUE

(0) Obligation:

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

zeros → cons(0, n__zeros)
U11(tt, L) → s(length(activate(L)))
and(tt, X) → activate(X)
isNat(n__0) → tt
isNat(n__length(V1)) → isNatList(activate(V1))
isNat(n__s(V1)) → isNat(activate(V1))
isNatIList(V) → isNatList(activate(V))
isNatIList(n__zeros) → tt
isNatIList(n__cons(V1, V2)) → and(isNat(activate(V1)), n__isNatIList(activate(V2)))
isNatList(n__nil) → tt
isNatList(n__cons(V1, V2)) → and(isNat(activate(V1)), n__isNatList(activate(V2)))
length(nil) → 0
length(cons(N, L)) → U11(and(isNatList(activate(L)), n__isNat(N)), activate(L))
zeros → n__zeros
0 → n__0
length(X) → n__length(X)
s(X) → n__s(X)
cons(X1, X2) → n__cons(X1, X2)
isNatIList(X) → n__isNatIList(X)
nil → n__nil
isNatList(X) → n__isNatList(X)
isNat(X) → n__isNat(X)
activate(n__zeros) → zeros
activate(n__0) → 0
activate(n__length(X)) → length(X)
activate(n__s(X)) → s(X)
activate(n__cons(X1, X2)) → cons(X1, X2)
activate(n__isNatIList(X)) → isNatIList(X)
activate(n__nil) → nil
activate(n__isNatList(X)) → isNatList(X)
activate(n__isNat(X)) → isNat(X)
activate(X) → X

Q is empty.

(1) QTRSRRRProof (EQUIVALENT transformation)

Used ordering:
Polynomial interpretation [POLO]:

POL(0) = 0
POL(U11(x₁, x₂)) = x₁ + 2·x₂
POL(activate(x₁)) = x₁
POL(and(x₁, x₂)) = x₁ + x₂
POL(cons(x₁, x₂)) = 2·x₁ + 2·x₂
POL(isNat(x₁)) = x₁
POL(isNatIList(x₁)) = 2·x₁
POL(isNatList(x₁)) = x₁
POL(length(x₁)) = 2·x₁
POL(n__0) = 0
POL(n__cons(x₁, x₂)) = 2·x₁ + 2·x₂
POL(n__isNat(x₁)) = x₁
POL(n__isNatIList(x₁)) = 2·x₁
POL(n__isNatList(x₁)) = x₁
POL(n__length(x₁)) = 2·x₁
POL(n__nil) = 1
POL(n__s(x₁)) = x₁
POL(n__zeros) = 0
POL(nil) = 1
POL(s(x₁)) = x₁
POL(tt) = 0
POL(zeros) = 0

With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly:

isNatList(n__nil) → tt
length(nil) → 0

(2) Obligation:

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

zeros → cons(0, n__zeros)
U11(tt, L) → s(length(activate(L)))
and(tt, X) → activate(X)
isNat(n__0) → tt
isNat(n__length(V1)) → isNatList(activate(V1))
isNat(n__s(V1)) → isNat(activate(V1))
isNatIList(V) → isNatList(activate(V))
isNatIList(n__zeros) → tt
isNatIList(n__cons(V1, V2)) → and(isNat(activate(V1)), n__isNatIList(activate(V2)))
isNatList(n__cons(V1, V2)) → and(isNat(activate(V1)), n__isNatList(activate(V2)))
length(cons(N, L)) → U11(and(isNatList(activate(L)), n__isNat(N)), activate(L))
zeros → n__zeros
0 → n__0
length(X) → n__length(X)
s(X) → n__s(X)
cons(X1, X2) → n__cons(X1, X2)
isNatIList(X) → n__isNatIList(X)
nil → n__nil
isNatList(X) → n__isNatList(X)
isNat(X) → n__isNat(X)
activate(n__zeros) → zeros
activate(n__0) → 0
activate(n__length(X)) → length(X)
activate(n__s(X)) → s(X)
activate(n__cons(X1, X2)) → cons(X1, X2)
activate(n__isNatIList(X)) → isNatIList(X)
activate(n__nil) → nil
activate(n__isNatList(X)) → isNatList(X)
activate(n__isNat(X)) → isNat(X)
activate(X) → X

Q is empty.

(3) QTRSRRRProof (EQUIVALENT transformation)

Used ordering:
Polynomial interpretation [POLO]:

POL(0) = 0
POL(U11(x₁, x₂)) = 1 + x₁ + x₂
POL(activate(x₁)) = x₁
POL(and(x₁, x₂)) = x₁ + x₂
POL(cons(x₁, x₂)) = x₁ + 2·x₂
POL(isNat(x₁)) = x₁
POL(isNatIList(x₁)) = x₁
POL(isNatList(x₁)) = x₁
POL(length(x₁)) = 1 + x₁
POL(n__0) = 0
POL(n__cons(x₁, x₂)) = x₁ + 2·x₂
POL(n__isNat(x₁)) = x₁
POL(n__isNatIList(x₁)) = x₁
POL(n__isNatList(x₁)) = x₁
POL(n__length(x₁)) = 1 + x₁
POL(n__nil) = 0
POL(n__s(x₁)) = x₁
POL(n__zeros) = 0
POL(nil) = 0
POL(s(x₁)) = x₁
POL(tt) = 0
POL(zeros) = 0

With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly:

isNat(n__length(V1)) → isNatList(activate(V1))

(4) Obligation:

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

zeros → cons(0, n__zeros)
U11(tt, L) → s(length(activate(L)))
and(tt, X) → activate(X)
isNat(n__0) → tt
isNat(n__s(V1)) → isNat(activate(V1))
isNatIList(V) → isNatList(activate(V))
isNatIList(n__zeros) → tt
isNatIList(n__cons(V1, V2)) → and(isNat(activate(V1)), n__isNatIList(activate(V2)))
isNatList(n__cons(V1, V2)) → and(isNat(activate(V1)), n__isNatList(activate(V2)))
length(cons(N, L)) → U11(and(isNatList(activate(L)), n__isNat(N)), activate(L))
zeros → n__zeros
0 → n__0
length(X) → n__length(X)
s(X) → n__s(X)
cons(X1, X2) → n__cons(X1, X2)
isNatIList(X) → n__isNatIList(X)
nil → n__nil
isNatList(X) → n__isNatList(X)
isNat(X) → n__isNat(X)
activate(n__zeros) → zeros
activate(n__0) → 0
activate(n__length(X)) → length(X)
activate(n__s(X)) → s(X)
activate(n__cons(X1, X2)) → cons(X1, X2)
activate(n__isNatIList(X)) → isNatIList(X)
activate(n__nil) → nil
activate(n__isNatList(X)) → isNatList(X)
activate(n__isNat(X)) → isNat(X)
activate(X) → X

Q is empty.

(5) QTRSRRRProof (EQUIVALENT transformation)

Used ordering:
Polynomial interpretation [POLO]:

POL(0) = 0
POL(U11(x₁, x₂)) = x₁ + 2·x₂
POL(activate(x₁)) = x₁
POL(and(x₁, x₂)) = 2·x₁ + x₂
POL(cons(x₁, x₂)) = 2·x₁ + 2·x₂
POL(isNat(x₁)) = x₁
POL(isNatIList(x₁)) = 2 + x₁
POL(isNatList(x₁)) = x₁
POL(length(x₁)) = 2·x₁
POL(n__0) = 0
POL(n__cons(x₁, x₂)) = 2·x₁ + 2·x₂
POL(n__isNat(x₁)) = x₁
POL(n__isNatIList(x₁)) = 2 + x₁
POL(n__isNatList(x₁)) = x₁
POL(n__length(x₁)) = 2·x₁
POL(n__nil) = 0
POL(n__s(x₁)) = x₁
POL(n__zeros) = 0
POL(nil) = 0
POL(s(x₁)) = x₁
POL(tt) = 0
POL(zeros) = 0

With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly:

isNatIList(V) → isNatList(activate(V))
isNatIList(n__zeros) → tt

(6) Obligation:

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

zeros → cons(0, n__zeros)
U11(tt, L) → s(length(activate(L)))
and(tt, X) → activate(X)
isNat(n__0) → tt
isNat(n__s(V1)) → isNat(activate(V1))
isNatIList(n__cons(V1, V2)) → and(isNat(activate(V1)), n__isNatIList(activate(V2)))
isNatList(n__cons(V1, V2)) → and(isNat(activate(V1)), n__isNatList(activate(V2)))
length(cons(N, L)) → U11(and(isNatList(activate(L)), n__isNat(N)), activate(L))
zeros → n__zeros
0 → n__0
length(X) → n__length(X)
s(X) → n__s(X)
cons(X1, X2) → n__cons(X1, X2)
isNatIList(X) → n__isNatIList(X)
nil → n__nil
isNatList(X) → n__isNatList(X)
isNat(X) → n__isNat(X)
activate(n__zeros) → zeros
activate(n__0) → 0
activate(n__length(X)) → length(X)
activate(n__s(X)) → s(X)
activate(n__cons(X1, X2)) → cons(X1, X2)
activate(n__isNatIList(X)) → isNatIList(X)
activate(n__nil) → nil
activate(n__isNatList(X)) → isNatList(X)
activate(n__isNat(X)) → isNat(X)
activate(X) → X

Q is empty.

(7) DependencyPairsProof (EQUIVALENT transformation)

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

(8) Obligation:

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

ZEROS → CONS(0, n__zeros)
ZEROS → 0¹
U11¹(tt, L) → S(length(activate(L)))
U11¹(tt, L) → LENGTH(activate(L))
U11¹(tt, L) → ACTIVATE(L)
AND(tt, X) → ACTIVATE(X)
ISNAT(n__s(V1)) → ISNAT(activate(V1))
ISNAT(n__s(V1)) → ACTIVATE(V1)
ISNATILIST(n__cons(V1, V2)) → AND(isNat(activate(V1)), n__isNatIList(activate(V2)))
ISNATILIST(n__cons(V1, V2)) → ISNAT(activate(V1))
ISNATILIST(n__cons(V1, V2)) → ACTIVATE(V1)
ISNATILIST(n__cons(V1, V2)) → ACTIVATE(V2)
ISNATLIST(n__cons(V1, V2)) → AND(isNat(activate(V1)), n__isNatList(activate(V2)))
ISNATLIST(n__cons(V1, V2)) → ISNAT(activate(V1))
ISNATLIST(n__cons(V1, V2)) → ACTIVATE(V1)
ISNATLIST(n__cons(V1, V2)) → ACTIVATE(V2)
LENGTH(cons(N, L)) → U11¹(and(isNatList(activate(L)), n__isNat(N)), activate(L))
LENGTH(cons(N, L)) → AND(isNatList(activate(L)), n__isNat(N))
LENGTH(cons(N, L)) → ISNATLIST(activate(L))
LENGTH(cons(N, L)) → ACTIVATE(L)
ACTIVATE(n__zeros) → ZEROS
ACTIVATE(n__0) → 0¹
ACTIVATE(n__length(X)) → LENGTH(X)
ACTIVATE(n__s(X)) → S(X)
ACTIVATE(n__cons(X1, X2)) → CONS(X1, X2)
ACTIVATE(n__isNatIList(X)) → ISNATILIST(X)
ACTIVATE(n__nil) → NIL
ACTIVATE(n__isNatList(X)) → ISNATLIST(X)
ACTIVATE(n__isNat(X)) → ISNAT(X)

The TRS R consists of the following rules:

zeros → cons(0, n__zeros)
U11(tt, L) → s(length(activate(L)))
and(tt, X) → activate(X)
isNat(n__0) → tt
isNat(n__s(V1)) → isNat(activate(V1))
isNatIList(n__cons(V1, V2)) → and(isNat(activate(V1)), n__isNatIList(activate(V2)))
isNatList(n__cons(V1, V2)) → and(isNat(activate(V1)), n__isNatList(activate(V2)))
length(cons(N, L)) → U11(and(isNatList(activate(L)), n__isNat(N)), activate(L))
zeros → n__zeros
0 → n__0
length(X) → n__length(X)
s(X) → n__s(X)
cons(X1, X2) → n__cons(X1, X2)
isNatIList(X) → n__isNatIList(X)
nil → n__nil
isNatList(X) → n__isNatList(X)
isNat(X) → n__isNat(X)
activate(n__zeros) → zeros
activate(n__0) → 0
activate(n__length(X)) → length(X)
activate(n__s(X)) → s(X)
activate(n__cons(X1, X2)) → cons(X1, X2)
activate(n__isNatIList(X)) → isNatIList(X)
activate(n__nil) → nil
activate(n__isNatList(X)) → isNatList(X)
activate(n__isNat(X)) → isNat(X)
activate(X) → X

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

(9) DependencyGraphProof (EQUIVALENT transformation)

The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 1 SCC with 8 less nodes.

(10) Obligation:

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

ACTIVATE(n__length(X)) → LENGTH(X)
LENGTH(cons(N, L)) → U11¹(and(isNatList(activate(L)), n__isNat(N)), activate(L))
U11¹(tt, L) → LENGTH(activate(L))
LENGTH(cons(N, L)) → AND(isNatList(activate(L)), n__isNat(N))
AND(tt, X) → ACTIVATE(X)
ACTIVATE(n__isNatIList(X)) → ISNATILIST(X)
ISNATILIST(n__cons(V1, V2)) → AND(isNat(activate(V1)), n__isNatIList(activate(V2)))
ISNATILIST(n__cons(V1, V2)) → ISNAT(activate(V1))
ISNAT(n__s(V1)) → ISNAT(activate(V1))
ISNAT(n__s(V1)) → ACTIVATE(V1)
ACTIVATE(n__isNatList(X)) → ISNATLIST(X)
ISNATLIST(n__cons(V1, V2)) → AND(isNat(activate(V1)), n__isNatList(activate(V2)))
ISNATLIST(n__cons(V1, V2)) → ISNAT(activate(V1))
ISNATLIST(n__cons(V1, V2)) → ACTIVATE(V1)
ACTIVATE(n__isNat(X)) → ISNAT(X)
ISNATLIST(n__cons(V1, V2)) → ACTIVATE(V2)
ISNATILIST(n__cons(V1, V2)) → ACTIVATE(V1)
ISNATILIST(n__cons(V1, V2)) → ACTIVATE(V2)
LENGTH(cons(N, L)) → ISNATLIST(activate(L))
LENGTH(cons(N, L)) → ACTIVATE(L)
U11¹(tt, L) → ACTIVATE(L)

The TRS R consists of the following rules:

zeros → cons(0, n__zeros)
U11(tt, L) → s(length(activate(L)))
and(tt, X) → activate(X)
isNat(n__0) → tt
isNat(n__s(V1)) → isNat(activate(V1))
isNatIList(n__cons(V1, V2)) → and(isNat(activate(V1)), n__isNatIList(activate(V2)))
isNatList(n__cons(V1, V2)) → and(isNat(activate(V1)), n__isNatList(activate(V2)))
length(cons(N, L)) → U11(and(isNatList(activate(L)), n__isNat(N)), activate(L))
zeros → n__zeros
0 → n__0
length(X) → n__length(X)
s(X) → n__s(X)
cons(X1, X2) → n__cons(X1, X2)
isNatIList(X) → n__isNatIList(X)
nil → n__nil
isNatList(X) → n__isNatList(X)
isNat(X) → n__isNat(X)
activate(n__zeros) → zeros
activate(n__0) → 0
activate(n__length(X)) → length(X)
activate(n__s(X)) → s(X)
activate(n__cons(X1, X2)) → cons(X1, X2)
activate(n__isNatIList(X)) → isNatIList(X)
activate(n__nil) → nil
activate(n__isNatList(X)) → isNatList(X)
activate(n__isNat(X)) → isNat(X)
activate(X) → X

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

(11) MRRProof (EQUIVALENT transformation)

By using the rule removal processor [LPAR04] with the following ordering, at least one Dependency Pair or term rewrite system rule of this QDP problem can be strictly oriented.
Strictly oriented dependency pairs:

ACTIVATE(n__length(X)) → LENGTH(X)

Used ordering: Polynomial interpretation [POLO]:

POL(0) = 0
POL(ACTIVATE(x₁)) = x₁
POL(AND(x₁, x₂)) = x₁ + 2·x₂
POL(ISNAT(x₁)) = x₁
POL(ISNATILIST(x₁)) = 2·x₁
POL(ISNATLIST(x₁)) = x₁
POL(LENGTH(x₁)) = 2·x₁
POL(U11(x₁, x₂)) = 2 + 2·x₁ + 2·x₂
POL(U11¹(x₁, x₂)) = 2·x₁ + 2·x₂
POL(activate(x₁)) = x₁
POL(and(x₁, x₂)) = x₁ + x₂
POL(cons(x₁, x₂)) = x₁ + 2·x₂
POL(isNat(x₁)) = x₁
POL(isNatIList(x₁)) = 2·x₁
POL(isNatList(x₁)) = x₁
POL(length(x₁)) = 2 + 2·x₁
POL(n__0) = 0
POL(n__cons(x₁, x₂)) = x₁ + 2·x₂
POL(n__isNat(x₁)) = x₁
POL(n__isNatIList(x₁)) = 2·x₁
POL(n__isNatList(x₁)) = x₁
POL(n__length(x₁)) = 2 + 2·x₁
POL(n__nil) = 0
POL(n__s(x₁)) = x₁
POL(n__zeros) = 0
POL(nil) = 0
POL(s(x₁)) = x₁
POL(tt) = 0
POL(zeros) = 0

(12) Obligation:

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

LENGTH(cons(N, L)) → U11¹(and(isNatList(activate(L)), n__isNat(N)), activate(L))
U11¹(tt, L) → LENGTH(activate(L))
LENGTH(cons(N, L)) → AND(isNatList(activate(L)), n__isNat(N))
AND(tt, X) → ACTIVATE(X)
ACTIVATE(n__isNatIList(X)) → ISNATILIST(X)
ISNATILIST(n__cons(V1, V2)) → AND(isNat(activate(V1)), n__isNatIList(activate(V2)))
ISNATILIST(n__cons(V1, V2)) → ISNAT(activate(V1))
ISNAT(n__s(V1)) → ISNAT(activate(V1))
ISNAT(n__s(V1)) → ACTIVATE(V1)
ACTIVATE(n__isNatList(X)) → ISNATLIST(X)
ISNATLIST(n__cons(V1, V2)) → AND(isNat(activate(V1)), n__isNatList(activate(V2)))
ISNATLIST(n__cons(V1, V2)) → ISNAT(activate(V1))
ISNATLIST(n__cons(V1, V2)) → ACTIVATE(V1)
ACTIVATE(n__isNat(X)) → ISNAT(X)
ISNATLIST(n__cons(V1, V2)) → ACTIVATE(V2)
ISNATILIST(n__cons(V1, V2)) → ACTIVATE(V1)
ISNATILIST(n__cons(V1, V2)) → ACTIVATE(V2)
LENGTH(cons(N, L)) → ISNATLIST(activate(L))
LENGTH(cons(N, L)) → ACTIVATE(L)
U11¹(tt, L) → ACTIVATE(L)

The TRS R consists of the following rules:

zeros → cons(0, n__zeros)
U11(tt, L) → s(length(activate(L)))
and(tt, X) → activate(X)
isNat(n__0) → tt
isNat(n__s(V1)) → isNat(activate(V1))
isNatIList(n__cons(V1, V2)) → and(isNat(activate(V1)), n__isNatIList(activate(V2)))
isNatList(n__cons(V1, V2)) → and(isNat(activate(V1)), n__isNatList(activate(V2)))
length(cons(N, L)) → U11(and(isNatList(activate(L)), n__isNat(N)), activate(L))
zeros → n__zeros
0 → n__0
length(X) → n__length(X)
s(X) → n__s(X)
cons(X1, X2) → n__cons(X1, X2)
isNatIList(X) → n__isNatIList(X)
nil → n__nil
isNatList(X) → n__isNatList(X)
isNat(X) → n__isNat(X)
activate(n__zeros) → zeros
activate(n__0) → 0
activate(n__length(X)) → length(X)
activate(n__s(X)) → s(X)
activate(n__cons(X1, X2)) → cons(X1, X2)
activate(n__isNatIList(X)) → isNatIList(X)
activate(n__nil) → nil
activate(n__isNatList(X)) → isNatList(X)
activate(n__isNat(X)) → isNat(X)
activate(X) → X

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

(13) DependencyGraphProof (EQUIVALENT transformation)

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

(14) Complex Obligation (AND)

(15) Obligation:

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

ACTIVATE(n__isNatIList(X)) → ISNATILIST(X)
ISNATILIST(n__cons(V1, V2)) → AND(isNat(activate(V1)), n__isNatIList(activate(V2)))
AND(tt, X) → ACTIVATE(X)
ACTIVATE(n__isNatList(X)) → ISNATLIST(X)
ISNATLIST(n__cons(V1, V2)) → AND(isNat(activate(V1)), n__isNatList(activate(V2)))
ISNATLIST(n__cons(V1, V2)) → ISNAT(activate(V1))
ISNAT(n__s(V1)) → ISNAT(activate(V1))
ISNAT(n__s(V1)) → ACTIVATE(V1)
ACTIVATE(n__isNat(X)) → ISNAT(X)
ISNATLIST(n__cons(V1, V2)) → ACTIVATE(V1)
ISNATLIST(n__cons(V1, V2)) → ACTIVATE(V2)
ISNATILIST(n__cons(V1, V2)) → ISNAT(activate(V1))
ISNATILIST(n__cons(V1, V2)) → ACTIVATE(V1)
ISNATILIST(n__cons(V1, V2)) → ACTIVATE(V2)

The TRS R consists of the following rules:

zeros → cons(0, n__zeros)
U11(tt, L) → s(length(activate(L)))
and(tt, X) → activate(X)
isNat(n__0) → tt
isNat(n__s(V1)) → isNat(activate(V1))
isNatIList(n__cons(V1, V2)) → and(isNat(activate(V1)), n__isNatIList(activate(V2)))
isNatList(n__cons(V1, V2)) → and(isNat(activate(V1)), n__isNatList(activate(V2)))
length(cons(N, L)) → U11(and(isNatList(activate(L)), n__isNat(N)), activate(L))
zeros → n__zeros
0 → n__0
length(X) → n__length(X)
s(X) → n__s(X)
cons(X1, X2) → n__cons(X1, X2)
isNatIList(X) → n__isNatIList(X)
nil → n__nil
isNatList(X) → n__isNatList(X)
isNat(X) → n__isNat(X)
activate(n__zeros) → zeros
activate(n__0) → 0
activate(n__length(X)) → length(X)
activate(n__s(X)) → s(X)
activate(n__cons(X1, X2)) → cons(X1, X2)
activate(n__isNatIList(X)) → isNatIList(X)
activate(n__nil) → nil
activate(n__isNatList(X)) → isNatList(X)
activate(n__isNat(X)) → isNat(X)
activate(X) → X

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

(16) MRRProof (EQUIVALENT transformation)

ISNATILIST(n__cons(V1, V2)) → ISNAT(activate(V1))
ISNATILIST(n__cons(V1, V2)) → ACTIVATE(V1)
ISNATILIST(n__cons(V1, V2)) → ACTIVATE(V2)

Used ordering: Polynomial interpretation [POLO]:

POL(0) = 0
POL(ACTIVATE(x₁)) = x₁
POL(AND(x₁, x₂)) = 2·x₁ + x₂
POL(ISNAT(x₁)) = x₁
POL(ISNATILIST(x₁)) = 1 + 2·x₁
POL(ISNATLIST(x₁)) = 2·x₁
POL(U11(x₁, x₂)) = x₁ + 2·x₂
POL(activate(x₁)) = x₁
POL(and(x₁, x₂)) = x₁ + x₂
POL(cons(x₁, x₂)) = x₁ + 2·x₂
POL(isNat(x₁)) = x₁
POL(isNatIList(x₁)) = 1 + 2·x₁
POL(isNatList(x₁)) = 2·x₁
POL(length(x₁)) = 2·x₁
POL(n__0) = 0
POL(n__cons(x₁, x₂)) = x₁ + 2·x₂
POL(n__isNat(x₁)) = x₁
POL(n__isNatIList(x₁)) = 1 + 2·x₁
POL(n__isNatList(x₁)) = 2·x₁
POL(n__length(x₁)) = 2·x₁
POL(n__nil) = 0
POL(n__s(x₁)) = x₁
POL(n__zeros) = 0
POL(nil) = 0
POL(s(x₁)) = x₁
POL(tt) = 0
POL(zeros) = 0

(17) Obligation:

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

ACTIVATE(n__isNatIList(X)) → ISNATILIST(X)
ISNATILIST(n__cons(V1, V2)) → AND(isNat(activate(V1)), n__isNatIList(activate(V2)))
AND(tt, X) → ACTIVATE(X)
ACTIVATE(n__isNatList(X)) → ISNATLIST(X)
ISNATLIST(n__cons(V1, V2)) → AND(isNat(activate(V1)), n__isNatList(activate(V2)))
ISNATLIST(n__cons(V1, V2)) → ISNAT(activate(V1))
ISNAT(n__s(V1)) → ISNAT(activate(V1))
ISNAT(n__s(V1)) → ACTIVATE(V1)
ACTIVATE(n__isNat(X)) → ISNAT(X)
ISNATLIST(n__cons(V1, V2)) → ACTIVATE(V1)
ISNATLIST(n__cons(V1, V2)) → ACTIVATE(V2)

The TRS R consists of the following rules:

zeros → cons(0, n__zeros)
U11(tt, L) → s(length(activate(L)))
and(tt, X) → activate(X)
isNat(n__0) → tt
isNat(n__s(V1)) → isNat(activate(V1))
isNatIList(n__cons(V1, V2)) → and(isNat(activate(V1)), n__isNatIList(activate(V2)))
isNatList(n__cons(V1, V2)) → and(isNat(activate(V1)), n__isNatList(activate(V2)))
length(cons(N, L)) → U11(and(isNatList(activate(L)), n__isNat(N)), activate(L))
zeros → n__zeros
0 → n__0
length(X) → n__length(X)
s(X) → n__s(X)
cons(X1, X2) → n__cons(X1, X2)
isNatIList(X) → n__isNatIList(X)
nil → n__nil
isNatList(X) → n__isNatList(X)
isNat(X) → n__isNat(X)
activate(n__zeros) → zeros
activate(n__0) → 0
activate(n__length(X)) → length(X)
activate(n__s(X)) → s(X)
activate(n__cons(X1, X2)) → cons(X1, X2)
activate(n__isNatIList(X)) → isNatIList(X)
activate(n__nil) → nil
activate(n__isNatList(X)) → isNatList(X)
activate(n__isNat(X)) → isNat(X)
activate(X) → X

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

(18) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04,JAR06].

The following pairs can be oriented strictly and are deleted.

ACTIVATE(n__isNat(X)) → ISNAT(X)

The remaining pairs can at least be oriented weakly.
Used ordering: Polynomial interpretation [POLO]:

POL(0) = 0
POL(ACTIVATE(x₁)) = x₁
POL(AND(x₁, x₂)) = x₂
POL(ISNAT(x₁)) = x₁
POL(ISNATILIST(x₁)) = 0
POL(ISNATLIST(x₁)) = x₁
POL(U11(x₁, x₂)) = 0
POL(activate(x₁)) = x₁
POL(and(x₁, x₂)) = x₂
POL(cons(x₁, x₂)) = x₁ + x₂
POL(isNat(x₁)) = 1 + x₁
POL(isNatIList(x₁)) = 0
POL(isNatList(x₁)) = x₁
POL(length(x₁)) = 0
POL(n__0) = 0
POL(n__cons(x₁, x₂)) = x₁ + x₂
POL(n__isNat(x₁)) = 1 + x₁
POL(n__isNatIList(x₁)) = 0
POL(n__isNatList(x₁)) = x₁
POL(n__length(x₁)) = 0
POL(n__nil) = 0
POL(n__s(x₁)) = x₁
POL(n__zeros) = 0
POL(nil) = 0
POL(s(x₁)) = x₁
POL(tt) = 0
POL(zeros) = 0

The following usable rules [FROCOS05] with respect to the argument filtering of the ordering [JAR06] were oriented:

activate(n__zeros) → zeros
activate(n__0) → 0
activate(n__length(X)) → length(X)
activate(n__s(X)) → s(X)
activate(n__cons(X1, X2)) → cons(X1, X2)
activate(n__isNatIList(X)) → isNatIList(X)
isNatIList(n__cons(V1, V2)) → and(isNat(activate(V1)), n__isNatIList(activate(V2)))
and(tt, X) → activate(X)
activate(n__isNatList(X)) → isNatList(X)
isNatList(n__cons(V1, V2)) → and(isNat(activate(V1)), n__isNatList(activate(V2)))
activate(n__nil) → nil
activate(n__isNat(X)) → isNat(X)
activate(X) → X
isNat(n__0) → tt
isNat(n__s(V1)) → isNat(activate(V1))
isNat(X) → n__isNat(X)
length(X) → n__length(X)
length(cons(N, L)) → U11(and(isNatList(activate(L)), n__isNat(N)), activate(L))
isNatList(X) → n__isNatList(X)
isNatIList(X) → n__isNatIList(X)
U11(tt, L) → s(length(activate(L)))
s(X) → n__s(X)
zeros → cons(0, n__zeros)
zeros → n__zeros
0 → n__0
cons(X1, X2) → n__cons(X1, X2)
nil → n__nil

(19) Obligation:

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

ACTIVATE(n__isNatIList(X)) → ISNATILIST(X)
ISNATILIST(n__cons(V1, V2)) → AND(isNat(activate(V1)), n__isNatIList(activate(V2)))
AND(tt, X) → ACTIVATE(X)
ACTIVATE(n__isNatList(X)) → ISNATLIST(X)
ISNATLIST(n__cons(V1, V2)) → AND(isNat(activate(V1)), n__isNatList(activate(V2)))
ISNATLIST(n__cons(V1, V2)) → ISNAT(activate(V1))
ISNAT(n__s(V1)) → ISNAT(activate(V1))
ISNAT(n__s(V1)) → ACTIVATE(V1)
ISNATLIST(n__cons(V1, V2)) → ACTIVATE(V1)
ISNATLIST(n__cons(V1, V2)) → ACTIVATE(V2)

The TRS R consists of the following rules:

zeros → cons(0, n__zeros)
U11(tt, L) → s(length(activate(L)))
and(tt, X) → activate(X)
isNat(n__0) → tt
isNat(n__s(V1)) → isNat(activate(V1))
isNatIList(n__cons(V1, V2)) → and(isNat(activate(V1)), n__isNatIList(activate(V2)))
isNatList(n__cons(V1, V2)) → and(isNat(activate(V1)), n__isNatList(activate(V2)))
length(cons(N, L)) → U11(and(isNatList(activate(L)), n__isNat(N)), activate(L))
zeros → n__zeros
0 → n__0
length(X) → n__length(X)
s(X) → n__s(X)
cons(X1, X2) → n__cons(X1, X2)
isNatIList(X) → n__isNatIList(X)
nil → n__nil
isNatList(X) → n__isNatList(X)
isNat(X) → n__isNat(X)
activate(n__zeros) → zeros
activate(n__0) → 0
activate(n__length(X)) → length(X)
activate(n__s(X)) → s(X)
activate(n__cons(X1, X2)) → cons(X1, X2)
activate(n__isNatIList(X)) → isNatIList(X)
activate(n__nil) → nil
activate(n__isNatList(X)) → isNatList(X)
activate(n__isNat(X)) → isNat(X)
activate(X) → X

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

(20) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04,JAR06].

The following pairs can be oriented strictly and are deleted.

ISNATLIST(n__cons(V1, V2)) → ISNAT(activate(V1))
ISNATLIST(n__cons(V1, V2)) → ACTIVATE(V1)
ISNATLIST(n__cons(V1, V2)) → ACTIVATE(V2)

The remaining pairs can at least be oriented weakly.
Used ordering: Polynomial interpretation [POLO]:

POL(0) = 0
POL(ACTIVATE(x₁)) = x₁
POL(AND(x₁, x₂)) = x₂
POL(ISNAT(x₁)) = x₁
POL(ISNATILIST(x₁)) = 0
POL(ISNATLIST(x₁)) = 1 + x₁
POL(U11(x₁, x₂)) = 0
POL(activate(x₁)) = x₁
POL(and(x₁, x₂)) = x₂
POL(cons(x₁, x₂)) = x₁ + x₂
POL(isNat(x₁)) = 0
POL(isNatIList(x₁)) = 0
POL(isNatList(x₁)) = 1 + x₁
POL(length(x₁)) = 0
POL(n__0) = 0
POL(n__cons(x₁, x₂)) = x₁ + x₂
POL(n__isNat(x₁)) = 0
POL(n__isNatIList(x₁)) = 0
POL(n__isNatList(x₁)) = 1 + x₁
POL(n__length(x₁)) = 0
POL(n__nil) = 1
POL(n__s(x₁)) = x₁
POL(n__zeros) = 0
POL(nil) = 1
POL(s(x₁)) = x₁
POL(tt) = 0
POL(zeros) = 0

The following usable rules [FROCOS05] with respect to the argument filtering of the ordering [JAR06] were oriented:

activate(n__zeros) → zeros
activate(n__0) → 0
activate(n__length(X)) → length(X)
activate(n__s(X)) → s(X)
activate(n__cons(X1, X2)) → cons(X1, X2)
activate(n__isNatIList(X)) → isNatIList(X)
isNatIList(n__cons(V1, V2)) → and(isNat(activate(V1)), n__isNatIList(activate(V2)))
and(tt, X) → activate(X)
activate(n__isNatList(X)) → isNatList(X)
isNatList(n__cons(V1, V2)) → and(isNat(activate(V1)), n__isNatList(activate(V2)))
activate(n__nil) → nil
activate(n__isNat(X)) → isNat(X)
activate(X) → X
isNat(n__0) → tt
isNat(n__s(V1)) → isNat(activate(V1))
isNat(X) → n__isNat(X)
length(X) → n__length(X)
length(cons(N, L)) → U11(and(isNatList(activate(L)), n__isNat(N)), activate(L))
isNatList(X) → n__isNatList(X)
isNatIList(X) → n__isNatIList(X)
U11(tt, L) → s(length(activate(L)))
s(X) → n__s(X)
zeros → cons(0, n__zeros)
zeros → n__zeros
0 → n__0
cons(X1, X2) → n__cons(X1, X2)
nil → n__nil

(21) Obligation:

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

ACTIVATE(n__isNatIList(X)) → ISNATILIST(X)
ISNATILIST(n__cons(V1, V2)) → AND(isNat(activate(V1)), n__isNatIList(activate(V2)))
AND(tt, X) → ACTIVATE(X)
ACTIVATE(n__isNatList(X)) → ISNATLIST(X)
ISNATLIST(n__cons(V1, V2)) → AND(isNat(activate(V1)), n__isNatList(activate(V2)))
ISNAT(n__s(V1)) → ISNAT(activate(V1))
ISNAT(n__s(V1)) → ACTIVATE(V1)

The TRS R consists of the following rules:

zeros → cons(0, n__zeros)
U11(tt, L) → s(length(activate(L)))
and(tt, X) → activate(X)
isNat(n__0) → tt
isNat(n__s(V1)) → isNat(activate(V1))
isNatIList(n__cons(V1, V2)) → and(isNat(activate(V1)), n__isNatIList(activate(V2)))
isNatList(n__cons(V1, V2)) → and(isNat(activate(V1)), n__isNatList(activate(V2)))
length(cons(N, L)) → U11(and(isNatList(activate(L)), n__isNat(N)), activate(L))
zeros → n__zeros
0 → n__0
length(X) → n__length(X)
s(X) → n__s(X)
cons(X1, X2) → n__cons(X1, X2)
isNatIList(X) → n__isNatIList(X)
nil → n__nil
isNatList(X) → n__isNatList(X)
isNat(X) → n__isNat(X)
activate(n__zeros) → zeros
activate(n__0) → 0
activate(n__length(X)) → length(X)
activate(n__s(X)) → s(X)
activate(n__cons(X1, X2)) → cons(X1, X2)
activate(n__isNatIList(X)) → isNatIList(X)
activate(n__nil) → nil
activate(n__isNatList(X)) → isNatList(X)
activate(n__isNat(X)) → isNat(X)
activate(X) → X

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

(22) DependencyGraphProof (EQUIVALENT transformation)

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

(23) Complex Obligation (AND)

(24) Obligation:

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

ISNATILIST(n__cons(V1, V2)) → AND(isNat(activate(V1)), n__isNatIList(activate(V2)))
AND(tt, X) → ACTIVATE(X)
ACTIVATE(n__isNatIList(X)) → ISNATILIST(X)
ACTIVATE(n__isNatList(X)) → ISNATLIST(X)
ISNATLIST(n__cons(V1, V2)) → AND(isNat(activate(V1)), n__isNatList(activate(V2)))

The TRS R consists of the following rules:

zeros → cons(0, n__zeros)
U11(tt, L) → s(length(activate(L)))
and(tt, X) → activate(X)
isNat(n__0) → tt
isNat(n__s(V1)) → isNat(activate(V1))
isNatIList(n__cons(V1, V2)) → and(isNat(activate(V1)), n__isNatIList(activate(V2)))
isNatList(n__cons(V1, V2)) → and(isNat(activate(V1)), n__isNatList(activate(V2)))
length(cons(N, L)) → U11(and(isNatList(activate(L)), n__isNat(N)), activate(L))
zeros → n__zeros
0 → n__0
length(X) → n__length(X)
s(X) → n__s(X)
cons(X1, X2) → n__cons(X1, X2)
isNatIList(X) → n__isNatIList(X)
nil → n__nil
isNatList(X) → n__isNatList(X)
isNat(X) → n__isNat(X)
activate(n__zeros) → zeros
activate(n__0) → 0
activate(n__length(X)) → length(X)
activate(n__s(X)) → s(X)
activate(n__cons(X1, X2)) → cons(X1, X2)
activate(n__isNatIList(X)) → isNatIList(X)
activate(n__nil) → nil
activate(n__isNatList(X)) → isNatList(X)
activate(n__isNat(X)) → isNat(X)
activate(X) → X

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

(25) Narrowing (EQUIVALENT transformation)

By narrowing [LPAR04] the rule ISNATILIST(n__cons(V1, V2)) → AND(isNat(activate(V1)), n__isNatIList(activate(V2))) at position [0] we obtained the following new rules [LPAR04]:

ISNATILIST(n__cons(y0, y1)) → AND(n__isNat(activate(y0)), n__isNatIList(activate(y1)))
ISNATILIST(n__cons(n__zeros, y1)) → AND(isNat(zeros), n__isNatIList(activate(y1)))
ISNATILIST(n__cons(n__0, y1)) → AND(isNat(0), n__isNatIList(activate(y1)))
ISNATILIST(n__cons(n__length(x0), y1)) → AND(isNat(length(x0)), n__isNatIList(activate(y1)))
ISNATILIST(n__cons(n__s(x0), y1)) → AND(isNat(s(x0)), n__isNatIList(activate(y1)))
ISNATILIST(n__cons(n__cons(x0, x1), y1)) → AND(isNat(cons(x0, x1)), n__isNatIList(activate(y1)))
ISNATILIST(n__cons(n__isNatIList(x0), y1)) → AND(isNat(isNatIList(x0)), n__isNatIList(activate(y1)))
ISNATILIST(n__cons(n__nil, y1)) → AND(isNat(nil), n__isNatIList(activate(y1)))
ISNATILIST(n__cons(n__isNatList(x0), y1)) → AND(isNat(isNatList(x0)), n__isNatIList(activate(y1)))
ISNATILIST(n__cons(n__isNat(x0), y1)) → AND(isNat(isNat(x0)), n__isNatIList(activate(y1)))
ISNATILIST(n__cons(x0, y1)) → AND(isNat(x0), n__isNatIList(activate(y1)))

(26) Obligation:

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

AND(tt, X) → ACTIVATE(X)
ACTIVATE(n__isNatIList(X)) → ISNATILIST(X)
ACTIVATE(n__isNatList(X)) → ISNATLIST(X)
ISNATLIST(n__cons(V1, V2)) → AND(isNat(activate(V1)), n__isNatList(activate(V2)))
ISNATILIST(n__cons(y0, y1)) → AND(n__isNat(activate(y0)), n__isNatIList(activate(y1)))
ISNATILIST(n__cons(n__zeros, y1)) → AND(isNat(zeros), n__isNatIList(activate(y1)))
ISNATILIST(n__cons(n__0, y1)) → AND(isNat(0), n__isNatIList(activate(y1)))
ISNATILIST(n__cons(n__length(x0), y1)) → AND(isNat(length(x0)), n__isNatIList(activate(y1)))
ISNATILIST(n__cons(n__s(x0), y1)) → AND(isNat(s(x0)), n__isNatIList(activate(y1)))
ISNATILIST(n__cons(n__cons(x0, x1), y1)) → AND(isNat(cons(x0, x1)), n__isNatIList(activate(y1)))
ISNATILIST(n__cons(n__isNatIList(x0), y1)) → AND(isNat(isNatIList(x0)), n__isNatIList(activate(y1)))
ISNATILIST(n__cons(n__nil, y1)) → AND(isNat(nil), n__isNatIList(activate(y1)))
ISNATILIST(n__cons(n__isNatList(x0), y1)) → AND(isNat(isNatList(x0)), n__isNatIList(activate(y1)))
ISNATILIST(n__cons(n__isNat(x0), y1)) → AND(isNat(isNat(x0)), n__isNatIList(activate(y1)))
ISNATILIST(n__cons(x0, y1)) → AND(isNat(x0), n__isNatIList(activate(y1)))

The TRS R consists of the following rules:

zeros → cons(0, n__zeros)
U11(tt, L) → s(length(activate(L)))
and(tt, X) → activate(X)
isNat(n__0) → tt
isNat(n__s(V1)) → isNat(activate(V1))
isNatIList(n__cons(V1, V2)) → and(isNat(activate(V1)), n__isNatIList(activate(V2)))
isNatList(n__cons(V1, V2)) → and(isNat(activate(V1)), n__isNatList(activate(V2)))
length(cons(N, L)) → U11(and(isNatList(activate(L)), n__isNat(N)), activate(L))
zeros → n__zeros
0 → n__0
length(X) → n__length(X)
s(X) → n__s(X)
cons(X1, X2) → n__cons(X1, X2)
isNatIList(X) → n__isNatIList(X)
nil → n__nil
isNatList(X) → n__isNatList(X)
isNat(X) → n__isNat(X)
activate(n__zeros) → zeros
activate(n__0) → 0
activate(n__length(X)) → length(X)
activate(n__s(X)) → s(X)
activate(n__cons(X1, X2)) → cons(X1, X2)
activate(n__isNatIList(X)) → isNatIList(X)
activate(n__nil) → nil
activate(n__isNatList(X)) → isNatList(X)
activate(n__isNat(X)) → isNat(X)
activate(X) → X

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

(27) DependencyGraphProof (EQUIVALENT transformation)

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

(28) Obligation:

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

ACTIVATE(n__isNatIList(X)) → ISNATILIST(X)
ISNATILIST(n__cons(n__zeros, y1)) → AND(isNat(zeros), n__isNatIList(activate(y1)))
AND(tt, X) → ACTIVATE(X)
ACTIVATE(n__isNatList(X)) → ISNATLIST(X)
ISNATLIST(n__cons(V1, V2)) → AND(isNat(activate(V1)), n__isNatList(activate(V2)))
ISNATILIST(n__cons(n__0, y1)) → AND(isNat(0), n__isNatIList(activate(y1)))
ISNATILIST(n__cons(n__length(x0), y1)) → AND(isNat(length(x0)), n__isNatIList(activate(y1)))
ISNATILIST(n__cons(n__s(x0), y1)) → AND(isNat(s(x0)), n__isNatIList(activate(y1)))
ISNATILIST(n__cons(n__cons(x0, x1), y1)) → AND(isNat(cons(x0, x1)), n__isNatIList(activate(y1)))
ISNATILIST(n__cons(n__isNatIList(x0), y1)) → AND(isNat(isNatIList(x0)), n__isNatIList(activate(y1)))
ISNATILIST(n__cons(n__nil, y1)) → AND(isNat(nil), n__isNatIList(activate(y1)))
ISNATILIST(n__cons(n__isNatList(x0), y1)) → AND(isNat(isNatList(x0)), n__isNatIList(activate(y1)))
ISNATILIST(n__cons(n__isNat(x0), y1)) → AND(isNat(isNat(x0)), n__isNatIList(activate(y1)))
ISNATILIST(n__cons(x0, y1)) → AND(isNat(x0), n__isNatIList(activate(y1)))

The TRS R consists of the following rules:

zeros → cons(0, n__zeros)
U11(tt, L) → s(length(activate(L)))
and(tt, X) → activate(X)
isNat(n__0) → tt
isNat(n__s(V1)) → isNat(activate(V1))
isNatIList(n__cons(V1, V2)) → and(isNat(activate(V1)), n__isNatIList(activate(V2)))
isNatList(n__cons(V1, V2)) → and(isNat(activate(V1)), n__isNatList(activate(V2)))
length(cons(N, L)) → U11(and(isNatList(activate(L)), n__isNat(N)), activate(L))
zeros → n__zeros
0 → n__0
length(X) → n__length(X)
s(X) → n__s(X)
cons(X1, X2) → n__cons(X1, X2)
isNatIList(X) → n__isNatIList(X)
nil → n__nil
isNatList(X) → n__isNatList(X)
isNat(X) → n__isNat(X)
activate(n__zeros) → zeros
activate(n__0) → 0
activate(n__length(X)) → length(X)
activate(n__s(X)) → s(X)
activate(n__cons(X1, X2)) → cons(X1, X2)
activate(n__isNatIList(X)) → isNatIList(X)
activate(n__nil) → nil
activate(n__isNatList(X)) → isNatList(X)
activate(n__isNat(X)) → isNat(X)
activate(X) → X

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

(29) Narrowing (EQUIVALENT transformation)

By narrowing [LPAR04] the rule ISNATLIST(n__cons(V1, V2)) → AND(isNat(activate(V1)), n__isNatList(activate(V2))) at position [0] we obtained the following new rules [LPAR04]:

ISNATLIST(n__cons(y0, y1)) → AND(n__isNat(activate(y0)), n__isNatList(activate(y1)))
ISNATLIST(n__cons(n__zeros, y1)) → AND(isNat(zeros), n__isNatList(activate(y1)))
ISNATLIST(n__cons(n__0, y1)) → AND(isNat(0), n__isNatList(activate(y1)))
ISNATLIST(n__cons(n__length(x0), y1)) → AND(isNat(length(x0)), n__isNatList(activate(y1)))
ISNATLIST(n__cons(n__s(x0), y1)) → AND(isNat(s(x0)), n__isNatList(activate(y1)))
ISNATLIST(n__cons(n__cons(x0, x1), y1)) → AND(isNat(cons(x0, x1)), n__isNatList(activate(y1)))
ISNATLIST(n__cons(n__isNatIList(x0), y1)) → AND(isNat(isNatIList(x0)), n__isNatList(activate(y1)))
ISNATLIST(n__cons(n__nil, y1)) → AND(isNat(nil), n__isNatList(activate(y1)))
ISNATLIST(n__cons(n__isNatList(x0), y1)) → AND(isNat(isNatList(x0)), n__isNatList(activate(y1)))
ISNATLIST(n__cons(n__isNat(x0), y1)) → AND(isNat(isNat(x0)), n__isNatList(activate(y1)))
ISNATLIST(n__cons(x0, y1)) → AND(isNat(x0), n__isNatList(activate(y1)))

(30) Obligation:

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

ACTIVATE(n__isNatIList(X)) → ISNATILIST(X)
ISNATILIST(n__cons(n__zeros, y1)) → AND(isNat(zeros), n__isNatIList(activate(y1)))
AND(tt, X) → ACTIVATE(X)
ACTIVATE(n__isNatList(X)) → ISNATLIST(X)
ISNATILIST(n__cons(n__0, y1)) → AND(isNat(0), n__isNatIList(activate(y1)))
ISNATILIST(n__cons(n__length(x0), y1)) → AND(isNat(length(x0)), n__isNatIList(activate(y1)))
ISNATILIST(n__cons(n__s(x0), y1)) → AND(isNat(s(x0)), n__isNatIList(activate(y1)))
ISNATILIST(n__cons(n__cons(x0, x1), y1)) → AND(isNat(cons(x0, x1)), n__isNatIList(activate(y1)))
ISNATILIST(n__cons(n__isNatIList(x0), y1)) → AND(isNat(isNatIList(x0)), n__isNatIList(activate(y1)))
ISNATILIST(n__cons(n__nil, y1)) → AND(isNat(nil), n__isNatIList(activate(y1)))
ISNATILIST(n__cons(n__isNatList(x0), y1)) → AND(isNat(isNatList(x0)), n__isNatIList(activate(y1)))
ISNATILIST(n__cons(n__isNat(x0), y1)) → AND(isNat(isNat(x0)), n__isNatIList(activate(y1)))
ISNATILIST(n__cons(x0, y1)) → AND(isNat(x0), n__isNatIList(activate(y1)))
ISNATLIST(n__cons(y0, y1)) → AND(n__isNat(activate(y0)), n__isNatList(activate(y1)))
ISNATLIST(n__cons(n__zeros, y1)) → AND(isNat(zeros), n__isNatList(activate(y1)))
ISNATLIST(n__cons(n__0, y1)) → AND(isNat(0), n__isNatList(activate(y1)))
ISNATLIST(n__cons(n__length(x0), y1)) → AND(isNat(length(x0)), n__isNatList(activate(y1)))
ISNATLIST(n__cons(n__s(x0), y1)) → AND(isNat(s(x0)), n__isNatList(activate(y1)))
ISNATLIST(n__cons(n__cons(x0, x1), y1)) → AND(isNat(cons(x0, x1)), n__isNatList(activate(y1)))
ISNATLIST(n__cons(n__isNatIList(x0), y1)) → AND(isNat(isNatIList(x0)), n__isNatList(activate(y1)))
ISNATLIST(n__cons(n__nil, y1)) → AND(isNat(nil), n__isNatList(activate(y1)))
ISNATLIST(n__cons(n__isNatList(x0), y1)) → AND(isNat(isNatList(x0)), n__isNatList(activate(y1)))
ISNATLIST(n__cons(n__isNat(x0), y1)) → AND(isNat(isNat(x0)), n__isNatList(activate(y1)))
ISNATLIST(n__cons(x0, y1)) → AND(isNat(x0), n__isNatList(activate(y1)))

The TRS R consists of the following rules:

zeros → cons(0, n__zeros)
U11(tt, L) → s(length(activate(L)))
and(tt, X) → activate(X)
isNat(n__0) → tt
isNat(n__s(V1)) → isNat(activate(V1))
isNatIList(n__cons(V1, V2)) → and(isNat(activate(V1)), n__isNatIList(activate(V2)))
isNatList(n__cons(V1, V2)) → and(isNat(activate(V1)), n__isNatList(activate(V2)))
length(cons(N, L)) → U11(and(isNatList(activate(L)), n__isNat(N)), activate(L))
zeros → n__zeros
0 → n__0
length(X) → n__length(X)
s(X) → n__s(X)
cons(X1, X2) → n__cons(X1, X2)
isNatIList(X) → n__isNatIList(X)
nil → n__nil
isNatList(X) → n__isNatList(X)
isNat(X) → n__isNat(X)
activate(n__zeros) → zeros
activate(n__0) → 0
activate(n__length(X)) → length(X)
activate(n__s(X)) → s(X)
activate(n__cons(X1, X2)) → cons(X1, X2)
activate(n__isNatIList(X)) → isNatIList(X)
activate(n__nil) → nil
activate(n__isNatList(X)) → isNatList(X)
activate(n__isNat(X)) → isNat(X)
activate(X) → X

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

(31) DependencyGraphProof (EQUIVALENT transformation)

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

(32) Obligation:

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

ISNATILIST(n__cons(n__zeros, y1)) → AND(isNat(zeros), n__isNatIList(activate(y1)))
AND(tt, X) → ACTIVATE(X)
ACTIVATE(n__isNatIList(X)) → ISNATILIST(X)
ISNATILIST(n__cons(n__0, y1)) → AND(isNat(0), n__isNatIList(activate(y1)))
ISNATILIST(n__cons(n__length(x0), y1)) → AND(isNat(length(x0)), n__isNatIList(activate(y1)))
ISNATILIST(n__cons(n__s(x0), y1)) → AND(isNat(s(x0)), n__isNatIList(activate(y1)))
ISNATILIST(n__cons(n__cons(x0, x1), y1)) → AND(isNat(cons(x0, x1)), n__isNatIList(activate(y1)))
ISNATILIST(n__cons(n__isNatIList(x0), y1)) → AND(isNat(isNatIList(x0)), n__isNatIList(activate(y1)))
ISNATILIST(n__cons(n__nil, y1)) → AND(isNat(nil), n__isNatIList(activate(y1)))
ISNATILIST(n__cons(n__isNatList(x0), y1)) → AND(isNat(isNatList(x0)), n__isNatIList(activate(y1)))
ISNATILIST(n__cons(n__isNat(x0), y1)) → AND(isNat(isNat(x0)), n__isNatIList(activate(y1)))
ISNATILIST(n__cons(x0, y1)) → AND(isNat(x0), n__isNatIList(activate(y1)))
ACTIVATE(n__isNatList(X)) → ISNATLIST(X)
ISNATLIST(n__cons(n__zeros, y1)) → AND(isNat(zeros), n__isNatList(activate(y1)))
ISNATLIST(n__cons(n__0, y1)) → AND(isNat(0), n__isNatList(activate(y1)))
ISNATLIST(n__cons(n__length(x0), y1)) → AND(isNat(length(x0)), n__isNatList(activate(y1)))
ISNATLIST(n__cons(n__s(x0), y1)) → AND(isNat(s(x0)), n__isNatList(activate(y1)))
ISNATLIST(n__cons(n__cons(x0, x1), y1)) → AND(isNat(cons(x0, x1)), n__isNatList(activate(y1)))
ISNATLIST(n__cons(n__isNatIList(x0), y1)) → AND(isNat(isNatIList(x0)), n__isNatList(activate(y1)))
ISNATLIST(n__cons(n__nil, y1)) → AND(isNat(nil), n__isNatList(activate(y1)))
ISNATLIST(n__cons(n__isNatList(x0), y1)) → AND(isNat(isNatList(x0)), n__isNatList(activate(y1)))
ISNATLIST(n__cons(n__isNat(x0), y1)) → AND(isNat(isNat(x0)), n__isNatList(activate(y1)))
ISNATLIST(n__cons(x0, y1)) → AND(isNat(x0), n__isNatList(activate(y1)))

The TRS R consists of the following rules:

zeros → cons(0, n__zeros)
U11(tt, L) → s(length(activate(L)))
and(tt, X) → activate(X)
isNat(n__0) → tt
isNat(n__s(V1)) → isNat(activate(V1))
isNatIList(n__cons(V1, V2)) → and(isNat(activate(V1)), n__isNatIList(activate(V2)))
isNatList(n__cons(V1, V2)) → and(isNat(activate(V1)), n__isNatList(activate(V2)))
length(cons(N, L)) → U11(and(isNatList(activate(L)), n__isNat(N)), activate(L))
zeros → n__zeros
0 → n__0
length(X) → n__length(X)
s(X) → n__s(X)
cons(X1, X2) → n__cons(X1, X2)
isNatIList(X) → n__isNatIList(X)
nil → n__nil
isNatList(X) → n__isNatList(X)
isNat(X) → n__isNat(X)
activate(n__zeros) → zeros
activate(n__0) → 0
activate(n__length(X)) → length(X)
activate(n__s(X)) → s(X)
activate(n__cons(X1, X2)) → cons(X1, X2)
activate(n__isNatIList(X)) → isNatIList(X)
activate(n__nil) → nil
activate(n__isNatList(X)) → isNatList(X)
activate(n__isNat(X)) → isNat(X)
activate(X) → X

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

(33) Instantiation (EQUIVALENT transformation)

By instantiating [LPAR04] the rule AND(tt, X) → ACTIVATE(X) we obtained the following new rules [LPAR04]:

AND(tt, n__isNatIList(y_3)) → ACTIVATE(n__isNatIList(y_3))
AND(tt, n__isNatList(y_3)) → ACTIVATE(n__isNatList(y_3))

(34) Obligation:

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

ISNATILIST(n__cons(n__zeros, y1)) → AND(isNat(zeros), n__isNatIList(activate(y1)))
ACTIVATE(n__isNatIList(X)) → ISNATILIST(X)
ISNATILIST(n__cons(n__0, y1)) → AND(isNat(0), n__isNatIList(activate(y1)))
ISNATILIST(n__cons(n__length(x0), y1)) → AND(isNat(length(x0)), n__isNatIList(activate(y1)))
ISNATILIST(n__cons(n__s(x0), y1)) → AND(isNat(s(x0)), n__isNatIList(activate(y1)))
ISNATILIST(n__cons(n__cons(x0, x1), y1)) → AND(isNat(cons(x0, x1)), n__isNatIList(activate(y1)))
ISNATILIST(n__cons(n__isNatIList(x0), y1)) → AND(isNat(isNatIList(x0)), n__isNatIList(activate(y1)))
ISNATILIST(n__cons(n__nil, y1)) → AND(isNat(nil), n__isNatIList(activate(y1)))
ISNATILIST(n__cons(n__isNatList(x0), y1)) → AND(isNat(isNatList(x0)), n__isNatIList(activate(y1)))
ISNATILIST(n__cons(n__isNat(x0), y1)) → AND(isNat(isNat(x0)), n__isNatIList(activate(y1)))
ISNATILIST(n__cons(x0, y1)) → AND(isNat(x0), n__isNatIList(activate(y1)))
ACTIVATE(n__isNatList(X)) → ISNATLIST(X)
ISNATLIST(n__cons(n__zeros, y1)) → AND(isNat(zeros), n__isNatList(activate(y1)))
ISNATLIST(n__cons(n__0, y1)) → AND(isNat(0), n__isNatList(activate(y1)))
ISNATLIST(n__cons(n__length(x0), y1)) → AND(isNat(length(x0)), n__isNatList(activate(y1)))
ISNATLIST(n__cons(n__s(x0), y1)) → AND(isNat(s(x0)), n__isNatList(activate(y1)))
ISNATLIST(n__cons(n__cons(x0, x1), y1)) → AND(isNat(cons(x0, x1)), n__isNatList(activate(y1)))
ISNATLIST(n__cons(n__isNatIList(x0), y1)) → AND(isNat(isNatIList(x0)), n__isNatList(activate(y1)))
ISNATLIST(n__cons(n__nil, y1)) → AND(isNat(nil), n__isNatList(activate(y1)))
ISNATLIST(n__cons(n__isNatList(x0), y1)) → AND(isNat(isNatList(x0)), n__isNatList(activate(y1)))
ISNATLIST(n__cons(n__isNat(x0), y1)) → AND(isNat(isNat(x0)), n__isNatList(activate(y1)))
ISNATLIST(n__cons(x0, y1)) → AND(isNat(x0), n__isNatList(activate(y1)))
AND(tt, n__isNatIList(y_3)) → ACTIVATE(n__isNatIList(y_3))
AND(tt, n__isNatList(y_3)) → ACTIVATE(n__isNatList(y_3))

The TRS R consists of the following rules:

zeros → cons(0, n__zeros)
U11(tt, L) → s(length(activate(L)))
and(tt, X) → activate(X)
isNat(n__0) → tt
isNat(n__s(V1)) → isNat(activate(V1))
isNatIList(n__cons(V1, V2)) → and(isNat(activate(V1)), n__isNatIList(activate(V2)))
isNatList(n__cons(V1, V2)) → and(isNat(activate(V1)), n__isNatList(activate(V2)))
length(cons(N, L)) → U11(and(isNatList(activate(L)), n__isNat(N)), activate(L))
zeros → n__zeros
0 → n__0
length(X) → n__length(X)
s(X) → n__s(X)
cons(X1, X2) → n__cons(X1, X2)
isNatIList(X) → n__isNatIList(X)
nil → n__nil
isNatList(X) → n__isNatList(X)
isNat(X) → n__isNat(X)
activate(n__zeros) → zeros
activate(n__0) → 0
activate(n__length(X)) → length(X)
activate(n__s(X)) → s(X)
activate(n__cons(X1, X2)) → cons(X1, X2)
activate(n__isNatIList(X)) → isNatIList(X)
activate(n__nil) → nil
activate(n__isNatList(X)) → isNatList(X)
activate(n__isNat(X)) → isNat(X)
activate(X) → X

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

(35) DependencyGraphProof (EQUIVALENT transformation)

The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 2 SCCs.

(36) Complex Obligation (AND)

(37) Obligation:

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

ISNATLIST(n__cons(n__zeros, y1)) → AND(isNat(zeros), n__isNatList(activate(y1)))
AND(tt, n__isNatList(y_3)) → ACTIVATE(n__isNatList(y_3))
ACTIVATE(n__isNatList(X)) → ISNATLIST(X)
ISNATLIST(n__cons(n__0, y1)) → AND(isNat(0), n__isNatList(activate(y1)))
ISNATLIST(n__cons(n__length(x0), y1)) → AND(isNat(length(x0)), n__isNatList(activate(y1)))
ISNATLIST(n__cons(n__s(x0), y1)) → AND(isNat(s(x0)), n__isNatList(activate(y1)))
ISNATLIST(n__cons(n__cons(x0, x1), y1)) → AND(isNat(cons(x0, x1)), n__isNatList(activate(y1)))
ISNATLIST(n__cons(n__isNatIList(x0), y1)) → AND(isNat(isNatIList(x0)), n__isNatList(activate(y1)))
ISNATLIST(n__cons(n__nil, y1)) → AND(isNat(nil), n__isNatList(activate(y1)))
ISNATLIST(n__cons(n__isNatList(x0), y1)) → AND(isNat(isNatList(x0)), n__isNatList(activate(y1)))
ISNATLIST(n__cons(n__isNat(x0), y1)) → AND(isNat(isNat(x0)), n__isNatList(activate(y1)))
ISNATLIST(n__cons(x0, y1)) → AND(isNat(x0), n__isNatList(activate(y1)))

The TRS R consists of the following rules:

zeros → cons(0, n__zeros)
U11(tt, L) → s(length(activate(L)))
and(tt, X) → activate(X)
isNat(n__0) → tt
isNat(n__s(V1)) → isNat(activate(V1))
isNatIList(n__cons(V1, V2)) → and(isNat(activate(V1)), n__isNatIList(activate(V2)))
isNatList(n__cons(V1, V2)) → and(isNat(activate(V1)), n__isNatList(activate(V2)))
length(cons(N, L)) → U11(and(isNatList(activate(L)), n__isNat(N)), activate(L))
zeros → n__zeros
0 → n__0
length(X) → n__length(X)
s(X) → n__s(X)
cons(X1, X2) → n__cons(X1, X2)
isNatIList(X) → n__isNatIList(X)
nil → n__nil
isNatList(X) → n__isNatList(X)
isNat(X) → n__isNat(X)
activate(n__zeros) → zeros
activate(n__0) → 0
activate(n__length(X)) → length(X)
activate(n__s(X)) → s(X)
activate(n__cons(X1, X2)) → cons(X1, X2)
activate(n__isNatIList(X)) → isNatIList(X)
activate(n__nil) → nil
activate(n__isNatList(X)) → isNatList(X)
activate(n__isNat(X)) → isNat(X)
activate(X) → X

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

(38) MRRProof (EQUIVALENT transformation)

ISNATLIST(n__cons(n__nil, y1)) → AND(isNat(nil), n__isNatList(activate(y1)))

Used ordering: Polynomial interpretation [POLO]:

POL(0) = 0
POL(ACTIVATE(x₁)) = 2·x₁
POL(AND(x₁, x₂)) = x₁ + 2·x₂
POL(ISNATLIST(x₁)) = x₁
POL(U11(x₁, x₂)) = 2·x₁ + 2·x₂
POL(activate(x₁)) = x₁
POL(and(x₁, x₂)) = x₁ + 2·x₂
POL(cons(x₁, x₂)) = 2·x₁ + 2·x₂
POL(isNat(x₁)) = x₁
POL(isNatIList(x₁)) = x₁
POL(isNatList(x₁)) = x₁
POL(length(x₁)) = 2·x₁
POL(n__0) = 0
POL(n__cons(x₁, x₂)) = 2·x₁ + 2·x₂
POL(n__isNat(x₁)) = x₁
POL(n__isNatIList(x₁)) = x₁
POL(n__isNatList(x₁)) = x₁
POL(n__length(x₁)) = 2·x₁
POL(n__nil) = 1
POL(n__s(x₁)) = x₁
POL(n__zeros) = 0
POL(nil) = 1
POL(s(x₁)) = x₁
POL(tt) = 0
POL(zeros) = 0

(39) Obligation:

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

ISNATLIST(n__cons(n__zeros, y1)) → AND(isNat(zeros), n__isNatList(activate(y1)))
AND(tt, n__isNatList(y_3)) → ACTIVATE(n__isNatList(y_3))
ACTIVATE(n__isNatList(X)) → ISNATLIST(X)
ISNATLIST(n__cons(n__0, y1)) → AND(isNat(0), n__isNatList(activate(y1)))
ISNATLIST(n__cons(n__length(x0), y1)) → AND(isNat(length(x0)), n__isNatList(activate(y1)))
ISNATLIST(n__cons(n__s(x0), y1)) → AND(isNat(s(x0)), n__isNatList(activate(y1)))
ISNATLIST(n__cons(n__cons(x0, x1), y1)) → AND(isNat(cons(x0, x1)), n__isNatList(activate(y1)))
ISNATLIST(n__cons(n__isNatIList(x0), y1)) → AND(isNat(isNatIList(x0)), n__isNatList(activate(y1)))
ISNATLIST(n__cons(n__isNatList(x0), y1)) → AND(isNat(isNatList(x0)), n__isNatList(activate(y1)))
ISNATLIST(n__cons(n__isNat(x0), y1)) → AND(isNat(isNat(x0)), n__isNatList(activate(y1)))
ISNATLIST(n__cons(x0, y1)) → AND(isNat(x0), n__isNatList(activate(y1)))

The TRS R consists of the following rules:

zeros → cons(0, n__zeros)
U11(tt, L) → s(length(activate(L)))
and(tt, X) → activate(X)
isNat(n__0) → tt
isNat(n__s(V1)) → isNat(activate(V1))
isNatIList(n__cons(V1, V2)) → and(isNat(activate(V1)), n__isNatIList(activate(V2)))
isNatList(n__cons(V1, V2)) → and(isNat(activate(V1)), n__isNatList(activate(V2)))
length(cons(N, L)) → U11(and(isNatList(activate(L)), n__isNat(N)), activate(L))
zeros → n__zeros
0 → n__0
length(X) → n__length(X)
s(X) → n__s(X)
cons(X1, X2) → n__cons(X1, X2)
isNatIList(X) → n__isNatIList(X)
nil → n__nil
isNatList(X) → n__isNatList(X)
isNat(X) → n__isNat(X)
activate(n__zeros) → zeros
activate(n__0) → 0
activate(n__length(X)) → length(X)
activate(n__s(X)) → s(X)
activate(n__cons(X1, X2)) → cons(X1, X2)
activate(n__isNatIList(X)) → isNatIList(X)
activate(n__nil) → nil
activate(n__isNatList(X)) → isNatList(X)
activate(n__isNat(X)) → isNat(X)
activate(X) → X

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

(40) MRRProof (EQUIVALENT transformation)

ISNATLIST(n__cons(n__isNatIList(x0), y1)) → AND(isNat(isNatIList(x0)), n__isNatList(activate(y1)))

Used ordering: Polynomial interpretation [POLO]:

POL(0) = 0
POL(ACTIVATE(x₁)) = 2·x₁
POL(AND(x₁, x₂)) = x₁ + 2·x₂
POL(ISNATLIST(x₁)) = 2·x₁
POL(U11(x₁, x₂)) = 2·x₁ + 2·x₂
POL(activate(x₁)) = x₁
POL(and(x₁, x₂)) = x₁ + x₂
POL(cons(x₁, x₂)) = 2·x₁ + 2·x₂
POL(isNat(x₁)) = 2·x₁
POL(isNatIList(x₁)) = 2 + x₁
POL(isNatList(x₁)) = x₁
POL(length(x₁)) = 2·x₁
POL(n__0) = 0
POL(n__cons(x₁, x₂)) = 2·x₁ + 2·x₂
POL(n__isNat(x₁)) = 2·x₁
POL(n__isNatIList(x₁)) = 2 + x₁
POL(n__isNatList(x₁)) = x₁
POL(n__length(x₁)) = 2·x₁
POL(n__nil) = 0
POL(n__s(x₁)) = x₁
POL(n__zeros) = 0
POL(nil) = 0
POL(s(x₁)) = x₁
POL(tt) = 0
POL(zeros) = 0

(41) Obligation:

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

ISNATLIST(n__cons(n__zeros, y1)) → AND(isNat(zeros), n__isNatList(activate(y1)))
AND(tt, n__isNatList(y_3)) → ACTIVATE(n__isNatList(y_3))
ACTIVATE(n__isNatList(X)) → ISNATLIST(X)
ISNATLIST(n__cons(n__0, y1)) → AND(isNat(0), n__isNatList(activate(y1)))
ISNATLIST(n__cons(n__length(x0), y1)) → AND(isNat(length(x0)), n__isNatList(activate(y1)))
ISNATLIST(n__cons(n__s(x0), y1)) → AND(isNat(s(x0)), n__isNatList(activate(y1)))
ISNATLIST(n__cons(n__cons(x0, x1), y1)) → AND(isNat(cons(x0, x1)), n__isNatList(activate(y1)))
ISNATLIST(n__cons(n__isNatList(x0), y1)) → AND(isNat(isNatList(x0)), n__isNatList(activate(y1)))
ISNATLIST(n__cons(n__isNat(x0), y1)) → AND(isNat(isNat(x0)), n__isNatList(activate(y1)))
ISNATLIST(n__cons(x0, y1)) → AND(isNat(x0), n__isNatList(activate(y1)))

The TRS R consists of the following rules:

zeros → cons(0, n__zeros)
U11(tt, L) → s(length(activate(L)))
and(tt, X) → activate(X)
isNat(n__0) → tt
isNat(n__s(V1)) → isNat(activate(V1))
isNatIList(n__cons(V1, V2)) → and(isNat(activate(V1)), n__isNatIList(activate(V2)))
isNatList(n__cons(V1, V2)) → and(isNat(activate(V1)), n__isNatList(activate(V2)))
length(cons(N, L)) → U11(and(isNatList(activate(L)), n__isNat(N)), activate(L))
zeros → n__zeros
0 → n__0
length(X) → n__length(X)
s(X) → n__s(X)
cons(X1, X2) → n__cons(X1, X2)
isNatIList(X) → n__isNatIList(X)
nil → n__nil
isNatList(X) → n__isNatList(X)
isNat(X) → n__isNat(X)
activate(n__zeros) → zeros
activate(n__0) → 0
activate(n__length(X)) → length(X)
activate(n__s(X)) → s(X)
activate(n__cons(X1, X2)) → cons(X1, X2)
activate(n__isNatIList(X)) → isNatIList(X)
activate(n__nil) → nil
activate(n__isNatList(X)) → isNatList(X)
activate(n__isNat(X)) → isNat(X)
activate(X) → X

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

(42) MRRProof (EQUIVALENT transformation)

ISNATLIST(n__cons(n__length(x0), y1)) → AND(isNat(length(x0)), n__isNatList(activate(y1)))

Used ordering: Polynomial interpretation [POLO]:

POL(0) = 0
POL(ACTIVATE(x₁)) = 2 + 2·x₁
POL(AND(x₁, x₂)) = 2 + x₁ + 2·x₂
POL(ISNATLIST(x₁)) = 2 + x₁
POL(U11(x₁, x₂)) = 1 + 2·x₁ + 2·x₂
POL(activate(x₁)) = x₁
POL(and(x₁, x₂)) = x₁ + 2·x₂
POL(cons(x₁, x₂)) = 2·x₁ + 2·x₂
POL(isNat(x₁)) = x₁
POL(isNatIList(x₁)) = 2·x₁
POL(isNatList(x₁)) = x₁
POL(length(x₁)) = 1 + 2·x₁
POL(n__0) = 0
POL(n__cons(x₁, x₂)) = 2·x₁ + 2·x₂
POL(n__isNat(x₁)) = x₁
POL(n__isNatIList(x₁)) = 2·x₁
POL(n__isNatList(x₁)) = x₁
POL(n__length(x₁)) = 1 + 2·x₁
POL(n__nil) = 0
POL(n__s(x₁)) = x₁
POL(n__zeros) = 0
POL(nil) = 0
POL(s(x₁)) = x₁
POL(tt) = 0
POL(zeros) = 0

(43) Obligation:

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

ISNATLIST(n__cons(n__zeros, y1)) → AND(isNat(zeros), n__isNatList(activate(y1)))
AND(tt, n__isNatList(y_3)) → ACTIVATE(n__isNatList(y_3))
ACTIVATE(n__isNatList(X)) → ISNATLIST(X)
ISNATLIST(n__cons(n__0, y1)) → AND(isNat(0), n__isNatList(activate(y1)))
ISNATLIST(n__cons(n__s(x0), y1)) → AND(isNat(s(x0)), n__isNatList(activate(y1)))
ISNATLIST(n__cons(n__cons(x0, x1), y1)) → AND(isNat(cons(x0, x1)), n__isNatList(activate(y1)))
ISNATLIST(n__cons(n__isNatList(x0), y1)) → AND(isNat(isNatList(x0)), n__isNatList(activate(y1)))
ISNATLIST(n__cons(n__isNat(x0), y1)) → AND(isNat(isNat(x0)), n__isNatList(activate(y1)))
ISNATLIST(n__cons(x0, y1)) → AND(isNat(x0), n__isNatList(activate(y1)))

The TRS R consists of the following rules:

zeros → cons(0, n__zeros)
U11(tt, L) → s(length(activate(L)))
and(tt, X) → activate(X)
isNat(n__0) → tt
isNat(n__s(V1)) → isNat(activate(V1))
isNatIList(n__cons(V1, V2)) → and(isNat(activate(V1)), n__isNatIList(activate(V2)))
isNatList(n__cons(V1, V2)) → and(isNat(activate(V1)), n__isNatList(activate(V2)))
length(cons(N, L)) → U11(and(isNatList(activate(L)), n__isNat(N)), activate(L))
zeros → n__zeros
0 → n__0
length(X) → n__length(X)
s(X) → n__s(X)
cons(X1, X2) → n__cons(X1, X2)
isNatIList(X) → n__isNatIList(X)
nil → n__nil
isNatList(X) → n__isNatList(X)
isNat(X) → n__isNat(X)
activate(n__zeros) → zeros
activate(n__0) → 0
activate(n__length(X)) → length(X)
activate(n__s(X)) → s(X)
activate(n__cons(X1, X2)) → cons(X1, X2)
activate(n__isNatIList(X)) → isNatIList(X)
activate(n__nil) → nil
activate(n__isNatList(X)) → isNatList(X)
activate(n__isNat(X)) → isNat(X)
activate(X) → X

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

(44) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04,JAR06].

The following pairs can be oriented strictly and are deleted.

ISNATLIST(n__cons(n__isNat(x0), y1)) → AND(isNat(isNat(x0)), n__isNatList(activate(y1)))

The remaining pairs can at least be oriented weakly.
Used ordering: Polynomial interpretation [POLO]:

POL(0) = 0
POL(ACTIVATE(x₁)) = x₁
POL(AND(x₁, x₂)) = x₂
POL(ISNATLIST(x₁)) = x₁
POL(U11(x₁, x₂)) = 0
POL(activate(x₁)) = x₁
POL(and(x₁, x₂)) = x₂
POL(cons(x₁, x₂)) = x₁ + x₂
POL(isNat(x₁)) = 1
POL(isNatIList(x₁)) = 1 + x₁
POL(isNatList(x₁)) = x₁
POL(length(x₁)) = x₁
POL(n__0) = 0
POL(n__cons(x₁, x₂)) = x₁ + x₂
POL(n__isNat(x₁)) = 1
POL(n__isNatIList(x₁)) = 1 + x₁
POL(n__isNatList(x₁)) = x₁
POL(n__length(x₁)) = x₁
POL(n__nil) = 0
POL(n__s(x₁)) = 0
POL(n__zeros) = 0
POL(nil) = 0
POL(s(x₁)) = 0
POL(tt) = 0
POL(zeros) = 0

The following usable rules [FROCOS05] with respect to the argument filtering of the ordering [JAR06] were oriented:

zeros → cons(0, n__zeros)
zeros → n__zeros
isNat(n__0) → tt
isNat(n__s(V1)) → isNat(activate(V1))
isNat(X) → n__isNat(X)
activate(n__zeros) → zeros
activate(n__0) → 0
activate(n__length(X)) → length(X)
activate(n__s(X)) → s(X)
activate(n__cons(X1, X2)) → cons(X1, X2)
activate(n__isNatIList(X)) → isNatIList(X)
isNatIList(n__cons(V1, V2)) → and(isNat(activate(V1)), n__isNatIList(activate(V2)))
and(tt, X) → activate(X)
activate(n__isNatList(X)) → isNatList(X)
isNatList(n__cons(V1, V2)) → and(isNat(activate(V1)), n__isNatList(activate(V2)))
activate(n__nil) → nil
activate(n__isNat(X)) → isNat(X)
activate(X) → X
0 → n__0
s(X) → n__s(X)
cons(X1, X2) → n__cons(X1, X2)
isNatList(X) → n__isNatList(X)
length(X) → n__length(X)
length(cons(N, L)) → U11(and(isNatList(activate(L)), n__isNat(N)), activate(L))
isNatIList(X) → n__isNatIList(X)
U11(tt, L) → s(length(activate(L)))
nil → n__nil

(45) Obligation:

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

ISNATLIST(n__cons(n__zeros, y1)) → AND(isNat(zeros), n__isNatList(activate(y1)))
AND(tt, n__isNatList(y_3)) → ACTIVATE(n__isNatList(y_3))
ACTIVATE(n__isNatList(X)) → ISNATLIST(X)
ISNATLIST(n__cons(n__0, y1)) → AND(isNat(0), n__isNatList(activate(y1)))
ISNATLIST(n__cons(n__s(x0), y1)) → AND(isNat(s(x0)), n__isNatList(activate(y1)))
ISNATLIST(n__cons(n__cons(x0, x1), y1)) → AND(isNat(cons(x0, x1)), n__isNatList(activate(y1)))
ISNATLIST(n__cons(n__isNatList(x0), y1)) → AND(isNat(isNatList(x0)), n__isNatList(activate(y1)))
ISNATLIST(n__cons(x0, y1)) → AND(isNat(x0), n__isNatList(activate(y1)))

The TRS R consists of the following rules:

zeros → cons(0, n__zeros)
U11(tt, L) → s(length(activate(L)))
and(tt, X) → activate(X)
isNat(n__0) → tt
isNat(n__s(V1)) → isNat(activate(V1))
isNatIList(n__cons(V1, V2)) → and(isNat(activate(V1)), n__isNatIList(activate(V2)))
isNatList(n__cons(V1, V2)) → and(isNat(activate(V1)), n__isNatList(activate(V2)))
length(cons(N, L)) → U11(and(isNatList(activate(L)), n__isNat(N)), activate(L))
zeros → n__zeros
0 → n__0
length(X) → n__length(X)
s(X) → n__s(X)
cons(X1, X2) → n__cons(X1, X2)
isNatIList(X) → n__isNatIList(X)
nil → n__nil
isNatList(X) → n__isNatList(X)
isNat(X) → n__isNat(X)
activate(n__zeros) → zeros
activate(n__0) → 0
activate(n__length(X)) → length(X)
activate(n__s(X)) → s(X)
activate(n__cons(X1, X2)) → cons(X1, X2)
activate(n__isNatIList(X)) → isNatIList(X)
activate(n__nil) → nil
activate(n__isNatList(X)) → isNatList(X)
activate(n__isNat(X)) → isNat(X)
activate(X) → X

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

(46) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04,JAR06].

The following pairs can be oriented strictly and are deleted.

ISNATLIST(n__cons(n__s(x0), y1)) → AND(isNat(s(x0)), n__isNatList(activate(y1)))

The remaining pairs can at least be oriented weakly.
Used ordering: Polynomial interpretation [POLO]:

POL(0) = 0
POL(ACTIVATE(x₁)) = x₁
POL(AND(x₁, x₂)) = x₂
POL(ISNATLIST(x₁)) = x₁
POL(U11(x₁, x₂)) = 1
POL(activate(x₁)) = x₁
POL(and(x₁, x₂)) = x₂
POL(cons(x₁, x₂)) = x₁ + x₂
POL(isNat(x₁)) = 0
POL(isNatIList(x₁)) = 0
POL(isNatList(x₁)) = x₁
POL(length(x₁)) = 1
POL(n__0) = 0
POL(n__cons(x₁, x₂)) = x₁ + x₂
POL(n__isNat(x₁)) = 0
POL(n__isNatIList(x₁)) = 0
POL(n__isNatList(x₁)) = x₁
POL(n__length(x₁)) = 1
POL(n__nil) = 0
POL(n__s(x₁)) = 1
POL(n__zeros) = 0
POL(nil) = 0
POL(s(x₁)) = 1
POL(tt) = 0
POL(zeros) = 0

The following usable rules [FROCOS05] with respect to the argument filtering of the ordering [JAR06] were oriented:

zeros → cons(0, n__zeros)
zeros → n__zeros
isNat(n__0) → tt
isNat(n__s(V1)) → isNat(activate(V1))
isNat(X) → n__isNat(X)
activate(n__zeros) → zeros
activate(n__0) → 0
activate(n__length(X)) → length(X)
activate(n__s(X)) → s(X)
activate(n__cons(X1, X2)) → cons(X1, X2)
activate(n__isNatIList(X)) → isNatIList(X)
isNatIList(n__cons(V1, V2)) → and(isNat(activate(V1)), n__isNatIList(activate(V2)))
and(tt, X) → activate(X)
activate(n__isNatList(X)) → isNatList(X)
isNatList(n__cons(V1, V2)) → and(isNat(activate(V1)), n__isNatList(activate(V2)))
activate(n__nil) → nil
activate(n__isNat(X)) → isNat(X)
activate(X) → X
0 → n__0
s(X) → n__s(X)
cons(X1, X2) → n__cons(X1, X2)
isNatList(X) → n__isNatList(X)
length(X) → n__length(X)
length(cons(N, L)) → U11(and(isNatList(activate(L)), n__isNat(N)), activate(L))
isNatIList(X) → n__isNatIList(X)
U11(tt, L) → s(length(activate(L)))
nil → n__nil

(47) Obligation:

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

ISNATLIST(n__cons(n__zeros, y1)) → AND(isNat(zeros), n__isNatList(activate(y1)))
AND(tt, n__isNatList(y_3)) → ACTIVATE(n__isNatList(y_3))
ACTIVATE(n__isNatList(X)) → ISNATLIST(X)
ISNATLIST(n__cons(n__0, y1)) → AND(isNat(0), n__isNatList(activate(y1)))
ISNATLIST(n__cons(n__cons(x0, x1), y1)) → AND(isNat(cons(x0, x1)), n__isNatList(activate(y1)))
ISNATLIST(n__cons(n__isNatList(x0), y1)) → AND(isNat(isNatList(x0)), n__isNatList(activate(y1)))
ISNATLIST(n__cons(x0, y1)) → AND(isNat(x0), n__isNatList(activate(y1)))

The TRS R consists of the following rules:

zeros → cons(0, n__zeros)
U11(tt, L) → s(length(activate(L)))
and(tt, X) → activate(X)
isNat(n__0) → tt
isNat(n__s(V1)) → isNat(activate(V1))
isNatIList(n__cons(V1, V2)) → and(isNat(activate(V1)), n__isNatIList(activate(V2)))
isNatList(n__cons(V1, V2)) → and(isNat(activate(V1)), n__isNatList(activate(V2)))
length(cons(N, L)) → U11(and(isNatList(activate(L)), n__isNat(N)), activate(L))
zeros → n__zeros
0 → n__0
length(X) → n__length(X)
s(X) → n__s(X)
cons(X1, X2) → n__cons(X1, X2)
isNatIList(X) → n__isNatIList(X)
nil → n__nil
isNatList(X) → n__isNatList(X)
isNat(X) → n__isNat(X)
activate(n__zeros) → zeros
activate(n__0) → 0
activate(n__length(X)) → length(X)
activate(n__s(X)) → s(X)
activate(n__cons(X1, X2)) → cons(X1, X2)
activate(n__isNatIList(X)) → isNatIList(X)
activate(n__nil) → nil
activate(n__isNatList(X)) → isNatList(X)
activate(n__isNat(X)) → isNat(X)
activate(X) → X

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

(48) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04,JAR06].

The following pairs can be oriented strictly and are deleted.

ISNATLIST(n__cons(n__zeros, y1)) → AND(isNat(zeros), n__isNatList(activate(y1)))

The remaining pairs can at least be oriented weakly.
Used ordering: Polynomial interpretation [POLO]:

POL(0) = 0
POL(ACTIVATE(x₁)) = x₁
POL(AND(x₁, x₂)) = x₂
POL(ISNATLIST(x₁)) = x₁
POL(U11(x₁, x₂)) = 0
POL(activate(x₁)) = x₁
POL(and(x₁, x₂)) = x₂
POL(cons(x₁, x₂)) = x₁ + x₂
POL(isNat(x₁)) = 0
POL(isNatIList(x₁)) = 0
POL(isNatList(x₁)) = x₁
POL(length(x₁)) = x₁
POL(n__0) = 0
POL(n__cons(x₁, x₂)) = x₁ + x₂
POL(n__isNat(x₁)) = 0
POL(n__isNatIList(x₁)) = 0
POL(n__isNatList(x₁)) = x₁
POL(n__length(x₁)) = x₁
POL(n__nil) = 0
POL(n__s(x₁)) = 0
POL(n__zeros) = 1
POL(nil) = 0
POL(s(x₁)) = 0
POL(tt) = 0
POL(zeros) = 1

The following usable rules [FROCOS05] with respect to the argument filtering of the ordering [JAR06] were oriented:

zeros → cons(0, n__zeros)
zeros → n__zeros
isNat(n__0) → tt
isNat(n__s(V1)) → isNat(activate(V1))
isNat(X) → n__isNat(X)
activate(n__zeros) → zeros
activate(n__0) → 0
activate(n__length(X)) → length(X)
activate(n__s(X)) → s(X)
activate(n__cons(X1, X2)) → cons(X1, X2)
activate(n__isNatIList(X)) → isNatIList(X)
isNatIList(n__cons(V1, V2)) → and(isNat(activate(V1)), n__isNatIList(activate(V2)))
and(tt, X) → activate(X)
activate(n__isNatList(X)) → isNatList(X)
isNatList(n__cons(V1, V2)) → and(isNat(activate(V1)), n__isNatList(activate(V2)))
activate(n__nil) → nil
activate(n__isNat(X)) → isNat(X)
activate(X) → X
0 → n__0
cons(X1, X2) → n__cons(X1, X2)
isNatList(X) → n__isNatList(X)
length(X) → n__length(X)
length(cons(N, L)) → U11(and(isNatList(activate(L)), n__isNat(N)), activate(L))
isNatIList(X) → n__isNatIList(X)
U11(tt, L) → s(length(activate(L)))
s(X) → n__s(X)
nil → n__nil

(49) Obligation:

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

AND(tt, n__isNatList(y_3)) → ACTIVATE(n__isNatList(y_3))
ACTIVATE(n__isNatList(X)) → ISNATLIST(X)
ISNATLIST(n__cons(n__0, y1)) → AND(isNat(0), n__isNatList(activate(y1)))
ISNATLIST(n__cons(n__cons(x0, x1), y1)) → AND(isNat(cons(x0, x1)), n__isNatList(activate(y1)))
ISNATLIST(n__cons(n__isNatList(x0), y1)) → AND(isNat(isNatList(x0)), n__isNatList(activate(y1)))
ISNATLIST(n__cons(x0, y1)) → AND(isNat(x0), n__isNatList(activate(y1)))

The TRS R consists of the following rules:

zeros → cons(0, n__zeros)
U11(tt, L) → s(length(activate(L)))
and(tt, X) → activate(X)
isNat(n__0) → tt
isNat(n__s(V1)) → isNat(activate(V1))
isNatIList(n__cons(V1, V2)) → and(isNat(activate(V1)), n__isNatIList(activate(V2)))
isNatList(n__cons(V1, V2)) → and(isNat(activate(V1)), n__isNatList(activate(V2)))
length(cons(N, L)) → U11(and(isNatList(activate(L)), n__isNat(N)), activate(L))
zeros → n__zeros
0 → n__0
length(X) → n__length(X)
s(X) → n__s(X)
cons(X1, X2) → n__cons(X1, X2)
isNatIList(X) → n__isNatIList(X)
nil → n__nil
isNatList(X) → n__isNatList(X)
isNat(X) → n__isNat(X)
activate(n__zeros) → zeros
activate(n__0) → 0
activate(n__length(X)) → length(X)
activate(n__s(X)) → s(X)
activate(n__cons(X1, X2)) → cons(X1, X2)
activate(n__isNatIList(X)) → isNatIList(X)
activate(n__nil) → nil
activate(n__isNatList(X)) → isNatList(X)
activate(n__isNat(X)) → isNat(X)
activate(X) → X

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

(50) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04,JAR06].

The following pairs can be oriented strictly and are deleted.

ISNATLIST(n__cons(n__cons(x0, x1), y1)) → AND(isNat(cons(x0, x1)), n__isNatList(activate(y1)))

The remaining pairs can at least be oriented weakly.
Used ordering: Polynomial interpretation [POLO]:

POL(0) = 0
POL(ACTIVATE(x₁)) = x₁
POL(AND(x₁, x₂)) = x₂
POL(ISNATLIST(x₁)) = x₁
POL(U11(x₁, x₂)) = 1
POL(activate(x₁)) = 1 + x₁
POL(and(x₁, x₂)) = 1 + x₂
POL(cons(x₁, x₂)) = 1 + x₁ + x₂
POL(isNat(x₁)) = 0
POL(isNatIList(x₁)) = 1 + x₁
POL(isNatList(x₁)) = 1 + x₁
POL(length(x₁)) = 1
POL(n__0) = 0
POL(n__cons(x₁, x₂)) = 1 + x₁ + x₂
POL(n__isNat(x₁)) = 0
POL(n__isNatIList(x₁)) = x₁
POL(n__isNatList(x₁)) = x₁
POL(n__length(x₁)) = 0
POL(n__nil) = 0
POL(n__s(x₁)) = 0
POL(n__zeros) = 0
POL(nil) = 0
POL(s(x₁)) = 0
POL(tt) = 0
POL(zeros) = 1

The following usable rules [FROCOS05] with respect to the argument filtering of the ordering [JAR06] were oriented:

0 → n__0
isNat(n__0) → tt
isNat(n__s(V1)) → isNat(activate(V1))
isNat(X) → n__isNat(X)
activate(n__zeros) → zeros
activate(n__0) → 0
activate(n__length(X)) → length(X)
activate(n__s(X)) → s(X)
activate(n__cons(X1, X2)) → cons(X1, X2)
activate(n__isNatIList(X)) → isNatIList(X)
isNatIList(n__cons(V1, V2)) → and(isNat(activate(V1)), n__isNatIList(activate(V2)))
and(tt, X) → activate(X)
activate(n__isNatList(X)) → isNatList(X)
isNatList(n__cons(V1, V2)) → and(isNat(activate(V1)), n__isNatList(activate(V2)))
activate(n__nil) → nil
activate(n__isNat(X)) → isNat(X)
activate(X) → X
cons(X1, X2) → n__cons(X1, X2)
isNatList(X) → n__isNatList(X)
length(X) → n__length(X)
length(cons(N, L)) → U11(and(isNatList(activate(L)), n__isNat(N)), activate(L))
isNatIList(X) → n__isNatIList(X)
U11(tt, L) → s(length(activate(L)))
s(X) → n__s(X)
zeros → cons(0, n__zeros)
zeros → n__zeros
nil → n__nil

(51) Obligation:

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

AND(tt, n__isNatList(y_3)) → ACTIVATE(n__isNatList(y_3))
ACTIVATE(n__isNatList(X)) → ISNATLIST(X)
ISNATLIST(n__cons(n__0, y1)) → AND(isNat(0), n__isNatList(activate(y1)))
ISNATLIST(n__cons(n__isNatList(x0), y1)) → AND(isNat(isNatList(x0)), n__isNatList(activate(y1)))
ISNATLIST(n__cons(x0, y1)) → AND(isNat(x0), n__isNatList(activate(y1)))

The TRS R consists of the following rules:

zeros → cons(0, n__zeros)
U11(tt, L) → s(length(activate(L)))
and(tt, X) → activate(X)
isNat(n__0) → tt
isNat(n__s(V1)) → isNat(activate(V1))
isNatIList(n__cons(V1, V2)) → and(isNat(activate(V1)), n__isNatIList(activate(V2)))
isNatList(n__cons(V1, V2)) → and(isNat(activate(V1)), n__isNatList(activate(V2)))
length(cons(N, L)) → U11(and(isNatList(activate(L)), n__isNat(N)), activate(L))
zeros → n__zeros
0 → n__0
length(X) → n__length(X)
s(X) → n__s(X)
cons(X1, X2) → n__cons(X1, X2)
isNatIList(X) → n__isNatIList(X)
nil → n__nil
isNatList(X) → n__isNatList(X)
isNat(X) → n__isNat(X)
activate(n__zeros) → zeros
activate(n__0) → 0
activate(n__length(X)) → length(X)
activate(n__s(X)) → s(X)
activate(n__cons(X1, X2)) → cons(X1, X2)
activate(n__isNatIList(X)) → isNatIList(X)
activate(n__nil) → nil
activate(n__isNatList(X)) → isNatList(X)
activate(n__isNat(X)) → isNat(X)
activate(X) → X

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

(52) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04,JAR06].

The following pairs can be oriented strictly and are deleted.

ISNATLIST(n__cons(n__isNatList(x0), y1)) → AND(isNat(isNatList(x0)), n__isNatList(activate(y1)))

The remaining pairs can at least be oriented weakly.
Used ordering: Polynomial interpretation [POLO]:

POL(0) = 0
POL(ACTIVATE(x₁)) = x₁
POL(AND(x₁, x₂)) = x₂
POL(ISNATLIST(x₁)) = 1 + x₁
POL(U11(x₁, x₂)) = 1 + x₂
POL(activate(x₁)) = x₁
POL(and(x₁, x₂)) = x₂
POL(cons(x₁, x₂)) = x₁ + x₂
POL(isNat(x₁)) = 0
POL(isNatIList(x₁)) = 0
POL(isNatList(x₁)) = 1 + x₁
POL(length(x₁)) = 1 + x₁
POL(n__0) = 0
POL(n__cons(x₁, x₂)) = x₁ + x₂
POL(n__isNat(x₁)) = 0
POL(n__isNatIList(x₁)) = 0
POL(n__isNatList(x₁)) = 1 + x₁
POL(n__length(x₁)) = 1 + x₁
POL(n__nil) = 0
POL(n__s(x₁)) = 0
POL(n__zeros) = 0
POL(nil) = 0
POL(s(x₁)) = 0
POL(tt) = 0
POL(zeros) = 0

The following usable rules [FROCOS05] with respect to the argument filtering of the ordering [JAR06] were oriented:

0 → n__0
isNat(n__0) → tt
isNat(n__s(V1)) → isNat(activate(V1))
isNat(X) → n__isNat(X)
activate(n__zeros) → zeros
activate(n__0) → 0
activate(n__length(X)) → length(X)
activate(n__s(X)) → s(X)
activate(n__cons(X1, X2)) → cons(X1, X2)
activate(n__isNatIList(X)) → isNatIList(X)
isNatIList(n__cons(V1, V2)) → and(isNat(activate(V1)), n__isNatIList(activate(V2)))
and(tt, X) → activate(X)
activate(n__isNatList(X)) → isNatList(X)
isNatList(n__cons(V1, V2)) → and(isNat(activate(V1)), n__isNatList(activate(V2)))
activate(n__nil) → nil
activate(n__isNat(X)) → isNat(X)
activate(X) → X
isNatList(X) → n__isNatList(X)
length(X) → n__length(X)
length(cons(N, L)) → U11(and(isNatList(activate(L)), n__isNat(N)), activate(L))
isNatIList(X) → n__isNatIList(X)
U11(tt, L) → s(length(activate(L)))
s(X) → n__s(X)
zeros → cons(0, n__zeros)
zeros → n__zeros
cons(X1, X2) → n__cons(X1, X2)
nil → n__nil

(53) Obligation:

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

AND(tt, n__isNatList(y_3)) → ACTIVATE(n__isNatList(y_3))
ACTIVATE(n__isNatList(X)) → ISNATLIST(X)
ISNATLIST(n__cons(n__0, y1)) → AND(isNat(0), n__isNatList(activate(y1)))
ISNATLIST(n__cons(x0, y1)) → AND(isNat(x0), n__isNatList(activate(y1)))

The TRS R consists of the following rules:

zeros → cons(0, n__zeros)
U11(tt, L) → s(length(activate(L)))
and(tt, X) → activate(X)
isNat(n__0) → tt
isNat(n__s(V1)) → isNat(activate(V1))
isNatIList(n__cons(V1, V2)) → and(isNat(activate(V1)), n__isNatIList(activate(V2)))
isNatList(n__cons(V1, V2)) → and(isNat(activate(V1)), n__isNatList(activate(V2)))
length(cons(N, L)) → U11(and(isNatList(activate(L)), n__isNat(N)), activate(L))
zeros → n__zeros
0 → n__0
length(X) → n__length(X)
s(X) → n__s(X)
cons(X1, X2) → n__cons(X1, X2)
isNatIList(X) → n__isNatIList(X)
nil → n__nil
isNatList(X) → n__isNatList(X)
isNat(X) → n__isNat(X)
activate(n__zeros) → zeros
activate(n__0) → 0
activate(n__length(X)) → length(X)
activate(n__s(X)) → s(X)
activate(n__cons(X1, X2)) → cons(X1, X2)
activate(n__isNatIList(X)) → isNatIList(X)
activate(n__nil) → nil
activate(n__isNatList(X)) → isNatList(X)
activate(n__isNat(X)) → isNat(X)
activate(X) → X

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

(54) NonTerminationLoopProof (EQUIVALENT transformation)

We used the non-termination processor [FROCOS05] to show that the DP problem is infinite.
Found a loop by narrowing to the left:

s = ACTIVATE(n__isNatList(activate(n__zeros))) evaluates to t =ACTIVATE(n__isNatList(activate(n__zeros)))

Thus s starts an infinite chain as s semiunifies with t with the following substitutions:

Matcher: [ ]
Semiunifier: [ ]

Rewriting sequence

ACTIVATE(n__isNatList(activate(n__zeros))) → ACTIVATE(n__isNatList(zeros))
with rule activate(n__zeros) → zeros at position [0,0] and matcher [ ]

ACTIVATE(n__isNatList(zeros)) → ACTIVATE(n__isNatList(cons(0, n__zeros)))
with rule zeros → cons(0, n__zeros) at position [0,0] and matcher [ ]

ACTIVATE(n__isNatList(cons(0, n__zeros))) → ACTIVATE(n__isNatList(cons(n__0, n__zeros)))
with rule 0 → n__0 at position [0,0,0] and matcher [ ]

ACTIVATE(n__isNatList(cons(n__0, n__zeros))) → ACTIVATE(n__isNatList(n__cons(n__0, n__zeros)))
with rule cons(X1, X2) → n__cons(X1, X2) at position [0,0] and matcher [X1 / n__0, X2 / n__zeros]

ACTIVATE(n__isNatList(n__cons(n__0, n__zeros))) → ISNATLIST(n__cons(n__0, n__zeros))
with rule ACTIVATE(n__isNatList(X)) → ISNATLIST(X) at position [] and matcher [X / n__cons(n__0, n__zeros)]

ISNATLIST(n__cons(n__0, n__zeros)) → AND(isNat(n__0), n__isNatList(activate(n__zeros)))
with rule ISNATLIST(n__cons(x0, y1)) → AND(isNat(x0), n__isNatList(activate(y1))) at position [] and matcher [x0 / n__0, y1 / n__zeros]

AND(isNat(n__0), n__isNatList(activate(n__zeros))) → AND(tt, n__isNatList(activate(n__zeros)))
with rule isNat(n__0) → tt at position [0] and matcher [ ]

AND(tt, n__isNatList(activate(n__zeros))) → ACTIVATE(n__isNatList(activate(n__zeros)))
with rule AND(tt, n__isNatList(y_3)) → ACTIVATE(n__isNatList(y_3))

Now applying the matcher to the start term leads to a term which is equal to the last term in the rewriting sequence

All these steps are and every following step will be a correct step w.r.t to Q.

(55) NO

(56) Obligation:

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

AND(tt, n__isNatIList(y_3)) → ACTIVATE(n__isNatIList(y_3))
ACTIVATE(n__isNatIList(X)) → ISNATILIST(X)
ISNATILIST(n__cons(n__zeros, y1)) → AND(isNat(zeros), n__isNatIList(activate(y1)))
ISNATILIST(n__cons(n__0, y1)) → AND(isNat(0), n__isNatIList(activate(y1)))
ISNATILIST(n__cons(n__length(x0), y1)) → AND(isNat(length(x0)), n__isNatIList(activate(y1)))
ISNATILIST(n__cons(n__s(x0), y1)) → AND(isNat(s(x0)), n__isNatIList(activate(y1)))
ISNATILIST(n__cons(n__cons(x0, x1), y1)) → AND(isNat(cons(x0, x1)), n__isNatIList(activate(y1)))
ISNATILIST(n__cons(n__isNatIList(x0), y1)) → AND(isNat(isNatIList(x0)), n__isNatIList(activate(y1)))
ISNATILIST(n__cons(n__nil, y1)) → AND(isNat(nil), n__isNatIList(activate(y1)))
ISNATILIST(n__cons(n__isNatList(x0), y1)) → AND(isNat(isNatList(x0)), n__isNatIList(activate(y1)))
ISNATILIST(n__cons(n__isNat(x0), y1)) → AND(isNat(isNat(x0)), n__isNatIList(activate(y1)))
ISNATILIST(n__cons(x0, y1)) → AND(isNat(x0), n__isNatIList(activate(y1)))

The TRS R consists of the following rules:

zeros → cons(0, n__zeros)
U11(tt, L) → s(length(activate(L)))
and(tt, X) → activate(X)
isNat(n__0) → tt
isNat(n__s(V1)) → isNat(activate(V1))
isNatIList(n__cons(V1, V2)) → and(isNat(activate(V1)), n__isNatIList(activate(V2)))
isNatList(n__cons(V1, V2)) → and(isNat(activate(V1)), n__isNatList(activate(V2)))
length(cons(N, L)) → U11(and(isNatList(activate(L)), n__isNat(N)), activate(L))
zeros → n__zeros
0 → n__0
length(X) → n__length(X)
s(X) → n__s(X)
cons(X1, X2) → n__cons(X1, X2)
isNatIList(X) → n__isNatIList(X)
nil → n__nil
isNatList(X) → n__isNatList(X)
isNat(X) → n__isNat(X)
activate(n__zeros) → zeros
activate(n__0) → 0
activate(n__length(X)) → length(X)
activate(n__s(X)) → s(X)
activate(n__cons(X1, X2)) → cons(X1, X2)
activate(n__isNatIList(X)) → isNatIList(X)
activate(n__nil) → nil
activate(n__isNatList(X)) → isNatList(X)
activate(n__isNat(X)) → isNat(X)
activate(X) → X

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

(57) MRRProof (EQUIVALENT transformation)

ISNATILIST(n__cons(n__nil, y1)) → AND(isNat(nil), n__isNatIList(activate(y1)))

Used ordering: Polynomial interpretation [POLO]:

POL(0) = 0
POL(ACTIVATE(x₁)) = 2·x₁
POL(AND(x₁, x₂)) = 2·x₁ + 2·x₂
POL(ISNATILIST(x₁)) = 2·x₁
POL(U11(x₁, x₂)) = x₁ + 2·x₂
POL(activate(x₁)) = x₁
POL(and(x₁, x₂)) = 2·x₁ + 2·x₂
POL(cons(x₁, x₂)) = 2·x₁ + 2·x₂
POL(isNat(x₁)) = x₁
POL(isNatIList(x₁)) = x₁
POL(isNatList(x₁)) = x₁
POL(length(x₁)) = 2·x₁
POL(n__0) = 0
POL(n__cons(x₁, x₂)) = 2·x₁ + 2·x₂
POL(n__isNat(x₁)) = x₁
POL(n__isNatIList(x₁)) = x₁
POL(n__isNatList(x₁)) = x₁
POL(n__length(x₁)) = 2·x₁
POL(n__nil) = 2
POL(n__s(x₁)) = x₁
POL(n__zeros) = 0
POL(nil) = 2
POL(s(x₁)) = x₁
POL(tt) = 0
POL(zeros) = 0

(58) Obligation:

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

AND(tt, n__isNatIList(y_3)) → ACTIVATE(n__isNatIList(y_3))
ACTIVATE(n__isNatIList(X)) → ISNATILIST(X)
ISNATILIST(n__cons(n__zeros, y1)) → AND(isNat(zeros), n__isNatIList(activate(y1)))
ISNATILIST(n__cons(n__0, y1)) → AND(isNat(0), n__isNatIList(activate(y1)))
ISNATILIST(n__cons(n__length(x0), y1)) → AND(isNat(length(x0)), n__isNatIList(activate(y1)))
ISNATILIST(n__cons(n__s(x0), y1)) → AND(isNat(s(x0)), n__isNatIList(activate(y1)))
ISNATILIST(n__cons(n__cons(x0, x1), y1)) → AND(isNat(cons(x0, x1)), n__isNatIList(activate(y1)))
ISNATILIST(n__cons(n__isNatIList(x0), y1)) → AND(isNat(isNatIList(x0)), n__isNatIList(activate(y1)))
ISNATILIST(n__cons(n__isNatList(x0), y1)) → AND(isNat(isNatList(x0)), n__isNatIList(activate(y1)))
ISNATILIST(n__cons(n__isNat(x0), y1)) → AND(isNat(isNat(x0)), n__isNatIList(activate(y1)))
ISNATILIST(n__cons(x0, y1)) → AND(isNat(x0), n__isNatIList(activate(y1)))

The TRS R consists of the following rules:

zeros → cons(0, n__zeros)
U11(tt, L) → s(length(activate(L)))
and(tt, X) → activate(X)
isNat(n__0) → tt
isNat(n__s(V1)) → isNat(activate(V1))
isNatIList(n__cons(V1, V2)) → and(isNat(activate(V1)), n__isNatIList(activate(V2)))
isNatList(n__cons(V1, V2)) → and(isNat(activate(V1)), n__isNatList(activate(V2)))
length(cons(N, L)) → U11(and(isNatList(activate(L)), n__isNat(N)), activate(L))
zeros → n__zeros
0 → n__0
length(X) → n__length(X)
s(X) → n__s(X)
cons(X1, X2) → n__cons(X1, X2)
isNatIList(X) → n__isNatIList(X)
nil → n__nil
isNatList(X) → n__isNatList(X)
isNat(X) → n__isNat(X)
activate(n__zeros) → zeros
activate(n__0) → 0
activate(n__length(X)) → length(X)
activate(n__s(X)) → s(X)
activate(n__cons(X1, X2)) → cons(X1, X2)
activate(n__isNatIList(X)) → isNatIList(X)
activate(n__nil) → nil
activate(n__isNatList(X)) → isNatList(X)
activate(n__isNat(X)) → isNat(X)
activate(X) → X

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

(59) MRRProof (EQUIVALENT transformation)

ISNATILIST(n__cons(n__length(x0), y1)) → AND(isNat(length(x0)), n__isNatIList(activate(y1)))

Used ordering: Polynomial interpretation [POLO]:

POL(0) = 0
POL(ACTIVATE(x₁)) = 2·x₁
POL(AND(x₁, x₂)) = x₁ + 2·x₂
POL(ISNATILIST(x₁)) = 2·x₁
POL(U11(x₁, x₂)) = 1 + x₁ + 2·x₂
POL(activate(x₁)) = x₁
POL(and(x₁, x₂)) = x₁ + x₂
POL(cons(x₁, x₂)) = 2·x₁ + 2·x₂
POL(isNat(x₁)) = 2·x₁
POL(isNatIList(x₁)) = 2·x₁
POL(isNatList(x₁)) = x₁
POL(length(x₁)) = 1 + 2·x₁
POL(n__0) = 0
POL(n__cons(x₁, x₂)) = 2·x₁ + 2·x₂
POL(n__isNat(x₁)) = 2·x₁
POL(n__isNatIList(x₁)) = 2·x₁
POL(n__isNatList(x₁)) = x₁
POL(n__length(x₁)) = 1 + 2·x₁
POL(n__nil) = 0
POL(n__s(x₁)) = x₁
POL(n__zeros) = 0
POL(nil) = 0
POL(s(x₁)) = x₁
POL(tt) = 0
POL(zeros) = 0

(60) Obligation:

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

AND(tt, n__isNatIList(y_3)) → ACTIVATE(n__isNatIList(y_3))
ACTIVATE(n__isNatIList(X)) → ISNATILIST(X)
ISNATILIST(n__cons(n__zeros, y1)) → AND(isNat(zeros), n__isNatIList(activate(y1)))
ISNATILIST(n__cons(n__0, y1)) → AND(isNat(0), n__isNatIList(activate(y1)))
ISNATILIST(n__cons(n__s(x0), y1)) → AND(isNat(s(x0)), n__isNatIList(activate(y1)))
ISNATILIST(n__cons(n__cons(x0, x1), y1)) → AND(isNat(cons(x0, x1)), n__isNatIList(activate(y1)))
ISNATILIST(n__cons(n__isNatIList(x0), y1)) → AND(isNat(isNatIList(x0)), n__isNatIList(activate(y1)))
ISNATILIST(n__cons(n__isNatList(x0), y1)) → AND(isNat(isNatList(x0)), n__isNatIList(activate(y1)))
ISNATILIST(n__cons(n__isNat(x0), y1)) → AND(isNat(isNat(x0)), n__isNatIList(activate(y1)))
ISNATILIST(n__cons(x0, y1)) → AND(isNat(x0), n__isNatIList(activate(y1)))

The TRS R consists of the following rules:

zeros → cons(0, n__zeros)
U11(tt, L) → s(length(activate(L)))
and(tt, X) → activate(X)
isNat(n__0) → tt
isNat(n__s(V1)) → isNat(activate(V1))
isNatIList(n__cons(V1, V2)) → and(isNat(activate(V1)), n__isNatIList(activate(V2)))
isNatList(n__cons(V1, V2)) → and(isNat(activate(V1)), n__isNatList(activate(V2)))
length(cons(N, L)) → U11(and(isNatList(activate(L)), n__isNat(N)), activate(L))
zeros → n__zeros
0 → n__0
length(X) → n__length(X)
s(X) → n__s(X)
cons(X1, X2) → n__cons(X1, X2)
isNatIList(X) → n__isNatIList(X)
nil → n__nil
isNatList(X) → n__isNatList(X)
isNat(X) → n__isNat(X)
activate(n__zeros) → zeros
activate(n__0) → 0
activate(n__length(X)) → length(X)
activate(n__s(X)) → s(X)
activate(n__cons(X1, X2)) → cons(X1, X2)
activate(n__isNatIList(X)) → isNatIList(X)
activate(n__nil) → nil
activate(n__isNatList(X)) → isNatList(X)
activate(n__isNat(X)) → isNat(X)
activate(X) → X

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

(61) MRRProof (EQUIVALENT transformation)

ISNATILIST(n__cons(n__isNatIList(x0), y1)) → AND(isNat(isNatIList(x0)), n__isNatIList(activate(y1)))

Used ordering: Polynomial interpretation [POLO]:

POL(0) = 0
POL(ACTIVATE(x₁)) = x₁
POL(AND(x₁, x₂)) = x₁ + x₂
POL(ISNATILIST(x₁)) = 1 + 2·x₁
POL(U11(x₁, x₂)) = 2·x₁ + 2·x₂
POL(activate(x₁)) = x₁
POL(and(x₁, x₂)) = x₁ + x₂
POL(cons(x₁, x₂)) = 2·x₁ + 2·x₂
POL(isNat(x₁)) = x₁
POL(isNatIList(x₁)) = 1 + 2·x₁
POL(isNatList(x₁)) = x₁
POL(length(x₁)) = 2·x₁
POL(n__0) = 0
POL(n__cons(x₁, x₂)) = 2·x₁ + 2·x₂
POL(n__isNat(x₁)) = x₁
POL(n__isNatIList(x₁)) = 1 + 2·x₁
POL(n__isNatList(x₁)) = x₁
POL(n__length(x₁)) = 2·x₁
POL(n__nil) = 0
POL(n__s(x₁)) = x₁
POL(n__zeros) = 0
POL(nil) = 0
POL(s(x₁)) = x₁
POL(tt) = 0
POL(zeros) = 0

(62) Obligation:

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

AND(tt, n__isNatIList(y_3)) → ACTIVATE(n__isNatIList(y_3))
ACTIVATE(n__isNatIList(X)) → ISNATILIST(X)
ISNATILIST(n__cons(n__zeros, y1)) → AND(isNat(zeros), n__isNatIList(activate(y1)))
ISNATILIST(n__cons(n__0, y1)) → AND(isNat(0), n__isNatIList(activate(y1)))
ISNATILIST(n__cons(n__s(x0), y1)) → AND(isNat(s(x0)), n__isNatIList(activate(y1)))
ISNATILIST(n__cons(n__cons(x0, x1), y1)) → AND(isNat(cons(x0, x1)), n__isNatIList(activate(y1)))
ISNATILIST(n__cons(n__isNatList(x0), y1)) → AND(isNat(isNatList(x0)), n__isNatIList(activate(y1)))
ISNATILIST(n__cons(n__isNat(x0), y1)) → AND(isNat(isNat(x0)), n__isNatIList(activate(y1)))
ISNATILIST(n__cons(x0, y1)) → AND(isNat(x0), n__isNatIList(activate(y1)))

The TRS R consists of the following rules:

zeros → cons(0, n__zeros)
U11(tt, L) → s(length(activate(L)))
and(tt, X) → activate(X)
isNat(n__0) → tt
isNat(n__s(V1)) → isNat(activate(V1))
isNatIList(n__cons(V1, V2)) → and(isNat(activate(V1)), n__isNatIList(activate(V2)))
isNatList(n__cons(V1, V2)) → and(isNat(activate(V1)), n__isNatList(activate(V2)))
length(cons(N, L)) → U11(and(isNatList(activate(L)), n__isNat(N)), activate(L))
zeros → n__zeros
0 → n__0
length(X) → n__length(X)
s(X) → n__s(X)
cons(X1, X2) → n__cons(X1, X2)
isNatIList(X) → n__isNatIList(X)
nil → n__nil
isNatList(X) → n__isNatList(X)
isNat(X) → n__isNat(X)
activate(n__zeros) → zeros
activate(n__0) → 0
activate(n__length(X)) → length(X)
activate(n__s(X)) → s(X)
activate(n__cons(X1, X2)) → cons(X1, X2)
activate(n__isNatIList(X)) → isNatIList(X)
activate(n__nil) → nil
activate(n__isNatList(X)) → isNatList(X)
activate(n__isNat(X)) → isNat(X)
activate(X) → X

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

(63) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04,JAR06].

The following pairs can be oriented strictly and are deleted.

ISNATILIST(n__cons(n__zeros, y1)) → AND(isNat(zeros), n__isNatIList(activate(y1)))

The remaining pairs can at least be oriented weakly.
Used ordering: Polynomial Order [NEGPOLO,POLO] with Interpretation:

POL( AND(x₁, x₂) ) = max{0, 2x₂ - 1}

POL( n__isNatIList(x₁) ) = x₁ + 1

POL( zeros ) = 1

POL( cons(x₁, x₂) ) = 2x₁ + x₂

POL( 0 ) = 0

POL( n__zeros ) = 1

POL( isNat(x₁) ) = max{0, -2}

POL( n__0 ) = 0

POL( tt ) = 0

POL( n__s(x₁) ) = 0

POL( activate(x₁) ) = x₁

POL( n__isNat(x₁) ) = 0

POL( n__length(x₁) ) = 2

POL( length(x₁) ) = 2

POL( s(x₁) ) = 0

POL( n__cons(x₁, x₂) ) = 2x₁ + x₂

POL( isNatIList(x₁) ) = x₁ + 1

POL( and(x₁, x₂) ) = x₂

POL( n__isNatList(x₁) ) = 0

POL( isNatList(x₁) ) = max{0, -2}

POL( n__nil ) = 0

POL( nil ) = 0

POL( U11(x₁, x₂) ) = max{0, 2x₁ - 2}

POL( ACTIVATE(x₁) ) = max{0, 2x₁ - 1}

POL( ISNATILIST(x₁) ) = 2x₁ + 1

The following usable rules [FROCOS05] with respect to the argument filtering of the ordering [JAR06] were oriented:

zeros → cons(0, n__zeros)
zeros → n__zeros
isNat(n__0) → tt
isNat(n__s(V1)) → isNat(activate(V1))
isNat(X) → n__isNat(X)
activate(n__zeros) → zeros
activate(n__0) → 0
activate(n__length(X)) → length(X)
activate(n__s(X)) → s(X)
activate(n__cons(X1, X2)) → cons(X1, X2)
activate(n__isNatIList(X)) → isNatIList(X)
isNatIList(n__cons(V1, V2)) → and(isNat(activate(V1)), n__isNatIList(activate(V2)))
and(tt, X) → activate(X)
activate(n__isNatList(X)) → isNatList(X)
isNatList(n__cons(V1, V2)) → and(isNat(activate(V1)), n__isNatList(activate(V2)))
activate(n__nil) → nil
activate(n__isNat(X)) → isNat(X)
activate(X) → X
0 → n__0
s(X) → n__s(X)
cons(X1, X2) → n__cons(X1, X2)
isNatList(X) → n__isNatList(X)
length(X) → n__length(X)
length(cons(N, L)) → U11(and(isNatList(activate(L)), n__isNat(N)), activate(L))
isNatIList(X) → n__isNatIList(X)
U11(tt, L) → s(length(activate(L)))
nil → n__nil

(64) Obligation:

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

AND(tt, n__isNatIList(y_3)) → ACTIVATE(n__isNatIList(y_3))
ACTIVATE(n__isNatIList(X)) → ISNATILIST(X)
ISNATILIST(n__cons(n__0, y1)) → AND(isNat(0), n__isNatIList(activate(y1)))
ISNATILIST(n__cons(n__s(x0), y1)) → AND(isNat(s(x0)), n__isNatIList(activate(y1)))
ISNATILIST(n__cons(n__cons(x0, x1), y1)) → AND(isNat(cons(x0, x1)), n__isNatIList(activate(y1)))
ISNATILIST(n__cons(n__isNatList(x0), y1)) → AND(isNat(isNatList(x0)), n__isNatIList(activate(y1)))
ISNATILIST(n__cons(n__isNat(x0), y1)) → AND(isNat(isNat(x0)), n__isNatIList(activate(y1)))
ISNATILIST(n__cons(x0, y1)) → AND(isNat(x0), n__isNatIList(activate(y1)))

The TRS R consists of the following rules:

zeros → cons(0, n__zeros)
U11(tt, L) → s(length(activate(L)))
and(tt, X) → activate(X)
isNat(n__0) → tt
isNat(n__s(V1)) → isNat(activate(V1))
isNatIList(n__cons(V1, V2)) → and(isNat(activate(V1)), n__isNatIList(activate(V2)))
isNatList(n__cons(V1, V2)) → and(isNat(activate(V1)), n__isNatList(activate(V2)))
length(cons(N, L)) → U11(and(isNatList(activate(L)), n__isNat(N)), activate(L))
zeros → n__zeros
0 → n__0
length(X) → n__length(X)
s(X) → n__s(X)
cons(X1, X2) → n__cons(X1, X2)
isNatIList(X) → n__isNatIList(X)
nil → n__nil
isNatList(X) → n__isNatList(X)
isNat(X) → n__isNat(X)
activate(n__zeros) → zeros
activate(n__0) → 0
activate(n__length(X)) → length(X)
activate(n__s(X)) → s(X)
activate(n__cons(X1, X2)) → cons(X1, X2)
activate(n__isNatIList(X)) → isNatIList(X)
activate(n__nil) → nil
activate(n__isNatList(X)) → isNatList(X)
activate(n__isNat(X)) → isNat(X)
activate(X) → X

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

(65) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04,JAR06].

The following pairs can be oriented strictly and are deleted.

ISNATILIST(n__cons(n__isNatList(x0), y1)) → AND(isNat(isNatList(x0)), n__isNatIList(activate(y1)))

The remaining pairs can at least be oriented weakly.
Used ordering: Polynomial interpretation [POLO]:

POL(0) = 0
POL(ACTIVATE(x₁)) = x₁
POL(AND(x₁, x₂)) = x₂
POL(ISNATILIST(x₁)) = x₁
POL(U11(x₁, x₂)) = 0
POL(activate(x₁)) = x₁
POL(and(x₁, x₂)) = x₂
POL(cons(x₁, x₂)) = x₁ + x₂
POL(isNat(x₁)) = 0
POL(isNatIList(x₁)) = x₁
POL(isNatList(x₁)) = 1
POL(length(x₁)) = 0
POL(n__0) = 0
POL(n__cons(x₁, x₂)) = x₁ + x₂
POL(n__isNat(x₁)) = 0
POL(n__isNatIList(x₁)) = x₁
POL(n__isNatList(x₁)) = 1
POL(n__length(x₁)) = 0
POL(n__nil) = 1
POL(n__s(x₁)) = 0
POL(n__zeros) = 0
POL(nil) = 1
POL(s(x₁)) = 0
POL(tt) = 0
POL(zeros) = 0

The following usable rules [FROCOS05] with respect to the argument filtering of the ordering [JAR06] were oriented:

0 → n__0
isNat(n__0) → tt
isNat(n__s(V1)) → isNat(activate(V1))
isNat(X) → n__isNat(X)
activate(n__zeros) → zeros
activate(n__0) → 0
activate(n__length(X)) → length(X)
activate(n__s(X)) → s(X)
activate(n__cons(X1, X2)) → cons(X1, X2)
activate(n__isNatIList(X)) → isNatIList(X)
isNatIList(n__cons(V1, V2)) → and(isNat(activate(V1)), n__isNatIList(activate(V2)))
and(tt, X) → activate(X)
activate(n__isNatList(X)) → isNatList(X)
isNatList(n__cons(V1, V2)) → and(isNat(activate(V1)), n__isNatList(activate(V2)))
activate(n__nil) → nil
activate(n__isNat(X)) → isNat(X)
activate(X) → X
s(X) → n__s(X)
cons(X1, X2) → n__cons(X1, X2)
isNatList(X) → n__isNatList(X)
length(X) → n__length(X)
length(cons(N, L)) → U11(and(isNatList(activate(L)), n__isNat(N)), activate(L))
isNatIList(X) → n__isNatIList(X)
U11(tt, L) → s(length(activate(L)))
zeros → cons(0, n__zeros)
zeros → n__zeros
nil → n__nil

(66) Obligation:

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

AND(tt, n__isNatIList(y_3)) → ACTIVATE(n__isNatIList(y_3))
ACTIVATE(n__isNatIList(X)) → ISNATILIST(X)
ISNATILIST(n__cons(n__0, y1)) → AND(isNat(0), n__isNatIList(activate(y1)))
ISNATILIST(n__cons(n__s(x0), y1)) → AND(isNat(s(x0)), n__isNatIList(activate(y1)))
ISNATILIST(n__cons(n__cons(x0, x1), y1)) → AND(isNat(cons(x0, x1)), n__isNatIList(activate(y1)))
ISNATILIST(n__cons(n__isNat(x0), y1)) → AND(isNat(isNat(x0)), n__isNatIList(activate(y1)))
ISNATILIST(n__cons(x0, y1)) → AND(isNat(x0), n__isNatIList(activate(y1)))

The TRS R consists of the following rules:

zeros → cons(0, n__zeros)
U11(tt, L) → s(length(activate(L)))
and(tt, X) → activate(X)
isNat(n__0) → tt
isNat(n__s(V1)) → isNat(activate(V1))
isNatIList(n__cons(V1, V2)) → and(isNat(activate(V1)), n__isNatIList(activate(V2)))
isNatList(n__cons(V1, V2)) → and(isNat(activate(V1)), n__isNatList(activate(V2)))
length(cons(N, L)) → U11(and(isNatList(activate(L)), n__isNat(N)), activate(L))
zeros → n__zeros
0 → n__0
length(X) → n__length(X)
s(X) → n__s(X)
cons(X1, X2) → n__cons(X1, X2)
isNatIList(X) → n__isNatIList(X)
nil → n__nil
isNatList(X) → n__isNatList(X)
isNat(X) → n__isNat(X)
activate(n__zeros) → zeros
activate(n__0) → 0
activate(n__length(X)) → length(X)
activate(n__s(X)) → s(X)
activate(n__cons(X1, X2)) → cons(X1, X2)
activate(n__isNatIList(X)) → isNatIList(X)
activate(n__nil) → nil
activate(n__isNatList(X)) → isNatList(X)
activate(n__isNat(X)) → isNat(X)
activate(X) → X

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

(67) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04,JAR06].

The following pairs can be oriented strictly and are deleted.

ISNATILIST(n__cons(n__isNat(x0), y1)) → AND(isNat(isNat(x0)), n__isNatIList(activate(y1)))

The remaining pairs can at least be oriented weakly.
Used ordering: Polynomial interpretation [POLO]:

POL(0) = 0
POL(ACTIVATE(x₁)) = x₁
POL(AND(x₁, x₂)) = x₂
POL(ISNATILIST(x₁)) = x₁
POL(U11(x₁, x₂)) = 0
POL(activate(x₁)) = x₁
POL(and(x₁, x₂)) = x₂
POL(cons(x₁, x₂)) = x₁ + x₂
POL(isNat(x₁)) = 1 + x₁
POL(isNatIList(x₁)) = x₁
POL(isNatList(x₁)) = 0
POL(length(x₁)) = 0
POL(n__0) = 0
POL(n__cons(x₁, x₂)) = x₁ + x₂
POL(n__isNat(x₁)) = 1 + x₁
POL(n__isNatIList(x₁)) = x₁
POL(n__isNatList(x₁)) = 0
POL(n__length(x₁)) = 0
POL(n__nil) = 1
POL(n__s(x₁)) = x₁
POL(n__zeros) = 0
POL(nil) = 1
POL(s(x₁)) = x₁
POL(tt) = 0
POL(zeros) = 0

The following usable rules [FROCOS05] with respect to the argument filtering of the ordering [JAR06] were oriented:

0 → n__0
isNat(n__0) → tt
isNat(n__s(V1)) → isNat(activate(V1))
isNat(X) → n__isNat(X)
activate(n__zeros) → zeros
activate(n__0) → 0
activate(n__length(X)) → length(X)
activate(n__s(X)) → s(X)
activate(n__cons(X1, X2)) → cons(X1, X2)
activate(n__isNatIList(X)) → isNatIList(X)
isNatIList(n__cons(V1, V2)) → and(isNat(activate(V1)), n__isNatIList(activate(V2)))
and(tt, X) → activate(X)
activate(n__isNatList(X)) → isNatList(X)
isNatList(n__cons(V1, V2)) → and(isNat(activate(V1)), n__isNatList(activate(V2)))
activate(n__nil) → nil
activate(n__isNat(X)) → isNat(X)
activate(X) → X
s(X) → n__s(X)
cons(X1, X2) → n__cons(X1, X2)
length(X) → n__length(X)
length(cons(N, L)) → U11(and(isNatList(activate(L)), n__isNat(N)), activate(L))
isNatList(X) → n__isNatList(X)
isNatIList(X) → n__isNatIList(X)
U11(tt, L) → s(length(activate(L)))
zeros → cons(0, n__zeros)
zeros → n__zeros
nil → n__nil

(68) Obligation:

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

AND(tt, n__isNatIList(y_3)) → ACTIVATE(n__isNatIList(y_3))
ACTIVATE(n__isNatIList(X)) → ISNATILIST(X)
ISNATILIST(n__cons(n__0, y1)) → AND(isNat(0), n__isNatIList(activate(y1)))
ISNATILIST(n__cons(n__s(x0), y1)) → AND(isNat(s(x0)), n__isNatIList(activate(y1)))
ISNATILIST(n__cons(n__cons(x0, x1), y1)) → AND(isNat(cons(x0, x1)), n__isNatIList(activate(y1)))
ISNATILIST(n__cons(x0, y1)) → AND(isNat(x0), n__isNatIList(activate(y1)))

The TRS R consists of the following rules:

zeros → cons(0, n__zeros)
U11(tt, L) → s(length(activate(L)))
and(tt, X) → activate(X)
isNat(n__0) → tt
isNat(n__s(V1)) → isNat(activate(V1))
isNatIList(n__cons(V1, V2)) → and(isNat(activate(V1)), n__isNatIList(activate(V2)))
isNatList(n__cons(V1, V2)) → and(isNat(activate(V1)), n__isNatList(activate(V2)))
length(cons(N, L)) → U11(and(isNatList(activate(L)), n__isNat(N)), activate(L))
zeros → n__zeros
0 → n__0
length(X) → n__length(X)
s(X) → n__s(X)
cons(X1, X2) → n__cons(X1, X2)
isNatIList(X) → n__isNatIList(X)
nil → n__nil
isNatList(X) → n__isNatList(X)
isNat(X) → n__isNat(X)
activate(n__zeros) → zeros
activate(n__0) → 0
activate(n__length(X)) → length(X)
activate(n__s(X)) → s(X)
activate(n__cons(X1, X2)) → cons(X1, X2)
activate(n__isNatIList(X)) → isNatIList(X)
activate(n__nil) → nil
activate(n__isNatList(X)) → isNatList(X)
activate(n__isNat(X)) → isNat(X)
activate(X) → X

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

(69) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04,JAR06].

The following pairs can be oriented strictly and are deleted.

ISNATILIST(n__cons(n__s(x0), y1)) → AND(isNat(s(x0)), n__isNatIList(activate(y1)))

The remaining pairs can at least be oriented weakly.
Used ordering: Polynomial interpretation [POLO]:

POL(0) = 0
POL(ACTIVATE(x₁)) = x₁
POL(AND(x₁, x₂)) = x₂
POL(ISNATILIST(x₁)) = x₁
POL(U11(x₁, x₂)) = x₁ + x₂
POL(activate(x₁)) = x₁
POL(and(x₁, x₂)) = x₂
POL(cons(x₁, x₂)) = x₁ + x₂
POL(isNat(x₁)) = 1
POL(isNatIList(x₁)) = x₁
POL(isNatList(x₁)) = 0
POL(length(x₁)) = 1 + x₁
POL(n__0) = 0
POL(n__cons(x₁, x₂)) = x₁ + x₂
POL(n__isNat(x₁)) = 1
POL(n__isNatIList(x₁)) = x₁
POL(n__isNatList(x₁)) = 0
POL(n__length(x₁)) = 1 + x₁
POL(n__nil) = 0
POL(n__s(x₁)) = 1
POL(n__zeros) = 0
POL(nil) = 0
POL(s(x₁)) = 1
POL(tt) = 1
POL(zeros) = 0

The following usable rules [FROCOS05] with respect to the argument filtering of the ordering [JAR06] were oriented:

0 → n__0
isNat(n__0) → tt
isNat(n__s(V1)) → isNat(activate(V1))
isNat(X) → n__isNat(X)
activate(n__zeros) → zeros
activate(n__0) → 0
activate(n__length(X)) → length(X)
activate(n__s(X)) → s(X)
activate(n__cons(X1, X2)) → cons(X1, X2)
activate(n__isNatIList(X)) → isNatIList(X)
isNatIList(n__cons(V1, V2)) → and(isNat(activate(V1)), n__isNatIList(activate(V2)))
and(tt, X) → activate(X)
activate(n__isNatList(X)) → isNatList(X)
isNatList(n__cons(V1, V2)) → and(isNat(activate(V1)), n__isNatList(activate(V2)))
activate(n__nil) → nil
activate(n__isNat(X)) → isNat(X)
activate(X) → X
s(X) → n__s(X)
cons(X1, X2) → n__cons(X1, X2)
length(X) → n__length(X)
length(cons(N, L)) → U11(and(isNatList(activate(L)), n__isNat(N)), activate(L))
isNatList(X) → n__isNatList(X)
isNatIList(X) → n__isNatIList(X)
U11(tt, L) → s(length(activate(L)))
zeros → cons(0, n__zeros)
zeros → n__zeros
nil → n__nil

(70) Obligation:

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

AND(tt, n__isNatIList(y_3)) → ACTIVATE(n__isNatIList(y_3))
ACTIVATE(n__isNatIList(X)) → ISNATILIST(X)
ISNATILIST(n__cons(n__0, y1)) → AND(isNat(0), n__isNatIList(activate(y1)))
ISNATILIST(n__cons(n__cons(x0, x1), y1)) → AND(isNat(cons(x0, x1)), n__isNatIList(activate(y1)))
ISNATILIST(n__cons(x0, y1)) → AND(isNat(x0), n__isNatIList(activate(y1)))

The TRS R consists of the following rules:

zeros → cons(0, n__zeros)
U11(tt, L) → s(length(activate(L)))
and(tt, X) → activate(X)
isNat(n__0) → tt
isNat(n__s(V1)) → isNat(activate(V1))
isNatIList(n__cons(V1, V2)) → and(isNat(activate(V1)), n__isNatIList(activate(V2)))
isNatList(n__cons(V1, V2)) → and(isNat(activate(V1)), n__isNatList(activate(V2)))
length(cons(N, L)) → U11(and(isNatList(activate(L)), n__isNat(N)), activate(L))
zeros → n__zeros
0 → n__0
length(X) → n__length(X)
s(X) → n__s(X)
cons(X1, X2) → n__cons(X1, X2)
isNatIList(X) → n__isNatIList(X)
nil → n__nil
isNatList(X) → n__isNatList(X)
isNat(X) → n__isNat(X)
activate(n__zeros) → zeros
activate(n__0) → 0
activate(n__length(X)) → length(X)
activate(n__s(X)) → s(X)
activate(n__cons(X1, X2)) → cons(X1, X2)
activate(n__isNatIList(X)) → isNatIList(X)
activate(n__nil) → nil
activate(n__isNatList(X)) → isNatList(X)
activate(n__isNat(X)) → isNat(X)
activate(X) → X

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

(71) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04,JAR06].

The following pairs can be oriented strictly and are deleted.

ISNATILIST(n__cons(n__cons(x0, x1), y1)) → AND(isNat(cons(x0, x1)), n__isNatIList(activate(y1)))

The remaining pairs can at least be oriented weakly.
Used ordering: Polynomial interpretation [POLO]:

POL(0) = 0
POL(ACTIVATE(x₁)) = x₁
POL(AND(x₁, x₂)) = x₂
POL(ISNATILIST(x₁)) = x₁
POL(U11(x₁, x₂)) = 0
POL(activate(x₁)) = 1 + x₁
POL(and(x₁, x₂)) = 1 + x₂
POL(cons(x₁, x₂)) = 1 + x₁ + x₂
POL(isNat(x₁)) = 0
POL(isNatIList(x₁)) = 1 + x₁
POL(isNatList(x₁)) = 1
POL(length(x₁)) = 0
POL(n__0) = 0
POL(n__cons(x₁, x₂)) = 1 + x₁ + x₂
POL(n__isNat(x₁)) = 0
POL(n__isNatIList(x₁)) = x₁
POL(n__isNatList(x₁)) = 0
POL(n__length(x₁)) = 0
POL(n__nil) = 0
POL(n__s(x₁)) = 0
POL(n__zeros) = 0
POL(nil) = 0
POL(s(x₁)) = 0
POL(tt) = 0
POL(zeros) = 1

The following usable rules [FROCOS05] with respect to the argument filtering of the ordering [JAR06] were oriented:

0 → n__0
isNat(n__0) → tt
isNat(n__s(V1)) → isNat(activate(V1))
isNat(X) → n__isNat(X)
activate(n__zeros) → zeros
activate(n__0) → 0
activate(n__length(X)) → length(X)
activate(n__s(X)) → s(X)
activate(n__cons(X1, X2)) → cons(X1, X2)
activate(n__isNatIList(X)) → isNatIList(X)
isNatIList(n__cons(V1, V2)) → and(isNat(activate(V1)), n__isNatIList(activate(V2)))
and(tt, X) → activate(X)
activate(n__isNatList(X)) → isNatList(X)
isNatList(n__cons(V1, V2)) → and(isNat(activate(V1)), n__isNatList(activate(V2)))
activate(n__nil) → nil
activate(n__isNat(X)) → isNat(X)
activate(X) → X
cons(X1, X2) → n__cons(X1, X2)
length(X) → n__length(X)
length(cons(N, L)) → U11(and(isNatList(activate(L)), n__isNat(N)), activate(L))
isNatList(X) → n__isNatList(X)
isNatIList(X) → n__isNatIList(X)
U11(tt, L) → s(length(activate(L)))
s(X) → n__s(X)
zeros → cons(0, n__zeros)
zeros → n__zeros
nil → n__nil

(72) Obligation:

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

AND(tt, n__isNatIList(y_3)) → ACTIVATE(n__isNatIList(y_3))
ACTIVATE(n__isNatIList(X)) → ISNATILIST(X)
ISNATILIST(n__cons(n__0, y1)) → AND(isNat(0), n__isNatIList(activate(y1)))
ISNATILIST(n__cons(x0, y1)) → AND(isNat(x0), n__isNatIList(activate(y1)))

The TRS R consists of the following rules:

zeros → cons(0, n__zeros)
U11(tt, L) → s(length(activate(L)))
and(tt, X) → activate(X)
isNat(n__0) → tt
isNat(n__s(V1)) → isNat(activate(V1))
isNatIList(n__cons(V1, V2)) → and(isNat(activate(V1)), n__isNatIList(activate(V2)))
isNatList(n__cons(V1, V2)) → and(isNat(activate(V1)), n__isNatList(activate(V2)))
length(cons(N, L)) → U11(and(isNatList(activate(L)), n__isNat(N)), activate(L))
zeros → n__zeros
0 → n__0
length(X) → n__length(X)
s(X) → n__s(X)
cons(X1, X2) → n__cons(X1, X2)
isNatIList(X) → n__isNatIList(X)
nil → n__nil
isNatList(X) → n__isNatList(X)
isNat(X) → n__isNat(X)
activate(n__zeros) → zeros
activate(n__0) → 0
activate(n__length(X)) → length(X)
activate(n__s(X)) → s(X)
activate(n__cons(X1, X2)) → cons(X1, X2)
activate(n__isNatIList(X)) → isNatIList(X)
activate(n__nil) → nil
activate(n__isNatList(X)) → isNatList(X)
activate(n__isNat(X)) → isNat(X)
activate(X) → X

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

(73) Obligation:

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

ISNAT(n__s(V1)) → ISNAT(activate(V1))

The TRS R consists of the following rules:

zeros → cons(0, n__zeros)
U11(tt, L) → s(length(activate(L)))
and(tt, X) → activate(X)
isNat(n__0) → tt
isNat(n__s(V1)) → isNat(activate(V1))
isNatIList(n__cons(V1, V2)) → and(isNat(activate(V1)), n__isNatIList(activate(V2)))
isNatList(n__cons(V1, V2)) → and(isNat(activate(V1)), n__isNatList(activate(V2)))
length(cons(N, L)) → U11(and(isNatList(activate(L)), n__isNat(N)), activate(L))
zeros → n__zeros
0 → n__0
length(X) → n__length(X)
s(X) → n__s(X)
cons(X1, X2) → n__cons(X1, X2)
isNatIList(X) → n__isNatIList(X)
nil → n__nil
isNatList(X) → n__isNatList(X)
isNat(X) → n__isNat(X)
activate(n__zeros) → zeros
activate(n__0) → 0
activate(n__length(X)) → length(X)
activate(n__s(X)) → s(X)
activate(n__cons(X1, X2)) → cons(X1, X2)
activate(n__isNatIList(X)) → isNatIList(X)
activate(n__nil) → nil
activate(n__isNatList(X)) → isNatList(X)
activate(n__isNat(X)) → isNat(X)
activate(X) → X

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

(74) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04,JAR06].

The following pairs can be oriented strictly and are deleted.

ISNAT(n__s(V1)) → ISNAT(activate(V1))

The remaining pairs can at least be oriented weakly.
Used ordering: Polynomial Order [NEGPOLO,POLO] with Interpretation:

POL( ISNAT(x₁) ) = x₁ + 2

POL( activate(x₁) ) = x₁

POL( n__zeros ) = 0

POL( zeros ) = 0

POL( n__0 ) = 0

POL( 0 ) = 0

POL( n__length(x₁) ) = 2x₁

POL( length(x₁) ) = 2x₁

POL( n__s(x₁) ) = x₁ + 1

POL( s(x₁) ) = x₁ + 1

POL( n__cons(x₁, x₂) ) = 2x₁ + 2x₂

POL( cons(x₁, x₂) ) = 2x₁ + 2x₂

POL( n__isNatIList(x₁) ) = max{0, -2}

POL( isNatIList(x₁) ) = 0

POL( and(x₁, x₂) ) = max{0, 2x₁ + x₂ - 2}

POL( isNat(x₁) ) = 1

POL( tt ) = 1

POL( n__isNatList(x₁) ) = x₁

POL( isNatList(x₁) ) = x₁

POL( n__nil ) = 0

POL( nil ) = 0

POL( n__isNat(x₁) ) = 1

POL( U11(x₁, x₂) ) = x₁ + 2x₂

The following usable rules [FROCOS05] with respect to the argument filtering of the ordering [JAR06] were oriented:

activate(n__zeros) → zeros
activate(n__0) → 0
activate(n__length(X)) → length(X)
activate(n__s(X)) → s(X)
activate(n__cons(X1, X2)) → cons(X1, X2)
activate(n__isNatIList(X)) → isNatIList(X)
isNatIList(n__cons(V1, V2)) → and(isNat(activate(V1)), n__isNatIList(activate(V2)))
and(tt, X) → activate(X)
activate(n__isNatList(X)) → isNatList(X)
isNatList(n__cons(V1, V2)) → and(isNat(activate(V1)), n__isNatList(activate(V2)))
activate(n__nil) → nil
activate(n__isNat(X)) → isNat(X)
activate(X) → X
length(X) → n__length(X)
length(cons(N, L)) → U11(and(isNatList(activate(L)), n__isNat(N)), activate(L))
isNatList(X) → n__isNatList(X)
isNatIList(X) → n__isNatIList(X)
isNat(n__0) → tt
isNat(X) → n__isNat(X)
isNat(n__s(V1)) → isNat(activate(V1))
U11(tt, L) → s(length(activate(L)))
s(X) → n__s(X)
zeros → cons(0, n__zeros)
zeros → n__zeros
0 → n__0
cons(X1, X2) → n__cons(X1, X2)
nil → n__nil

(75) Obligation:

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

zeros → cons(0, n__zeros)
U11(tt, L) → s(length(activate(L)))
and(tt, X) → activate(X)
isNat(n__0) → tt
isNat(n__s(V1)) → isNat(activate(V1))
isNatIList(n__cons(V1, V2)) → and(isNat(activate(V1)), n__isNatIList(activate(V2)))
isNatList(n__cons(V1, V2)) → and(isNat(activate(V1)), n__isNatList(activate(V2)))
length(cons(N, L)) → U11(and(isNatList(activate(L)), n__isNat(N)), activate(L))
zeros → n__zeros
0 → n__0
length(X) → n__length(X)
s(X) → n__s(X)
cons(X1, X2) → n__cons(X1, X2)
isNatIList(X) → n__isNatIList(X)
nil → n__nil
isNatList(X) → n__isNatList(X)
isNat(X) → n__isNat(X)
activate(n__zeros) → zeros
activate(n__0) → 0
activate(n__length(X)) → length(X)
activate(n__s(X)) → s(X)
activate(n__cons(X1, X2)) → cons(X1, X2)
activate(n__isNatIList(X)) → isNatIList(X)
activate(n__nil) → nil
activate(n__isNatList(X)) → isNatList(X)
activate(n__isNat(X)) → isNat(X)
activate(X) → X

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

(76) PisEmptyProof (EQUIVALENT transformation)

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

(77) YES

(78) Obligation:

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

U11¹(tt, L) → LENGTH(activate(L))
LENGTH(cons(N, L)) → U11¹(and(isNatList(activate(L)), n__isNat(N)), activate(L))

The TRS R consists of the following rules:

zeros → cons(0, n__zeros)
U11(tt, L) → s(length(activate(L)))
and(tt, X) → activate(X)
isNat(n__0) → tt
isNat(n__s(V1)) → isNat(activate(V1))
isNatIList(n__cons(V1, V2)) → and(isNat(activate(V1)), n__isNatIList(activate(V2)))
isNatList(n__cons(V1, V2)) → and(isNat(activate(V1)), n__isNatList(activate(V2)))
length(cons(N, L)) → U11(and(isNatList(activate(L)), n__isNat(N)), activate(L))
zeros → n__zeros
0 → n__0
length(X) → n__length(X)
s(X) → n__s(X)
cons(X1, X2) → n__cons(X1, X2)
isNatIList(X) → n__isNatIList(X)
nil → n__nil
isNatList(X) → n__isNatList(X)
isNat(X) → n__isNat(X)
activate(n__zeros) → zeros
activate(n__0) → 0
activate(n__length(X)) → length(X)
activate(n__s(X)) → s(X)
activate(n__cons(X1, X2)) → cons(X1, X2)
activate(n__isNatIList(X)) → isNatIList(X)
activate(n__nil) → nil
activate(n__isNatList(X)) → isNatList(X)
activate(n__isNat(X)) → isNat(X)
activate(X) → X

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

(79) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04,JAR06].

The following pairs can be oriented strictly and are deleted.

U11¹(tt, L) → LENGTH(activate(L))

The remaining pairs can at least be oriented weakly.
Used ordering: Polynomial Order [NEGPOLO,POLO] with Interpretation:

POL( LENGTH(x₁) ) = max{0, -2}

POL( U11¹(x₁, x₂) ) = x₁

POL( activate(x₁) ) = 2x₁

POL( n__zeros ) = 0

POL( zeros ) = 0

POL( n__0 ) = 0

POL( 0 ) = 0

POL( n__length(x₁) ) = 1

POL( length(x₁) ) = 1

POL( n__s(x₁) ) = 0

POL( s(x₁) ) = max{0, -2}

POL( n__cons(x₁, x₂) ) = 0

POL( cons(x₁, x₂) ) = max{0, -2}

POL( n__isNatIList(x₁) ) = max{0, -2}

POL( isNatIList(x₁) ) = 0

POL( and(x₁, x₂) ) = max{0, 2x₁ + 2x₂ - 2}

POL( isNat(x₁) ) = 1

POL( tt ) = 1

POL( n__isNatList(x₁) ) = max{0, -2}

POL( isNatList(x₁) ) = max{0, -2}

POL( n__nil ) = 2

POL( nil ) = 2

POL( n__isNat(x₁) ) = 1

POL( U11(x₁, x₂) ) = 2x₁

The following usable rules [FROCOS05] with respect to the argument filtering of the ordering [JAR06] were oriented:

activate(n__zeros) → zeros
activate(n__0) → 0
activate(n__length(X)) → length(X)
activate(n__s(X)) → s(X)
activate(n__cons(X1, X2)) → cons(X1, X2)
activate(n__isNatIList(X)) → isNatIList(X)
isNatIList(n__cons(V1, V2)) → and(isNat(activate(V1)), n__isNatIList(activate(V2)))
and(tt, X) → activate(X)
activate(n__isNatList(X)) → isNatList(X)
isNatList(n__cons(V1, V2)) → and(isNat(activate(V1)), n__isNatList(activate(V2)))
activate(n__nil) → nil
activate(n__isNat(X)) → isNat(X)
activate(X) → X
isNatList(X) → n__isNatList(X)
length(X) → n__length(X)
length(cons(N, L)) → U11(and(isNatList(activate(L)), n__isNat(N)), activate(L))
isNatIList(X) → n__isNatIList(X)
isNat(n__0) → tt
isNat(X) → n__isNat(X)
isNat(n__s(V1)) → isNat(activate(V1))
U11(tt, L) → s(length(activate(L)))
s(X) → n__s(X)
zeros → cons(0, n__zeros)
zeros → n__zeros
0 → n__0
cons(X1, X2) → n__cons(X1, X2)
nil → n__nil

(80) Obligation:

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

LENGTH(cons(N, L)) → U11¹(and(isNatList(activate(L)), n__isNat(N)), activate(L))

The TRS R consists of the following rules:

zeros → cons(0, n__zeros)
U11(tt, L) → s(length(activate(L)))
and(tt, X) → activate(X)
isNat(n__0) → tt
isNat(n__s(V1)) → isNat(activate(V1))
isNatIList(n__cons(V1, V2)) → and(isNat(activate(V1)), n__isNatIList(activate(V2)))
isNatList(n__cons(V1, V2)) → and(isNat(activate(V1)), n__isNatList(activate(V2)))
length(cons(N, L)) → U11(and(isNatList(activate(L)), n__isNat(N)), activate(L))
zeros → n__zeros
0 → n__0
length(X) → n__length(X)
s(X) → n__s(X)
cons(X1, X2) → n__cons(X1, X2)
isNatIList(X) → n__isNatIList(X)
nil → n__nil
isNatList(X) → n__isNatList(X)
isNat(X) → n__isNat(X)
activate(n__zeros) → zeros
activate(n__0) → 0
activate(n__length(X)) → length(X)
activate(n__s(X)) → s(X)
activate(n__cons(X1, X2)) → cons(X1, X2)
activate(n__isNatIList(X)) → isNatIList(X)
activate(n__nil) → nil
activate(n__isNatList(X)) → isNatList(X)
activate(n__isNat(X)) → isNat(X)
activate(X) → X

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

(81) DependencyGraphProof (EQUIVALENT transformation)

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