Termination proof

1: switching to dependency pairs

The following set of initial dependency pairs has been identified.

norm#( g( x , y ) ) norm#( x )
f#( x , g( y , z ) ) f#( x , y )
rem#( g( x , y ) , s( z ) ) rem#( x , z )

1.1: dependency graph processor

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