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

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

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

(0) Obligation:

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

Begin(a(x)) → Wait(Right1(x))
Begin(b(x)) → Wait(Right2(x))
Begin(c(x)) → Wait(Right3(x))
Begin(b(x)) → Wait(Right4(x))
Begin(c(x)) → Wait(Right5(x))
Right1(a(End(x))) → Left(b(a(b(End(x)))))
Right2(b(End(x))) → Left(a(c(b(End(x)))))
Right3(c(End(x))) → Left(c(b(a(End(x)))))
Right4(a(End(x))) → Left(b(a(End(x))))
Right5(b(End(x))) → Left(c(End(x)))
Right1(a(x)) → Aa(Right1(x))
Right2(a(x)) → Aa(Right2(x))
Right3(a(x)) → Aa(Right3(x))
Right4(a(x)) → Aa(Right4(x))
Right5(a(x)) → Aa(Right5(x))
Right1(b(x)) → Ab(Right1(x))
Right2(b(x)) → Ab(Right2(x))
Right3(b(x)) → Ab(Right3(x))
Right4(b(x)) → Ab(Right4(x))
Right5(b(x)) → Ab(Right5(x))
Right1(c(x)) → Ac(Right1(x))
Right2(c(x)) → Ac(Right2(x))
Right3(c(x)) → Ac(Right3(x))
Right4(c(x)) → Ac(Right4(x))
Right5(c(x)) → Ac(Right5(x))
Aa(Left(x)) → Left(a(x))
Ab(Left(x)) → Left(b(x))
Ac(Left(x)) → Left(c(x))
Wait(Left(x)) → Begin(x)
a(a(x)) → b(a(b(x)))
b(b(x)) → a(c(b(x)))
c(c(x)) → c(b(a(x)))
a(b(x)) → b(a(x))
b(c(x)) → c(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:
Wait Left b a End → Wait Left b a End

Wait Left b a End → Wait Left b a End
by OverlapClosure OC 2
Wait Left b → Wait Right4
by OverlapClosure OC 2
Wait Left → Begin
by original rule (OC 1)
Begin b → Wait Right4
by original rule (OC 1)
Right4 a End → Left b a End
by original rule (OC 1)

(2) NO