NO
0 QTRS
↳1 NonTerminationProof (⇒, 1074 ms)
↳2 NO
B(x) → W(M(M(V(x))))
M(x) → x
M(V(b(x))) → V(Xb(x))
M(V(a(x))) → V(Xa(x))
Xb(b(x)) → b(Xb(x))
Xb(a(x)) → a(Xb(x))
Xa(b(x)) → b(Xa(x))
Xa(a(x)) → a(Xa(x))
Xb(E(x)) → b(E(x))
Xa(E(x)) → a(E(x))
W(V(x)) → R(L(x))
L(b(x)) → Yb(L(x))
L(a(x)) → Ya(L(x))
L(b(a(x))) → D(b(b(x)))
L(b(a(b(x)))) → D(b(a(a(x))))
L(a(a(a(x)))) → D(a(b(b(x))))
Yb(D(x)) → D(b(x))
Ya(D(x)) → D(a(x))
R(D(x)) → B(x)
W V b a b E → W V b a b E
W V b a b E → W M V b a b E
by OverlapClosure OC 2W V b a b → W M V b a Xb
by OverlapClosure OC 2W V b a b → W M V b Xb a
by OverlapClosure OC 3W V b a b → W M V Xb b a
by OverlapClosure OC 3W V b a b → B b b a
by OverlapClosure OC 3W V b a b → R D b a a
by OverlapClosure OC 2W V → R L
by original rule (OC 1)L b a b → D b a a
by original rule (OC 1)R D b a → B b b
by OverlapClosure OC 2R D → W V
by OverlapClosure OC 3R D → W M V
by OverlapClosure OC 2R 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)W V b a → B b b
by OverlapClosure OC 3W V b a → R D b b
by OverlapClosure OC 2W V → R L
by original rule (OC 1)L b a → D b b
by original rule (OC 1)R D → B
by original rule (OC 1)B b → W M V Xb
by OverlapClosure OC 2B → W M M V
by original rule (OC 1)M V b → V Xb
by original rule (OC 1)Xb b → b Xb
by original rule (OC 1)Xb a → a Xb
by original rule (OC 1)Xb E → b E
by original rule (OC 1)
M →
by original rule (OC 1)