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

(0) Obligation:

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

Begin(a(a(x))) → Wait(Right1(x))
Begin(a(x)) → Wait(Right2(x))
Begin(c(a(x))) → Wait(Right3(x))
Begin(a(x)) → Wait(Right4(x))
Begin(a(c(x))) → Wait(Right5(x))
Begin(c(x)) → Wait(Right6(x))
Right1(a(End(x))) → Left(c(c(a(End(x)))))
Right2(a(a(End(x)))) → Left(c(c(a(End(x)))))
Right3(a(End(x))) → Left(c(c(a(End(x)))))
Right4(a(c(End(x)))) → Left(c(c(a(End(x)))))
Right5(c(End(x))) → Left(a(a(c(End(x)))))
Right6(c(a(End(x)))) → Left(a(a(c(End(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))
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))
Aa(Left(x)) → Left(a(x))
Ac(Left(x)) → Left(c(x))
Wait(Left(x)) → Begin(x)
a(a(a(x))) → c(c(a(x)))
a(c(a(x))) → c(c(a(x)))
c(a(c(x))) → a(a(c(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 c c a EndWait Left c c a End

Wait Left c c a EndWait Left c c a End
by OverlapClosure OC 2
Wait Left c c a EndWait Right4 a c End
by OverlapClosure OC 3
Wait Left c c a EndBegin a a c End
by OverlapClosure OC 3
Wait Left c c a EndWait Left a a c End
by OverlapClosure OC 2
Wait Left cWait Right6
by OverlapClosure OC 2
Wait LeftBegin
by original rule (OC 1)
Begin cWait Right6
by original rule (OC 1)
Right6 c a EndLeft a a c End
by original rule (OC 1)
Wait LeftBegin
by original rule (OC 1)
Begin aWait Right4
by original rule (OC 1)
Right4 a c EndLeft c c a End
by original rule (OC 1)

(2) NO