Termination proof

1: switching to dependency pairs

The following set of initial dependency pairs has been identified.

+#( x , s( y ) ) +#( x , y )
+#( s( x ) , y ) +#( x , y )
+#( x , +( y , z ) ) +#( +( x , y ) , z )
+#( x , +( y , z ) ) +#( x , y )
f#( g( f( x ) ) ) f#( h( s( 0 ) , x ) )
f#( g( h( x , y ) ) ) f#( h( s( x ) , y ) )
f#( h( x , h( y , z ) ) ) f#( h( +( x , y ) , z ) )
f#( h( x , h( y , z ) ) ) +#( x , y )

1.1: dependency graph processor

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