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

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

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

(0) Obligation:

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

Begin(1(1(x))) → Wait(Right1(x))
Begin(1(x)) → Wait(Right2(x))
Begin(1(h(b(x)))) → Wait(Right3(x))
Begin(h(b(x))) → Wait(Right4(x))
Begin(b(x)) → Wait(Right5(x))
Begin(s(x)) → Wait(Right6(x))
Begin(s(x)) → Wait(Right7(x))
Begin(1(b(x))) → Wait(Right8(x))
Begin(b(x)) → Wait(Right9(x))
Begin(t(x)) → Wait(Right10(x))
Begin(t(x)) → Wait(Right11(x))
Right1(h(End(x))) → Left(1(h(End(x))))
Right2(h(1(End(x)))) → Left(1(h(End(x))))
Right3(1(End(x))) → Left(1(1(s(b(End(x))))))
Right4(1(1(End(x)))) → Left(1(1(s(b(End(x))))))
Right5(1(1(h(End(x))))) → Left(1(1(s(b(End(x))))))
Right6(1(End(x))) → Left(s(1(End(x))))
Right7(b(End(x))) → Left(b(h(End(x))))
Right8(h(End(x))) → Left(t(1(1(b(End(x))))))
Right9(h(1(End(x)))) → Left(t(1(1(b(End(x))))))
Right10(1(End(x))) → Left(t(1(1(1(End(x))))))
Right11(b(End(x))) → Left(b(h(End(x))))
Right1(h(x)) → Ah(Right1(x))
Right2(h(x)) → Ah(Right2(x))
Right3(h(x)) → Ah(Right3(x))
Right4(h(x)) → Ah(Right4(x))
Right5(h(x)) → Ah(Right5(x))
Right6(h(x)) → Ah(Right6(x))
Right7(h(x)) → Ah(Right7(x))
Right8(h(x)) → Ah(Right8(x))
Right9(h(x)) → Ah(Right9(x))
Right10(h(x)) → Ah(Right10(x))
Right11(h(x)) → Ah(Right11(x))
Right1(1(x)) → A1(Right1(x))
Right2(1(x)) → A1(Right2(x))
Right3(1(x)) → A1(Right3(x))
Right4(1(x)) → A1(Right4(x))
Right5(1(x)) → A1(Right5(x))
Right6(1(x)) → A1(Right6(x))
Right7(1(x)) → A1(Right7(x))
Right8(1(x)) → A1(Right8(x))
Right9(1(x)) → A1(Right9(x))
Right10(1(x)) → A1(Right10(x))
Right11(1(x)) → A1(Right11(x))
Right1(b(x)) → Ab(Right1(x))
Right2(b(x)) → Ab(Right2(x))
Right3(b(x)) → Ab(Right3(x))
Right4(b(x)) → Ab(Right4(x))
Right5(b(x)) → Ab(Right5(x))
Right6(b(x)) → Ab(Right6(x))
Right7(b(x)) → Ab(Right7(x))
Right8(b(x)) → Ab(Right8(x))
Right9(b(x)) → Ab(Right9(x))
Right10(b(x)) → Ab(Right10(x))
Right11(b(x)) → Ab(Right11(x))
Right1(s(x)) → As(Right1(x))
Right2(s(x)) → As(Right2(x))
Right3(s(x)) → As(Right3(x))
Right4(s(x)) → As(Right4(x))
Right5(s(x)) → As(Right5(x))
Right6(s(x)) → As(Right6(x))
Right7(s(x)) → As(Right7(x))
Right8(s(x)) → As(Right8(x))
Right9(s(x)) → As(Right9(x))
Right10(s(x)) → As(Right10(x))
Right11(s(x)) → As(Right11(x))
Right1(t(x)) → At(Right1(x))
Right2(t(x)) → At(Right2(x))
Right3(t(x)) → At(Right3(x))
Right4(t(x)) → At(Right4(x))
Right5(t(x)) → At(Right5(x))
Right6(t(x)) → At(Right6(x))
Right7(t(x)) → At(Right7(x))
Right8(t(x)) → At(Right8(x))
Right9(t(x)) → At(Right9(x))
Right10(t(x)) → At(Right10(x))
Right11(t(x)) → At(Right11(x))
Ah(Left(x)) → Left(h(x))
A1(Left(x)) → Left(1(x))
Ab(Left(x)) → Left(b(x))
As(Left(x)) → Left(s(x))
At(Left(x)) → Left(t(x))
Wait(Left(x)) → Begin(x)
h(1(1(x))) → 1(h(x))
1(1(h(b(x)))) → 1(1(s(b(x))))
1(s(x)) → s(1(x))
b(s(x)) → b(h(x))
h(1(b(x))) → t(1(1(b(x))))
1(t(x)) → t(1(1(1(x))))
b(t(x)) → b(h(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 s 1 End → Wait Left s 1 End

Wait Left s 1 End → Wait Left s 1 End
by OverlapClosure OC 2
Wait Left s → Wait Right6
by OverlapClosure OC 2
Wait Left → Begin
by original rule (OC 1)
Begin s → Wait Right6
by original rule (OC 1)
Right6 1 End → Left s 1 End
by original rule (OC 1)

(2) NO