Termination proof

1: switching to dependency pairs

The following set of initial dependency pairs has been identified.

a__U11#( tt , V1 ) → a__U12#( a__isNatList( V1 ) )

a__U11#( tt , V1 ) → a__isNatList#( V1 )

a__U21#( tt , V1 ) → a__U22#( a__isNat( V1 ) )

a__U21#( tt , V1 ) → a__isNat#( V1 )

a__U31#( tt , V ) → a__U32#( a__isNatList( V ) )

a__U31#( tt , V ) → a__isNatList#( V )

a__U41#( tt , V1 , V2 ) → a__U42#( a__isNat( V1 ) , V2 )

a__U41#( tt , V1 , V2 ) → a__isNat#( V1 )

a__U42#( tt , V2 ) → a__U43#( a__isNatIList( V2 ) )

a__U42#( tt , V2 ) → a__isNatIList#( V2 )

a__U51#( tt , V1 , V2 ) → a__U52#( a__isNat( V1 ) , V2 )

a__U51#( tt , V1 , V2 ) → a__isNat#( V1 )

a__U52#( tt , V2 ) → a__U53#( a__isNatList( V2 ) )

a__U52#( tt , V2 ) → a__isNatList#( V2 )

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

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

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

a__isNat#( length( V1 ) ) → a__U11#( a__isNatIListKind( V1 ) , V1 )

a__isNat#( length( V1 ) ) → a__isNatIListKind#( V1 )

a__isNat#( s( V1 ) ) → a__U21#( a__isNatKind( V1 ) , V1 )

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

a__isNatIList#( V ) → a__U31#( a__isNatIListKind( V ) , V )

a__isNatIList#( V ) → a__isNatIListKind#( V )

a__isNatIList#( cons( V1 , V2 ) ) → a__U41#( a__and( a__isNatKind( V1 ) , isNatIListKind( V2 ) ) , V1 , V2 )

a__isNatIList#( cons( V1 , V2 ) ) → a__and#( a__isNatKind( V1 ) , isNatIListKind( V2 ) )

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

a__isNatIListKind#( cons( V1 , V2 ) ) → a__and#( a__isNatKind( V1 ) , isNatIListKind( V2 ) )

a__isNatIListKind#( cons( V1 , V2 ) ) → a__isNatKind#( V1 )

a__isNatKind#( length( V1 ) ) → a__isNatIListKind#( V1 )

a__isNatKind#( s( V1 ) ) → a__isNatKind#( V1 )

a__isNatList#( cons( V1 , V2 ) ) → a__U51#( a__and( a__isNatKind( V1 ) , isNatIListKind( V2 ) ) , V1 , V2 )

a__isNatList#( cons( V1 , V2 ) ) → a__and#( a__isNatKind( V1 ) , isNatIListKind( V2 ) )

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

a__length#( cons( N , L ) ) → a__U61#( a__and( a__and( a__isNatList( L ) , isNatIListKind( L ) ) , and( isNat( N ) , isNatKind( N ) ) ) , L )

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

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

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#( U12( X ) ) → a__U12#( mark( X ) )

mark#( U12( X ) ) → mark#( X )

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

mark#( U21( X1 , X2 ) ) → a__U21#( mark( X1 ) , X2 )

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

mark#( U22( X ) ) → a__U22#( mark( X ) )

mark#( U22( X ) ) → mark#( X )

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

mark#( U31( X1 , X2 ) ) → a__U31#( mark( X1 ) , X2 )

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

mark#( U32( X ) ) → a__U32#( mark( X ) )

mark#( U32( X ) ) → mark#( X )

mark#( U41( X1 , X2 , X3 ) ) → a__U41#( mark( X1 ) , X2 , X3 )

mark#( U41( X1 , X2 , X3 ) ) → mark#( X1 )

mark#( U42( X1 , X2 ) ) → a__U42#( mark( X1 ) , X2 )

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

mark#( U43( X ) ) → a__U43#( mark( X ) )

mark#( U43( X ) ) → mark#( X )

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

mark#( U51( X1 , X2 , X3 ) ) → a__U51#( mark( X1 ) , X2 , X3 )

mark#( U51( X1 , X2 , X3 ) ) → mark#( X1 )

mark#( U52( X1 , X2 ) ) → a__U52#( mark( X1 ) , X2 )

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

mark#( U53( X ) ) → a__U53#( mark( X ) )

mark#( U53( X ) ) → mark#( X )

mark#( U61( X1 , X2 ) ) → a__U61#( mark( X1 ) , X2 )

mark#( U61( 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#( isNatIListKind( X ) ) → a__isNatIListKind#( X )

mark#( isNatKind( X ) ) → a__isNatKind#( 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__U11#( tt , V1 ) → a__isNatList#( V1 )

a__isNatList#( cons( V1 , V2 ) ) → a__U51#( a__and( a__isNatKind( V1 ) , isNatIListKind( V2 ) ) , V1 , V2 )

a__U51#( tt , V1 , V2 ) → a__U52#( a__isNat( V1 ) , V2 )

a__U52#( tt , V2 ) → a__isNatList#( V2 )

a__isNatList#( cons( V1 , V2 ) ) → a__and#( a__isNatKind( V1 ) , isNatIListKind( V2 ) )

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

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

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

mark#( U12( X ) ) → mark#( X )

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

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

a__isNatKind#( length( V1 ) ) → a__isNatIListKind#( V1 )

a__isNatIListKind#( cons( V1 , V2 ) ) → a__and#( a__isNatKind( V1 ) , isNatIListKind( V2 ) )

a__isNatIListKind#( cons( V1 , V2 ) ) → a__isNatKind#( V1 )

a__isNatKind#( s( V1 ) ) → a__isNatKind#( V1 )

mark#( U21( X1 , X2 ) ) → a__U21#( mark( X1 ) , X2 )

a__U21#( tt , V1 ) → a__isNat#( V1 )

a__isNat#( length( V1 ) ) → a__U11#( a__isNatIListKind( V1 ) , V1 )

a__isNat#( length( V1 ) ) → a__isNatIListKind#( V1 )

a__isNat#( s( V1 ) ) → a__U21#( a__isNatKind( V1 ) , V1 )

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

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

mark#( U22( X ) ) → mark#( X )

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

mark#( U31( X1 , X2 ) ) → a__U31#( mark( X1 ) , X2 )

a__U31#( tt , V ) → a__isNatList#( V )

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

mark#( U32( X ) ) → mark#( X )

mark#( U41( X1 , X2 , X3 ) ) → a__U41#( mark( X1 ) , X2 , X3 )

a__U41#( tt , V1 , V2 ) → a__U42#( a__isNat( V1 ) , V2 )

a__U42#( tt , V2 ) → a__isNatIList#( V2 )

a__isNatIList#( V ) → a__U31#( a__isNatIListKind( V ) , V )

a__isNatIList#( V ) → a__isNatIListKind#( V )

a__isNatIList#( cons( V1 , V2 ) ) → a__U41#( a__and( a__isNatKind( V1 ) , isNatIListKind( V2 ) ) , V1 , V2 )

a__U41#( tt , V1 , V2 ) → a__isNat#( V1 )

a__isNatIList#( cons( V1 , V2 ) ) → a__and#( a__isNatKind( V1 ) , isNatIListKind( V2 ) )

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

mark#( U41( X1 , X2 , X3 ) ) → mark#( X1 )

mark#( U42( X1 , X2 ) ) → a__U42#( mark( X1 ) , X2 )

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

mark#( U43( X ) ) → mark#( X )

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

mark#( U51( X1 , X2 , X3 ) ) → a__U51#( mark( X1 ) , X2 , X3 )

a__U51#( tt , V1 , V2 ) → a__isNat#( V1 )

mark#( U51( X1 , X2 , X3 ) ) → mark#( X1 )

mark#( U52( X1 , X2 ) ) → a__U52#( mark( X1 ) , X2 )

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

mark#( U53( X ) ) → mark#( X )

mark#( U61( X1 , X2 ) ) → a__U61#( mark( X1 ) , X2 )

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

a__length#( cons( N , L ) ) → a__U61#( a__and( a__and( a__isNatList( L ) , isNatIListKind( L ) ) , and( isNat( N ) , isNatKind( N ) ) ) , L )

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

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

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

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

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

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

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

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

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

mark#( isNatIListKind( X ) ) → a__isNatIListKind#( X )

mark#( isNatKind( X ) ) → a__isNatKind#( X )

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

[isNatKind (x₁) ] = 0

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

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

[a__U22 (x₁) ] = 2 x₁

[0] = 0

[U41 (x₁, x₂, x₃) ] = 2 x₁

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

[U21 (x₁, x₂) ] = 2 x₁

[U31 (x₁, x₂) ] = 2 x₁

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

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

