Termination of the rewrite relation of the following TRS is considered.
a(plus(0),y) | → | y |
We uncurry the binary symbol a in combination with the following symbol map which also determines the applicative arities of these symbols.
plus(x1) | is mapped to | plus(x1), | plus2(x1, x2) |
0 | is mapped to | new_0 |
plus2(new_0,y) | → | y |
a(plus(x),y) | → | plus2(x,y) |
a#(plus(x),y) | → | plus2#(x,y) |
The dependency pairs are split into 0 components.