Termination proof

1: switching to dependency pairs

__#( __( X , Y ) , Z )	→	__#( X , __( Y , Z ) )
__#( __( X , Y ) , Z )	→	__#( Y , Z )
and#( tt , X )	→	activate#( X )

1.1: dependency graph processor

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

• The 1st component contains the pair(s)

  __#( __( X , Y ) , Z )	→	__#( Y , Z )
  __#( __( X , Y ) , Z )	→	__#( X , __( Y , Z ) )

  1.1.1: reduction pair processor

  Using the following reduction pair

  Linear polynomial interpretation over the naturals

  [__ (x1, x2) ]	=	2 x1 + x2 + 2
  [and (x1, x2) ]	=	2 x1 + 2 x2 + 2
  [isNePal (x1) ]	=	2
  [__# (x1, x2) ]	=	2 x1 + x2
  [nil]	=	0
  [tt]	=	1
  [activate (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.