NO Termination w.r.t. Q proof of /home/cern_httpd/provide/research/cycsrs/tpdb/TPDB-d9b80194f163/SRS_Standard/Zantema_06/while2-rotate.srs

Termination w.r.t. Q of the given QTRS could be disproven:

0 QTRS
↳1 NonTerminationProof (⇒, 6590 ms)
↳2 NO

(0) Obligation:

Q restricted rewrite system:
The TRS R consists of the following rules:

begin(end(x)) → rewrite(end(x))
begin(a(x)) → rotate(cut(Ca(guess(x))))
begin(b(x)) → rotate(cut(Cb(guess(x))))
begin(d(x)) → rotate(cut(Cd(guess(x))))
begin(c(x)) → rotate(cut(Cc(guess(x))))
begin(f(x)) → rotate(cut(Cf(guess(x))))
guess(a(x)) → Ca(guess(x))
guess(b(x)) → Cb(guess(x))
guess(d(x)) → Cd(guess(x))
guess(c(x)) → Cc(guess(x))
guess(f(x)) → Cf(guess(x))
guess(a(x)) → moveleft(Ba(wait(x)))
guess(b(x)) → moveleft(Bb(wait(x)))
guess(d(x)) → moveleft(Bd(wait(x)))
guess(c(x)) → moveleft(Bc(wait(x)))
guess(f(x)) → moveleft(Bf(wait(x)))
guess(end(x)) → finish(end(x))
Ca(moveleft(Ba(x))) → moveleft(Ba(Aa(x)))
Cb(moveleft(Ba(x))) → moveleft(Ba(Ab(x)))
Cd(moveleft(Ba(x))) → moveleft(Ba(Ad(x)))
Cc(moveleft(Ba(x))) → moveleft(Ba(Ac(x)))
Cf(moveleft(Ba(x))) → moveleft(Ba(Af(x)))
Ca(moveleft(Bb(x))) → moveleft(Bb(Aa(x)))
Cb(moveleft(Bb(x))) → moveleft(Bb(Ab(x)))
Cd(moveleft(Bb(x))) → moveleft(Bb(Ad(x)))
Cc(moveleft(Bb(x))) → moveleft(Bb(Ac(x)))
Cf(moveleft(Bb(x))) → moveleft(Bb(Af(x)))
Ca(moveleft(Bd(x))) → moveleft(Bd(Aa(x)))
Cb(moveleft(Bd(x))) → moveleft(Bd(Ab(x)))
Cd(moveleft(Bd(x))) → moveleft(Bd(Ad(x)))
Cc(moveleft(Bd(x))) → moveleft(Bd(Ac(x)))
Cf(moveleft(Bd(x))) → moveleft(Bd(Af(x)))
Ca(moveleft(Bc(x))) → moveleft(Bc(Aa(x)))
Cb(moveleft(Bc(x))) → moveleft(Bc(Ab(x)))
Cd(moveleft(Bc(x))) → moveleft(Bc(Ad(x)))
Cc(moveleft(Bc(x))) → moveleft(Bc(Ac(x)))
Cf(moveleft(Bc(x))) → moveleft(Bc(Af(x)))
Ca(moveleft(Bf(x))) → moveleft(Bf(Aa(x)))
Cb(moveleft(Bf(x))) → moveleft(Bf(Ab(x)))
Cd(moveleft(Bf(x))) → moveleft(Bf(Ad(x)))
Cc(moveleft(Bf(x))) → moveleft(Bf(Ac(x)))
Cf(moveleft(Bf(x))) → moveleft(Bf(Af(x)))
cut(moveleft(Ba(x))) → Da(cut(goright(x)))
cut(moveleft(Bb(x))) → Db(cut(goright(x)))
cut(moveleft(Bd(x))) → Dd(cut(goright(x)))
cut(moveleft(Bc(x))) → Dc(cut(goright(x)))
cut(moveleft(Bf(x))) → Df(cut(goright(x)))
goright(Aa(x)) → Ca(goright(x))
goright(Ab(x)) → Cb(goright(x))
goright(Ad(x)) → Cd(goright(x))
goright(Ac(x)) → Cc(goright(x))
goright(Af(x)) → Cf(goright(x))
goright(wait(a(x))) → moveleft(Ba(wait(x)))
goright(wait(b(x))) → moveleft(Bb(wait(x)))
goright(wait(d(x))) → moveleft(Bd(wait(x)))
goright(wait(c(x))) → moveleft(Bc(wait(x)))
goright(wait(f(x))) → moveleft(Bf(wait(x)))
goright(wait(end(x))) → finish(end(x))
Ca(finish(x)) → finish(a(x))
Cb(finish(x)) → finish(b(x))
Cd(finish(x)) → finish(d(x))
Cc(finish(x)) → finish(c(x))
Cf(finish(x)) → finish(f(x))
cut(finish(x)) → finish2(x)
Da(finish2(x)) → finish2(a(x))
Db(finish2(x)) → finish2(b(x))
Dd(finish2(x)) → finish2(d(x))
Dc(finish2(x)) → finish2(c(x))
Df(finish2(x)) → finish2(f(x))
rotate(finish2(x)) → rewrite(x)
rewrite(a(b(x))) → begin(d(x))
rewrite(b(a(x))) → begin(a(b(x)))
rewrite(d(c(x))) → begin(f(a(b(b(c(x))))))
rewrite(d(f(x))) → begin(f(a(b(x))))
rewrite(a(f(x))) → begin(a(x))

Q is empty.

(1) NonTerminationProof (COMPLETE transformation)

We used the non-termination processor [OPPELT08] to show that the SRS problem is infinite.

Found the self-embedding DerivationStructure:
rewrite b a end → rewrite b a end

rewrite b a end → rewrite b a end
by OverlapClosure OC 3
rewrite b a end → rotate finish2 b a end
by OverlapClosure OC 3
rewrite b a end → rotate Db finish2 a end
by OverlapClosure OC 3
rewrite b a end → rotate Db cut finish a end
by OverlapClosure OC 3
rewrite b a end → rotate Db cut Ca finish end
by OverlapClosure OC 2
rewrite b a → rotate Db cut Ca goright wait
by OverlapClosure OC 3
rewrite b a → rotate Db cut goright Aa wait
by OverlapClosure OC 3
rewrite b a → rotate cut moveleft Bb Aa wait
by OverlapClosure OC 3
rewrite b a → rotate cut Ca moveleft Bb wait
by OverlapClosure OC 2
rewrite b a → rotate cut Ca guess b
by OverlapClosure OC 3
rewrite b a → begin a b
by original rule (OC 1)
begin a → rotate cut Ca guess
by original rule (OC 1)
guess b → moveleft Bb wait
by original rule (OC 1)
Ca moveleft Bb → moveleft Bb Aa
by original rule (OC 1)
cut moveleft Bb → Db cut goright
by original rule (OC 1)
goright Aa → Ca goright
by original rule (OC 1)
goright wait end → finish end
by original rule (OC 1)
Ca finish → finish a
by original rule (OC 1)
cut finish → finish2
by original rule (OC 1)
Db finish2 → finish2 b
by original rule (OC 1)
rotate finish2 → rewrite
by original rule (OC 1)

(2) NO