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