NO Termination w.r.t. Q proof of /home/cern_httpd/provide/research/cycsrs/tpdb/TPDB-d9b80194f163/SRS_Standard/Waldmann_07_size12/size-12-alpha-3-num-374-split.srs

(0) Obligation:

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

Begin(c(x)) → Wait(Right1(x))
Begin(b(b(x))) → Wait(Right2(x))
Begin(b(x)) → Wait(Right3(x))
Right1(a(End(x))) → Left(b(c(c(a(End(x))))))
Right2(c(End(x))) → Left(a(End(x)))
Right3(c(b(End(x)))) → Left(a(End(x)))
Right1(a(x)) → Aa(Right1(x))
Right2(a(x)) → Aa(Right2(x))
Right3(a(x)) → Aa(Right3(x))
Right1(b(x)) → Ab(Right1(x))
Right2(b(x)) → Ab(Right2(x))
Right3(b(x)) → Ab(Right3(x))
Right1(c(x)) → Ac(Right1(x))
Right2(c(x)) → Ac(Right2(x))
Right3(c(x)) → Ac(Right3(x))
Aa(Left(x)) → Left(a(x))
Ab(Left(x)) → Left(b(x))
Ac(Left(x)) → Left(c(x))
Wait(Left(x)) → Begin(x)
a(x) → b(x)
a(c(x)) → b(c(c(a(x))))
c(b(b(x))) → a(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:
Begin c a EndBegin c a End

Begin c a EndBegin c a End
by OverlapClosure OC 3
Begin c a EndWait Left c a End
by OverlapClosure OC 3
Begin c a EndWait Ac Left a End
by OverlapClosure OC 2
Begin c a EndWait Ac Right3 c b End
by OverlapClosure OC 3
Begin c a EndWait Ac Right3 c a End
by OverlapClosure OC 3
Begin c a EndWait Right3 c c a End
by OverlapClosure OC 3
Begin c a EndBegin b c c a End
by OverlapClosure OC 3
Begin c a EndWait Left b c c a End
by OverlapClosure OC 2
Begin cWait Right1
by original rule (OC 1)
Right1 a EndLeft b c c a End
by original rule (OC 1)
Wait LeftBegin
by original rule (OC 1)
Begin bWait Right3
by original rule (OC 1)
Right3 cAc Right3
by original rule (OC 1)
ab
by original rule (OC 1)
Right3 c b EndLeft a End
by original rule (OC 1)
Ac LeftLeft c
by original rule (OC 1)
Wait LeftBegin
by original rule (OC 1)

(2) NO