NO
by ttt2 (version ttt2 1.15)
The rewrite relation of the following TRS is considered.
Begin(f(x0)) | → | Wait(Right1(x0)) |
Begin(c(x0)) | → | Wait(Right2(x0)) |
Begin(f(x0)) | → | Wait(Right3(x0)) |
Right1(c(End(x0))) | → | Left(f(c(c(End(x0))))) |
Right2(c(End(x0))) | → | Left(c(End(x0))) |
Right3(n(End(x0))) | → | Left(f(n(End(x0)))) |
Right1(c(x0)) | → | Ac(Right1(x0)) |
Right2(c(x0)) | → | Ac(Right2(x0)) |
Right3(c(x0)) | → | Ac(Right3(x0)) |
Right1(f(x0)) | → | Af(Right1(x0)) |
Right2(f(x0)) | → | Af(Right2(x0)) |
Right3(f(x0)) | → | Af(Right3(x0)) |
Right1(n(x0)) | → | An(Right1(x0)) |
Right2(n(x0)) | → | An(Right2(x0)) |
Right3(n(x0)) | → | An(Right3(x0)) |
Ac(Left(x0)) | → | Left(c(x0)) |
Af(Left(x0)) | → | Left(f(x0)) |
An(Left(x0)) | → | Left(n(x0)) |
Wait(Left(x0)) | → | Begin(x0) |
c(f(x0)) | → | f(c(c(x0))) |
c(c(x0)) | → | c(x0) |
n(f(x0)) | → | f(n(x0)) |
t0 | = | Begin(f(n(End(x1810)))) |
→ε | Wait(Right3(n(End(x1810)))) | |
→1 | Wait(Left(f(n(End(x1810))))) | |
→ε | Begin(f(n(End(x1810)))) | |
= | t3 |