Termination proof

1: switching to dependency pairs

The following set of initial dependency pairs has been identified.

minus#( x , s( y ) ) pred#( minus( x , y ) )
minus#( x , s( y ) ) minus#( x , y )
quot#( s( x ) , s( y ) ) quot#( minus( x , y ) , s( y ) )
quot#( s( x ) , s( y ) ) minus#( x , y )
log#( s( s( x ) ) ) log#( s( quot( x , s( s( 0 ) ) ) ) )
log#( s( s( x ) ) ) quot#( x , s( s( 0 ) ) )

1.1: dependency graph processor

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