NO Termination w.r.t. Q proof of /home/cern_httpd/provide/research/cycsrs/tpdb/TPDB-d9b80194f163/SRS_Standard/Zantema_04/z093.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(c(x)) → Wait(Right1(x))
Right1(b(End(x))) → Left(c(b(End(x))))
Right1(b(x)) → Ab(Right1(x))
Right1(c(x)) → Ac(Right1(x))
Ab(Left(x)) → Left(b(x))
Ac(Left(x)) → Left(c(x))
Wait(Left(x)) → Begin(x)
b(c(x)) → c(b(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 c b End → Wait Left c b End

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

(2) NO