MAYBE Problem: a(x1) -> x1 a(a(x1)) -> b(x1) b(x1) -> c(x1) b(c(x1)) -> c(b(a(x1))) c(x1) -> x1 Proof: DP Processor: DPs: a#(a(x1)) -> b#(x1) b#(x1) -> c#(x1) b#(c(x1)) -> a#(x1) b#(c(x1)) -> b#(a(x1)) b#(c(x1)) -> c#(b(a(x1))) TRS: a(x1) -> x1 a(a(x1)) -> b(x1) b(x1) -> c(x1) b(c(x1)) -> c(b(a(x1))) c(x1) -> x1 TDG Processor: DPs: a#(a(x1)) -> b#(x1) b#(x1) -> c#(x1) b#(c(x1)) -> a#(x1) b#(c(x1)) -> b#(a(x1)) b#(c(x1)) -> c#(b(a(x1))) TRS: a(x1) -> x1 a(a(x1)) -> b(x1) b(x1) -> c(x1) b(c(x1)) -> c(b(a(x1))) c(x1) -> x1 graph: b#(c(x1)) -> b#(a(x1)) -> b#(c(x1)) -> c#(b(a(x1))) b#(c(x1)) -> b#(a(x1)) -> b#(c(x1)) -> b#(a(x1)) b#(c(x1)) -> b#(a(x1)) -> b#(c(x1)) -> a#(x1) b#(c(x1)) -> b#(a(x1)) -> b#(x1) -> c#(x1) b#(c(x1)) -> a#(x1) -> a#(a(x1)) -> b#(x1) a#(a(x1)) -> b#(x1) -> b#(c(x1)) -> c#(b(a(x1))) a#(a(x1)) -> b#(x1) -> b#(c(x1)) -> b#(a(x1)) a#(a(x1)) -> b#(x1) -> b#(c(x1)) -> a#(x1) a#(a(x1)) -> b#(x1) -> b#(x1) -> c#(x1) SCC Processor: #sccs: 1 #rules: 3 #arcs: 9/25 DPs: b#(c(x1)) -> b#(a(x1)) b#(c(x1)) -> a#(x1) a#(a(x1)) -> b#(x1) TRS: a(x1) -> x1 a(a(x1)) -> b(x1) b(x1) -> c(x1) b(c(x1)) -> c(b(a(x1))) c(x1) -> x1 Arctic Interpretation Processor: dimension: 2 interpretation: [b#](x0) = [0 2]x0 + [0], [a#](x0) = [2 0]x0 + [-3], [0 -&] [0] [c](x0) = [0 0 ]x0 + [2], [0 1] [0] [b](x0) = [0 1]x0 + [3], [0 1] [3] [a](x0) = [0 0]x0 + [1] orientation: b#(c(x1)) = [2 2]x1 + [4] >= [2 2]x1 + [3] = b#(a(x1)) b#(c(x1)) = [2 2]x1 + [4] >= [2 0]x1 + [-3] = a#(x1) a#(a(x1)) = [2 3]x1 + [5] >= [0 2]x1 + [0] = b#(x1) [0 1] [3] a(x1) = [0 0]x1 + [1] >= x1 = x1 [1 1] [3] [0 1] [0] a(a(x1)) = [0 1]x1 + [3] >= [0 1]x1 + [3] = b(x1) [0 1] [0] [0 -&] [0] b(x1) = [0 1]x1 + [3] >= [0 0 ]x1 + [2] = c(x1) [1 1] [3] [1 1] [3] b(c(x1)) = [1 1]x1 + [3] >= [1 1]x1 + [3] = c(b(a(x1))) [0 -&] [0] c(x1) = [0 0 ]x1 + [2] >= x1 = x1 problem: DPs: b#(c(x1)) -> b#(a(x1)) b#(c(x1)) -> a#(x1) TRS: a(x1) -> x1 a(a(x1)) -> b(x1) b(x1) -> c(x1) b(c(x1)) -> c(b(a(x1))) c(x1) -> x1 Open