Termination proof

1: switching to dependency pairs

The following set of initial dependency pairs has been identified.

a__U11#( tt , L ) → a__length#( mark( L ) )

a__U11#( tt , L ) → mark#( L )

a__and#( tt , X ) → mark#( X )

a__isNat#( length( V1 ) ) → a__isNatList#( V1 )

a__isNat#( s( V1 ) ) → a__isNat#( V1 )

a__isNatIList#( V ) → a__isNatList#( V )

a__isNatIList#( cons( V1 , V2 ) ) → a__and#( a__isNat( V1 ) , isNatIList( V2 ) )

a__isNatIList#( cons( V1 , V2 ) ) → a__isNat#( V1 )

a__isNatList#( cons( V1 , V2 ) ) → a__and#( a__isNat( V1 ) , isNatList( V2 ) )

a__isNatList#( cons( V1 , V2 ) ) → a__isNat#( V1 )

a__length#( cons( N , L ) ) → a__U11#( a__and( a__isNatList( L ) , isNat( N ) ) , L )

a__length#( cons( N , L ) ) → a__and#( a__isNatList( L ) , isNat( N ) )

a__length#( cons( N , L ) ) → a__isNatList#( L )

mark#( zeros ) → a__zeros#

mark#( U11( X1 , X2 ) ) → a__U11#( mark( X1 ) , X2 )

mark#( U11( X1 , X2 ) ) → mark#( X1 )

mark#( length( X ) ) → a__length#( mark( X ) )

mark#( length( X ) ) → mark#( X )

mark#( and( X1 , X2 ) ) → a__and#( mark( X1 ) , X2 )

mark#( and( X1 , X2 ) ) → mark#( X1 )

mark#( isNat( X ) ) → a__isNat#( X )

mark#( isNatList( X ) ) → a__isNatList#( X )

mark#( isNatIList( X ) ) → a__isNatIList#( X )

mark#( cons( X1 , X2 ) ) → mark#( X1 )

mark#( s( X ) ) → mark#( X )

1.1: dependency graph processor

The dependency pairs are split into 1 component(s).

The 1st component contains the pair(s)

a__length#( cons( N , L ) ) → a__U11#( a__and( a__isNatList( L ) , isNat( N ) ) , L )

a__U11#( tt , L ) → a__length#( mark( L ) )

a__length#( cons( N , L ) ) → a__and#( a__isNatList( L ) , isNat( N ) )

a__and#( tt , X ) → mark#( X )

mark#( U11( X1 , X2 ) ) → a__U11#( mark( X1 ) , X2 )

a__U11#( tt , L ) → mark#( L )

mark#( U11( X1 , X2 ) ) → mark#( X1 )

mark#( length( X ) ) → a__length#( mark( X ) )

a__length#( cons( N , L ) ) → a__isNatList#( L )

a__isNatList#( cons( V1 , V2 ) ) → a__and#( a__isNat( V1 ) , isNatList( V2 ) )

a__isNatList#( cons( V1 , V2 ) ) → a__isNat#( V1 )

a__isNat#( length( V1 ) ) → a__isNatList#( V1 )

a__isNat#( s( V1 ) ) → a__isNat#( V1 )

mark#( length( X ) ) → mark#( X )

mark#( and( X1 , X2 ) ) → a__and#( mark( X1 ) , X2 )

mark#( and( X1 , X2 ) ) → mark#( X1 )

mark#( isNat( X ) ) → a__isNat#( X )

mark#( isNatList( X ) ) → a__isNatList#( X )

mark#( isNatIList( X ) ) → a__isNatIList#( X )

a__isNatIList#( V ) → a__isNatList#( V )

a__isNatIList#( cons( V1 , V2 ) ) → a__and#( a__isNat( V1 ) , isNatIList( V2 ) )

a__isNatIList#( cons( V1 , V2 ) ) → a__isNat#( V1 )

mark#( cons( X1 , X2 ) ) → mark#( X1 )

mark#( s( X ) ) → mark#( X )

1.1.1: reduction pair processor

Using the following reduction pair

Linear polynomial interpretation over the naturals

