NO
0 QTRS
↳1 NonTerminationProof (⇒, 996 ms)
↳2 NO
B(x) → W(M(V(x)))
M(x) → x
M(V(a(x))) → V(Xa(x))
M(V(b(x))) → V(Xb(x))
M(V(c(x))) → V(Xc(x))
Xa(a(x)) → a(Xa(x))
Xa(b(x)) → b(Xa(x))
Xa(c(x)) → c(Xa(x))
Xb(a(x)) → a(Xb(x))
Xb(b(x)) → b(Xb(x))
Xb(c(x)) → c(Xb(x))
Xc(a(x)) → a(Xc(x))
Xc(b(x)) → b(Xc(x))
Xc(c(x)) → c(Xc(x))
Xa(E(x)) → a(E(x))
Xb(E(x)) → b(E(x))
Xc(E(x)) → c(E(x))
W(V(x)) → R(L(x))
L(a(x)) → Ya(L(x))
L(b(x)) → Yb(L(x))
L(c(x)) → Yc(L(x))
L(a(x)) → D(x)
L(a(a(x))) → D(b(b(c(x))))
L(b(x)) → D(x)
L(c(b(x))) → D(b(a(c(x))))
Ya(D(x)) → D(a(x))
Yb(D(x)) → D(b(x))
Yc(D(x)) → D(c(x))
R(D(x)) → B(x)
B c b E → B c b E
B c b → B c Xb
by OverlapClosure OC 2B → W V
by OverlapClosure OC 3B → W M V
by original rule (OC 1)M →
by original rule (OC 1)W V c b → B c Xb
by OverlapClosure OC 3W V c b → R D c Xb
by OverlapClosure OC 2W V c b → R D Xb c
by OverlapClosure OC 3W V c b → R L a Xb c
by OverlapClosure OC 3W V c b → R L Xb a c
by OverlapClosure OC 3W V c b → B b a c
by OverlapClosure OC 3W V c b → R D b a c
by OverlapClosure OC 2W V → R L
by original rule (OC 1)L c b → D b a c
by original rule (OC 1)R D → B
by original rule (OC 1)B b → R L Xb
by OverlapClosure OC 3B b → W V Xb
by OverlapClosure OC 2B → W M V
by original rule (OC 1)M V b → V Xb
by original rule (OC 1)W V → R L
by original rule (OC 1)Xb a → a Xb
by original rule (OC 1)L a → D
by original rule (OC 1)Xb c → c Xb
by original rule (OC 1)R D → B
by original rule (OC 1)
Xb E → b E
by original rule (OC 1)