Termination proof

1: switching to dependency pairs

The following set of initial dependency pairs has been identified.

f#( g( f( a ) , h( a , f( a ) ) ) ) → f#( h( g( f( a ) , a ) , g( f( a ) , f( a ) ) ) )
f#( g( f( a ) , h( a , f( a ) ) ) ) → f#( a )
f#( g( f( a ) , h( a , f( a ) ) ) ) → f#( a )
f#( g( f( a ) , h( a , f( a ) ) ) ) → f#( a )

1.1: dependency graph processor

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