Termination proof

1: switching to dependency pairs

The following set of initial dependency pairs has been identified.

a__nats# a__adx#( a__zeros )
a__nats# a__zeros#
a__adx#( cons( X , Y ) ) a__incr#( cons( X , adx( Y ) ) )
a__hd#( cons( X , Y ) ) mark#( X )
a__tl#( cons( X , Y ) ) mark#( Y )
mark#( nats ) a__nats#
mark#( adx( X ) ) a__adx#( mark( X ) )
mark#( adx( X ) ) mark#( X )
mark#( zeros ) a__zeros#
mark#( incr( X ) ) a__incr#( mark( X ) )
mark#( incr( X ) ) mark#( X )
mark#( hd( X ) ) a__hd#( mark( X ) )
mark#( hd( X ) ) mark#( X )
mark#( tl( X ) ) a__tl#( mark( X ) )
mark#( tl( X ) ) mark#( X )

1.1: dependency graph processor

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