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-328-split.srs

Termination w.r.t. Q of the given QTRS could be disproven:

0 QTRS
↳1 NonTerminationProof (⇒, 38 ms)
↳2 NO

(0) Obligation:

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

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

Wait Left b c a End → Wait Left b c a End
by OverlapClosure OC 3
Wait Left b c a End → Wait Left a c a End
by OverlapClosure OC 2
Wait Left → Begin
by original rule (OC 1)
Begin b c a End → Wait Left a c a End
by OverlapClosure OC 2
Begin b → Wait Right2
by original rule (OC 1)
Right2 c a End → Left a c a End
by original rule (OC 1)
a → b
by original rule (OC 1)

(2) NO