Termination proof

1: switching to dependency pairs

The following set of initial dependency pairs has been identified.

min#( s( X ) , s( Y ) ) min#( X , Y )
quot#( s( X ) , s( Y ) ) quot#( min( X , Y ) , s( Y ) )
quot#( s( X ) , s( Y ) ) min#( 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).