Termination proof

1: switching to dependency pairs

The following set of initial dependency pairs has been identified.

f#( g( i( a , b , b' ) , c ) , d ) → f#( .( b , c ) , d' )
f#( g( i( a , b , b' ) , c ) , d ) → f#( .( b' , c ) , d' )
f#( g( h( a , b ) , c ) , d ) → f#( .( b , g( h( a , b ) , c ) ) , d )
f#( g( h( a , b ) , c ) , d ) → f#( c , d' )

1.1: dependency graph processor

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