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:

a(x1) → x1
a(x1) → b(x1)
b(a(c(x1))) → c(c(a(b(a(x1)))))
c(x1) → 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:

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

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

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

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

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

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

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

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

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

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

c →
by original rule (OC 1)

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

c →
by original rule (OC 1)

a → b
by original rule (OC 1)

c →
by original rule (OC 1)

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

a →
by original rule (OC 1)

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

(2) NO