Termination proof

1: switching to dependency pairs

f#( a , f( f( a , x ) , a ) )	→	f#( f( a , f( a , x ) ) , a )
f#( a , f( f( a , x ) , a ) )	→	f#( a , f( a , x ) )
f#( a , f( f( a , x ) , a ) )	→	f#( a , x )

1.1: dependency graph processor

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

• The 1st component contains the pair(s)

  f#( a , f( f( a , x ) , a ) )	→	f#( a , x )
  f#( a , f( f( a , x ) , a ) )	→	f#( a , f( a , x ) )

  1.1.1: reduction pair processor

  Using the following reduction pair

  Linear polynomial interpretation over the naturals

  [a]	=	0
  [f (x1, x2) ]	=	x1 + 2 x2 + 1
  [f# (x1, x2) ]	=	x1
  [f(x1, ..., xn)]	=	x1 + ... + xn + 1	for all other symbols f of arity n

  one remains with the following pair(s).

  none

  1.1.1.1: P is empty

  All dependency pairs have been removed.