YES Problem: b(c(x1)) -> a(x1) b(b(x1)) -> a(c(x1)) a(x1) -> c(b(x1)) c(c(c(x1))) -> b(x1) Proof: DP Processor: DPs: b#(c(x1)) -> a#(x1) b#(b(x1)) -> c#(x1) b#(b(x1)) -> a#(c(x1)) a#(x1) -> b#(x1) a#(x1) -> c#(b(x1)) c#(c(c(x1))) -> b#(x1) TRS: b(c(x1)) -> a(x1) b(b(x1)) -> a(c(x1)) a(x1) -> c(b(x1)) c(c(c(x1))) -> b(x1) TDG Processor: DPs: b#(c(x1)) -> a#(x1) b#(b(x1)) -> c#(x1) b#(b(x1)) -> a#(c(x1)) a#(x1) -> b#(x1) a#(x1) -> c#(b(x1)) c#(c(c(x1))) -> b#(x1) TRS: b(c(x1)) -> a(x1) b(b(x1)) -> a(c(x1)) a(x1) -> c(b(x1)) c(c(c(x1))) -> b(x1) graph: c#(c(c(x1))) -> b#(x1) -> b#(b(x1)) -> a#(c(x1)) c#(c(c(x1))) -> b#(x1) -> b#(b(x1)) -> c#(x1) c#(c(c(x1))) -> b#(x1) -> b#(c(x1)) -> a#(x1) a#(x1) -> c#(b(x1)) -> c#(c(c(x1))) -> b#(x1) a#(x1) -> b#(x1) -> b#(b(x1)) -> a#(c(x1)) a#(x1) -> b#(x1) -> b#(b(x1)) -> c#(x1) a#(x1) -> b#(x1) -> b#(c(x1)) -> a#(x1) b#(b(x1)) -> c#(x1) -> c#(c(c(x1))) -> b#(x1) b#(b(x1)) -> a#(c(x1)) -> a#(x1) -> c#(b(x1)) b#(b(x1)) -> a#(c(x1)) -> a#(x1) -> b#(x1) b#(c(x1)) -> a#(x1) -> a#(x1) -> c#(b(x1)) b#(c(x1)) -> a#(x1) -> a#(x1) -> b#(x1) Matrix Interpretation Processor: dim=1 interpretation: [c#](x0) = x0 + 4, [a#](x0) = x0 + 23, [b#](x0) = x0 + 18, [a](x0) = x0 + 24, [b](x0) = x0 + 16, [c](x0) = x0 + 8 orientation: b#(c(x1)) = x1 + 26 >= x1 + 23 = a#(x1) b#(b(x1)) = x1 + 34 >= x1 + 4 = c#(x1) b#(b(x1)) = x1 + 34 >= x1 + 31 = a#(c(x1)) a#(x1) = x1 + 23 >= x1 + 18 = b#(x1) a#(x1) = x1 + 23 >= x1 + 20 = c#(b(x1)) c#(c(c(x1))) = x1 + 20 >= x1 + 18 = b#(x1) b(c(x1)) = x1 + 24 >= x1 + 24 = a(x1) b(b(x1)) = x1 + 32 >= x1 + 32 = a(c(x1)) a(x1) = x1 + 24 >= x1 + 24 = c(b(x1)) c(c(c(x1))) = x1 + 24 >= x1 + 16 = b(x1) problem: DPs: TRS: b(c(x1)) -> a(x1) b(b(x1)) -> a(c(x1)) a(x1) -> c(b(x1)) c(c(c(x1))) -> b(x1) Qed