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

Wait Left 0 1 End → Wait Left 0 1 End
by OverlapClosure OC 2
Wait Left 0 → Wait Right1
by OverlapClosure OC 2
Wait Left → Begin
by original rule (OC 1)
Begin 0 → Wait Right1
by original rule (OC 1)
Right1 1 End → Left 0 1 End
by OverlapClosure OC 3
Right1 1 End → Left 0 0 0 1 End
by original rule (OC 1)
0 0 1 → 1
by OverlapClosure OC 2
0 0 → 0
by original rule (OC 1)
0 1 → 1
by original rule (OC 1)

(2) NO