Termination proof

1: switching to dependency pairs

a#	→	g#( c )
f#( g( X ) , b )	→	f#( a , X )
f#( g( X ) , b )	→	a#

1.1: dependency graph processor

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

• The 1st component contains the pair(s)

  f#( g( X ) , b )

  →

  f#( a , X )

  1.1.1: reduction pair processor

  Using the following reduction pair

  Linear polynomial interpretation over the naturals

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