Termination proof

1: switching to dependency pairs

not#( and( x , y ) )	→	or#( not( x ) , not( y ) )
not#( and( x , y ) )	→	not#( x )
not#( and( x , y ) )	→	not#( y )
not#( or( x , y ) )	→	and#( not( x ) , not( y ) )
not#( or( x , y ) )	→	not#( x )
not#( or( x , y ) )	→	not#( y )

1.1: dependency graph processor

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

• The 1st component contains the pair(s)

  not#( and( x , y ) )	→	not#( y )
  not#( and( x , y ) )	→	not#( x )
  not#( or( x , y ) )	→	not#( x )
  not#( or( x , y ) )	→	not#( y )

  1.1.1: reduction pair processor

  Using the following reduction pair

  Linear polynomial interpretation over the naturals

  [and (x1, x2) ]	=	3 x1 + x2 + 3
  [or (x1, x2) ]	=	3 x1 + x2 + 3
  [not# (x1) ]	=	x1
  [not (x1) ]	=	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.