NO
0 QTRS
↳1 NonTerminationProof (⇒, 1292 ms)
↳2 NO
Begin(b(x)) → Wait(Right1(x))
Begin(c(x)) → Wait(Right2(x))
Right1(a(End(x))) → Left(b(a(c(b(a(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)) → b(a(c(b(a(x)))))
b(x) → x
c(c(x)) → x
Wait Left b a a End → Wait Left b a a End
Wait Left b a a End → Wait Left b a c c a End
by OverlapClosure OC 2Wait Left → Begin
by original rule (OC 1)Begin b a a End → Wait Left b a c c a End
by OverlapClosure OC 3Begin b a a End → Wait Left b a c b c a End
by OverlapClosure OC 2Begin b → Wait Right1
by original rule (OC 1)Right1 a a End → Left b a c b c a End
by OverlapClosure OC 3Right1 a a End → Left a b c a End
by OverlapClosure OC 3Right1 a a End → Aa Left b c a End
by OverlapClosure OC 3Right1 a a End → Aa Left b c b a End
by OverlapClosure OC 2Right1 a → Aa Right1
by original rule (OC 1)Right1 a End → Left b c b a End
by OverlapClosure OC 3Right1 a End → Left b a c b a End
by original rule (OC 1)a →
by original rule (OC 1)b →
by original rule (OC 1)Aa Left → Left a
by original rule (OC 1)a b → b a c b
by OverlapClosure OC 2a b → b a c b a
by original rule (OC 1)a →
by original rule (OC 1)b →
by original rule (OC 1)
c c →
by original rule (OC 1)