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