The rewrite relation of the following TRS is considered.
| anchored(Cons(x,xs),y) | → | anchored(xs,Cons(Cons(Nil,Nil),y)) | (1) |
| anchored(Nil,y) | → | y | (2) |
| goal(x,y) | → | anchored(x,y) | (3) |
final states:
{0, 1, 2}
transitions:
| Cons0(0,0) | → | 0 |
| Nil0 | → | 0 |
| anchored0(0,0) | → | 1 |
| goal0(0,0) | → | 2 |
| Nil1 | → | 5 |
| Nil1 | → | 6 |
| Cons1(5,6) | → | 4 |
| Cons1(4,0) | → | 3 |
| anchored1(0,3) | → | 1 |
| anchored1(0,0) | → | 2 |
| Cons1(4,3) | → | 3 |
| anchored1(0,3) | → | 2 |
| 0 | → | 1 |
| 0 | → | 2 |
| 3 | → | 1 |
| 3 | → | 2 |