NO Termination w.r.t. Q proof of /home/cern_httpd/provide/research/cycsrs/tpdb/TPDB-d9b80194f163/SRS_Standard/Mixed_SRS/07-oppelt08-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(b(x)) → Wait(Right1(x))
Begin(c(x)) → Wait(Right2(x))
Begin(L(x)) → Wait(Right3(x))
Begin(L(x)) → Wait(Right4(x))
Right1(R(End(x))) → Left(b(R(End(x))))
Right2(R(End(x))) → Left(L(c(End(x))))
Right3(b(End(x))) → Left(L(b(End(x))))
Right4(a(End(x))) → Left(a(b(R(End(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))
Right1(b(x)) → Ab(Right1(x))
Right2(b(x)) → Ab(Right2(x))
Right3(b(x)) → Ab(Right3(x))
Right4(b(x)) → Ab(Right4(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))
Right1(L(x)) → AL(Right1(x))
Right2(L(x)) → AL(Right2(x))
Right3(L(x)) → AL(Right3(x))
Right4(L(x)) → AL(Right4(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))
AR(Left(x)) → Left(R(x))
Ab(Left(x)) → Left(b(x))
Ac(Left(x)) → Left(c(x))
AL(Left(x)) → Left(L(x))
Aa(Left(x)) → Left(a(x))
Wait(Left(x)) → Begin(x)
R(b(x)) → b(R(x))
R(c(x)) → L(c(x))
b(L(x)) → L(b(x))
a(L(x)) → a(b(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:
Wait Left L b End → Wait Left L b End

Wait Left L b End → Wait Left L b End
by OverlapClosure OC 2
Wait Left L → Wait Right3
by OverlapClosure OC 2
Wait Left → Begin
by original rule (OC 1)
Begin L → Wait Right3
by original rule (OC 1)
Right3 b End → Left L b End
by original rule (OC 1)

(2) NO