YES Problem: a(a(a(x1))) -> b(b(x1)) b(b(b(x1))) -> c(x1) c(x1) -> d(d(x1)) d(x1) -> a(a(x1)) Proof: DP Processor: DPs: a#(a(a(x1))) -> b#(x1) a#(a(a(x1))) -> b#(b(x1)) b#(b(b(x1))) -> c#(x1) c#(x1) -> d#(x1) c#(x1) -> d#(d(x1)) d#(x1) -> a#(x1) d#(x1) -> a#(a(x1)) TRS: a(a(a(x1))) -> b(b(x1)) b(b(b(x1))) -> c(x1) c(x1) -> d(d(x1)) d(x1) -> a(a(x1)) TDG Processor: DPs: a#(a(a(x1))) -> b#(x1) a#(a(a(x1))) -> b#(b(x1)) b#(b(b(x1))) -> c#(x1) c#(x1) -> d#(x1) c#(x1) -> d#(d(x1)) d#(x1) -> a#(x1) d#(x1) -> a#(a(x1)) TRS: a(a(a(x1))) -> b(b(x1)) b(b(b(x1))) -> c(x1) c(x1) -> d(d(x1)) d(x1) -> a(a(x1)) graph: d#(x1) -> a#(a(x1)) -> a#(a(a(x1))) -> b#(b(x1)) d#(x1) -> a#(a(x1)) -> a#(a(a(x1))) -> b#(x1) d#(x1) -> a#(x1) -> a#(a(a(x1))) -> b#(b(x1)) d#(x1) -> a#(x1) -> a#(a(a(x1))) -> b#(x1) c#(x1) -> d#(d(x1)) -> d#(x1) -> a#(a(x1)) c#(x1) -> d#(d(x1)) -> d#(x1) -> a#(x1) c#(x1) -> d#(x1) -> d#(x1) -> a#(a(x1)) c#(x1) -> d#(x1) -> d#(x1) -> a#(x1) b#(b(b(x1))) -> c#(x1) -> c#(x1) -> d#(d(x1)) b#(b(b(x1))) -> c#(x1) -> c#(x1) -> d#(x1) a#(a(a(x1))) -> b#(b(x1)) -> b#(b(b(x1))) -> c#(x1) a#(a(a(x1))) -> b#(x1) -> b#(b(b(x1))) -> c#(x1) Matrix Interpretation Processor: dim=1 interpretation: [d#](x0) = 4x0 + 9, [c#](x0) = 4x0 + 26, [b#](x0) = 4x0 + 3, [a#](x0) = 4x0, [d](x0) = x0 + 4, [c](x0) = x0 + 9, [b](x0) = x0 + 3, [a](x0) = x0 + 2 orientation: a#(a(a(x1))) = 4x1 + 16 >= 4x1 + 3 = b#(x1) a#(a(a(x1))) = 4x1 + 16 >= 4x1 + 15 = b#(b(x1)) b#(b(b(x1))) = 4x1 + 27 >= 4x1 + 26 = c#(x1) c#(x1) = 4x1 + 26 >= 4x1 + 9 = d#(x1) c#(x1) = 4x1 + 26 >= 4x1 + 25 = d#(d(x1)) d#(x1) = 4x1 + 9 >= 4x1 = a#(x1) d#(x1) = 4x1 + 9 >= 4x1 + 8 = a#(a(x1)) a(a(a(x1))) = x1 + 6 >= x1 + 6 = b(b(x1)) b(b(b(x1))) = x1 + 9 >= x1 + 9 = c(x1) c(x1) = x1 + 9 >= x1 + 8 = d(d(x1)) d(x1) = x1 + 4 >= x1 + 4 = a(a(x1)) problem: DPs: TRS: a(a(a(x1))) -> b(b(x1)) b(b(b(x1))) -> c(x1) c(x1) -> d(d(x1)) d(x1) -> a(a(x1)) Qed