Termination w.r.t. Q of the given QTRS could be disproven:

(0) Obligation:

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

c(b(a(b(a(x1))))) → a(b(a(b(a(b(c(b(c(x1)))))))))

Q is empty.

(1) NonTerminationProof (EQUIVALENT transformation)

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

Found the self-embedding DerivationStructure:

c b a b a b a b a b a b a → a b a b a b c b a b a b a b a b a b a b c b c b a b c b c

c b a b a b a b a b a b a → a b a b a b c b a b a b a b a b a b a b c b c b a b c b c
by OverlapClosure OC 2

c b a b a → a b a b a b c b c
by original rule (OC 1)

c b a b a b a b a → a b a b a b a b a b a b c b c b a b c b c
by OverlapClosure OC 3

c b a b a b a b a → a b a b a b c b a b a b a b c b c
by OverlapClosure OC 2

c b a b a → a b a b a b c b c
by original rule (OC 1)

c b a b a → a b a b a b c b c
by original rule (OC 1)

c b a b a → a b a b a b c b c
by original rule (OC 1)

(2) NO