NO Termination w.r.t. Q proof of /home/cern_httpd/provide/research/cycsrs/tpdb/TPDB-d9b80194f163/SRS_Standard/Waldmann_07_size12/size-12-alpha-3-num-488.srs

(0) Obligation:

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

a(a(x)) → b(x)
a(b(x)) → c(a(x))
c(c(x)) → b(a(b(x)))

Q is empty.

(1) NonTerminationProof (COMPLETE transformation)

We used the non-termination processor [OPPELT08] to show that the SRS problem is infinite.

Found the self-embedding DerivationStructure:
a b b b b a b bb a b b b b a b b b a

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

(2) NO