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

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

0 QTRS
↳1 NonTerminationProof (⇒, 618 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(m(x)) → Wait(Right3(x))
Begin(0(x)) → Wait(Right4(x))
Begin(1(x)) → Wait(Right5(x))
Begin(m(x)) → Wait(Right6(x))
Begin(b(x)) → Wait(Right7(x))
Begin(b(x)) → Wait(Right8(x))
Begin(qr(x)) → Wait(Right9(x))
Begin(qr(x)) → Wait(Right10(x))
Begin(qr(x)) → Wait(Right11(x))
Begin(ql(x)) → Wait(Right12(x))
Begin(ql(x)) → Wait(Right13(x))
Begin(ql(0(x))) → Wait(Right14(x))
Begin(0(x)) → Wait(Right15(x))
Begin(ql(1(x))) → Wait(Right16(x))
Begin(1(x)) → Wait(Right17(x))
Right1(r0(End(x))) → Left(0(r0(End(x))))
Right2(r0(End(x))) → Left(1(r0(End(x))))
Right3(r0(End(x))) → Left(m(r0(End(x))))
Right4(r1(End(x))) → Left(0(r1(End(x))))
Right5(r1(End(x))) → Left(1(r1(End(x))))
Right6(r1(End(x))) → Left(m(r1(End(x))))
Right7(r0(End(x))) → Left(qr(0(b(End(x)))))
Right8(r1(End(x))) → Left(qr(1(b(End(x)))))
Right9(0(End(x))) → Left(qr(0(End(x))))
Right10(1(End(x))) → Left(qr(1(End(x))))
Right11(m(End(x))) → Left(ql(m(End(x))))
Right12(0(End(x))) → Left(ql(0(End(x))))
Right13(1(End(x))) → Left(ql(1(End(x))))
Right14(b(End(x))) → Left(0(b(r0(End(x)))))
Right15(b(ql(End(x)))) → Left(0(b(r0(End(x)))))
Right16(b(End(x))) → Left(1(b(r1(End(x)))))
Right17(b(ql(End(x)))) → Left(1(b(r1(End(x)))))
Right1(r0(x)) → Ar0(Right1(x))
Right2(r0(x)) → Ar0(Right2(x))
Right3(r0(x)) → Ar0(Right3(x))
Right4(r0(x)) → Ar0(Right4(x))
Right5(r0(x)) → Ar0(Right5(x))
Right6(r0(x)) → Ar0(Right6(x))
Right7(r0(x)) → Ar0(Right7(x))
Right8(r0(x)) → Ar0(Right8(x))
Right9(r0(x)) → Ar0(Right9(x))
Right10(r0(x)) → Ar0(Right10(x))
Right11(r0(x)) → Ar0(Right11(x))
Right12(r0(x)) → Ar0(Right12(x))
Right13(r0(x)) → Ar0(Right13(x))
Right14(r0(x)) → Ar0(Right14(x))
Right15(r0(x)) → Ar0(Right15(x))
Right16(r0(x)) → Ar0(Right16(x))
Right17(r0(x)) → Ar0(Right17(x))
Right1(0(x)) → A0(Right1(x))
Right2(0(x)) → A0(Right2(x))
Right3(0(x)) → A0(Right3(x))
Right4(0(x)) → A0(Right4(x))
Right5(0(x)) → A0(Right5(x))
Right6(0(x)) → A0(Right6(x))
Right7(0(x)) → A0(Right7(x))
Right8(0(x)) → A0(Right8(x))
Right9(0(x)) → A0(Right9(x))
Right10(0(x)) → A0(Right10(x))
Right11(0(x)) → A0(Right11(x))
Right12(0(x)) → A0(Right12(x))
Right13(0(x)) → A0(Right13(x))
Right14(0(x)) → A0(Right14(x))
Right15(0(x)) → A0(Right15(x))
Right16(0(x)) → A0(Right16(x))
Right17(0(x)) → A0(Right17(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))
Right12(1(x)) → A1(Right12(x))
Right13(1(x)) → A1(Right13(x))
Right14(1(x)) → A1(Right14(x))
Right15(1(x)) → A1(Right15(x))
Right16(1(x)) → A1(Right16(x))
Right17(1(x)) → A1(Right17(x))
Right1(m(x)) → Am(Right1(x))
Right2(m(x)) → Am(Right2(x))
Right3(m(x)) → Am(Right3(x))
Right4(m(x)) → Am(Right4(x))
Right5(m(x)) → Am(Right5(x))
Right6(m(x)) → Am(Right6(x))
Right7(m(x)) → Am(Right7(x))
Right8(m(x)) → Am(Right8(x))
Right9(m(x)) → Am(Right9(x))
Right10(m(x)) → Am(Right10(x))
Right11(m(x)) → Am(Right11(x))
Right12(m(x)) → Am(Right12(x))
Right13(m(x)) → Am(Right13(x))
Right14(m(x)) → Am(Right14(x))
Right15(m(x)) → Am(Right15(x))
Right16(m(x)) → Am(Right16(x))
Right17(m(x)) → Am(Right17(x))
Right1(r1(x)) → Ar1(Right1(x))
Right2(r1(x)) → Ar1(Right2(x))
Right3(r1(x)) → Ar1(Right3(x))
Right4(r1(x)) → Ar1(Right4(x))
Right5(r1(x)) → Ar1(Right5(x))
Right6(r1(x)) → Ar1(Right6(x))
Right7(r1(x)) → Ar1(Right7(x))
Right8(r1(x)) → Ar1(Right8(x))
Right9(r1(x)) → Ar1(Right9(x))
Right10(r1(x)) → Ar1(Right10(x))
Right11(r1(x)) → Ar1(Right11(x))
Right12(r1(x)) → Ar1(Right12(x))
Right13(r1(x)) → Ar1(Right13(x))
Right14(r1(x)) → Ar1(Right14(x))
Right15(r1(x)) → Ar1(Right15(x))
Right16(r1(x)) → Ar1(Right16(x))
Right17(r1(x)) → Ar1(Right17(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))
Right12(b(x)) → Ab(Right12(x))
Right13(b(x)) → Ab(Right13(x))
Right14(b(x)) → Ab(Right14(x))
Right15(b(x)) → Ab(Right15(x))
Right16(b(x)) → Ab(Right16(x))
Right17(b(x)) → Ab(Right17(x))
Right1(qr(x)) → Aqr(Right1(x))
Right2(qr(x)) → Aqr(Right2(x))
Right3(qr(x)) → Aqr(Right3(x))
Right4(qr(x)) → Aqr(Right4(x))
Right5(qr(x)) → Aqr(Right5(x))
Right6(qr(x)) → Aqr(Right6(x))
Right7(qr(x)) → Aqr(Right7(x))
Right8(qr(x)) → Aqr(Right8(x))
Right9(qr(x)) → Aqr(Right9(x))
Right10(qr(x)) → Aqr(Right10(x))
Right11(qr(x)) → Aqr(Right11(x))
Right12(qr(x)) → Aqr(Right12(x))
Right13(qr(x)) → Aqr(Right13(x))
Right14(qr(x)) → Aqr(Right14(x))
Right15(qr(x)) → Aqr(Right15(x))
Right16(qr(x)) → Aqr(Right16(x))
Right17(qr(x)) → Aqr(Right17(x))
Right1(ql(x)) → Aql(Right1(x))
Right2(ql(x)) → Aql(Right2(x))
Right3(ql(x)) → Aql(Right3(x))
Right4(ql(x)) → Aql(Right4(x))
Right5(ql(x)) → Aql(Right5(x))
Right6(ql(x)) → Aql(Right6(x))
Right7(ql(x)) → Aql(Right7(x))
Right8(ql(x)) → Aql(Right8(x))
Right9(ql(x)) → Aql(Right9(x))
Right10(ql(x)) → Aql(Right10(x))
Right11(ql(x)) → Aql(Right11(x))
Right12(ql(x)) → Aql(Right12(x))
Right13(ql(x)) → Aql(Right13(x))
Right14(ql(x)) → Aql(Right14(x))
Right15(ql(x)) → Aql(Right15(x))
Right16(ql(x)) → Aql(Right16(x))
Right17(ql(x)) → Aql(Right17(x))
Ar0(Left(x)) → Left(r0(x))
A0(Left(x)) → Left(0(x))
A1(Left(x)) → Left(1(x))
Am(Left(x)) → Left(m(x))
Ar1(Left(x)) → Left(r1(x))
Ab(Left(x)) → Left(b(x))
Aqr(Left(x)) → Left(qr(x))
Aql(Left(x)) → Left(ql(x))
Wait(Left(x)) → Begin(x)
r0(0(x)) → 0(r0(x))
r0(1(x)) → 1(r0(x))
r0(m(x)) → m(r0(x))
r1(0(x)) → 0(r1(x))
r1(1(x)) → 1(r1(x))
r1(m(x)) → m(r1(x))
r0(b(x)) → qr(0(b(x)))
r1(b(x)) → qr(1(b(x)))
0(qr(x)) → qr(0(x))
1(qr(x)) → qr(1(x))
m(qr(x)) → ql(m(x))
0(ql(x)) → ql(0(x))
1(ql(x)) → ql(1(x))
b(ql(0(x))) → 0(b(r0(x)))
b(ql(1(x))) → 1(b(r1(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 ql 1 End → Wait Left ql 1 End

Wait Left ql 1 End → Wait Left ql 1 End
by OverlapClosure OC 2
Wait Left ql → Wait Right13
by OverlapClosure OC 2
Wait Left → Begin
by original rule (OC 1)
Begin ql → Wait Right13
by original rule (OC 1)
Right13 1 End → Left ql 1 End
by original rule (OC 1)

(2) NO