NO Termination w.r.t. Q proof of /home/cern_httpd/provide/research/cycsrs/tpdb/TPDB-d9b80194f163/SRS_Standard/Zantema_04/z071.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(P(P(x))) → Wait(Right2(x))
Begin(P(x)) → Wait(Right3(x))
Begin(P(x)) → Wait(Right4(x))
Begin(p(x)) → Wait(Right5(x))
Right1(r(End(x))) → Left(p(p(r(P(End(x))))))
Right2(r(End(x))) → Left(P(P(r(End(x)))))
Right3(r(P(End(x)))) → Left(P(P(r(End(x)))))
Right4(p(End(x))) → Left(End(x))
Right5(P(End(x))) → Left(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))
Right5(r(x)) → Ar(Right5(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))
Right5(p(x)) → Ap(Right5(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))
Right5(P(x)) → AP(Right5(x))
Ar(Left(x)) → Left(r(x))
Ap(Left(x)) → Left(p(x))
AP(Left(x)) → Left(P(x))
Wait(Left(x)) → Begin(x)
r(p(x)) → p(p(r(P(x))))
r(P(P(x))) → P(P(r(x)))
p(P(x)) → x
P(p(x)) → 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 P P r End → Wait Left P P r End

Wait Left P P r End → Wait Left P P r End
by OverlapClosure OC 2
Wait Left P P → Wait Right2
by OverlapClosure OC 2
Wait Left → Begin
by original rule (OC 1)
Begin P P → Wait Right2
by original rule (OC 1)
Right2 r End → Left P P r End
by original rule (OC 1)

(2) NO