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

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

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

(0) Obligation:

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

Begin(a(x)) → Wait(Right1(x))
Begin(d(x)) → Wait(Right2(x))
Right1(a(End(x))) → Left(d(c(End(x))))
Right2(c(End(x))) → Left(a(a(End(x))))
Right1(a(x)) → Aa(Right1(x))
Right2(a(x)) → Aa(Right2(x))
Right1(d(x)) → Ad(Right1(x))
Right2(d(x)) → Ad(Right2(x))
Right1(c(x)) → Ac(Right1(x))
Right2(c(x)) → Ac(Right2(x))
Aa(Left(x)) → Left(a(x))
Ad(Left(x)) → Left(d(x))
Ac(Left(x)) → Left(c(x))
Wait(Left(x)) → Begin(x)
a(a(x)) → d(c(x))
c(d(x)) → a(a(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 c End → Begin d c End

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

(2) NO