MAYBE Termination Proof

Termination Proof

by ttt2 (version ttt2 1.15)

Input

The rewrite relation of the following TRS is considered.

begin(end(x0)) → rewrite(end(x0))
begin(b(x0)) → rotate(cut(Cb(guess(x0))))
begin(a(x0)) → rotate(cut(Ca(guess(x0))))
begin(L(x0)) → rotate(cut(CL(guess(x0))))
begin(X(x0)) → rotate(cut(CX(guess(x0))))
guess(b(x0)) → Cb(guess(x0))
guess(a(x0)) → Ca(guess(x0))
guess(L(x0)) → CL(guess(x0))
guess(X(x0)) → CX(guess(x0))
guess(b(x0)) → moveleft(Bb(wait(x0)))
guess(a(x0)) → moveleft(Ba(wait(x0)))
guess(L(x0)) → moveleft(BL(wait(x0)))
guess(X(x0)) → moveleft(BX(wait(x0)))
guess(end(x0)) → finish(end(x0))
Cb(moveleft(Bb(x0))) → moveleft(Bb(Ab(x0)))
Ca(moveleft(Bb(x0))) → moveleft(Bb(Aa(x0)))
CL(moveleft(Bb(x0))) → moveleft(Bb(AL(x0)))
CX(moveleft(Bb(x0))) → moveleft(Bb(AX(x0)))
Cb(moveleft(Ba(x0))) → moveleft(Ba(Ab(x0)))
Ca(moveleft(Ba(x0))) → moveleft(Ba(Aa(x0)))
CL(moveleft(Ba(x0))) → moveleft(Ba(AL(x0)))
CX(moveleft(Ba(x0))) → moveleft(Ba(AX(x0)))
Cb(moveleft(BL(x0))) → moveleft(BL(Ab(x0)))
Ca(moveleft(BL(x0))) → moveleft(BL(Aa(x0)))
CL(moveleft(BL(x0))) → moveleft(BL(AL(x0)))
CX(moveleft(BL(x0))) → moveleft(BL(AX(x0)))
Cb(moveleft(BX(x0))) → moveleft(BX(Ab(x0)))
Ca(moveleft(BX(x0))) → moveleft(BX(Aa(x0)))
CL(moveleft(BX(x0))) → moveleft(BX(AL(x0)))
CX(moveleft(BX(x0))) → moveleft(BX(AX(x0)))
cut(moveleft(Bb(x0))) → Db(cut(goright(x0)))
cut(moveleft(Ba(x0))) → Da(cut(goright(x0)))
cut(moveleft(BL(x0))) → DL(cut(goright(x0)))
cut(moveleft(BX(x0))) → DX(cut(goright(x0)))
goright(Ab(x0)) → Cb(goright(x0))
goright(Aa(x0)) → Ca(goright(x0))
goright(AL(x0)) → CL(goright(x0))
goright(AX(x0)) → CX(goright(x0))
goright(wait(b(x0))) → moveleft(Bb(wait(x0)))
goright(wait(a(x0))) → moveleft(Ba(wait(x0)))
goright(wait(L(x0))) → moveleft(BL(wait(x0)))
goright(wait(X(x0))) → moveleft(BX(wait(x0)))
goright(wait(end(x0))) → finish(end(x0))
Cb(finish(x0)) → finish(b(x0))
Ca(finish(x0)) → finish(a(x0))
CL(finish(x0)) → finish(L(x0))
CX(finish(x0)) → finish(X(x0))
cut(finish(x0)) → finish2(x0)
Db(finish2(x0)) → finish2(b(x0))
Da(finish2(x0)) → finish2(a(x0))
DL(finish2(x0)) → finish2(L(x0))
DX(finish2(x0)) → finish2(X(x0))
rotate(finish2(x0)) → rewrite(x0)
rewrite(b(a(L(x0)))) → begin(L(a(L(X(b(a(b(b(x0)))))))))
rewrite(b(L(x0))) → begin(L(b(x0)))

