YES Problem: a(b(x1)) -> x1 a(c(x1)) -> c(c(b(a(x1)))) b(c(x1)) -> a(b(x1)) Proof: DP Processor: DPs: a#(c(x1)) -> a#(x1) a#(c(x1)) -> b#(a(x1)) b#(c(x1)) -> b#(x1) b#(c(x1)) -> a#(b(x1)) TRS: a(b(x1)) -> x1 a(c(x1)) -> c(c(b(a(x1)))) b(c(x1)) -> a(b(x1)) TDG Processor: DPs: a#(c(x1)) -> a#(x1) a#(c(x1)) -> b#(a(x1)) b#(c(x1)) -> b#(x1) b#(c(x1)) -> a#(b(x1)) TRS: a(b(x1)) -> x1 a(c(x1)) -> c(c(b(a(x1)))) b(c(x1)) -> a(b(x1)) graph: b#(c(x1)) -> b#(x1) -> b#(c(x1)) -> a#(b(x1)) b#(c(x1)) -> b#(x1) -> b#(c(x1)) -> b#(x1) b#(c(x1)) -> a#(b(x1)) -> a#(c(x1)) -> b#(a(x1)) b#(c(x1)) -> a#(b(x1)) -> a#(c(x1)) -> a#(x1) a#(c(x1)) -> b#(a(x1)) -> b#(c(x1)) -> a#(b(x1)) a#(c(x1)) -> b#(a(x1)) -> b#(c(x1)) -> b#(x1) a#(c(x1)) -> a#(x1) -> a#(c(x1)) -> b#(a(x1)) a#(c(x1)) -> a#(x1) -> a#(c(x1)) -> a#(x1) Arctic Interpretation Processor: dimension: 1 usable rules: a(b(x1)) -> x1 a(c(x1)) -> c(c(b(a(x1)))) b(c(x1)) -> a(b(x1)) interpretation: [b#](x0) = x0 + -16, [a](x0) = 3x0 + -16, [a#](x0) = x0 + 0, [b](x0) = -3x0 + 0, [c](x0) = 3x0 + 9 orientation: a#(c(x1)) = 3x1 + 9 >= x1 + 0 = a#(x1) a#(c(x1)) = 3x1 + 9 >= 3x1 + -16 = b#(a(x1)) b#(c(x1)) = 3x1 + 9 >= x1 + -16 = b#(x1) b#(c(x1)) = 3x1 + 9 >= -3x1 + 0 = a#(b(x1)) a(b(x1)) = x1 + 3 >= x1 = x1 a(c(x1)) = 6x1 + 12 >= 6x1 + 12 = c(c(b(a(x1)))) b(c(x1)) = x1 + 6 >= x1 + 3 = a(b(x1)) problem: DPs: a#(c(x1)) -> b#(a(x1)) TRS: a(b(x1)) -> x1 a(c(x1)) -> c(c(b(a(x1)))) b(c(x1)) -> a(b(x1)) Restore Modifier: DPs: a#(c(x1)) -> b#(a(x1)) TRS: a(b(x1)) -> x1 a(c(x1)) -> c(c(b(a(x1)))) b(c(x1)) -> a(b(x1)) EDG Processor: DPs: a#(c(x1)) -> b#(a(x1)) TRS: a(b(x1)) -> x1 a(c(x1)) -> c(c(b(a(x1)))) b(c(x1)) -> a(b(x1)) graph: SCC Processor: #sccs: 0 #rules: 0 #arcs: 0/1