YES Problem: a(a(b(x1))) -> b(b(c(a(a(a(x1)))))) b(c(a(x1))) -> x1 Proof: String Reversal Processor: b(a(a(x1))) -> a(a(a(c(b(b(x1)))))) a(c(b(x1))) -> x1 DP Processor: DPs: b#(a(a(x1))) -> b#(x1) b#(a(a(x1))) -> b#(b(x1)) b#(a(a(x1))) -> a#(c(b(b(x1)))) b#(a(a(x1))) -> a#(a(c(b(b(x1))))) b#(a(a(x1))) -> a#(a(a(c(b(b(x1)))))) TRS: b(a(a(x1))) -> a(a(a(c(b(b(x1)))))) a(c(b(x1))) -> x1 TDG Processor: DPs: b#(a(a(x1))) -> b#(x1) b#(a(a(x1))) -> b#(b(x1)) b#(a(a(x1))) -> a#(c(b(b(x1)))) b#(a(a(x1))) -> a#(a(c(b(b(x1))))) b#(a(a(x1))) -> a#(a(a(c(b(b(x1)))))) TRS: b(a(a(x1))) -> a(a(a(c(b(b(x1)))))) a(c(b(x1))) -> x1 graph: b#(a(a(x1))) -> b#(b(x1)) -> b#(a(a(x1))) -> a#(a(a(c(b(b(x1)))))) b#(a(a(x1))) -> b#(b(x1)) -> b#(a(a(x1))) -> a#(a(c(b(b(x1))))) b#(a(a(x1))) -> b#(b(x1)) -> b#(a(a(x1))) -> a#(c(b(b(x1)))) b#(a(a(x1))) -> b#(b(x1)) -> b#(a(a(x1))) -> b#(b(x1)) b#(a(a(x1))) -> b#(b(x1)) -> b#(a(a(x1))) -> b#(x1) b#(a(a(x1))) -> b#(x1) -> b#(a(a(x1))) -> a#(a(a(c(b(b(x1)))))) b#(a(a(x1))) -> b#(x1) -> b#(a(a(x1))) -> a#(a(c(b(b(x1))))) b#(a(a(x1))) -> b#(x1) -> b#(a(a(x1))) -> a#(c(b(b(x1)))) b#(a(a(x1))) -> b#(x1) -> b#(a(a(x1))) -> b#(b(x1)) b#(a(a(x1))) -> b#(x1) -> b#(a(a(x1))) -> b#(x1) SCC Processor: #sccs: 1 #rules: 2 #arcs: 10/25 DPs: b#(a(a(x1))) -> b#(b(x1)) b#(a(a(x1))) -> b#(x1) TRS: b(a(a(x1))) -> a(a(a(c(b(b(x1)))))) a(c(b(x1))) -> x1 Arctic Interpretation Processor: dimension: 2 usable rules: b(a(a(x1))) -> a(a(a(c(b(b(x1)))))) a(c(b(x1))) -> x1 interpretation: [b#](x0) = [0 0]x0 + [0], [-& -&] [0] [c](x0) = [-& 0 ]x0 + [0], [2 0] [3] [a](x0) = [0 0]x0 + [2], [2 0] [-&] [b](x0) = [0 0]x0 + [1 ] orientation: b#(a(a(x1))) = [4 2]x1 + [5] >= [2 0]x1 + [1] = b#(b(x1)) b#(a(a(x1))) = [4 2]x1 + [5] >= [0 0]x1 + [0] = b#(x1) [6 4] [7] [6 4] [7] b(a(a(x1))) = [4 2]x1 + [5] >= [4 2]x1 + [5] = a(a(a(c(b(b(x1)))))) [0 0] [3] a(c(b(x1))) = [0 0]x1 + [2] >= x1 = x1 problem: DPs: TRS: b(a(a(x1))) -> a(a(a(c(b(b(x1)))))) a(c(b(x1))) -> x1 Qed