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