Termination proof

1: switching to dependency pairs

The following set of initial dependency pairs has been identified.

g#( s( x ) ) → f#( x )
f#( s( x ) ) → g#( x )

1.1: reduction pair processor

Using the following reduction pair

Linear polynomial interpretation over the naturals
[g# (x1) ] = x1 + 3
[f (x1) ] = 3 x1 + 3
[s (x1) ] = 3 x1 + 3
[0] = 0
[f# (x1) ] = 3 x1 + 3
[g (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: P is empty

All dependency pairs have been removed.