YES Problem: c(b(a(X))) -> a(a(b(b(c(c(X)))))) a(X) -> e() b(X) -> e() c(X) -> e() Proof: DP Processor: DPs: c#(b(a(X))) -> c#(X) c#(b(a(X))) -> c#(c(X)) c#(b(a(X))) -> b#(c(c(X))) c#(b(a(X))) -> b#(b(c(c(X)))) c#(b(a(X))) -> a#(b(b(c(c(X))))) c#(b(a(X))) -> a#(a(b(b(c(c(X)))))) TRS: c(b(a(X))) -> a(a(b(b(c(c(X)))))) a(X) -> e() b(X) -> e() c(X) -> e() TDG Processor: DPs: c#(b(a(X))) -> c#(X) c#(b(a(X))) -> c#(c(X)) c#(b(a(X))) -> b#(c(c(X))) c#(b(a(X))) -> b#(b(c(c(X)))) c#(b(a(X))) -> a#(b(b(c(c(X))))) c#(b(a(X))) -> a#(a(b(b(c(c(X)))))) TRS: c(b(a(X))) -> a(a(b(b(c(c(X)))))) a(X) -> e() b(X) -> e() c(X) -> e() graph: c#(b(a(X))) -> c#(c(X)) -> c#(b(a(X))) -> a#(a(b(b(c(c(X)))))) c#(b(a(X))) -> c#(c(X)) -> c#(b(a(X))) -> a#(b(b(c(c(X))))) c#(b(a(X))) -> c#(c(X)) -> c#(b(a(X))) -> b#(b(c(c(X)))) c#(b(a(X))) -> c#(c(X)) -> c#(b(a(X))) -> b#(c(c(X))) c#(b(a(X))) -> c#(c(X)) -> c#(b(a(X))) -> c#(c(X)) c#(b(a(X))) -> c#(c(X)) -> c#(b(a(X))) -> c#(X) c#(b(a(X))) -> c#(X) -> c#(b(a(X))) -> a#(a(b(b(c(c(X)))))) c#(b(a(X))) -> c#(X) -> c#(b(a(X))) -> a#(b(b(c(c(X))))) c#(b(a(X))) -> c#(X) -> c#(b(a(X))) -> b#(b(c(c(X)))) c#(b(a(X))) -> c#(X) -> c#(b(a(X))) -> b#(c(c(X))) c#(b(a(X))) -> c#(X) -> c#(b(a(X))) -> c#(c(X)) c#(b(a(X))) -> c#(X) -> c#(b(a(X))) -> c#(X) SCC Processor: #sccs: 1 #rules: 2 #arcs: 12/36 DPs: c#(b(a(X))) -> c#(c(X)) c#(b(a(X))) -> c#(X) TRS: c(b(a(X))) -> a(a(b(b(c(c(X)))))) a(X) -> e() b(X) -> e() c(X) -> e() EDG Processor: DPs: c#(b(a(X))) -> c#(c(X)) c#(b(a(X))) -> c#(X) TRS: c(b(a(X))) -> a(a(b(b(c(c(X)))))) a(X) -> e() b(X) -> e() c(X) -> e() graph: c#(b(a(X))) -> c#(X) -> c#(b(a(X))) -> c#(X) c#(b(a(X))) -> c#(X) -> c#(b(a(X))) -> c#(c(X)) CDG Processor: DPs: c#(b(a(X))) -> c#(c(X)) c#(b(a(X))) -> c#(X) TRS: c(b(a(X))) -> a(a(b(b(c(c(X)))))) a(X) -> e() b(X) -> e() c(X) -> e() graph: Qed