[a__isNatList# (x₁) ] = 0

[length (x₁) ] = x₁ + 1

[a__length (x₁) ] = x₁ + 1

[a__isNatIList (x₁) ] = 0

[0] = 0

[isNatList (x₁) ] = 0

[a__length# (x₁) ] = x₁ + 1

[cons (x₁, x₂) ] = x₁ + 3 x₂

[and (x₁, x₂) ] = 2 x₁ + 2 x₂

[a__U11# (x₁, x₂) ] = 2 x₁ + 1

[s (x₁) ] = x₁

[isNatIList (x₁) ] = 0

[a__U11 (x₁, x₂) ] = x₁ + 2 x₂ + 1

[mark (x₁) ] = 2 x₁

[zeros] = 0

[a__zeros] = 0

[a__and# (x₁, x₂) ] = 2 x₁

[mark# (x₁) ] = 2 x₁

[nil] = 0

[a__isNatIList# (x₁) ] = 0

[a__isNatList (x₁) ] = 0

[tt] = 0

[a__isNat# (x₁) ] = 0

[a__and (x₁, x₂) ] = 2 x₁ + 2 x₂

[isNat (x₁) ] = 0

[U11 (x₁, x₂) ] = x₁ + x₂ + 1

[a__isNat (x₁) ] = 0

[f(x₁, ..., x_n)] = x₁ + ... + x_n + 1 for all other symbols f of arity n

one remains with the following pair(s).

a__length#( cons( N , L ) ) → a__U11#( a__and( a__isNatList( L ) , isNat( N ) ) , L )

a__U11#( tt , L ) → a__length#( mark( L ) )

a__and#( tt , X ) → mark#( X )

a__isNatList#( cons( V1 , V2 ) ) → a__and#( a__isNat( V1 ) , isNatList( V2 ) )

a__isNatList#( cons( V1 , V2 ) ) → a__isNat#( V1 )

a__isNat#( length( V1 ) ) → a__isNatList#( V1 )

a__isNat#( s( V1 ) ) → a__isNat#( V1 )

mark#( and( X1 , X2 ) ) → a__and#( mark( X1 ) , X2 )

mark#( and( X1 , X2 ) ) → mark#( X1 )

mark#( isNat( X ) ) → a__isNat#( X )

mark#( isNatList( X ) ) → a__isNatList#( X )

mark#( isNatIList( X ) ) → a__isNatIList#( X )

a__isNatIList#( V ) → a__isNatList#( V )

a__isNatIList#( cons( V1 , V2 ) ) → a__and#( a__isNat( V1 ) , isNatIList( V2 ) )

a__isNatIList#( cons( V1 , V2 ) ) → a__isNat#( V1 )

mark#( cons( X1 , X2 ) ) → mark#( X1 )

mark#( s( X ) ) → mark#( X )

1.1.1.1: dependency graph processor

The dependency pairs are split into 2 component(s).

The 1st component contains the pair(s)

a__U11#( tt , L ) → a__length#( mark( L ) )

a__length#( cons( N , L ) ) → a__U11#( a__and( a__isNatList( L ) , isNat( N ) ) , L )

1.1.1.1.1: reduction pair processor

Using the following reduction pair

Linear polynomial interpretation over the naturals

[a__U11 (x₁, x₂) ] = x₁ + x₂ + 1

[length (x₁) ] = x₁

[mark (x₁) ] = x₁ + 2

[zeros] = 0

[a__length (x₁) ] = x₁

[a__isNatIList (x₁) ] = 2 x₁ + 2

[a__zeros] = 2

[0] = 1

[nil] = 2

[isNatList (x₁) ] = x₁

[a__length# (x₁) ] = x₁

[cons (x₁, x₂) ] = x₁ + 3 x₂ + 1

[a__isNatList (x₁) ] = x₁

[tt] = 2

[a__and (x₁, x₂) ] = x₁ + x₂

[isNat (x₁) ] = x₁

[U11 (x₁, x₂) ] = x₁ + x₂ + 1

[and (x₁, x₂) ] = x₁ + x₂

[a__U11# (x₁, x₂) ] = x₁ + 2 x₂

[s (x₁) ] = x₁

[a__isNat (x₁) ] = x₁ + 1

[isNatIList (x₁) ] = 2 x₁ + 2

[f(x₁, ..., x_n)] = x₁ + ... + x_n + 1 for all other symbols f of arity n

one remains with the following pair(s).

a__U11#( tt , L ) → a__length#( mark( L ) )

1.1.1.1.1.1: dependency graph processor

The dependency pairs are split into 0 component(s).

The 2nd component contains the pair(s)

mark#( and( X1 , X2 ) ) → a__and#( mark( X1 ) , X2 )

a__and#( tt , X ) → mark#( X )

mark#( and( X1 , X2 ) ) → mark#( X1 )

mark#( isNat( X ) ) → a__isNat#( X )

a__isNat#( length( V1 ) ) → a__isNatList#( V1 )

a__isNatList#( cons( V1 , V2 ) ) → a__and#( a__isNat( V1 ) , isNatList( V2 ) )

a__isNatList#( cons( V1 , V2 ) ) → a__isNat#( V1 )

a__isNat#( s( V1 ) ) → a__isNat#( V1 )

mark#( isNatList( X ) ) → a__isNatList#( X )

mark#( isNatIList( X ) ) → a__isNatIList#( X )

a__isNatIList#( V ) → a__isNatList#( V )

a__isNatIList#( cons( V1 , V2 ) ) → a__and#( a__isNat( V1 ) , isNatIList( V2 ) )

a__isNatIList#( cons( V1 , V2 ) ) → a__isNat#( V1 )

mark#( cons( X1 , X2 ) ) → mark#( X1 )

mark#( s( X ) ) → mark#( X )

1.1.1.1.2: reduction pair processor

Using the following reduction pair

Linear polynomial interpretation over the naturals

[a__isNatList# (x₁) ] = 0

[length (x₁) ] = 0

[a__length (x₁) ] = 0

[a__isNatIList (x₁) ] = 0

[0] = 0

[cons (x₁, x₂) ] = 2 x₁ + 2

[isNatList (x₁) ] = 0

[and (x₁, x₂) ] = x₁ + x₂

[s (x₁) ] = 2 x₁

[isNatIList (x₁) ] = 0

[a__U11 (x₁, x₂) ] = 0

[zeros] = 2

[mark (x₁) ] = x₁

[a__zeros] = 2

[a__and# (x₁, x₂) ] = 2 x₁

[mark# (x₁) ] = 2 x₁

[a__isNatIList# (x₁) ] = 0

[nil] = 1

[a__isNatList (x₁) ] = 0

[a__isNat# (x₁) ] = 0

[tt] = 0

[a__and (x₁, x₂) ] = x₁ + x₂

[isNat (x₁) ] = 0

[U11 (x₁, x₂) ] = 0

[a__isNat (x₁) ] = 0

[f(x₁, ..., x_n)] = x₁ + ... + x_n + 1 for all other symbols f of arity n

one remains with the following pair(s).

1.1.1.1.2.1: reduction pair processor

Using the following reduction pair

Linear polynomial interpretation over the naturals

[a__isNatList# (x₁) ] = 0

[length (x₁) ] = 0

[a__length (x₁) ] = 0

[a__isNatIList (x₁) ] = 2

[0] = 0

[cons (x₁, x₂) ] = 0

[isNatList (x₁) ] = 0

[and (x₁, x₂) ] = 2 x₁ + x₂

[s (x₁) ] = 2 x₁

[isNatIList (x₁) ] = 1

[a__U11 (x₁, x₂) ] = 0

[zeros] = 0

[mark (x₁) ] = 2 x₁

[a__zeros] = 0

[a__and# (x₁, x₂) ] = x₁ + x₂

[mark# (x₁) ] = x₁

[a__isNatIList# (x₁) ] = 1

[nil] = 1

[a__isNatList (x₁) ] = 0

[a__isNat# (x₁) ] = 0

[tt] = 0

[a__and (x₁, x₂) ] = 2 x₁ + 2 x₂

[isNat (x₁) ] = 0

[U11 (x₁, x₂) ] = 0

[a__isNat (x₁) ] = 0

[f(x₁, ..., x_n)] = x₁ + ... + x_n + 1 for all other symbols f of arity n

one remains with the following pair(s).

mark#( and( X1 , X2 ) ) → a__and#( mark( X1 ) , X2 )

a__and#( tt , X ) → mark#( X )

mark#( and( X1 , X2 ) ) → mark#( X1 )

mark#( isNat( X ) ) → a__isNat#( X )

a__isNat#( length( V1 ) ) → a__isNatList#( V1 )

a__isNatList#( cons( V1 , V2 ) ) → a__and#( a__isNat( V1 ) , isNatList( V2 ) )

a__isNatList#( cons( V1 , V2 ) ) → a__isNat#( V1 )

a__isNat#( s( V1 ) ) → a__isNat#( V1 )

mark#( isNatList( X ) ) → a__isNatList#( X )

mark#( isNatIList( X ) ) → a__isNatIList#( X )

a__isNatIList#( cons( V1 , V2 ) ) → a__and#( a__isNat( V1 ) , isNatIList( V2 ) )

mark#( s( X ) ) → mark#( X )

1.1.1.1.2.1.1: reduction pair processor

Using the following reduction pair

Linear polynomial interpretation over the naturals

[a__isNatList# (x₁) ] = 2 x₁

[length (x₁) ] = x₁ + 2

[a__length (x₁) ] = x₁ + 2

[a__isNatIList (x₁) ] = 2 x₁

[0] = 0

[cons (x₁, x₂) ] = 2 x₁ + 3 x₂

[isNatList (x₁) ] = 2 x₁

[and (x₁, x₂) ] = 2 x₁ + 2 x₂

[s (x₁) ] = x₁

[isNatIList (x₁) ] = x₁

[a__U11 (x₁, x₂) ] = 3 x₁ + 2

[zeros] = 0

[mark (x₁) ] = 2 x₁

[a__zeros] = 0

[a__and# (x₁, x₂) ] = x₁ + 2 x₂

[mark# (x₁) ] = x₁

[a__isNatIList# (x₁) ] = x₁

[nil] = 1

[a__isNatList (x₁) ] = 2 x₁

[a__isNat# (x₁) ] = 2 x₁

[tt] = 0

[a__and (x₁, x₂) ] = 2 x₁ + 2 x₂

[isNat (x₁) ] = 2 x₁

[U11 (x₁, x₂) ] = 2 x₁ + 1

[a__isNat (x₁) ] = 2 x₁

[f(x₁, ..., x_n)] = x₁ + ... + x_n + 1 for all other symbols f of arity n

one remains with the following pair(s).

mark#( and( X1 , X2 ) ) → a__and#( mark( X1 ) , X2 )

a__and#( tt , X ) → mark#( X )

mark#( and( X1 , X2 ) ) → mark#( X1 )

mark#( isNat( X ) ) → a__isNat#( X )

a__isNatList#( cons( V1 , V2 ) ) → a__and#( a__isNat( V1 ) , isNatList( V2 ) )

a__isNatList#( cons( V1 , V2 ) ) → a__isNat#( V1 )

a__isNat#( s( V1 ) ) → a__isNat#( V1 )

mark#( isNatList( X ) ) → a__isNatList#( X )

mark#( isNatIList( X ) ) → a__isNatIList#( X )

a__isNatIList#( cons( V1 , V2 ) ) → a__and#( a__isNat( V1 ) , isNatIList( V2 ) )

mark#( s( X ) ) → mark#( X )

1.1.1.1.2.1.1.1: dependency graph processor

The dependency pairs are split into 2 component(s).

The 1st component contains the pair(s)

a__and#( tt , X ) → mark#( X )

mark#( and( X1 , X2 ) ) → a__and#( mark( X1 ) , X2 )

mark#( and( X1 , X2 ) ) → mark#( X1 )

mark#( isNatList( X ) ) → a__isNatList#( X )

a__isNatList#( cons( V1 , V2 ) ) → a__and#( a__isNat( V1 ) , isNatList( V2 ) )

mark#( isNatIList( X ) ) → a__isNatIList#( X )

a__isNatIList#( cons( V1 , V2 ) ) → a__and#( a__isNat( V1 ) , isNatIList( V2 ) )

mark#( s( X ) ) → mark#( X )

1.1.1.1.2.1.1.1.1: reduction pair processor

Using the following reduction pair

Linear polynomial interpretation over the naturals

[a__U11 (x₁, x₂) ] = 0

[a__isNatList# (x₁) ] = 0

[length (x₁) ] = 0

[zeros] = 1

[mark (x₁) ] = 2 x₁

[a__length (x₁) ] = 0

[a__isNatIList (x₁) ] = 2 x₁ + 2

[a__zeros] = 2

[a__and# (x₁, x₂) ] = x₁

[mark# (x₁) ] = x₁

[0] = 0

[nil] = 0

[a__isNatIList# (x₁) ] = x₁

[cons (x₁, x₂) ] = x₁ + 1

[isNatList (x₁) ] = 0

[a__isNatList (x₁) ] = 0

[tt] = 0

[a__and (x₁, x₂) ] = x₁ + 2 x₂

[isNat (x₁) ] = 0

[U11 (x₁, x₂) ] = 0

[and (x₁, x₂) ] = x₁ + x₂

[s (x₁) ] = 2 x₁

[a__isNat (x₁) ] = 0

[isNatIList (x₁) ] = x₁ + 1

[f(x₁, ..., x_n)] = x₁ + ... + x_n + 1 for all other symbols f of arity n

one remains with the following pair(s).

a__and#( tt , X ) → mark#( X )

mark#( and( X1 , X2 ) ) → a__and#( mark( X1 ) , X2 )

mark#( and( X1 , X2 ) ) → mark#( X1 )

mark#( isNatList( X ) ) → a__isNatList#( X )

a__isNatList#( cons( V1 , V2 ) ) → a__and#( a__isNat( V1 ) , isNatList( V2 ) )

a__isNatIList#( cons( V1 , V2 ) ) → a__and#( a__isNat( V1 ) , isNatIList( V2 ) )

mark#( s( X ) ) → mark#( X )

1.1.1.1.2.1.1.1.1.1: dependency graph processor

The dependency pairs are split into 1 component(s).

The 1st component contains the pair(s)

mark#( and( X1 , X2 ) ) → a__and#( mark( X1 ) , X2 )

a__and#( tt , X ) → mark#( X )

mark#( and( X1 , X2 ) ) → mark#( X1 )

mark#( isNatList( X ) ) → a__isNatList#( X )

a__isNatList#( cons( V1 , V2 ) ) → a__and#( a__isNat( V1 ) , isNatList( V2 ) )

mark#( s( X ) ) → mark#( X )

1.1.1.1.2.1.1.1.1.1.1: reduction pair processor

Using the following reduction pair

Linear polynomial interpretation over the naturals

[a__U11 (x₁, x₂) ] = x₁ + 2 x₂

[a__isNatList# (x₁) ] = x₁ + 1

[length (x₁) ] = x₁

[mark (x₁) ] = x₁ + 1

[zeros] = 0

[a__length (x₁) ] = x₁

[a__isNatIList (x₁) ] = 2 x₁ + 2

[a__zeros] = 1

[a__and# (x₁, x₂) ] = x₁ + x₂

[mark# (x₁) ] = x₁ + 1

[0] = 1

[nil] = 1

[cons (x₁, x₂) ] = x₁ + 3 x₂

[isNatList (x₁) ] = x₁

[a__isNatList (x₁) ] = x₁

[tt] = 1

[a__and (x₁, x₂) ] = x₁ + x₂

[isNat (x₁) ] = x₁

[U11 (x₁, x₂) ] = x₁ + 2 x₂

[and (x₁, x₂) ] = x₁ + x₂

[s (x₁) ] = x₁

[a__isNat (x₁) ] = x₁

[isNatIList (x₁) ] = 2 x₁ + 1

[f(x₁, ..., x_n)] = x₁ + ... + x_n + 1 for all other symbols f of arity n

one remains with the following pair(s).

mark#( and( X1 , X2 ) ) → a__and#( mark( X1 ) , X2 )

a__and#( tt , X ) → mark#( X )

mark#( and( X1 , X2 ) ) → mark#( X1 )

mark#( isNatList( X ) ) → a__isNatList#( X )

mark#( s( X ) ) → mark#( X )

1.1.1.1.2.1.1.1.1.1.1.1: dependency graph processor

The dependency pairs are split into 1 component(s).

The 1st component contains the pair(s)

a__and#( tt , X ) → mark#( X )

mark#( and( X1 , X2 ) ) → a__and#( mark( X1 ) , X2 )

mark#( and( X1 , X2 ) ) → mark#( X1 )

mark#( s( X ) ) → mark#( X )

1.1.1.1.2.1.1.1.1.1.1.1.1: reduction pair processor

Using the following reduction pair

Linear polynomial interpretation over the naturals

[a__U11 (x₁, x₂) ] = 3 x₁ + 2

[length (x₁) ] = x₁

[mark (x₁) ] = 2 x₁ + 2

[zeros] = 0

[a__length (x₁) ] = x₁

[a__isNatIList (x₁) ] = 2 x₁ + 3

[a__zeros] = 2

[a__and# (x₁, x₂) ] = x₁ + 3 x₂

[mark# (x₁) ] = 2 x₁ + 3

[0] = 0

[nil] = 2

[cons (x₁, x₂) ] = 2 x₁ + 3 x₂ + 2

[isNatList (x₁) ] = 2 x₁

[a__isNatList (x₁) ] = 2 x₁

[tt] = 3

[a__and (x₁, x₂) ] = x₁ + 2 x₂

[isNat (x₁) ] = x₁ + 2

[U11 (x₁, x₂) ] = 2 x₁ + 2

[and (x₁, x₂) ] = x₁ + 2 x₂

[s (x₁) ] = x₁

[a__isNat (x₁) ] = 2 x₁ + 3

[isNatIList (x₁) ] = x₁ + 1

[f(x₁, ..., x_n)] = x₁ + ... + x_n + 1 for all other symbols f of arity n

one remains with the following pair(s).

a__and#( tt , X ) → mark#( X )

mark#( and( X1 , X2 ) ) → mark#( X1 )

mark#( s( X ) ) → mark#( X )

1.1.1.1.2.1.1.1.1.1.1.1.1.1: dependency graph processor

The dependency pairs are split into 1 component(s).

The 1st component contains the pair(s)

mark#( s( X ) ) → mark#( X )

mark#( and( X1 , X2 ) ) → mark#( X1 )

1.1.1.1.2.1.1.1.1.1.1.1.1.1.1: reduction pair processor

Using the following reduction pair

Linear polynomial interpretation over the naturals

[a__U11 (x₁, x₂) ] = x₁ + 1

[length (x₁) ] = x₁

[zeros] = 0

[mark (x₁) ] = x₁ + 1

[a__length (x₁) ] = x₁

[a__isNatIList (x₁) ] = 2 x₁ + 1

[a__zeros] = 1

[mark# (x₁) ] = 3 x₁

[0] = 0

[nil] = 0

[isNatList (x₁) ] = x₁

[a__isNatList (x₁) ] = x₁

[cons (x₁, x₂) ] = x₁ + x₂ + 1

[tt] = 0

[a__and (x₁, x₂) ] = x₁ + x₂ + 1

[isNat (x₁) ] = x₁

[U11 (x₁, x₂) ] = x₁

[and (x₁, x₂) ] = x₁ + x₂ + 1

[a__isNat (x₁) ] = x₁

[s (x₁) ] = x₁

[isNatIList (x₁) ] = 2 x₁ + 1

[f(x₁, ..., x_n)] = x₁ + ... + x_n + 1 for all other symbols f of arity n

one remains with the following pair(s).

mark#( s( X ) ) → mark#( X )

1.1.1.1.2.1.1.1.1.1.1.1.1.1.1.1: reduction pair processor

Using the following reduction pair

Linear polynomial interpretation over the naturals

[a__U11 (x₁, x₂) ] = x₁ + 2 x₂ + 2

[zeros] = 0

[mark (x₁) ] = 2 x₁ + 1

[length (x₁) ] = x₁ + 1

[a__length (x₁) ] = x₁ + 1

[a__isNatIList (x₁) ] = 2 x₁ + 1

[a__zeros] = 1

[mark# (x₁) ] = 2 x₁

[0] = 0

[nil] = 2

[isNatList (x₁) ] = x₁

[a__isNatList (x₁) ] = x₁

[cons (x₁, x₂) ] = 2 x₁ + 3 x₂ + 1

[tt] = 1

[a__and (x₁, x₂) ] = x₁ + 2 x₂

[isNat (x₁) ] = x₁

[U11 (x₁, x₂) ] = x₁ + 2 x₂ + 2

[and (x₁, x₂) ] = x₁ + x₂

[a__isNat (x₁) ] = 2 x₁ + 1

[s (x₁) ] = x₁ + 1

[isNatIList (x₁) ] = x₁

[f(x₁, ..., x_n)] = x₁ + ... + x_n + 1 for all other symbols f of arity n

one remains with the following pair(s).

none

1.1.1.1.2.1.1.1.1.1.1.1.1.1.1.1.1: P is empty

All dependency pairs have been removed.

The 2nd component contains the pair(s)

a__isNat#( s( V1 ) ) → a__isNat#( V1 )

1.1.1.1.2.1.1.1.2: reduction pair processor

Using the following reduction pair

Linear polynomial interpretation over the naturals

[a__U11 (x₁, x₂) ] = x₁ + 2 x₂ + 2

[zeros] = 0

[mark (x₁) ] = 2 x₁ + 1

[length (x₁) ] = x₁ + 1

[a__length (x₁) ] = x₁ + 1

[a__isNatIList (x₁) ] = 2 x₁ + 1

[a__zeros] = 1

[0] = 0

[nil] = 2

[isNatList (x₁) ] = x₁

[a__isNatList (x₁) ] = x₁

[cons (x₁, x₂) ] = 2 x₁ + 3 x₂ + 1

[tt] = 1

[a__isNat# (x₁) ] = 2 x₁

[a__and (x₁, x₂) ] = x₁ + 2 x₂

[isNat (x₁) ] = x₁

[U11 (x₁, x₂) ] = x₁ + 2 x₂ + 2

[and (x₁, x₂) ] = x₁ + x₂

[a__isNat (x₁) ] = 2 x₁ + 1

[s (x₁) ] = x₁ + 1

[isNatIList (x₁) ] = x₁

[f(x₁, ..., x_n)] = x₁ + ... + x_n + 1 for all other symbols f of arity n

one remains with the following pair(s).

none

1.1.1.1.2.1.1.1.2.1: P is empty

All dependency pairs have been removed.

a__U11#( tt , L )	→	a__length#( mark( L ) )
a__U11#( tt , L )	→	mark#( L )
a__and#( tt , X )	→	mark#( X )
a__isNat#( length( V1 ) )	→	a__isNatList#( V1 )
a__isNat#( s( V1 ) )	→	a__isNat#( V1 )
a__isNatIList#( V )	→	a__isNatList#( V )
a__isNatIList#( cons( V1 , V2 ) )	→	a__and#( a__isNat( V1 ) , isNatIList( V2 ) )
a__isNatIList#( cons( V1 , V2 ) )	→	a__isNat#( V1 )
a__isNatList#( cons( V1 , V2 ) )	→	a__and#( a__isNat( V1 ) , isNatList( V2 ) )
a__isNatList#( cons( V1 , V2 ) )	→	a__isNat#( V1 )
a__length#( cons( N , L ) )	→	a__U11#( a__and( a__isNatList( L ) , isNat( N ) ) , L )
a__length#( cons( N , L ) )	→	a__and#( a__isNatList( L ) , isNat( N ) )
a__length#( cons( N , L ) )	→	a__isNatList#( L )
mark#( zeros )	→	a__zeros#
mark#( U11( X1 , X2 ) )	→	a__U11#( mark( X1 ) , X2 )
mark#( U11( X1 , X2 ) )	→	mark#( X1 )
mark#( length( X ) )	→	a__length#( mark( X ) )
mark#( length( X ) )	→	mark#( X )
mark#( and( X1 , X2 ) )	→	a__and#( mark( X1 ) , X2 )
mark#( and( X1 , X2 ) )	→	mark#( X1 )
mark#( isNat( X ) )	→	a__isNat#( X )
mark#( isNatList( X ) )	→	a__isNatList#( X )
mark#( isNatIList( X ) )	→	a__isNatIList#( X )
mark#( cons( X1 , X2 ) )	→	mark#( X1 )
mark#( s( X ) )	→	mark#( X )

[a__isNatList# (x₁) ]	=	0
[length (x₁) ]	=	x₁ + 1
[a__length (x₁) ]	=	x₁ + 1
[a__isNatIList (x₁) ]	=	0
[0]	=	0
[isNatList (x₁) ]	=	0
[a__length# (x₁) ]	=	x₁ + 1
[cons (x₁, x₂) ]	=	x₁ + 3 x₂
[and (x₁, x₂) ]	=	2 x₁ + 2 x₂
[a__U11# (x₁, x₂) ]	=	2 x₁ + 1
[s (x₁) ]	=	x₁
[isNatIList (x₁) ]	=	0
[a__U11 (x₁, x₂) ]	=	x₁ + 2 x₂ + 1
[mark (x₁) ]	=	2 x₁
[zeros]	=	0
[a__zeros]	=	0
[a__and# (x₁, x₂) ]	=	2 x₁
[mark# (x₁) ]	=	2 x₁
[nil]	=	0
[a__isNatIList# (x₁) ]	=	0
[a__isNatList (x₁) ]	=	0
[tt]	=	0
[a__isNat# (x₁) ]	=	0
[a__and (x₁, x₂) ]	=	2 x₁ + 2 x₂
[isNat (x₁) ]	=	0
[U11 (x₁, x₂) ]	=	x₁ + x₂ + 1
[a__isNat (x₁) ]	=	0
[f(x₁, ..., x_n)]	=	x₁ + ... + x_n + 1	for all other symbols f of arity n

[a__U11 (x₁, x₂) ]	=	x₁ + 2 x₂
[a__isNatList# (x₁) ]	=	x₁ + 1
[length (x₁) ]	=	x₁
[mark (x₁) ]	=	x₁ + 1
[zeros]	=	0
[a__length (x₁) ]	=	x₁
[a__isNatIList (x₁) ]	=	2 x₁ + 2
[a__zeros]	=	1
[a__and# (x₁, x₂) ]	=	x₁ + x₂
[mark# (x₁) ]	=	x₁ + 1
[0]	=	1
[nil]	=	1
[cons (x₁, x₂) ]	=	x₁ + 3 x₂
[isNatList (x₁) ]	=	x₁
[a__isNatList (x₁) ]	=	x₁
[tt]	=	1
[a__and (x₁, x₂) ]	=	x₁ + x₂
[isNat (x₁) ]	=	x₁
[U11 (x₁, x₂) ]	=	x₁ + 2 x₂
[and (x₁, x₂) ]	=	x₁ + x₂
[s (x₁) ]	=	x₁
[a__isNat (x₁) ]	=	x₁
[isNatIList (x₁) ]	=	2 x₁ + 1
[f(x₁, ..., x_n)]	=	x₁ + ... + x_n + 1	for all other symbols f of arity n

[a__U11 (x₁, x₂) ]	=	3 x₁ + 2
[length (x₁) ]	=	x₁
[mark (x₁) ]	=	2 x₁ + 2
[zeros]	=	0
[a__length (x₁) ]	=	x₁
[a__isNatIList (x₁) ]	=	2 x₁ + 3
[a__zeros]	=	2
[a__and# (x₁, x₂) ]	=	x₁ + 3 x₂
[mark# (x₁) ]	=	2 x₁ + 3
[0]	=	0
[nil]	=	2
[cons (x₁, x₂) ]	=	2 x₁ + 3 x₂ + 2
[isNatList (x₁) ]	=	2 x₁
[a__isNatList (x₁) ]	=	2 x₁
[tt]	=	3
[a__and (x₁, x₂) ]	=	x₁ + 2 x₂
[isNat (x₁) ]	=	x₁ + 2
[U11 (x₁, x₂) ]	=	2 x₁ + 2
[and (x₁, x₂) ]	=	x₁ + 2 x₂
[s (x₁) ]	=	x₁
[a__isNat (x₁) ]	=	2 x₁ + 3
[isNatIList (x₁) ]	=	x₁ + 1
[f(x₁, ..., x_n)]	=	x₁ + ... + x_n + 1	for all other symbols f of arity n

[a__U11 (x₁, x₂) ]	=	x₁ + 2 x₂ + 2
[zeros]	=	0
[mark (x₁) ]	=	2 x₁ + 1
[length (x₁) ]	=	x₁ + 1
[a__length (x₁) ]	=	x₁ + 1
[a__isNatIList (x₁) ]	=	2 x₁ + 1
[a__zeros]	=	1
[mark# (x₁) ]	=	2 x₁
[0]	=	0
[nil]	=	2
[isNatList (x₁) ]	=	x₁
[a__isNatList (x₁) ]	=	x₁
[cons (x₁, x₂) ]	=	2 x₁ + 3 x₂ + 1
[tt]	=	1
[a__and (x₁, x₂) ]	=	x₁ + 2 x₂
[isNat (x₁) ]	=	x₁
[U11 (x₁, x₂) ]	=	x₁ + 2 x₂ + 2
[and (x₁, x₂) ]	=	x₁ + x₂
[a__isNat (x₁) ]	=	2 x₁ + 1
[s (x₁) ]	=	x₁ + 1
[isNatIList (x₁) ]	=	x₁
[f(x₁, ..., x_n)]	=	x₁ + ... + x_n + 1	for all other symbols f of arity n