(0) Obligation:

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

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

b a aa b a a b
by OverlapClosure OC 3
b a aa b c c a a b
by OverlapClosure OC 2
b aa b c b
by OverlapClosure OC 3
b aa b c a b
by OverlapClosure OC 3
b aa b c a a b
by original rule (OC 1)
a
by original rule (OC 1)
a
by original rule (OC 1)
b ac a a b
by OverlapClosure OC 3
b ab c a a b
by OverlapClosure OC 3
b aa b c a a b
by original rule (OC 1)
a
by original rule (OC 1)
b
by original rule (OC 1)
c c
by original rule (OC 1)

(4) NO