Proof

1 Termination Assumption

We assume termination of the following TRS
begin(end(x0)) → rewrite(end(x0))
begin(b(x0)) → rotate(cut(Cb(guess(x0))))
begin(a(x0)) → rotate(cut(Ca(guess(x0))))
begin(L(x0)) → rotate(cut(CL(guess(x0))))
begin(X(x0)) → rotate(cut(CX(guess(x0))))
guess(b(x0)) → Cb(guess(x0))
guess(a(x0)) → Ca(guess(x0))
guess(L(x0)) → CL(guess(x0))
guess(X(x0)) → CX(guess(x0))
guess(b(x0)) → moveleft(Bb(wait(x0)))
guess(a(x0)) → moveleft(Ba(wait(x0)))
guess(L(x0)) → moveleft(BL(wait(x0)))
guess(X(x0)) → moveleft(BX(wait(x0)))
guess(end(x0)) → finish(end(x0))
Cb(moveleft(Bb(x0))) → moveleft(Bb(Ab(x0)))
Ca(moveleft(Bb(x0))) → moveleft(Bb(Aa(x0)))
CL(moveleft(Bb(x0))) → moveleft(Bb(AL(x0)))
CX(moveleft(Bb(x0))) → moveleft(Bb(AX(x0)))
Cb(moveleft(Ba(x0))) → moveleft(Ba(Ab(x0)))
Ca(moveleft(Ba(x0))) → moveleft(Ba(Aa(x0)))
CL(moveleft(Ba(x0))) → moveleft(Ba(AL(x0)))
CX(moveleft(Ba(x0))) → moveleft(Ba(AX(x0)))
Cb(moveleft(BL(x0))) → moveleft(BL(Ab(x0)))
Ca(moveleft(BL(x0))) → moveleft(BL(Aa(x0)))
CL(moveleft(BL(x0))) → moveleft(BL(AL(x0)))
CX(moveleft(BL(x0))) → moveleft(BL(AX(x0)))
Cb(moveleft(BX(x0))) → moveleft(BX(Ab(x0)))
Ca(moveleft(BX(x0))) → moveleft(BX(Aa(x0)))
CL(moveleft(BX(x0))) → moveleft(BX(AL(x0)))
CX(moveleft(BX(x0))) → moveleft(BX(AX(x0)))
cut(moveleft(Bb(x0))) → Db(cut(goright(x0)))
cut(moveleft(Ba(x0))) → Da(cut(goright(x0)))
cut(moveleft(BL(x0))) → DL(cut(goright(x0)))
cut(moveleft(BX(x0))) → DX(cut(goright(x0)))
goright(Ab(x0)) → Cb(goright(x0))
goright(Aa(x0)) → Ca(goright(x0))
goright(AL(x0)) → CL(goright(x0))
goright(AX(x0)) → CX(goright(x0))
goright(wait(b(x0))) → moveleft(Bb(wait(x0)))
goright(wait(a(x0))) → moveleft(Ba(wait(x0)))
goright(wait(L(x0))) → moveleft(BL(wait(x0)))
goright(wait(X(x0))) → moveleft(BX(wait(x0)))
goright(wait(end(x0))) → finish(end(x0))
Cb(finish(x0)) → finish(b(x0))
Ca(finish(x0)) → finish(a(x0))
CL(finish(x0)) → finish(L(x0))
CX(finish(x0)) → finish(X(x0))
cut(finish(x0)) → finish2(x0)
Db(finish2(x0)) → finish2(b(x0))
Da(finish2(x0)) → finish2(a(x0))
DL(finish2(x0)) → finish2(L(x0))
DX(finish2(x0)) → finish2(X(x0))
rotate(finish2(x0)) → rewrite(x0)
rewrite(b(a(L(x0)))) → begin(L(a(L(X(b(a(b(b(x0)))))))))
rewrite(b(L(x0))) → begin(L(b(x0)))