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

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

0 QTRS
↳1 NonTerminationProof (⇒, 2706 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(l(x)) → rotate(cut(Cl(guess(x))))
begin(c(x)) → rotate(cut(Cc(guess(x))))
begin(r(x)) → rotate(cut(Cr(guess(x))))
guess(a(x)) → Ca(guess(x))
guess(l(x)) → Cl(guess(x))
guess(c(x)) → Cc(guess(x))
guess(r(x)) → Cr(guess(x))
guess(a(x)) → moveleft(Ba(wait(x)))
guess(l(x)) → moveleft(Bl(wait(x)))
guess(c(x)) → moveleft(Bc(wait(x)))
guess(r(x)) → moveleft(Br(wait(x)))
guess(end(x)) → finish(end(x))
Ca(moveleft(Ba(x))) → moveleft(Ba(Aa(x)))
Cl(moveleft(Ba(x))) → moveleft(Ba(Al(x)))
Cc(moveleft(Ba(x))) → moveleft(Ba(Ac(x)))
Cr(moveleft(Ba(x))) → moveleft(Ba(Ar(x)))
Ca(moveleft(Bl(x))) → moveleft(Bl(Aa(x)))
Cl(moveleft(Bl(x))) → moveleft(Bl(Al(x)))
Cc(moveleft(Bl(x))) → moveleft(Bl(Ac(x)))
Cr(moveleft(Bl(x))) → moveleft(Bl(Ar(x)))
Ca(moveleft(Bc(x))) → moveleft(Bc(Aa(x)))
Cl(moveleft(Bc(x))) → moveleft(Bc(Al(x)))
Cc(moveleft(Bc(x))) → moveleft(Bc(Ac(x)))
Cr(moveleft(Bc(x))) → moveleft(Bc(Ar(x)))
Ca(moveleft(Br(x))) → moveleft(Br(Aa(x)))
Cl(moveleft(Br(x))) → moveleft(Br(Al(x)))
Cc(moveleft(Br(x))) → moveleft(Br(Ac(x)))
Cr(moveleft(Br(x))) → moveleft(Br(Ar(x)))
cut(moveleft(Ba(x))) → Da(cut(goright(x)))
cut(moveleft(Bl(x))) → Dl(cut(goright(x)))
cut(moveleft(Bc(x))) → Dc(cut(goright(x)))
cut(moveleft(Br(x))) → Dr(cut(goright(x)))
goright(Aa(x)) → Ca(goright(x))
goright(Al(x)) → Cl(goright(x))
goright(Ac(x)) → Cc(goright(x))
goright(Ar(x)) → Cr(goright(x))
goright(wait(a(x))) → moveleft(Ba(wait(x)))
goright(wait(l(x))) → moveleft(Bl(wait(x)))
goright(wait(c(x))) → moveleft(Bc(wait(x)))
goright(wait(r(x))) → moveleft(Br(wait(x)))
goright(wait(end(x))) → finish(end(x))
Ca(finish(x)) → finish(a(x))
Cl(finish(x)) → finish(l(x))
Cc(finish(x)) → finish(c(x))
Cr(finish(x)) → finish(r(x))
cut(finish(x)) → finish2(x)
Da(finish2(x)) → finish2(a(x))
Dl(finish2(x)) → finish2(l(x))
Dc(finish2(x)) → finish2(c(x))
Dr(finish2(x)) → finish2(r(x))
rotate(finish2(x)) → rewrite(x)
rewrite(a(l(x))) → begin(l(a(x)))
rewrite(a(c(x))) → begin(c(a(x)))
rewrite(c(a(r(x)))) → begin(r(a(x)))
rewrite(l(r(a(a(x))))) → begin(a(a(l(c(c(c(r(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 a c end → rewrite a c end

rewrite a c end → rewrite a c end
by OverlapClosure OC 3
rewrite a c end → rotate finish2 a c end
by OverlapClosure OC 3
rewrite a c end → rotate Da finish2 c end
by OverlapClosure OC 3
rewrite a c end → rotate Da cut finish c end
by OverlapClosure OC 3
rewrite a c end → rotate Da cut Cc finish end
by OverlapClosure OC 2
rewrite a c → rotate Da cut Cc goright wait
by OverlapClosure OC 3
rewrite a c → rotate Da cut goright Ac wait
by OverlapClosure OC 3
rewrite a c → rotate cut moveleft Ba Ac wait
by OverlapClosure OC 3
rewrite a c → rotate cut Cc moveleft Ba wait
by OverlapClosure OC 2
rewrite a c → rotate cut Cc guess a
by OverlapClosure OC 3
rewrite a c → begin c a
by original rule (OC 1)
begin c → rotate cut Cc guess
by original rule (OC 1)
guess a → moveleft Ba wait
by original rule (OC 1)
Cc moveleft Ba → moveleft Ba Ac
by original rule (OC 1)
cut moveleft Ba → Da cut goright
by original rule (OC 1)
goright Ac → Cc goright
by original rule (OC 1)
goright wait end → finish end
by original rule (OC 1)
Cc finish → finish c
by original rule (OC 1)
cut finish → finish2
by original rule (OC 1)
Da finish2 → finish2 a
by original rule (OC 1)
rotate finish2 → rewrite
by original rule (OC 1)

(2) NO