[a__U42# (x₁, x₂) ] = 0

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

[a__U52# (x₁, x₂) ] = 0

[isNatIList (x₁) ] = 0

[a__U21 (x₁, x₂) ] = 2 x₁

[a__zeros] = 0

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

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

[a__isNatList (x₁) ] = 0

[tt] = 0

[a__isNat# (x₁) ] = 0

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

[a__U21# (x₁, x₂) ] = 0

[a__U32 (x₁) ] = 2 x₁

[a__isNatKind (x₁) ] = 0

[a__U41# (x₁, x₂, x₃) ] = 0

[a__isNat (x₁) ] = 0

[U51 (x₁, x₂, x₃) ] = x₁

[U53 (x₁) ] = x₁

[a__isNatKind# (x₁) ] = 0

[a__U41 (x₁, x₂, x₃) ] = 2 x₁

[a__isNatIList (x₁) ] = 0

[U22 (x₁) ] = 2 x₁

[isNatList (x₁) ] = 0

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

[a__U53 (x₁) ] = x₁

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

[a__U31 (x₁, x₂) ] = 2 x₁

[a__isNatIListKind# (x₁) ] = 0

[a__U31# (x₁, x₂) ] = 0

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

[U32 (x₁) ] = 2 x₁

[s (x₁) ] = x₁

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

[mark (x₁) ] = x₁

[zeros] = 0

[a__U52 (x₁, x₂) ] = 2 x₁

[U52 (x₁, x₂) ] = 2 x₁

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

[a__isNatIList# (x₁) ] = 0

[nil] = 3

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

[isNat (x₁) ] = 0

[a__U51 (x₁, x₂, x₃) ] = x₁

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

[a__U51# (x₁, x₂, x₃) ] = 0

[a__U12 (x₁) ] = x₁

[a__isNatIListKind (x₁) ] = 0

[U43 (x₁) ] = 2 x₁

[isNatIListKind (x₁) ] = 0

[a__U43 (x₁) ] = 2 x₁

[U12 (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).

a__U11#( tt , V1 ) → a__isNatList#( V1 )

a__isNatList#( cons( V1 , V2 ) ) → a__U51#( a__and( a__isNatKind( V1 ) , isNatIListKind( V2 ) ) , V1 , V2 )

a__U51#( tt , V1 , V2 ) → a__U52#( a__isNat( V1 ) , V2 )

a__U52#( tt , V2 ) → a__isNatList#( V2 )

a__isNatList#( cons( V1 , V2 ) ) → a__and#( a__isNatKind( V1 ) , isNatIListKind( V2 ) )

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

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

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

mark#( U12( X ) ) → mark#( X )

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

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

a__isNatKind#( length( V1 ) ) → a__isNatIListKind#( V1 )

a__isNatIListKind#( cons( V1 , V2 ) ) → a__and#( a__isNatKind( V1 ) , isNatIListKind( V2 ) )

a__isNatIListKind#( cons( V1 , V2 ) ) → a__isNatKind#( V1 )

a__isNatKind#( s( V1 ) ) → a__isNatKind#( V1 )

mark#( U21( X1 , X2 ) ) → a__U21#( mark( X1 ) , X2 )

a__U21#( tt , V1 ) → a__isNat#( V1 )

a__isNat#( length( V1 ) ) → a__U11#( a__isNatIListKind( V1 ) , V1 )

a__isNat#( length( V1 ) ) → a__isNatIListKind#( V1 )

a__isNat#( s( V1 ) ) → a__U21#( a__isNatKind( V1 ) , V1 )

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

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

mark#( U22( X ) ) → mark#( X )

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

mark#( U31( X1 , X2 ) ) → a__U31#( mark( X1 ) , X2 )

a__U31#( tt , V ) → a__isNatList#( V )

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

mark#( U32( X ) ) → mark#( X )

mark#( U41( X1 , X2 , X3 ) ) → a__U41#( mark( X1 ) , X2 , X3 )

a__U41#( tt , V1 , V2 ) → a__U42#( a__isNat( V1 ) , V2 )

a__U42#( tt , V2 ) → a__isNatIList#( V2 )

a__isNatIList#( V ) → a__U31#( a__isNatIListKind( V ) , V )

a__isNatIList#( V ) → a__isNatIListKind#( V )

a__isNatIList#( cons( V1 , V2 ) ) → a__U41#( a__and( a__isNatKind( V1 ) , isNatIListKind( V2 ) ) , V1 , V2 )

a__U41#( tt , V1 , V2 ) → a__isNat#( V1 )

a__isNatIList#( cons( V1 , V2 ) ) → a__and#( a__isNatKind( V1 ) , isNatIListKind( V2 ) )

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

mark#( U41( X1 , X2 , X3 ) ) → mark#( X1 )

mark#( U42( X1 , X2 ) ) → a__U42#( mark( X1 ) , X2 )

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

mark#( U43( X ) ) → mark#( X )

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

mark#( U51( X1 , X2 , X3 ) ) → a__U51#( mark( X1 ) , X2 , X3 )

a__U51#( tt , V1 , V2 ) → a__isNat#( V1 )

mark#( U51( X1 , X2 , X3 ) ) → mark#( X1 )

mark#( U52( X1 , X2 ) ) → a__U52#( mark( X1 ) , X2 )

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

mark#( U53( X ) ) → mark#( X )

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

a__length#( cons( N , L ) ) → a__U61#( a__and( a__and( a__isNatList( L ) , isNatIListKind( L ) ) , and( isNat( N ) , isNatKind( N ) ) ) , L )

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

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

mark#( isNatIListKind( X ) ) → a__isNatIListKind#( X )

mark#( isNatKind( X ) ) → a__isNatKind#( X )

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__isNatList#( cons( V1 , V2 ) ) → a__U51#( a__and( a__isNatKind( V1 ) , isNatIListKind( V2 ) ) , V1 , V2 )

a__U51#( tt , V1 , V2 ) → a__U52#( a__isNat( V1 ) , V2 )

a__U52#( tt , V2 ) → a__isNatList#( V2 )

a__isNatList#( cons( V1 , V2 ) ) → a__and#( a__isNatKind( V1 ) , isNatIListKind( V2 ) )

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

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

a__U11#( tt , V1 ) → a__isNatList#( V1 )

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

a__isNatKind#( length( V1 ) ) → a__isNatIListKind#( V1 )

a__isNatIListKind#( cons( V1 , V2 ) ) → a__and#( a__isNatKind( V1 ) , isNatIListKind( V2 ) )

a__isNatIListKind#( cons( V1 , V2 ) ) → a__isNatKind#( V1 )

a__isNatKind#( s( V1 ) ) → a__isNatKind#( V1 )

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

mark#( U12( X ) ) → mark#( X )

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

mark#( U21( X1 , X2 ) ) → a__U21#( mark( X1 ) , X2 )

a__U21#( tt , V1 ) → a__isNat#( V1 )

a__isNat#( length( V1 ) ) → a__U11#( a__isNatIListKind( V1 ) , V1 )

a__isNat#( length( V1 ) ) → a__isNatIListKind#( V1 )

a__isNat#( s( V1 ) ) → a__U21#( a__isNatKind( V1 ) , V1 )

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

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

mark#( U22( X ) ) → mark#( X )

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

mark#( U31( X1 , X2 ) ) → a__U31#( mark( X1 ) , X2 )

a__U31#( tt , V ) → a__isNatList#( V )

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

mark#( U32( X ) ) → mark#( X )

mark#( U41( X1 , X2 , X3 ) ) → a__U41#( mark( X1 ) , X2 , X3 )

a__U41#( tt , V1 , V2 ) → a__U42#( a__isNat( V1 ) , V2 )

a__U42#( tt , V2 ) → a__isNatIList#( V2 )

a__isNatIList#( V ) → a__U31#( a__isNatIListKind( V ) , V )

a__isNatIList#( V ) → a__isNatIListKind#( V )

a__isNatIList#( cons( V1 , V2 ) ) → a__U41#( a__and( a__isNatKind( V1 ) , isNatIListKind( V2 ) ) , V1 , V2 )

a__U41#( tt , V1 , V2 ) → a__isNat#( V1 )

a__isNatIList#( cons( V1 , V2 ) ) → a__and#( a__isNatKind( V1 ) , isNatIListKind( V2 ) )

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

mark#( U41( X1 , X2 , X3 ) ) → mark#( X1 )

mark#( U42( X1 , X2 ) ) → a__U42#( mark( X1 ) , X2 )

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

mark#( U43( X ) ) → mark#( X )

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

mark#( U51( X1 , X2 , X3 ) ) → a__U51#( mark( X1 ) , X2 , X3 )

a__U51#( tt , V1 , V2 ) → a__isNat#( V1 )

mark#( U51( X1 , X2 , X3 ) ) → mark#( X1 )

mark#( U52( X1 , X2 ) ) → a__U52#( mark( X1 ) , X2 )

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

mark#( U53( X ) ) → mark#( X )

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

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

mark#( isNatIListKind( X ) ) → a__isNatIListKind#( X )

mark#( isNatKind( X ) ) → a__isNatKind#( X )

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

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

1.1.1.1.1: reduction pair processor

Using the following reduction pair

Linear polynomial interpretation over the naturals

[a__isNatList# (x₁) ] = 0

[isNatKind (x₁) ] = 0

[length (x₁) ] = 0

[a__length (x₁) ] = 0

[a__U22 (x₁) ] = x₁

[0] = 0

[U41 (x₁, x₂, x₃) ] = x₁

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

[U21 (x₁, x₂) ] = 2 x₁

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

[U31 (x₁, x₂) ] = 2 x₁

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

[a__U42# (x₁, x₂) ] = 0

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

[a__U52# (x₁, x₂) ] = 0

[isNatIList (x₁) ] = 0

[a__U21 (x₁, x₂) ] = 2 x₁

[a__zeros] = 3

[mark# (x₁) ] = x₁

[a__isNatList (x₁) ] = 0

[tt] = 0

[a__isNat# (x₁) ] = 0

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

[a__U21# (x₁, x₂) ] = 0

[a__U32 (x₁) ] = 2 x₁

[a__isNatKind (x₁) ] = 0

[a__U41# (x₁, x₂, x₃) ] = 0

[a__isNat (x₁) ] = 0

[U51 (x₁, x₂, x₃) ] = 2 x₁

[U53 (x₁) ] = x₁

[a__isNatKind# (x₁) ] = 0

[a__U41 (x₁, x₂, x₃) ] = x₁

[a__isNatIList (x₁) ] = 0

[U22 (x₁) ] = x₁

[isNatList (x₁) ] = 0

[a__U53 (x₁) ] = x₁

[a__U42 (x₁, x₂) ] = 2 x₁

[a__U31 (x₁, x₂) ] = 2 x₁

[a__isNatIListKind# (x₁) ] = 0

[a__U31# (x₁, x₂) ] = 0

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

[U32 (x₁) ] = 2 x₁

[s (x₁) ] = x₁

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

[mark (x₁) ] = x₁

[zeros] = 3

[a__U52 (x₁, x₂) ] = 2 x₁

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

[U52 (x₁, x₂) ] = 2 x₁

[a__isNatIList# (x₁) ] = 0

[nil] = 0

[U42 (x₁, x₂) ] = 2 x₁

[isNat (x₁) ] = 0

[a__U51 (x₁, x₂, x₃) ] = 2 x₁

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

[a__U51# (x₁, x₂, x₃) ] = 0

[a__U12 (x₁) ] = x₁

[a__isNatIListKind (x₁) ] = 0

[U43 (x₁) ] = x₁

[isNatIListKind (x₁) ] = 0

[a__U43 (x₁) ] = x₁

[U12 (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).

1.1.1.1.1.1: reduction pair processor

Using the following reduction pair

Linear polynomial interpretation over the naturals

[a__isNatList# (x₁) ] = 0

[isNatKind (x₁) ] = 0

[length (x₁) ] = 0

[a__length (x₁) ] = 0

[a__U22 (x₁) ] = x₁

[0] = 0

[U41 (x₁, x₂, x₃) ] = x₁ + 1

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

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

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

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

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

[a__U42# (x₁, x₂) ] = 0

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

[a__U52# (x₁, x₂) ] = 0

[isNatIList (x₁) ] = 1

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

[a__zeros] = 0

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

[a__isNatList (x₁) ] = 0

[tt] = 0

[a__isNat# (x₁) ] = 0

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

[a__U21# (x₁, x₂) ] = 0

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

[a__isNatKind (x₁) ] = 0

[a__U41# (x₁, x₂, x₃) ] = 0

[a__isNat (x₁) ] = 0

[U51 (x₁, x₂, x₃) ] = 2 x₁

[U53 (x₁) ] = 2 x₁

[a__isNatKind# (x₁) ] = 0

[a__U41 (x₁, x₂, x₃) ] = x₁ + 1

[a__isNatIList (x₁) ] = 1

[U22 (x₁) ] = x₁

[isNatList (x₁) ] = 0

[a__U53 (x₁) ] = 2 x₁

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

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

[a__isNatIListKind# (x₁) ] = 0

[a__U31# (x₁, x₂) ] = 0

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

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

[s (x₁) ] = x₁

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

[mark (x₁) ] = 2 x₁

[zeros] = 0

[a__U52 (x₁, x₂) ] = 2 x₁

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

[U52 (x₁, x₂) ] = 2 x₁

[a__isNatIList# (x₁) ] = 0

[nil] = 1

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

[isNat (x₁) ] = 0

[a__U51 (x₁, x₂, x₃) ] = 2 x₁

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

[a__U51# (x₁, x₂, x₃) ] = 0

[a__U12 (x₁) ] = 2 x₁

[a__isNatIListKind (x₁) ] = 0

[U43 (x₁) ] = x₁

[isNatIListKind (x₁) ] = 0

[a__U43 (x₁) ] = x₁

[U12 (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).

a__isNatList#( cons( V1 , V2 ) ) → a__U51#( a__and( a__isNatKind( V1 ) , isNatIListKind( V2 ) ) , V1 , V2 )

a__U51#( tt , V1 , V2 ) → a__U52#( a__isNat( V1 ) , V2 )

a__U52#( tt , V2 ) → a__isNatList#( V2 )

a__isNatList#( cons( V1 , V2 ) ) → a__and#( a__isNatKind( V1 ) , isNatIListKind( V2 ) )

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

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

a__U11#( tt , V1 ) → a__isNatList#( V1 )

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

a__isNatKind#( length( V1 ) ) → a__isNatIListKind#( V1 )

a__isNatIListKind#( cons( V1 , V2 ) ) → a__and#( a__isNatKind( V1 ) , isNatIListKind( V2 ) )

a__isNatIListKind#( cons( V1 , V2 ) ) → a__isNatKind#( V1 )

a__isNatKind#( s( V1 ) ) → a__isNatKind#( V1 )

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

mark#( U12( X ) ) → mark#( X )

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

mark#( U21( X1 , X2 ) ) → a__U21#( mark( X1 ) , X2 )

a__U21#( tt , V1 ) → a__isNat#( V1 )

a__isNat#( length( V1 ) ) → a__U11#( a__isNatIListKind( V1 ) , V1 )

a__isNat#( length( V1 ) ) → a__isNatIListKind#( V1 )

a__isNat#( s( V1 ) ) → a__U21#( a__isNatKind( V1 ) , V1 )

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

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

mark#( U22( X ) ) → mark#( X )

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

a__U31#( tt , V ) → a__isNatList#( V )

a__U41#( tt , V1 , V2 ) → a__U42#( a__isNat( V1 ) , V2 )

a__U42#( tt , V2 ) → a__isNatIList#( V2 )

a__isNatIList#( V ) → a__U31#( a__isNatIListKind( V ) , V )

a__isNatIList#( V ) → a__isNatIListKind#( V )

a__isNatIList#( cons( V1 , V2 ) ) → a__U41#( a__and( a__isNatKind( V1 ) , isNatIListKind( V2 ) ) , V1 , V2 )

a__U41#( tt , V1 , V2 ) → a__isNat#( V1 )

a__isNatIList#( cons( V1 , V2 ) ) → a__and#( a__isNatKind( V1 ) , isNatIListKind( V2 ) )

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

mark#( U43( X ) ) → mark#( X )

mark#( U51( X1 , X2 , X3 ) ) → a__U51#( mark( X1 ) , X2 , X3 )

a__U51#( tt , V1 , V2 ) → a__isNat#( V1 )

mark#( U51( X1 , X2 , X3 ) ) → mark#( X1 )

mark#( U52( X1 , X2 ) ) → a__U52#( mark( X1 ) , X2 )

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

mark#( U53( X ) ) → mark#( X )

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

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

mark#( isNatIListKind( X ) ) → a__isNatIListKind#( X )

mark#( isNatKind( X ) ) → a__isNatKind#( X )

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

1.1.1.1.1.1.1: dependency graph processor

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

The 1st component contains the pair(s)

a__U41#( tt , V1 , V2 ) → a__U42#( a__isNat( V1 ) , V2 )

a__U42#( tt , V2 ) → a__isNatIList#( V2 )

a__isNatIList#( cons( V1 , V2 ) ) → a__U41#( a__and( a__isNatKind( V1 ) , isNatIListKind( V2 ) ) , V1 , V2 )

1.1.1.1.1.1.1.1: reduction pair processor

Using the following reduction pair

Linear polynomial interpretation over the naturals

[isNatKind (x₁) ] = 1

[length (x₁) ] = 1

[a__length (x₁) ] = 1

[a__U22 (x₁) ] = 1

[0] = 1

[U41 (x₁, x₂, x₃) ] = 1

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

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

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

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

[U31 (x₁, x₂) ] = 2

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

[isNatIList (x₁) ] = 2

[a__U21 (x₁, x₂) ] = 1

[a__zeros] = 1

[a__isNatList (x₁) ] = 1

[tt] = 1

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

[a__isNatKind (x₁) ] = 2

[a__U32 (x₁) ] = 2

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

[U51 (x₁, x₂, x₃) ] = 0

[a__isNat (x₁) ] = x₁

[U53 (x₁) ] = 1

[a__U41 (x₁, x₂, x₃) ] = 1

[a__isNatIList (x₁) ] = 2

[U22 (x₁) ] = 1

[isNatList (x₁) ] = 0

[a__U53 (x₁) ] = 1

[a__U42 (x₁, x₂) ] = 1

[a__U31 (x₁, x₂) ] = 2

[a__U61 (x₁, x₂) ] = 1

[U32 (x₁) ] = 2

[s (x₁) ] = 1

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

[zeros] = 0

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

[a__U52 (x₁, x₂) ] = 1

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

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

[nil] = 0

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

[a__U51 (x₁, x₂, x₃) ] = 1

[isNat (x₁) ] = x₁

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

[a__U12 (x₁) ] = 1

[a__isNatIListKind (x₁) ] = 1

[U43 (x₁) ] = 0

[isNatIListKind (x₁) ] = 0

[a__U43 (x₁) ] = 1

[U12 (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__U41#( tt , V1 , V2 ) → a__U42#( a__isNat( V1 ) , V2 )

a__isNatIList#( cons( V1 , V2 ) ) → a__U41#( a__and( a__isNatKind( V1 ) , isNatIListKind( V2 ) ) , V1 , V2 )

1.1.1.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)

a__U51#( tt , V1 , V2 ) → a__U52#( a__isNat( V1 ) , V2 )

a__U52#( tt , V2 ) → a__isNatList#( V2 )

a__isNatList#( cons( V1 , V2 ) ) → a__U51#( a__and( a__isNatKind( V1 ) , isNatIListKind( V2 ) ) , V1 , V2 )

a__U51#( tt , V1 , V2 ) → a__isNat#( V1 )

a__isNat#( length( V1 ) ) → a__U11#( a__isNatIListKind( V1 ) , V1 )

a__U11#( tt , V1 ) → a__isNatList#( V1 )

a__isNatList#( cons( V1 , V2 ) ) → a__and#( a__isNatKind( V1 ) , isNatIListKind( V2 ) )

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

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

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

mark#( U12( X ) ) → mark#( X )

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

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

a__isNatKind#( length( V1 ) ) → a__isNatIListKind#( V1 )

a__isNatIListKind#( cons( V1 , V2 ) ) → a__and#( a__isNatKind( V1 ) , isNatIListKind( V2 ) )

a__isNatIListKind#( cons( V1 , V2 ) ) → a__isNatKind#( V1 )

a__isNatKind#( s( V1 ) ) → a__isNatKind#( V1 )

mark#( U21( X1 , X2 ) ) → a__U21#( mark( X1 ) , X2 )

a__U21#( tt , V1 ) → a__isNat#( V1 )

a__isNat#( length( V1 ) ) → a__isNatIListKind#( V1 )

a__isNat#( s( V1 ) ) → a__U21#( a__isNatKind( V1 ) , V1 )

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

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

mark#( U22( X ) ) → mark#( X )

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

mark#( U43( X ) ) → mark#( X )

mark#( U51( X1 , X2 , X3 ) ) → a__U51#( mark( X1 ) , X2 , X3 )

mark#( U51( X1 , X2 , X3 ) ) → mark#( X1 )

mark#( U52( X1 , X2 ) ) → a__U52#( mark( X1 ) , X2 )

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

mark#( U53( X ) ) → mark#( X )

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

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

mark#( isNatIListKind( X ) ) → a__isNatIListKind#( X )

mark#( isNatKind( X ) ) → a__isNatKind#( X )

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

1.1.1.1.1.1.1.2: reduction pair processor

Using the following reduction pair

Linear polynomial interpretation over the naturals

[a__isNatList# (x₁) ] = 2

[isNatKind (x₁) ] = 0

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

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

[a__U22 (x₁) ] = x₁

[0] = 0

[U41 (x₁, x₂, x₃) ] = 3 x₁

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

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

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

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

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

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

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

[isNatIList (x₁) ] = 0

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

[a__zeros] = 0

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

[a__isNatList (x₁) ] = x₁

[a__isNat# (x₁) ] = 2

[tt] = 0

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

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

[a__U32 (x₁) ] = 0

[a__isNatKind (x₁) ] = 0

[a__isNat (x₁) ] = x₁

[U51 (x₁, x₂, x₃) ] = x₁ + x₂ + x₃

[U53 (x₁) ] = x₁

[a__isNatKind# (x₁) ] = 2

[a__U41 (x₁, x₂, x₃) ] = 3 x₁

[a__isNatIList (x₁) ] = 0

[U22 (x₁) ] = x₁

[isNatList (x₁) ] = x₁

[a__U53 (x₁) ] = x₁

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

[a__isNatIListKind# (x₁) ] = 2

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

[U32 (x₁) ] = 0

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

[s (x₁) ] = x₁

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

[mark (x₁) ] = 2 x₁

[zeros] = 0

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

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

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

[nil] = 1

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

[a__U51 (x₁, x₂, x₃) ] = x₁ + 2 x₂ + 2 x₃

[isNat (x₁) ] = x₁

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

[a__U51# (x₁, x₂, x₃) ] = 2

[a__U12 (x₁) ] = x₁

[a__isNatIListKind (x₁) ] = 0

[U43 (x₁) ] = x₁

[a__U43 (x₁) ] = x₁

[isNatIListKind (x₁) ] = 0

[U12 (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).

a__U51#( tt , V1 , V2 ) → a__U52#( a__isNat( V1 ) , V2 )

a__U52#( tt , V2 ) → a__isNatList#( V2 )

a__isNatList#( cons( V1 , V2 ) ) → a__U51#( a__and( a__isNatKind( V1 ) , isNatIListKind( V2 ) ) , V1 , V2 )

a__U51#( tt , V1 , V2 ) → a__isNat#( V1 )

a__isNat#( length( V1 ) ) → a__U11#( a__isNatIListKind( V1 ) , V1 )

a__U11#( tt , V1 ) → a__isNatList#( V1 )

a__isNatList#( cons( V1 , V2 ) ) → a__and#( a__isNatKind( V1 ) , isNatIListKind( V2 ) )

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

mark#( U12( X ) ) → mark#( X )

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

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

a__isNatKind#( length( V1 ) ) → a__isNatIListKind#( V1 )

a__isNatIListKind#( cons( V1 , V2 ) ) → a__and#( a__isNatKind( V1 ) , isNatIListKind( V2 ) )

a__isNatIListKind#( cons( V1 , V2 ) ) → a__isNatKind#( V1 )

a__isNatKind#( s( V1 ) ) → a__isNatKind#( V1 )

mark#( U21( X1 , X2 ) ) → a__U21#( mark( X1 ) , X2 )

a__U21#( tt , V1 ) → a__isNat#( V1 )

a__isNat#( length( V1 ) ) → a__isNatIListKind#( V1 )

a__isNat#( s( V1 ) ) → a__U21#( a__isNatKind( V1 ) , V1 )

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

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

mark#( U22( X ) ) → mark#( X )

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

mark#( U43( X ) ) → mark#( X )

mark#( U51( X1 , X2 , X3 ) ) → a__U51#( mark( X1 ) , X2 , X3 )

mark#( U51( X1 , X2 , X3 ) ) → mark#( X1 )

mark#( U52( X1 , X2 ) ) → a__U52#( mark( X1 ) , X2 )

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

mark#( U53( X ) ) → mark#( X )

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

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

mark#( isNatIListKind( X ) ) → a__isNatIListKind#( X )

mark#( isNatKind( X ) ) → a__isNatKind#( X )

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

1.1.1.1.1.1.1.2.1: reduction pair processor

Using the following reduction pair

Linear polynomial interpretation over the naturals

[a__isNatList# (x₁) ] = 0

[isNatKind (x₁) ] = 0

[length (x₁) ] = 0

[a__length (x₁) ] = 0

[a__U22 (x₁) ] = 2 x₁

[0] = 0

[U41 (x₁, x₂, x₃) ] = x₁ + 1

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

[U21 (x₁, x₂) ] = 2 x₁

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

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

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

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

[a__U52# (x₁, x₂) ] = 0

[isNatIList (x₁) ] = x₁

[a__U21 (x₁, x₂) ] = 2 x₁

[a__zeros] = 3

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

[a__isNatList (x₁) ] = 0

[a__isNat# (x₁) ] = 0

[tt] = 0

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

[a__U21# (x₁, x₂) ] = 0

[a__U32 (x₁) ] = 0

[a__isNatKind (x₁) ] = 0

[a__isNat (x₁) ] = 0

[U51 (x₁, x₂, x₃) ] = 2 x₁

[U53 (x₁) ] = x₁

[a__isNatKind# (x₁) ] = 0

[a__U41 (x₁, x₂, x₃) ] = x₁ + 1

[a__isNatIList (x₁) ] = x₁

[U22 (x₁) ] = 2 x₁

[isNatList (x₁) ] = 0

[a__U53 (x₁) ] = x₁

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

[a__isNatIListKind# (x₁) ] = 0

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

[U32 (x₁) ] = 0

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

[s (x₁) ] = 2 x₁

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

[mark (x₁) ] = 2 x₁

[zeros] = 2

[a__U52 (x₁, x₂) ] = 2 x₁

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

[U52 (x₁, x₂) ] = 2 x₁

[nil] = 2

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

[a__U51 (x₁, x₂, x₃) ] = 2 x₁

[isNat (x₁) ] = 0

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

[a__U51# (x₁, x₂, x₃) ] = 0

[a__U12 (x₁) ] = 2 x₁

[a__isNatIListKind (x₁) ] = 0

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

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

[isNatIListKind (x₁) ] = 0

[U12 (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).

a__U51#( tt , V1 , V2 ) → a__U52#( a__isNat( V1 ) , V2 )

a__U52#( tt , V2 ) → a__isNatList#( V2 )

a__isNatList#( cons( V1 , V2 ) ) → a__U51#( a__and( a__isNatKind( V1 ) , isNatIListKind( V2 ) ) , V1 , V2 )

a__U51#( tt , V1 , V2 ) → a__isNat#( V1 )

a__isNat#( length( V1 ) ) → a__U11#( a__isNatIListKind( V1 ) , V1 )

a__U11#( tt , V1 ) → a__isNatList#( V1 )

a__isNatList#( cons( V1 , V2 ) ) → a__and#( a__isNatKind( V1 ) , isNatIListKind( V2 ) )

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

mark#( U12( X ) ) → mark#( X )

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

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

a__isNatKind#( length( V1 ) ) → a__isNatIListKind#( V1 )

a__isNatIListKind#( cons( V1 , V2 ) ) → a__and#( a__isNatKind( V1 ) , isNatIListKind( V2 ) )

a__isNatIListKind#( cons( V1 , V2 ) ) → a__isNatKind#( V1 )

a__isNatKind#( s( V1 ) ) → a__isNatKind#( V1 )

mark#( U21( X1 , X2 ) ) → a__U21#( mark( X1 ) , X2 )

a__U21#( tt , V1 ) → a__isNat#( V1 )

a__isNat#( length( V1 ) ) → a__isNatIListKind#( V1 )

a__isNat#( s( V1 ) ) → a__U21#( a__isNatKind( V1 ) , V1 )

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

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

mark#( U22( X ) ) → mark#( X )

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

mark#( U51( X1 , X2 , X3 ) ) → a__U51#( mark( X1 ) , X2 , X3 )

mark#( U51( X1 , X2 , X3 ) ) → mark#( X1 )

mark#( U52( X1 , X2 ) ) → a__U52#( mark( X1 ) , X2 )

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

mark#( U53( X ) ) → mark#( X )

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

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

mark#( isNatIListKind( X ) ) → a__isNatIListKind#( X )

mark#( isNatKind( X ) ) → a__isNatKind#( X )

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

1.1.1.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₁ + 1

[isNatKind (x₁) ] = 0

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

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

[a__U22 (x₁) ] = x₁

[0] = 0

[U41 (x₁, x₂, x₃) ] = 0

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

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

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

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

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

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

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

[isNatIList (x₁) ] = 0

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

[a__zeros] = 0

[mark# (x₁) ] = x₁

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

[a__isNat# (x₁) ] = x₁

[tt] = 0

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

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

[a__U32 (x₁) ] = 0

[a__isNatKind (x₁) ] = 0

[a__isNat (x₁) ] = x₁

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

[U53 (x₁) ] = x₁

[a__isNatKind# (x₁) ] = 0

[a__U41 (x₁, x₂, x₃) ] = 0

[a__isNatIList (x₁) ] = 0

[U22 (x₁) ] = x₁

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

[a__U53 (x₁) ] = x₁

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

[a__isNatIListKind# (x₁) ] = 0

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

[U32 (x₁) ] = 0

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

[s (x₁) ] = x₁

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

[mark (x₁) ] = x₁

[zeros] = 0

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

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

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

[nil] = 1

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

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

[isNat (x₁) ] = x₁

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

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

[a__U12 (x₁) ] = x₁

[a__isNatIListKind (x₁) ] = 0

[U43 (x₁) ] = 0

[a__U43 (x₁) ] = 0

[isNatIListKind (x₁) ] = 0

[U12 (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).

a__U51#( tt , V1 , V2 ) → a__U52#( a__isNat( V1 ) , V2 )

a__U52#( tt , V2 ) → a__isNatList#( V2 )

a__isNatList#( cons( V1 , V2 ) ) → a__U51#( a__and( a__isNatKind( V1 ) , isNatIListKind( V2 ) ) , V1 , V2 )

a__isNat#( length( V1 ) ) → a__U11#( a__isNatIListKind( V1 ) , V1 )

a__U11#( tt , V1 ) → a__isNatList#( V1 )

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

mark#( U12( X ) ) → mark#( X )

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

a__isNatKind#( length( V1 ) ) → a__isNatIListKind#( V1 )

a__isNatIListKind#( cons( V1 , V2 ) ) → a__and#( a__isNatKind( V1 ) , isNatIListKind( V2 ) )

a__isNatIListKind#( cons( V1 , V2 ) ) → a__isNatKind#( V1 )

a__isNatKind#( s( V1 ) ) → a__isNatKind#( V1 )

mark#( U21( X1 , X2 ) ) → a__U21#( mark( X1 ) , X2 )

a__U21#( tt , V1 ) → a__isNat#( V1 )

a__isNat#( s( V1 ) ) → a__U21#( a__isNatKind( V1 ) , V1 )

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

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

mark#( U22( X ) ) → mark#( X )

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

mark#( U51( X1 , X2 , X3 ) ) → a__U51#( mark( X1 ) , X2 , X3 )

mark#( U52( X1 , X2 ) ) → a__U52#( mark( X1 ) , X2 )

mark#( U53( X ) ) → mark#( X )

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

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

mark#( isNatIListKind( X ) ) → a__isNatIListKind#( X )

mark#( isNatKind( X ) ) → a__isNatKind#( X )

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

1.1.1.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)

mark#( U12( X ) ) → mark#( X )

mark#( U21( X1 , X2 ) ) → a__U21#( mark( X1 ) , X2 )

a__U21#( tt , V1 ) → a__isNat#( V1 )

a__isNat#( s( V1 ) ) → a__U21#( a__isNatKind( V1 ) , V1 )

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

a__isNatKind#( length( V1 ) ) → a__isNatIListKind#( V1 )

a__isNatIListKind#( cons( V1 , V2 ) ) → a__and#( a__isNatKind( V1 ) , isNatIListKind( V2 ) )

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

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

mark#( U22( X ) ) → mark#( X )

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

mark#( U53( X ) ) → mark#( X )

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

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

mark#( isNatIListKind( X ) ) → a__isNatIListKind#( X )

a__isNatIListKind#( cons( V1 , V2 ) ) → a__isNatKind#( V1 )

a__isNatKind#( s( V1 ) ) → a__isNatKind#( V1 )

mark#( isNatKind( X ) ) → a__isNatKind#( X )

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

1.1.1.1.1.1.1.2.1.1.1.1: reduction pair processor

Using the following reduction pair

Linear polynomial interpretation over the naturals

[isNatKind (x₁) ] = 0

[length (x₁) ] = 0

[a__length (x₁) ] = 0

[a__U22 (x₁) ] = x₁

[0] = 0

[U41 (x₁, x₂, x₃) ] = 0

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

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

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

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

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

[isNatIList (x₁) ] = 0

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

[a__zeros] = 0

[mark# (x₁) ] = x₁

[a__isNatList (x₁) ] = 0

[a__isNat# (x₁) ] = 0

[tt] = 0

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

[a__U21# (x₁, x₂) ] = 0

[a__U32 (x₁) ] = 0

[a__isNatKind (x₁) ] = 0

[a__isNat (x₁) ] = 1

[U53 (x₁) ] = 2 x₁

[U51 (x₁, x₂, x₃) ] = 0

[a__isNatKind# (x₁) ] = 0

[a__U41 (x₁, x₂, x₃) ] = 0

[a__isNatIList (x₁) ] = 0

[U22 (x₁) ] = x₁

[isNatList (x₁) ] = 0

[a__U53 (x₁) ] = 2 x₁

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

[a__isNatIListKind# (x₁) ] = 0

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

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

[U32 (x₁) ] = 0

[s (x₁) ] = 2 x₁

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

[zeros] = 0

[mark (x₁) ] = x₁

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

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

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

[nil] = 0

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

[isNat (x₁) ] = 1

[a__U51 (x₁, x₂, x₃) ] = 0

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

[a__U12 (x₁) ] = x₁

[a__isNatIListKind (x₁) ] = 0

[U43 (x₁) ] = 0

[a__U43 (x₁) ] = 0

[isNatIListKind (x₁) ] = 0

[U12 (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).

mark#( U12( X ) ) → mark#( X )

a__U21#( tt , V1 ) → a__isNat#( V1 )

a__isNat#( s( V1 ) ) → a__U21#( a__isNatKind( V1 ) , V1 )

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

a__isNatKind#( length( V1 ) ) → a__isNatIListKind#( V1 )

a__isNatIListKind#( cons( V1 , V2 ) ) → a__and#( a__isNatKind( V1 ) , isNatIListKind( V2 ) )

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

mark#( U22( X ) ) → mark#( X )

mark#( U53( X ) ) → mark#( X )

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

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

mark#( isNatIListKind( X ) ) → a__isNatIListKind#( X )

a__isNatIListKind#( cons( V1 , V2 ) ) → a__isNatKind#( V1 )

a__isNatKind#( s( V1 ) ) → a__isNatKind#( V1 )

mark#( isNatKind( X ) ) → a__isNatKind#( X )

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

1.1.1.1.1.1.1.2.1.1.1.1.1: dependency graph processor

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

The 1st component contains the pair(s)

a__isNat#( s( V1 ) ) → a__U21#( a__isNatKind( V1 ) , V1 )

a__U21#( tt , V1 ) → a__isNat#( V1 )

1.1.1.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

[isNatKind (x₁) ] = 0

[length (x₁) ] = x₁

[a__length (x₁) ] = x₁

[a__U22 (x₁) ] = 1

[0] = 0

[U41 (x₁, x₂, x₃) ] = x₁

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

[U21 (x₁, x₂) ] = 1

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

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

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

[isNatIList (x₁) ] = 3 x₁

[a__U21 (x₁, x₂) ] = 1

[a__zeros] = 1

[a__isNatList (x₁) ] = x₁

[tt] = 1

[a__isNat# (x₁) ] = x₁

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

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

[a__isNatKind (x₁) ] = 1

[a__U32 (x₁) ] = x₁

[U53 (x₁) ] = x₁

[U51 (x₁, x₂, x₃) ] = 3 x₁

[a__isNat (x₁) ] = 1

[a__U41 (x₁, x₂, x₃) ] = x₁

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

[U22 (x₁) ] = 0

[isNatList (x₁) ] = x₁

[a__U53 (x₁) ] = x₁

[a__U42 (x₁, x₂) ] = 1

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

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

[U32 (x₁) ] = x₁

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

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

[zeros] = 0

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

[a__U52 (x₁, x₂) ] = 2 x₁

[U52 (x₁, x₂) ] = 2 x₁

[nil] = 1

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

[a__U51 (x₁, x₂, x₃) ] = 3 x₁

[isNat (x₁) ] = 0

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

[a__U12 (x₁) ] = 1

[a__isNatIListKind (x₁) ] = 1

[U43 (x₁) ] = 0

[a__U43 (x₁) ] = 1

[isNatIListKind (x₁) ] = 0

[U12 (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__U21#( tt , V1 ) → a__isNat#( V1 )

1.1.1.1.1.1.1.2.1.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#( U22( X ) ) → mark#( X )

mark#( U12( X ) ) → mark#( X )

mark#( U53( X ) ) → mark#( X )

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

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

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

mark#( isNatIListKind( X ) ) → a__isNatIListKind#( X )

a__isNatIListKind#( cons( V1 , V2 ) ) → a__and#( a__isNatKind( V1 ) , isNatIListKind( V2 ) )

a__isNatIListKind#( cons( V1 , V2 ) ) → a__isNatKind#( V1 )

a__isNatKind#( length( V1 ) ) → a__isNatIListKind#( V1 )

a__isNatKind#( s( V1 ) ) → a__isNatKind#( V1 )

mark#( isNatKind( X ) ) → a__isNatKind#( X )

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

1.1.1.1.1.1.1.2.1.1.1.1.1.2: reduction pair processor

Using the following reduction pair

Linear polynomial interpretation over the naturals

[isNatKind (x₁) ] = 0

[length (x₁) ] = 0

[a__length (x₁) ] = 0

[a__U22 (x₁) ] = x₁

[0] = 0

[U41 (x₁, x₂, x₃) ] = 0

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

[U21 (x₁, x₂) ] = 2

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

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

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

[isNatIList (x₁) ] = 0

[a__U21 (x₁, x₂) ] = 2

[a__zeros] = 0

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

[a__isNatList (x₁) ] = 0

[tt] = 0

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

[a__U32 (x₁) ] = 0

[a__isNatKind (x₁) ] = 0

[U53 (x₁) ] = 2 x₁

[a__isNat (x₁) ] = 2

[U51 (x₁, x₂, x₃) ] = 0

[a__isNatKind# (x₁) ] = 0

[a__U41 (x₁, x₂, x₃) ] = 0

[a__isNatIList (x₁) ] = 0

[U22 (x₁) ] = x₁

[isNatList (x₁) ] = 0

[a__U53 (x₁) ] = 2 x₁

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

[a__isNatIListKind# (x₁) ] = 0

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

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

[U32 (x₁) ] = 0

[s (x₁) ] = x₁

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

[zeros] = 0

[mark (x₁) ] = x₁

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

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

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

[nil] = 1

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

[a__U51 (x₁, x₂, x₃) ] = 0

[isNat (x₁) ] = 2

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

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

[a__isNatIListKind (x₁) ] = 0

[U43 (x₁) ] = 0

[a__U43 (x₁) ] = 0

[isNatIListKind (x₁) ] = 0

[U12 (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).

mark#( U22( X ) ) → mark#( X )

mark#( U53( X ) ) → mark#( X )

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

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

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

mark#( isNatIListKind( X ) ) → a__isNatIListKind#( X )

a__isNatIListKind#( cons( V1 , V2 ) ) → a__and#( a__isNatKind( V1 ) , isNatIListKind( V2 ) )

a__isNatIListKind#( cons( V1 , V2 ) ) → a__isNatKind#( V1 )

a__isNatKind#( length( V1 ) ) → a__isNatIListKind#( V1 )

a__isNatKind#( s( V1 ) ) → a__isNatKind#( V1 )

mark#( isNatKind( X ) ) → a__isNatKind#( X )

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

1.1.1.1.1.1.1.2.1.1.1.1.1.2.1: reduction pair processor

Using the following reduction pair

Linear polynomial interpretation over the naturals

[isNatKind (x₁) ] = x₁

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

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

[a__U22 (x₁) ] = x₁

[0] = 0

[U41 (x₁, x₂, x₃) ] = x₁ + 1

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

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

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

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

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

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

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

[a__zeros] = 0

[mark# (x₁) ] = x₁

[a__isNatList (x₁) ] = 0

[tt] = 0

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

[a__U32 (x₁) ] = 0

[a__isNatKind (x₁) ] = x₁

[U53 (x₁) ] = 2 x₁

[a__isNat (x₁) ] = 0

[U51 (x₁, x₂, x₃) ] = 0

[a__isNatKind# (x₁) ] = x₁

[a__U41 (x₁, x₂, x₃) ] = 2 x₁ + 2

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

[U22 (x₁) ] = x₁

[isNatList (x₁) ] = 0

[a__U53 (x₁) ] = 2 x₁

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

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

[a__isNatIListKind# (x₁) ] = x₁

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

[U32 (x₁) ] = 0

[s (x₁) ] = x₁

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

[zeros] = 0

[mark (x₁) ] = 2 x₁

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

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

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

[nil] = 0

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

[a__U51 (x₁, x₂, x₃) ] = 0

[isNat (x₁) ] = 0

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

[a__U12 (x₁) ] = x₁

[a__isNatIListKind (x₁) ] = x₁

[U43 (x₁) ] = 0

[a__U43 (x₁) ] = 0

[isNatIListKind (x₁) ] = x₁

[U12 (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).

mark#( U22( X ) ) → mark#( X )

mark#( U53( X ) ) → mark#( X )

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

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

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

mark#( isNatIListKind( X ) ) → a__isNatIListKind#( X )

a__isNatIListKind#( cons( V1 , V2 ) ) → a__and#( a__isNatKind( V1 ) , isNatIListKind( V2 ) )

a__isNatIListKind#( cons( V1 , V2 ) ) → a__isNatKind#( V1 )

a__isNatKind#( s( V1 ) ) → a__isNatKind#( V1 )

mark#( isNatKind( X ) ) → a__isNatKind#( X )

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

1.1.1.1.1.1.1.2.1.1.1.1.1.2.1.1: dependency graph processor

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

The 1st component contains the pair(s)

mark#( U53( X ) ) → mark#( X )

mark#( U22( X ) ) → mark#( X )

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

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

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

mark#( isNatIListKind( X ) ) → a__isNatIListKind#( X )

a__isNatIListKind#( cons( V1 , V2 ) ) → a__and#( a__isNatKind( V1 ) , isNatIListKind( V2 ) )

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

1.1.1.1.1.1.1.2.1.1.1.1.1.2.1.1.1: reduction pair processor

Using the following reduction pair

Linear polynomial interpretation over the naturals

[isNatKind (x₁) ] = 0

[length (x₁) ] = 0

[a__length (x₁) ] = 0

[a__U22 (x₁) ] = x₁

[0] = 0

[U41 (x₁, x₂, x₃) ] = x₁ + 1

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

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

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

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

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

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

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

[a__zeros] = 2

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

[a__isNatList (x₁) ] = 2 x₁

[tt] = 0

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

[a__isNatKind (x₁) ] = 0

[a__U32 (x₁) ] = 2

[U51 (x₁, x₂, x₃) ] = 2 x₁ + 2

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

[a__isNat (x₁) ] = 0

[a__U41 (x₁, x₂, x₃) ] = 2 x₁ + 2

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

[U22 (x₁) ] = x₁

[isNatList (x₁) ] = x₁

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

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

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

[a__isNatIListKind# (x₁) ] = 0

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

[U32 (x₁) ] = 1

[s (x₁) ] = 2 x₁

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

[zeros] = 1

[mark (x₁) ] = 2 x₁

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

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

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

[nil] = 0

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

[a__U51 (x₁, x₂, x₃) ] = 2 x₁ + 2

[isNat (x₁) ] = 0

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

[a__U12 (x₁) ] = 0

[a__isNatIListKind (x₁) ] = 0

[U43 (x₁) ] = 1

[a__U43 (x₁) ] = 1

[isNatIListKind (x₁) ] = 0

[U12 (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#( U22( X ) ) → mark#( X )

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

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

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

mark#( isNatIListKind( X ) ) → a__isNatIListKind#( X )

a__isNatIListKind#( cons( V1 , V2 ) ) → a__and#( a__isNatKind( V1 ) , isNatIListKind( V2 ) )

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

1.1.1.1.1.1.1.2.1.1.1.1.1.2.1.1.1.1: reduction pair processor

Using the following reduction pair

Linear polynomial interpretation over the naturals

[isNatKind (x₁) ] = x₁

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

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

[a__U22 (x₁) ] = x₁

[0] = 0

[U41 (x₁, x₂, x₃) ] = x₁ + x₂

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

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

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

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

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

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

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

[a__zeros] = 2

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

[a__isNatList (x₁) ] = 0

[tt] = 0

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

[a__isNatKind (x₁) ] = 2 x₁

[a__U32 (x₁) ] = 2

[U51 (x₁, x₂, x₃) ] = 0

[a__isNat (x₁) ] = 0

[U53 (x₁) ] = 0

[a__U41 (x₁, x₂, x₃) ] = x₁ + x₂

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

[U22 (x₁) ] = x₁

[isNatList (x₁) ] = 0

[a__U53 (x₁) ] = 0

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

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

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

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

[U32 (x₁) ] = 0

[s (x₁) ] = x₁

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

[zeros] = 0

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

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

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

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

[nil] = 0

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

[a__U51 (x₁, x₂, x₃) ] = 0

[isNat (x₁) ] = 0

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

[a__U12 (x₁) ] = 0

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

[U43 (x₁) ] = 0

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

[a__U43 (x₁) ] = 0

[U12 (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#( U22( X ) ) → mark#( X )

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

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

1.1.1.1.1.1.1.2.1.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#( s( X ) ) → mark#( X )

mark#( U22( X ) ) → mark#( X )

1.1.1.1.1.1.1.2.1.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

[isNatKind (x₁) ] = 0

[length (x₁) ] = x₁

[a__length (x₁) ] = x₁

[a__U22 (x₁) ] = x₁

[0] = 0

[U41 (x₁, x₂, x₃) ] = 2 x₁ + 2 x₂ + 2

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

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

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

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

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

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

[a__U21 (x₁, x₂) ] = 1

[a__zeros] = 1

[mark# (x₁) ] = x₁

[a__isNatList (x₁) ] = x₁

[tt] = 1

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

[a__isNatKind (x₁) ] = 1

[a__U32 (x₁) ] = 1

[U53 (x₁) ] = x₁

[U51 (x₁, x₂, x₃) ] = x₁

[a__isNat (x₁) ] = 1

[a__U41 (x₁, x₂, x₃) ] = 2 x₁ + 2 x₂ + 2

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

[U22 (x₁) ] = x₁

[isNatList (x₁) ] = x₁

[a__U53 (x₁) ] = x₁

[a__U42 (x₁, x₂) ] = 3

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

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

[U32 (x₁) ] = 0

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

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

[zeros] = 0

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

[a__U52 (x₁, x₂) ] = 2 x₁

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

[nil] = 1

[U42 (x₁, x₂) ] = 1

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

[isNat (x₁) ] = 0

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

[a__U12 (x₁) ] = 1

[a__isNatIListKind (x₁) ] = 1

[U43 (x₁) ] = 2

[a__U43 (x₁) ] = 3

[isNatIListKind (x₁) ] = 0

[U12 (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#( U22( X ) ) → mark#( X )

1.1.1.1.1.1.1.2.1.1.1.1.1.2.1.1.1.1.1.1.1: reduction pair processor

Using the following reduction pair

Linear polynomial interpretation over the naturals

[isNatKind (x₁) ] = 0

[length (x₁) ] = x₁

[a__length (x₁) ] = x₁

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

[0] = 0

[U41 (x₁, x₂, x₃) ] = 0

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

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

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

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

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

[isNatIList (x₁) ] = 0

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

[a__zeros] = 1

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

[a__isNatList (x₁) ] = x₁

[tt] = 1

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

[a__isNatKind (x₁) ] = 1

[a__U32 (x₁) ] = 1

[U53 (x₁) ] = x₁

[U51 (x₁, x₂, x₃) ] = x₁ + 3 x₂

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

[a__U41 (x₁, x₂, x₃) ] = 1

[a__isNatIList (x₁) ] = 1

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

[isNatList (x₁) ] = x₁

[a__U53 (x₁) ] = x₁

[a__U42 (x₁, x₂) ] = 1

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

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

[U32 (x₁) ] = 1

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

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

[zeros] = 0

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

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

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

[nil] = 2

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

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

[isNat (x₁) ] = x₁

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

[a__U12 (x₁) ] = 1

[a__isNatIListKind (x₁) ] = 1

[U43 (x₁) ] = 0

[a__U43 (x₁) ] = 1

[isNatIListKind (x₁) ] = 0

[U12 (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).

none

1.1.1.1.1.1.1.2.1.1.1.1.1.2.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__isNatKind#( s( V1 ) ) → a__isNatKind#( V1 )

1.1.1.1.1.1.1.2.1.1.1.1.1.2.1.1.2: reduction pair processor

Using the following reduction pair

Linear polynomial interpretation over the naturals

[isNatKind (x₁) ] = 0

[length (x₁) ] = x₁

[a__length (x₁) ] = x₁

[a__U22 (x₁) ] = 2

[0] = 0

[U41 (x₁, x₂, x₃) ] = 1

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

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

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

[U31 (x₁, x₂) ] = 1

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

[isNatIList (x₁) ] = 1

[a__U21 (x₁, x₂) ] = 2

[a__zeros] = 1

[a__isNatList (x₁) ] = 2 x₁

[tt] = 2

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

[a__isNatKind (x₁) ] = 2

[a__U32 (x₁) ] = 2

[U53 (x₁) ] = x₁

[U51 (x₁, x₂, x₃) ] = 3 x₁

[a__isNat (x₁) ] = 2

[a__isNatKind# (x₁) ] = x₁

[a__U41 (x₁, x₂, x₃) ] = 3

[a__isNatIList (x₁) ] = 3

[U22 (x₁) ] = 0

[isNatList (x₁) ] = 2 x₁

[a__U53 (x₁) ] = x₁

[a__U42 (x₁, x₂) ] = 3

[a__U31 (x₁, x₂) ] = 3

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

[U32 (x₁) ] = 2

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

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

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

[zeros] = 0

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

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

[nil] = 2

[U42 (x₁, x₂) ] = 3

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

[isNat (x₁) ] = 0

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

[a__U12 (x₁) ] = 2

[a__isNatIListKind (x₁) ] = 2

[U43 (x₁) ] = 3

[a__U43 (x₁) ] = 3

[isNatIListKind (x₁) ] = 0

[U12 (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).

none

1.1.1.1.1.1.1.2.1.1.1.1.1.2.1.1.2.1: P is empty

All dependency pairs have been removed.

The 2nd component contains the pair(s)

a__U52#( tt , V2 ) → a__isNatList#( V2 )

a__isNatList#( cons( V1 , V2 ) ) → a__U51#( a__and( a__isNatKind( V1 ) , isNatIListKind( V2 ) ) , V1 , V2 )

a__U51#( tt , V1 , V2 ) → a__U52#( a__isNat( V1 ) , V2 )

1.1.1.1.1.1.1.2.1.1.1.2: reduction pair processor

Using the following reduction pair

Linear polynomial interpretation over the naturals

[a__isNatList# (x₁) ] = x₁

[isNatKind (x₁) ] = 0

[length (x₁) ] = 1

[a__length (x₁) ] = 1

[a__U22 (x₁) ] = 1

[0] = 1

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

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

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

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

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

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

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

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

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

[a__zeros] = 1

[a__isNatList (x₁) ] = 1

[tt] = 1

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

[a__isNatKind (x₁) ] = 1

[a__U32 (x₁) ] = 1

[U51 (x₁, x₂, x₃) ] = 1

[a__isNat (x₁) ] = x₁

[U53 (x₁) ] = 0

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

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

[U22 (x₁) ] = 0

[isNatList (x₁) ] = 1

[a__U53 (x₁) ] = 1

[a__U42 (x₁, x₂) ] = 1

[a__U31 (x₁, x₂) ] = 1

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

[U32 (x₁) ] = 1

[s (x₁) ] = 1

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

[zeros] = 0

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

[a__U52 (x₁, x₂) ] = 1

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

[nil] = 0

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

[a__U51 (x₁, x₂, x₃) ] = 1

[isNat (x₁) ] = x₁

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

[a__U51# (x₁, x₂, x₃) ] = x₁ + x₂

[a__U12 (x₁) ] = 1

[a__isNatIListKind (x₁) ] = 1

[U43 (x₁) ] = 1

[isNatIListKind (x₁) ] = 0

[a__U43 (x₁) ] = 1

[U12 (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__isNatList#( cons( V1 , V2 ) ) → a__U51#( a__and( a__isNatKind( V1 ) , isNatIListKind( V2 ) ) , V1 , V2 )

a__U51#( tt , V1 , V2 ) → a__U52#( a__isNat( V1 ) , V2 )

1.1.1.1.1.1.1.2.1.1.1.2.1: dependency graph processor

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

The 2nd component contains the pair(s)

a__length#( cons( N , L ) ) → a__U61#( a__and( a__and( a__isNatList( L ) , isNatIListKind( L ) ) , and( isNat( N ) , isNatKind( N ) ) ) , L )

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

1.1.1.1.2: reduction pair processor

Using the following reduction pair

Linear polynomial interpretation over the naturals

[isNatKind (x₁) ] = 0

[length (x₁) ] = 0

[a__length (x₁) ] = 0

[a__U22 (x₁) ] = x₁

[0] = 0

[U41 (x₁, x₂, x₃) ] = x₁ + x₂ + 1

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

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

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

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

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

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

[a__U21 (x₁, x₂) ] = 1

[a__zeros] = 1

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

[a__isNatList (x₁) ] = x₁

[tt] = 1

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

[a__isNatKind (x₁) ] = 1

[a__U32 (x₁) ] = x₁

[U53 (x₁) ] = x₁

[U51 (x₁, x₂, x₃) ] = 3 x₁

[a__isNat (x₁) ] = 1

[a__U41 (x₁, x₂, x₃) ] = x₁ + x₂ + 1

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

[U22 (x₁) ] = x₁

[a__length# (x₁) ] = x₁

[isNatList (x₁) ] = x₁

[a__U53 (x₁) ] = x₁

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

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

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

[U32 (x₁) ] = x₁

[s (x₁) ] = 0

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

[zeros] = 0

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

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

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

[nil] = 1

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

[isNat (x₁) ] = 0

[a__U51 (x₁, x₂, x₃) ] = 3 x₁

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

[a__U12 (x₁) ] = 1

[a__isNatIListKind (x₁) ] = 1

[U43 (x₁) ] = x₁

[a__U43 (x₁) ] = x₁

[isNatIListKind (x₁) ] = 0

[U12 (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__U61#( a__and( a__and( a__isNatList( L ) , isNatIListKind( L ) ) , and( isNat( N ) , isNatKind( N ) ) ) , L )

1.1.1.1.2.1: dependency graph processor

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

a__U11#( tt , V1 )	→	a__U12#( a__isNatList( V1 ) )
a__U11#( tt , V1 )	→	a__isNatList#( V1 )
a__U21#( tt , V1 )	→	a__U22#( a__isNat( V1 ) )
a__U21#( tt , V1 )	→	a__isNat#( V1 )
a__U31#( tt , V )	→	a__U32#( a__isNatList( V ) )
a__U31#( tt , V )	→	a__isNatList#( V )
a__U41#( tt , V1 , V2 )	→	a__U42#( a__isNat( V1 ) , V2 )
a__U41#( tt , V1 , V2 )	→	a__isNat#( V1 )
a__U42#( tt , V2 )	→	a__U43#( a__isNatIList( V2 ) )
a__U42#( tt , V2 )	→	a__isNatIList#( V2 )
a__U51#( tt , V1 , V2 )	→	a__U52#( a__isNat( V1 ) , V2 )
a__U51#( tt , V1 , V2 )	→	a__isNat#( V1 )
a__U52#( tt , V2 )	→	a__U53#( a__isNatList( V2 ) )
a__U52#( tt , V2 )	→	a__isNatList#( V2 )
a__U61#( tt , L )	→	a__length#( mark( L ) )
a__U61#( tt , L )	→	mark#( L )
a__and#( tt , X )	→	mark#( X )
a__isNat#( length( V1 ) )	→	a__U11#( a__isNatIListKind( V1 ) , V1 )
a__isNat#( length( V1 ) )	→	a__isNatIListKind#( V1 )
a__isNat#( s( V1 ) )	→	a__U21#( a__isNatKind( V1 ) , V1 )
a__isNat#( s( V1 ) )	→	a__isNatKind#( V1 )
a__isNatIList#( V )	→	a__U31#( a__isNatIListKind( V ) , V )
a__isNatIList#( V )	→	a__isNatIListKind#( V )
a__isNatIList#( cons( V1 , V2 ) )	→	a__U41#( a__and( a__isNatKind( V1 ) , isNatIListKind( V2 ) ) , V1 , V2 )
a__isNatIList#( cons( V1 , V2 ) )	→	a__and#( a__isNatKind( V1 ) , isNatIListKind( V2 ) )
a__isNatIList#( cons( V1 , V2 ) )	→	a__isNatKind#( V1 )
a__isNatIListKind#( cons( V1 , V2 ) )	→	a__and#( a__isNatKind( V1 ) , isNatIListKind( V2 ) )
a__isNatIListKind#( cons( V1 , V2 ) )	→	a__isNatKind#( V1 )
a__isNatKind#( length( V1 ) )	→	a__isNatIListKind#( V1 )
a__isNatKind#( s( V1 ) )	→	a__isNatKind#( V1 )
a__isNatList#( cons( V1 , V2 ) )	→	a__U51#( a__and( a__isNatKind( V1 ) , isNatIListKind( V2 ) ) , V1 , V2 )
a__isNatList#( cons( V1 , V2 ) )	→	a__and#( a__isNatKind( V1 ) , isNatIListKind( V2 ) )
a__isNatList#( cons( V1 , V2 ) )	→	a__isNatKind#( V1 )
a__length#( cons( N , L ) )	→	a__U61#( a__and( a__and( a__isNatList( L ) , isNatIListKind( L ) ) , and( isNat( N ) , isNatKind( N ) ) ) , L )
a__length#( cons( N , L ) )	→	a__and#( a__and( a__isNatList( L ) , isNatIListKind( L ) ) , and( isNat( N ) , isNatKind( N ) ) )
a__length#( cons( N , L ) )	→	a__and#( a__isNatList( L ) , isNatIListKind( L ) )
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#( U12( X ) )	→	a__U12#( mark( X ) )
mark#( U12( X ) )	→	mark#( X )
mark#( isNatList( X ) )	→	a__isNatList#( X )
mark#( U21( X1 , X2 ) )	→	a__U21#( mark( X1 ) , X2 )
mark#( U21( X1 , X2 ) )	→	mark#( X1 )
mark#( U22( X ) )	→	a__U22#( mark( X ) )
mark#( U22( X ) )	→	mark#( X )
mark#( isNat( X ) )	→	a__isNat#( X )
mark#( U31( X1 , X2 ) )	→	a__U31#( mark( X1 ) , X2 )
mark#( U31( X1 , X2 ) )	→	mark#( X1 )
mark#( U32( X ) )	→	a__U32#( mark( X ) )
mark#( U32( X ) )	→	mark#( X )
mark#( U41( X1 , X2 , X3 ) )	→	a__U41#( mark( X1 ) , X2 , X3 )
mark#( U41( X1 , X2 , X3 ) )	→	mark#( X1 )
mark#( U42( X1 , X2 ) )	→	a__U42#( mark( X1 ) , X2 )
mark#( U42( X1 , X2 ) )	→	mark#( X1 )
mark#( U43( X ) )	→	a__U43#( mark( X ) )
mark#( U43( X ) )	→	mark#( X )
mark#( isNatIList( X ) )	→	a__isNatIList#( X )
mark#( U51( X1 , X2 , X3 ) )	→	a__U51#( mark( X1 ) , X2 , X3 )
mark#( U51( X1 , X2 , X3 ) )	→	mark#( X1 )
mark#( U52( X1 , X2 ) )	→	a__U52#( mark( X1 ) , X2 )
mark#( U52( X1 , X2 ) )	→	mark#( X1 )
mark#( U53( X ) )	→	a__U53#( mark( X ) )
mark#( U53( X ) )	→	mark#( X )
mark#( U61( X1 , X2 ) )	→	a__U61#( mark( X1 ) , X2 )
mark#( U61( 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#( isNatIListKind( X ) )	→	a__isNatIListKind#( X )
mark#( isNatKind( X ) )	→	a__isNatKind#( X )
mark#( cons( X1 , X2 ) )	→	mark#( X1 )
mark#( s( X ) )	→	mark#( X )

[a__isNatList# (x₁) ]	=	0
[isNatKind (x₁) ]	=	0
[length (x₁) ]	=	x₁ + 1
[a__length (x₁) ]	=	x₁ + 1
[a__U22 (x₁) ]	=	2 x₁
[0]	=	0
[U41 (x₁, x₂, x₃) ]	=	2 x₁
[cons (x₁, x₂) ]	=	2 x₁ + 2 x₂
[U21 (x₁, x₂) ]	=	2 x₁
[U31 (x₁, x₂) ]	=	2 x₁
[U61 (x₁, x₂) ]	=	2 x₁ + x₂ + 1
[and (x₁, x₂) ]	=	2 x₁ + x₂
[a__U42# (x₁, x₂) ]	=	0
[a__U11# (x₁, x₂) ]	=	0
[a__U52# (x₁, x₂) ]	=	0
[isNatIList (x₁) ]	=	0
[a__U21 (x₁, x₂) ]	=	2 x₁
[a__zeros]	=	0
[mark# (x₁) ]	=	2 x₁
[a__U61# (x₁, x₂) ]	=	2 x₁ + 1
[a__isNatList (x₁) ]	=	0
[tt]	=	0
[a__isNat# (x₁) ]	=	0
[a__and (x₁, x₂) ]	=	2 x₁ + x₂
[a__U21# (x₁, x₂) ]	=	0
[a__U32 (x₁) ]	=	2 x₁
[a__isNatKind (x₁) ]	=	0
[a__U41# (x₁, x₂, x₃) ]	=	0
[a__isNat (x₁) ]	=	0
[U51 (x₁, x₂, x₃) ]	=	x₁
[U53 (x₁) ]	=	x₁
[a__isNatKind# (x₁) ]	=	0
[a__U41 (x₁, x₂, x₃) ]	=	2 x₁
[a__isNatIList (x₁) ]	=	0
[U22 (x₁) ]	=	2 x₁
[isNatList (x₁) ]	=	0
[a__length# (x₁) ]	=	x₁ + 1
[a__U53 (x₁) ]	=	x₁
[a__U42 (x₁, x₂) ]	=	x₁
[a__U31 (x₁, x₂) ]	=	2 x₁
[a__isNatIListKind# (x₁) ]	=	0
[a__U31# (x₁, x₂) ]	=	0
[a__U61 (x₁, x₂) ]	=	2 x₁ + x₂ + 1
[U32 (x₁) ]	=	2 x₁
[s (x₁) ]	=	x₁
[a__U11 (x₁, x₂) ]	=	x₁
[mark (x₁) ]	=	x₁
[zeros]	=	0
[a__U52 (x₁, x₂) ]	=	2 x₁
[U52 (x₁, x₂) ]	=	2 x₁
[a__and# (x₁, x₂) ]	=	2 x₁
[a__isNatIList# (x₁) ]	=	0
[nil]	=	3
[U42 (x₁, x₂) ]	=	x₁
[isNat (x₁) ]	=	0
[a__U51 (x₁, x₂, x₃) ]	=	x₁
[U11 (x₁, x₂) ]	=	x₁
[a__U51# (x₁, x₂, x₃) ]	=	0
[a__U12 (x₁) ]	=	x₁
[a__isNatIListKind (x₁) ]	=	0
[U43 (x₁) ]	=	2 x₁
[isNatIListKind (x₁) ]	=	0
[a__U43 (x₁) ]	=	2 x₁
[U12 (x₁) ]	=	x₁
[f(x₁, ..., x_n)]	=	x₁ + ... + x_n + 1	for all other symbols f of arity n