NO Termination w.r.t. Q proof of /home/cern_httpd/provide/research/cycsrs/tpdb/TPDB-d9b80194f163/SRS_Standard/Zantema_04/z065.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(0(x)) → Wait(Right1(x))
Begin(1(x)) → Wait(Right2(x))
Right1(#(End(x))) → Left(0(#(End(x))))
Right2(#(End(x))) → Left(1(#(End(x))))
Right1(#(x)) → A#(Right1(x))
Right2(#(x)) → A#(Right2(x))
Right1(0(x)) → A0(Right1(x))
Right2(0(x)) → A0(Right2(x))
Right1(1(x)) → A1(Right1(x))
Right2(1(x)) → A1(Right2(x))
A#(Left(x)) → Left(#(x))
A0(Left(x)) → Left(0(x))
A1(Left(x)) → Left(1(x))
Wait(Left(x)) → Begin(x)
#(0(x)) → 0(#(x))
#(1(x)) → 1(#(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 1 # End → Wait Left 1 # End

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

(2) NO