NO Termination w.r.t. Q proof of /home/cern_httpd/provide/research/cycsrs/tpdb/TPDB-d9b80194f163/SRS_Standard/Waldmann_07_size12/size-12-alpha-2-num-3-shift.srs

(0) Obligation:

Q restricted rewrite system:
The TRS R consists of the following rules:

B(x) → W(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(a(x))) → D(x)
L(a(b(x))) → D(x)
L(b(b(a(x)))) → D(a(b(a(b(b(x))))))
Ya(D(x)) → D(a(x))
Yb(D(x)) → D(b(x))
R(D(x)) → B(x)

Q is empty.

(1) NonTerminationProof (COMPLETE transformation)

We used the non-termination processor [OPPELT08] to show that the SRS problem is infinite.

Found the self-embedding DerivationStructure:
W V b b a EW V b b a E

W V b b a EW V b b a E
by OverlapClosure OC 3
W V b b a EW M V b b a E
by OverlapClosure OC 2
W V b b aW M V b b Xa
by OverlapClosure OC 2
W V b b aW M V b Xa b
by OverlapClosure OC 3
W V b b aW M V Xa b b
by OverlapClosure OC 3
W V b b aB a b b
by OverlapClosure OC 3
W V b b aR D a b a b b
by OverlapClosure OC 2
W VR L
by original rule (OC 1)
L b b aD a b a b b
by original rule (OC 1)
R D a bB
by OverlapClosure OC 2
R DW V
by OverlapClosure OC 3
R DW M V
by OverlapClosure OC 2
R DB
by original rule (OC 1)
BW M V
by OverlapClosure OC 3
BW M M V
by original rule (OC 1)
M
by original rule (OC 1)
M
by original rule (OC 1)
W V a bB
by OverlapClosure OC 2
W V a bR D
by OverlapClosure OC 2
W VR L
by original rule (OC 1)
L a bD
by original rule (OC 1)
R DB
by original rule (OC 1)
B aW M V Xa
by OverlapClosure OC 2
BW M M V
by original rule (OC 1)
M V aV Xa
by original rule (OC 1)
Xa bb Xa
by original rule (OC 1)
Xa bb Xa
by original rule (OC 1)
Xa Ea E
by original rule (OC 1)
M
by original rule (OC 1)

(2) NO