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