(0) Obligation:

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

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

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

(2) NO