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-493.srs

(0) Obligation:

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

a(a(x)) → b(x)
b(a(c(x))) → c(c(a(a(a(a(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:
b a c a a c c a c cc c c c a c c b c c a b a c a a c c a c c a a a a

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

(2) NO