(0) Obligation:

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

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

a b c b c cc c c c c c c c c a b c b c c c
by OverlapClosure OC 2
a b c b cc c c c c c c c c a b c b b
by OverlapClosure OC 3
a b c b cc c c c c c a b c c b b
by OverlapClosure OC 3
a b c b cc c c a b c c c b b
by OverlapClosure OC 2
ab
by original rule (OC 1)
b b c b cc c c a b c c c b b
by OverlapClosure OC 2
b b cc c c a a
by OverlapClosure OC 3
b b ca c c c a a
by original rule (OC 1)
a
by original rule (OC 1)
a b cb c c c b b
by OverlapClosure OC 2
ab
by original rule (OC 1)
b b cb c c c b b
by OverlapClosure OC 3
b b cb c c c a b
by OverlapClosure OC 3
b b ca c c c a b
by OverlapClosure OC 2
b b ca c c c a a
by original rule (OC 1)
ab
by original rule (OC 1)
ab
by original rule (OC 1)
ab
by original rule (OC 1)
a b cc c c a b
by OverlapClosure OC 2
ab
by original rule (OC 1)
b b cc c c a b
by OverlapClosure OC 2
b b cc c c a a
by OverlapClosure OC 3
b b ca c c c a a
by original rule (OC 1)
a
by original rule (OC 1)
ab
by original rule (OC 1)
a b cc c c a b
by OverlapClosure OC 2
ab
by original rule (OC 1)
b b cc c c a b
by OverlapClosure OC 2
b b cc c c a a
by OverlapClosure OC 3
b b ca c c c a a
by original rule (OC 1)
a
by original rule (OC 1)
ab
by original rule (OC 1)
b b cb c c c
by OverlapClosure OC 2
b b cb c c c a
by OverlapClosure OC 3
b b ca c c c a
by OverlapClosure OC 2
b b ca c c c a a
by original rule (OC 1)
a
by original rule (OC 1)
ab
by original rule (OC 1)
a
by original rule (OC 1)

(2) NO