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

(0) Obligation:

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

Begin(e(b(x))) → Wait(Right1(x))
Begin(b(x)) → Wait(Right2(x))
Begin(e(e(x))) → Wait(Right3(x))
Begin(e(x)) → Wait(Right4(x))
Right1(b(End(x))) → Left(e(d(End(x))))
Right2(b(e(End(x)))) → Left(e(d(End(x))))
Right3(e(End(x))) → Left(d(e(End(x))))
Right4(e(e(End(x)))) → Left(d(e(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))
Right1(e(x)) → Ae(Right1(x))
Right2(e(x)) → Ae(Right2(x))
Right3(e(x)) → Ae(Right3(x))
Right4(e(x)) → Ae(Right4(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))
Ab(Left(x)) → Left(b(x))
Ae(Left(x)) → Left(e(x))
Ad(Left(x)) → Left(d(x))
Wait(Left(x)) → Begin(x)
b(e(b(x))) → e(d(x))
e(e(e(x))) → d(e(x))
d(x) → b(e(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 e d e e EndBegin e d e e End

Begin e d e e EndBegin e d e e End
by OverlapClosure OC 3
Begin e d e e EndWait Left e d e e End
by OverlapClosure OC 2
Begin eWait Right4
by original rule (OC 1)
Right4 d e e EndLeft e d e e End
by OverlapClosure OC 3
Right4 d e e EndLeft d b e e End
by OverlapClosure OC 3
Right4 d e e EndLeft d d e End
by OverlapClosure OC 3
Right4 d e e EndAd Left d e End
by OverlapClosure OC 2
Right4 dAd Right4
by original rule (OC 1)
Right4 e e EndLeft d e End
by original rule (OC 1)
Ad LeftLeft d
by original rule (OC 1)
db e
by original rule (OC 1)
d be d
by OverlapClosure OC 2
db e
by original rule (OC 1)
b e be d
by original rule (OC 1)
Wait LeftBegin
by original rule (OC 1)

(2) NO