Termination proof

1: switching to dependency pairs

The following set of initial dependency pairs has been identified.

a__from#( X ) mark#( X )
a__length#( cons( X , Y ) ) a__length1#( Y )
a__length1#( X ) a__length#( X )
mark#( from( X ) ) a__from#( mark( X ) )
mark#( from( X ) ) mark#( X )
mark#( length( X ) ) a__length#( X )
mark#( length1( X ) ) a__length1#( X )
mark#( cons( X1 , X2 ) ) mark#( X1 )
mark#( s( X ) ) mark#( X )

1.1: dependency graph processor

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