Termination proof

1: switching to dependency pairs

The following set of initial dependency pairs has been identified.

activate#( n__h( X ) ) h#( activate( X ) )
activate#( n__h( X ) ) activate#( X )
activate#( n__f( X ) ) f#( activate( X ) )
activate#( n__f( X ) ) activate#( X )

1.1: dependency graph processor

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