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

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

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

(0) Obligation:

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

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

Begin d b d d b End → Begin d b d d b End
by OverlapClosure OC 3
Begin d b d d b End → Wait Left d b d d b End
by OverlapClosure OC 2
Begin d b → Wait Right1
by original rule (OC 1)
Right1 d d b End → Left d b d d b End
by OverlapClosure OC 3
Right1 d d b End → Ad Left b d d b End
by OverlapClosure OC 2
Right1 d → Ad Right1
by original rule (OC 1)
Right1 d b End → Left b d d b End
by OverlapClosure OC 3
Right1 d b End → Left d c d b End
by OverlapClosure OC 3
Right1 d b End → Ad Left c d b End
by OverlapClosure OC 2
Right1 d → Ad Right1
by original rule (OC 1)
Right1 b End → Left c d b End
by original rule (OC 1)
Ad Left → Left d
by original rule (OC 1)
d c → b d
by original rule (OC 1)
Ad Left → Left d
by original rule (OC 1)
Wait Left → Begin
by original rule (OC 1)

(2) NO