Termination proof

1: switching to dependency pairs

The following set of initial dependency pairs has been identified.

double#( s( x ) ) double#( x )
half#( s( s( x ) ) ) half#( x )
-#( s( x ) , s( y ) ) -#( x , y )

1.1: dependency graph processor

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