NO Termination w.r.t. Q proof of /home/cern_httpd/provide/research/cycsrs/tpdb/TPDB-d9b80194f163/SRS_Standard/Zantema_04/z072-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(l(x)) → Wait(Right1(x))
Begin(a(a(x))) → Wait(Right2(x))
Begin(a(x)) → Wait(Right3(x))
Begin(l(x)) → Wait(Right4(x))
Begin(b(x)) → Wait(Right5(x))
Right1(a(End(x))) → Left(l(a(End(x))))
Right2(r(End(x))) → Left(a(a(r(End(x)))))
Right3(r(a(End(x)))) → Left(a(a(r(End(x)))))
Right4(b(End(x))) → Left(b(a(r(End(x)))))
Right5(r(End(x))) → Left(l(b(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(l(x)) → Al(Right1(x))
Right2(l(x)) → Al(Right2(x))
Right3(l(x)) → Al(Right3(x))
Right4(l(x)) → Al(Right4(x))
Right5(l(x)) → Al(Right5(x))
Right1(r(x)) → Ar(Right1(x))
Right2(r(x)) → Ar(Right2(x))
Right3(r(x)) → Ar(Right3(x))
Right4(r(x)) → Ar(Right4(x))
Right5(r(x)) → Ar(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))
Aa(Left(x)) → Left(a(x))
Al(Left(x)) → Left(l(x))
Ar(Left(x)) → Left(r(x))
Ab(Left(x)) → Left(b(x))
Wait(Left(x)) → Begin(x)
a(l(x)) → l(a(x))
r(a(a(x))) → a(a(r(x)))
b(l(x)) → b(a(r(x)))
r(b(x)) → l(b(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 l a End → Wait Left l a End

Wait Left l a End → Wait Left l a End
by OverlapClosure OC 2
Wait Left l → Wait Right1
by OverlapClosure OC 2
Wait Left → Begin
by original rule (OC 1)
Begin l → Wait Right1
by original rule (OC 1)
Right1 a End → Left l a End
by original rule (OC 1)

(2) NO