Termination proof

1: switching to dependency pairs

after#( s( N ) , cons( X , XS ) )	→	after#( N , activate( XS ) )
after#( s( N ) , cons( X , XS ) )	→	activate#( XS )
activate#( n__from( X ) )	→	from#( X )

1.1: dependency graph processor

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

• The 1st component contains the pair(s)

  after#( s( N ) , cons( X , XS ) )

  →

  after#( N , activate( XS ) )

  1.1.1: reduction pair processor

  Using the following reduction pair

  Linear polynomial interpretation over the naturals

  [from (x1) ]	=	1
  [n__from (x1) ]	=	0
  [after (x1, x2) ]	=	x1 + x2
  [s (x1) ]	=	2 x1 + 3
  [0]	=	0
  [after# (x1, x2) ]	=	3 x1 + 3 x2
  [cons (x1, x2) ]	=	2 x1
  [activate (x1) ]	=	x1 + 2
  [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.