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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

b c c c → a a
by OverlapClosure OC 2

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

b c c → a
by OverlapClosure OC 2

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

b c →
by OverlapClosure OC 2

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

a b →
by original rule (OC 1)

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

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

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

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

b c c → a
by OverlapClosure OC 2

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

b c →
by OverlapClosure OC 2

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

a b →
by original rule (OC 1)

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

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

b c →
by OverlapClosure OC 2

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

a b →
by original rule (OC 1)

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

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

b c →
by OverlapClosure OC 2

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

a b →
by original rule (OC 1)

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

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

b c →
by OverlapClosure OC 2

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

a b →
by original rule (OC 1)

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

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

(2) NO