NO Termination w.r.t. Q proof of /home/cern_httpd/provide/research/cycsrs/tpdb/TPDB-d9b80194f163/SRS_Standard/Zantema_06/02.srs-torpacyc2out-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(p(x)) → Wait(Right1(x))
Begin(A(x)) → Wait(Right2(x))
Begin(A(A(x))) → Wait(Right3(x))
Begin(A(x)) → Wait(Right4(x))
Right1(a(End(x))) → Left(p(a(A(End(x)))))
Right2(a(End(x))) → Left(A(a(End(x))))
Right3(p(End(x))) → Left(a(p(End(x))))
Right4(p(A(End(x)))) → Left(a(p(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))
Right1(p(x)) → Ap(Right1(x))
Right2(p(x)) → Ap(Right2(x))
Right3(p(x)) → Ap(Right3(x))
Right4(p(x)) → Ap(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))
Aa(Left(x)) → Left(a(x))
Ap(Left(x)) → Left(p(x))
AA(Left(x)) → Left(A(x))
Wait(Left(x)) → Begin(x)
a(p(x)) → p(a(A(x)))
a(A(x)) → A(a(x))
p(A(A(x))) → a(p(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 A a End → Wait Left A a End

Wait Left A a End → Wait Left A a End
by OverlapClosure OC 2
Wait Left A → Wait Right2
by OverlapClosure OC 2
Wait Left → Begin
by original rule (OC 1)
Begin A → Wait Right2
by original rule (OC 1)
Right2 a End → Left A a End
by original rule (OC 1)

(2) NO