Termination proof

1: switching to dependency pairs

g#( a )	→	g#( b )
g#( a )	→	b#
b#	→	f#( a , a )
f#( a , a )	→	g#( d )

1.1: dependency graph processor

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

• The 1st component contains the pair(s)

  g#( a )

  →

  g#( b )

  1.1.1: reduction pair processor

  Using the following reduction pair

  Linear polynomial interpretation over the naturals

  [d]	=	0
  [b]	=	1
  [g# (x1) ]	=	3 x1
  [a]	=	2
  [f (x1, x2) ]	=	1
  [g (x1) ]	=	0
  [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.