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-283.srs-torpacyc2out-split.srs

(0) Obligation:

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

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

Begin b a EndBegin b a End
by OverlapClosure OC 3
Begin b a EndWait Left b a End
by OverlapClosure OC 3
Begin b a EndWait Ab Left a End
by OverlapClosure OC 3
Begin b a EndWait Ab Aa Left End
by OverlapClosure OC 2
Begin b a EndWait Ab Aa Right2 c End
by OverlapClosure OC 3
Begin b a EndWait Ab Right2 a c End
by OverlapClosure OC 3
Begin b a EndWait Right2 b a c End
by OverlapClosure OC 3
Begin b a EndBegin c b a c End
by OverlapClosure OC 3
Begin b a EndBegin c b b End
by OverlapClosure OC 3
Begin b a EndWait Left c b b End
by OverlapClosure OC 2
Begin bWait Right1
by original rule (OC 1)
Right1 a EndLeft c b b End
by original rule (OC 1)
Wait LeftBegin
by original rule (OC 1)
ba c
by OverlapClosure OC 3
ba a c
by original rule (OC 1)
a
by original rule (OC 1)
Begin cWait Right2
by original rule (OC 1)
Right2 bAb Right2
by original rule (OC 1)
Right2 aAa Right2
by original rule (OC 1)
Right2 c EndLeft End
by original rule (OC 1)
Aa LeftLeft a
by original rule (OC 1)
Ab LeftLeft b
by original rule (OC 1)
Wait LeftBegin
by original rule (OC 1)

(2) NO