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

Q is empty.

(1) QTRS Reverse (EQUIVALENT transformation)

We applied the QTRS Reverse Processor [REVERSE].

(2) Obligation:

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

a(x) → x
b(a(x)) → a(a(c(a(a(b(x))))))
c(c(x)) → b(x)

Q is empty.

(3) 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 a → a a b a a b

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

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

b a → a a c b
by OverlapClosure OC 3

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

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

a →
by original rule (OC 1)

a →
by original rule (OC 1)

b a → c a a b
by OverlapClosure OC 3

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

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

a →
by original rule (OC 1)

a →
by original rule (OC 1)

c c → b
by original rule (OC 1)

(4) NO