YES Problem: a(b(x1)) -> x1 a(c(x1)) -> c(b(b(c(a(a(x1)))))) b(c(x1)) -> x1 Proof: String Reversal Processor: b(a(x1)) -> x1 c(a(x1)) -> a(a(c(b(b(c(x1)))))) c(b(x1)) -> x1 DP Processor: DPs: c#(a(x1)) -> c#(x1) c#(a(x1)) -> b#(c(x1)) c#(a(x1)) -> b#(b(c(x1))) c#(a(x1)) -> c#(b(b(c(x1)))) TRS: b(a(x1)) -> x1 c(a(x1)) -> a(a(c(b(b(c(x1)))))) c(b(x1)) -> x1 TDG Processor: DPs: c#(a(x1)) -> c#(x1) c#(a(x1)) -> b#(c(x1)) c#(a(x1)) -> b#(b(c(x1))) c#(a(x1)) -> c#(b(b(c(x1)))) TRS: b(a(x1)) -> x1 c(a(x1)) -> a(a(c(b(b(c(x1)))))) c(b(x1)) -> x1 graph: c#(a(x1)) -> c#(b(b(c(x1)))) -> c#(a(x1)) -> c#(b(b(c(x1)))) c#(a(x1)) -> c#(b(b(c(x1)))) -> c#(a(x1)) -> b#(b(c(x1))) c#(a(x1)) -> c#(b(b(c(x1)))) -> c#(a(x1)) -> b#(c(x1)) c#(a(x1)) -> c#(b(b(c(x1)))) -> c#(a(x1)) -> c#(x1) c#(a(x1)) -> c#(x1) -> c#(a(x1)) -> c#(b(b(c(x1)))) c#(a(x1)) -> c#(x1) -> c#(a(x1)) -> b#(b(c(x1))) c#(a(x1)) -> c#(x1) -> c#(a(x1)) -> b#(c(x1)) c#(a(x1)) -> c#(x1) -> c#(a(x1)) -> c#(x1) SCC Processor: #sccs: 1 #rules: 2 #arcs: 8/16 DPs: c#(a(x1)) -> c#(b(b(c(x1)))) c#(a(x1)) -> c#(x1) TRS: b(a(x1)) -> x1 c(a(x1)) -> a(a(c(b(b(c(x1)))))) c(b(x1)) -> x1 Arctic Interpretation Processor: dimension: 1 usable rules: b(a(x1)) -> x1 c(a(x1)) -> a(a(c(b(b(c(x1)))))) c(b(x1)) -> x1 interpretation: [c#](x0) = -13x0 + 0, [a](x0) = 1x0 + 15, [b](x0) = -1x0 + 12, [c](x0) = 1x0 + 0 orientation: c#(a(x1)) = -12x1 + 2 >= -14x1 + 0 = c#(b(b(c(x1)))) c#(a(x1)) = -12x1 + 2 >= -13x1 + 0 = c#(x1) b(a(x1)) = x1 + 14 >= x1 = x1 c(a(x1)) = 2x1 + 16 >= 2x1 + 16 = a(a(c(b(b(c(x1)))))) c(b(x1)) = x1 + 13 >= x1 = x1 problem: DPs: TRS: b(a(x1)) -> x1 c(a(x1)) -> a(a(c(b(b(c(x1)))))) c(b(x1)) -> x1 Qed