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

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

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

(0) Obligation:

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

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

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

(2) NO