NO Termination w.r.t. Q proof of /home/cern_httpd/provide/research/cycsrs/tpdb/TPDB-d9b80194f163/SRS_Standard/Zantema_04/z022-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))
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(a(b(x)))) → D(b(a(b(c(a(x))))))
L(b(a(x))) → D(a(b(b(x))))
L(b(c(a(x)))) → D(c(a(b(x))))
Ya(D(x)) → D(a(x))
Yb(D(x)) → D(b(x))
Yc(D(x)) → D(c(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:
B c a b EB c a b E

B c a b EB c a b E
by OverlapClosure OC 3
B c a b ER D c a b E
by OverlapClosure OC 3
B c a b ER L b c a E
by OverlapClosure OC 2
B c a b ER L b c Xa E
by OverlapClosure OC 3
B c a b ER L b Xa c E
by OverlapClosure OC 2
B c a bR L b Xa Xc
by OverlapClosure OC 3
B c a bR L Xa b Xc
by OverlapClosure OC 2
B c aR L Xa Xc
by OverlapClosure OC 3
B c aW V Xa Xc
by OverlapClosure OC 3
B c aW M V a Xc
by OverlapClosure OC 2
B cW M V Xc
by OverlapClosure OC 2
BW M M V
by original rule (OC 1)
M V cV Xc
by original rule (OC 1)
Xc aa Xc
by original rule (OC 1)
M V aV Xa
by original rule (OC 1)
W VR L
by original rule (OC 1)
Xc bb Xc
by original rule (OC 1)
Xa bb Xa
by original rule (OC 1)
Xc Ec E
by original rule (OC 1)
Xa cc Xa
by original rule (OC 1)
Xa Ea E
by original rule (OC 1)
L b c aD c a b
by original rule (OC 1)
R DB
by original rule (OC 1)

(2) NO