NO Problem: a(x1) -> x1 a(b(x1)) -> b(a(c(b(a(x1))))) b(x1) -> x1 c(c(x1)) -> x1 Proof: String Reversal Processor: a(x1) -> x1 b(a(x1)) -> a(b(c(a(b(x1))))) b(x1) -> x1 c(c(x1)) -> x1 DP Processor: DPs: b#(a(x1)) -> b#(x1) b#(a(x1)) -> a#(b(x1)) b#(a(x1)) -> c#(a(b(x1))) b#(a(x1)) -> b#(c(a(b(x1)))) b#(a(x1)) -> a#(b(c(a(b(x1))))) TRS: a(x1) -> x1 b(a(x1)) -> a(b(c(a(b(x1))))) b(x1) -> x1 c(c(x1)) -> x1 TDG Processor: DPs: b#(a(x1)) -> b#(x1) b#(a(x1)) -> a#(b(x1)) b#(a(x1)) -> c#(a(b(x1))) b#(a(x1)) -> b#(c(a(b(x1)))) b#(a(x1)) -> a#(b(c(a(b(x1))))) TRS: a(x1) -> x1 b(a(x1)) -> a(b(c(a(b(x1))))) b(x1) -> x1 c(c(x1)) -> x1 graph: b#(a(x1)) -> b#(c(a(b(x1)))) -> b#(a(x1)) -> a#(b(c(a(b(x1))))) b#(a(x1)) -> b#(c(a(b(x1)))) -> b#(a(x1)) -> b#(c(a(b(x1)))) b#(a(x1)) -> b#(c(a(b(x1)))) -> b#(a(x1)) -> c#(a(b(x1))) b#(a(x1)) -> b#(c(a(b(x1)))) -> b#(a(x1)) -> a#(b(x1)) b#(a(x1)) -> b#(c(a(b(x1)))) -> b#(a(x1)) -> b#(x1) b#(a(x1)) -> b#(x1) -> b#(a(x1)) -> a#(b(c(a(b(x1))))) b#(a(x1)) -> b#(x1) -> b#(a(x1)) -> b#(c(a(b(x1)))) b#(a(x1)) -> b#(x1) -> b#(a(x1)) -> c#(a(b(x1))) b#(a(x1)) -> b#(x1) -> b#(a(x1)) -> a#(b(x1)) b#(a(x1)) -> b#(x1) -> b#(a(x1)) -> b#(x1) SCC Processor: #sccs: 1 #rules: 2 #arcs: 10/25 DPs: b#(a(x1)) -> b#(c(a(b(x1)))) b#(a(x1)) -> b#(x1) TRS: a(x1) -> x1 b(a(x1)) -> a(b(c(a(b(x1))))) b(x1) -> x1 c(c(x1)) -> x1 Loop Processor: loop length: 13 terms: b(c(b(c(a(b(a(b(c(a(b(a(x1)))))))))))) b(c(b(c(a(a(b(c(a(b(b(c(a(b(a(x1))))))))))))))) b(c(c(a(a(b(c(a(b(b(c(a(b(a(x1)))))))))))))) b(a(a(b(c(a(b(b(c(a(b(a(x1)))))))))))) b(a(a(b(c(a(b(c(a(b(a(x1))))))))))) b(a(a(b(c(b(c(a(b(a(x1)))))))))) b(a(a(b(c(b(c(a(a(x1))))))))) b(a(a(b(c(c(a(a(x1)))))))) b(a(a(b(a(a(x1)))))) a(b(c(a(b(a(b(a(a(x1))))))))) a(b(c(b(a(b(a(a(x1)))))))) a(b(c(a(b(c(a(b(b(a(a(x1))))))))))) a(b(c(b(c(a(b(b(a(a(x1)))))))))) context: a([]) substitution: x1 -> x1 Qed