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

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

0 QTRS
↳1 NonTerminationProof (⇒, 712 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))
Begin(c(x)) → Wait(Right3(x))
Right1(b(End(x))) → Left(c(End(x)))
Right2(b(a(End(x)))) → Left(c(End(x)))
Right3(c(End(x))) → Left(a(a(b(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(c(x))
b(a(b(x))) → c(x)
c(c(x)) → a(a(b(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 a b c b End → Begin a b c b End

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

(2) NO