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

(0) Obligation:

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

Begin(c(a(x))) → Wait(Right1(x))
Begin(a(x)) → Wait(Right2(x))
Begin(b(b(x))) → Wait(Right3(x))
Begin(b(x)) → Wait(Right4(x))
Begin(d(x)) → Wait(Right5(x))
Begin(d(b(x))) → Wait(Right6(x))
Begin(b(x)) → Wait(Right7(x))
Begin(c(x)) → Wait(Right8(x))
Begin(b(x)) → Wait(Right9(x))
Begin(b(c(x))) → Wait(Right10(x))
Begin(c(x)) → Wait(Right11(x))
Begin(a(x)) → Wait(Right12(x))
Right1(b(End(x))) → Left(a(b(End(x))))
Right2(b(c(End(x)))) → Left(a(b(End(x))))
Right3(b(End(x))) → Left(c(a(c(End(x)))))
Right4(b(b(End(x)))) → Left(c(a(c(End(x)))))
Right5(c(End(x))) → Left(d(c(End(x))))
Right6(c(End(x))) → Left(d(c(c(End(x)))))
Right7(c(d(End(x)))) → Left(d(c(c(End(x)))))
Right8(d(End(x))) → Left(b(b(b(End(x)))))
Right9(c(End(x))) → Left(d(a(End(x))))
Right10(d(End(x))) → Left(a(a(End(x))))
Right11(d(b(End(x)))) → Left(a(a(End(x))))
Right12(d(End(x))) → Left(b(End(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))
Right1(c(x)) → Ac(Right1(x))
Right2(c(x)) → Ac(Right2(x))
Right3(c(x)) → Ac(Right3(x))
Right4(c(x)) → Ac(Right4(x))
Right5(c(x)) → Ac(Right5(x))
Right6(c(x)) → Ac(Right6(x))
Right7(c(x)) → Ac(Right7(x))
Right8(c(x)) → Ac(Right8(x))
Right9(c(x)) → Ac(Right9(x))
Right10(c(x)) → Ac(Right10(x))
Right11(c(x)) → Ac(Right11(x))
Right12(c(x)) → Ac(Right12(x))
Right1(a(x)) → Aa(Right1(x))
Right2(a(x)) → Aa(Right2(x))
Right3(a(x)) → Aa(Right3(x))
Right4(a(x)) → Aa(Right4(x))
Right5(a(x)) → Aa(Right5(x))
Right6(a(x)) → Aa(Right6(x))
Right7(a(x)) → Aa(Right7(x))
Right8(a(x)) → Aa(Right8(x))
Right9(a(x)) → Aa(Right9(x))
Right10(a(x)) → Aa(Right10(x))
Right11(a(x)) → Aa(Right11(x))
Right12(a(x)) → Aa(Right12(x))
Right1(d(x)) → Ad(Right1(x))
Right2(d(x)) → Ad(Right2(x))
Right3(d(x)) → Ad(Right3(x))
Right4(d(x)) → Ad(Right4(x))
Right5(d(x)) → Ad(Right5(x))
Right6(d(x)) → Ad(Right6(x))
Right7(d(x)) → Ad(Right7(x))
Right8(d(x)) → Ad(Right8(x))
Right9(d(x)) → Ad(Right9(x))
Right10(d(x)) → Ad(Right10(x))
Right11(d(x)) → Ad(Right11(x))
Right12(d(x)) → Ad(Right12(x))
Ab(Left(x)) → Left(b(x))
Ac(Left(x)) → Left(c(x))
Aa(Left(x)) → Left(a(x))
Ad(Left(x)) → Left(d(x))
Wait(Left(x)) → Begin(x)
b(c(a(x))) → a(b(x))
b(b(b(x))) → c(a(c(x)))
c(d(x)) → d(c(x))
c(d(b(x))) → d(c(c(x)))
d(c(x)) → b(b(b(x)))
c(b(x)) → d(a(x))
d(b(c(x))) → a(a(x))
d(a(x)) → 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 d c EndWait Left d c End

Wait Left d c EndWait Left d c End
by OverlapClosure OC 2
Wait Left dWait Right5
by OverlapClosure OC 2
Wait LeftBegin
by original rule (OC 1)
Begin dWait Right5
by original rule (OC 1)
Right5 c EndLeft d c End
by original rule (OC 1)

(2) NO