(0) Obligation:

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

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

a b b c ba b b c b
by OverlapClosure OC 3
a b b c bb b b c b
by OverlapClosure OC 2
a b b cb b a
by OverlapClosure OC 3
a b b cb c c b a
by OverlapClosure OC 2
a b bb c c b a c
by OverlapClosure OC 3
a b bb c b c b a c
by OverlapClosure OC 3
a b bb c a b c
by OverlapClosure OC 3
a b bb c b b c
by OverlapClosure OC 2
a bb c b a
by original rule (OC 1)
a bb c
by OverlapClosure OC 2
a bb c b
by OverlapClosure OC 2
a bb c b a
by original rule (OC 1)
a
by original rule (OC 1)
b
by OverlapClosure OC 2
ba
by original rule (OC 1)
a
by original rule (OC 1)
ba
by original rule (OC 1)
a bb c b a
by original rule (OC 1)
b
by OverlapClosure OC 2
ba
by original rule (OC 1)
a
by original rule (OC 1)
c c
by original rule (OC 1)
c c
by original rule (OC 1)
a bb c b
by OverlapClosure OC 2
a bb c b a
by original rule (OC 1)
a
by original rule (OC 1)
ba
by original rule (OC 1)

(2) NO