YES Problem: a(x1) -> x1 a(a(b(x1))) -> b(b(a(a(x1)))) b(x1) -> a(c(a(x1))) Proof: String Reversal Processor: a(x1) -> x1 b(a(a(x1))) -> a(a(b(b(x1)))) b(x1) -> a(c(a(x1))) DP Processor: DPs: b#(a(a(x1))) -> b#(x1) b#(a(a(x1))) -> b#(b(x1)) b#(a(a(x1))) -> a#(b(b(x1))) b#(a(a(x1))) -> a#(a(b(b(x1)))) b#(x1) -> a#(x1) b#(x1) -> a#(c(a(x1))) TRS: a(x1) -> x1 b(a(a(x1))) -> a(a(b(b(x1)))) b(x1) -> a(c(a(x1))) TDG Processor: DPs: b#(a(a(x1))) -> b#(x1) b#(a(a(x1))) -> b#(b(x1)) b#(a(a(x1))) -> a#(b(b(x1))) b#(a(a(x1))) -> a#(a(b(b(x1)))) b#(x1) -> a#(x1) b#(x1) -> a#(c(a(x1))) TRS: a(x1) -> x1 b(a(a(x1))) -> a(a(b(b(x1)))) b(x1) -> a(c(a(x1))) graph: b#(a(a(x1))) -> b#(b(x1)) -> b#(x1) -> a#(c(a(x1))) b#(a(a(x1))) -> b#(b(x1)) -> b#(x1) -> a#(x1) b#(a(a(x1))) -> b#(b(x1)) -> b#(a(a(x1))) -> a#(a(b(b(x1)))) b#(a(a(x1))) -> b#(b(x1)) -> b#(a(a(x1))) -> a#(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#(x1) -> a#(c(a(x1))) b#(a(a(x1))) -> b#(x1) -> b#(x1) -> a#(x1) b#(a(a(x1))) -> b#(x1) -> b#(a(a(x1))) -> a#(a(b(b(x1)))) b#(a(a(x1))) -> b#(x1) -> b#(a(a(x1))) -> a#(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: 12/36 DPs: b#(a(a(x1))) -> b#(b(x1)) b#(a(a(x1))) -> b#(x1) TRS: a(x1) -> x1 b(a(a(x1))) -> a(a(b(b(x1)))) b(x1) -> a(c(a(x1))) Arctic Interpretation Processor: dimension: 2 interpretation: [b#](x0) = [0 3]x0 + [0], [0] [c](x0) = [1], [0 0 ] [2] [b](x0) = [-& 0 ]x0 + [2], [0 0] [2] [a](x0) = [1 0]x0 + [0] orientation: b#(a(a(x1))) = [4 4]x1 + [6] >= [0 3]x1 + [5] = b#(b(x1)) b#(a(a(x1))) = [4 4]x1 + [6] >= [0 3]x1 + [0] = b#(x1) [0 0] [2] a(x1) = [1 0]x1 + [0] >= x1 = x1 [1 1] [3] [1 1] [3] b(a(a(x1))) = [1 1]x1 + [3] >= [1 1]x1 + [3] = a(a(b(b(x1)))) [0 0 ] [2] [2] b(x1) = [-& 0 ]x1 + [2] >= [1] = a(c(a(x1))) problem: DPs: TRS: a(x1) -> x1 b(a(a(x1))) -> a(a(b(b(x1)))) b(x1) -> a(c(a(x1))) Qed