/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES Problem 1: (VAR x1) (RULES A(A(A(A(x1)))) -> a(a(a(x1))) A(A(A(b(x1)))) -> a(a(a(C(x1)))) A(C(x1)) -> b(x1) A(a(x1)) -> x1 A(c(c(c(x1)))) -> b(C(C(C(x1)))) B(A(x1)) -> c(x1) B(B(B(B(x1)))) -> b(b(b(x1))) B(B(B(c(x1)))) -> b(b(b(A(x1)))) B(a(a(a(x1)))) -> c(A(A(A(x1)))) B(b(x1)) -> x1 C(B(x1)) -> a(x1) C(C(C(C(x1)))) -> c(c(c(x1))) C(C(C(a(x1)))) -> c(c(c(B(x1)))) C(b(b(b(x1)))) -> a(B(B(B(x1)))) C(c(x1)) -> x1 a(A(x1)) -> x1 a(a(a(a(x1)))) -> A(A(A(x1))) a(b(x1)) -> C(x1) b(B(x1)) -> x1 b(b(b(b(x1)))) -> B(B(B(x1))) b(c(x1)) -> A(x1) c(C(x1)) -> x1 c(a(x1)) -> B(x1) c(c(c(c(x1)))) -> C(C(C(x1))) ) Problem 1: Dependency Pairs Processor: -> Pairs: A#(A(A(A(x1)))) -> A(a(a(x1))) A#(A(A(A(x1)))) -> A(a(x1)) A#(A(A(A(x1)))) -> A(x1) A#(A(A(b(x1)))) -> C#(x1) A#(A(A(b(x1)))) -> A(C(x1)) A#(A(A(b(x1)))) -> A(a(C(x1))) A#(A(A(b(x1)))) -> A(a(a(C(x1)))) A#(C(x1)) -> B(x1) A#(c(c(c(x1)))) -> C#(C(C(x1))) A#(c(c(c(x1)))) -> C#(C(x1)) A#(c(c(c(x1)))) -> C#(x1) A#(c(c(c(x1)))) -> B(C(C(C(x1)))) B#(A(x1)) -> C(x1) B#(B(B(B(x1)))) -> B(b(b(x1))) B#(B(B(B(x1)))) -> B(b(x1)) B#(B(B(B(x1)))) -> B(x1) B#(B(B(c(x1)))) -> A#(x1) B#(B(B(c(x1)))) -> B(A(x1)) B#(B(B(c(x1)))) -> B(b(A(x1))) B#(B(B(c(x1)))) -> B(b(b(A(x1)))) B#(a(a(a(x1)))) -> A#(A(A(x1))) B#(a(a(a(x1)))) -> A#(A(x1)) B#(a(a(a(x1)))) -> A#(x1) B#(a(a(a(x1)))) -> C(A(A(A(x1)))) C#(B(x1)) -> A(x1) C#(C(C(C(x1)))) -> C(c(c(x1))) C#(C(C(C(x1)))) -> C(c(x1)) C#(C(C(C(x1)))) -> C(x1) C#(C(C(a(x1)))) -> B#(x1) C#(C(C(a(x1)))) -> C(B(x1)) C#(C(C(a(x1)))) -> C(c(B(x1))) C#(C(C(a(x1)))) -> C(c(c(B(x1)))) C#(b(b(b(x1)))) -> B#(B(B(x1))) C#(b(b(b(x1)))) -> B#(B(x1)) C#(b(b(b(x1)))) -> B#(x1) C#(b(b(b(x1)))) -> A(B(B(B(x1)))) A(a(a(a(x1)))) -> A#(A(A(x1))) A(a(a(a(x1)))) -> A#(A(x1)) A(a(a(a(x1)))) -> A#(x1) A(b(x1)) -> C#(x1) B(b(b(b(x1)))) -> B#(B(B(x1))) B(b(b(b(x1)))) -> B#(B(x1)) B(b(b(b(x1)))) -> B#(x1) B(c(x1)) -> A#(x1) C(a(x1)) -> B#(x1) C(c(c(c(x1)))) -> C#(C(C(x1))) C(c(c(c(x1)))) -> C#(C(x1)) C(c(c(c(x1)))) -> C#(x1) -> Rules: A(A(A(A(x1)))) -> a(a(a(x1))) A(A(A(b(x1)))) -> a(a(a(C(x1)))) A(C(x1)) -> b(x1) A(a(x1)) -> x1 A(c(c(c(x1)))) -> b(C(C(C(x1)))) B(A(x1)) -> c(x1) B(B(B(B(x1)))) -> b(b(b(x1))) B(B(B(c(x1)))) -> b(b(b(A(x1)))) B(a(a(a(x1)))) -> c(A(A(A(x1)))) B(b(x1)) -> x1 C(B(x1)) -> a(x1) C(C(C(C(x1)))) -> c(c(c(x1))) C(C(C(a(x1)))) -> c(c(c(B(x1)))) C(b(b(b(x1)))) -> a(B(B(B(x1)))) C(c(x1)) -> x1 a(A(x1)) -> x1 a(a(a(a(x1)))) -> A(A(A(x1))) a(b(x1)) -> C(x1) b(B(x1)) -> x1 b(b(b(b(x1)))) -> B(B(B(x1))) b(c(x1)) -> A(x1) c(C(x1)) -> x1 c(a(x1)) -> B(x1) c(c(c(c(x1)))) -> C(C(C(x1))) Problem 1: SCC Processor: -> Pairs: A#(A(A(A(x1)))) -> A(a(a(x1))) A#(A(A(A(x1)))) -> A(a(x1)) A#(A(A(A(x1)))) -> A(x1) A#(A(A(b(x1)))) -> C#(x1) A#(A(A(b(x1)))) -> A(C(x1)) A#(A(A(b(x1)))) -> A(a(C(x1))) A#(A(A(b(x1)))) -> A(a(a(C(x1)))) A#(C(x1)) -> B(x1) A#(c(c(c(x1)))) -> C#(C(C(x1))) A#(c(c(c(x1)))) -> C#(C(x1)) A#(c(c(c(x1)))) -> C#(x1) A#(c(c(c(x1)))) -> B(C(C(C(x1)))) B#(A(x1)) -> C(x1) B#(B(B(B(x1)))) -> B(b(b(x1))) B#(B(B(B(x1)))) -> B(b(x1)) B#(B(B(B(x1)))) -> B(x1) B#(B(B(c(x1)))) -> A#(x1) B#(B(B(c(x1)))) -> B(A(x1)) B#(B(B(c(x1)))) -> B(b(A(x1))) B#(B(B(c(x1)))) -> B(b(b(A(x1)))) B#(a(a(a(x1)))) -> A#(A(A(x1))) B#(a(a(a(x1)))) -> A#(A(x1)) B#(a(a(a(x1)))) -> A#(x1) B#(a(a(a(x1)))) -> C(A(A(A(x1)))) C#(B(x1)) -> A(x1) C#(C(C(C(x1)))) -> C(c(c(x1))) C#(C(C(C(x1)))) -> C(c(x1)) C#(C(C(C(x1)))) -> C(x1) C#(C(C(a(x1)))) -> B#(x1) C#(C(C(a(x1)))) -> C(B(x1)) C#(C(C(a(x1)))) -> C(c(B(x1))) C#(C(C(a(x1)))) -> C(c(c(B(x1)))) C#(b(b(b(x1)))) -> B#(B(B(x1))) C#(b(b(b(x1)))) -> B#(B(x1)) C#(b(b(b(x1)))) -> B#(x1) C#(b(b(b(x1)))) -> A(B(B(B(x1)))) A(a(a(a(x1)))) -> A#(A(A(x1))) A(a(a(a(x1)))) -> A#(A(x1)) A(a(a(a(x1)))) -> A#(x1) A(b(x1)) -> C#(x1) B(b(b(b(x1)))) -> B#(B(B(x1))) B(b(b(b(x1)))) -> B#(B(x1)) B(b(b(b(x1)))) -> B#(x1) B(c(x1)) -> A#(x1) C(a(x1)) -> B#(x1) C(c(c(c(x1)))) -> C#(C(C(x1))) C(c(c(c(x1)))) -> C#(C(x1)) C(c(c(c(x1)))) -> C#(x1) -> Rules: A(A(A(A(x1)))) -> a(a(a(x1))) A(A(A(b(x1)))) -> a(a(a(C(x1)))) A(C(x1)) -> b(x1) A(a(x1)) -> x1 A(c(c(c(x1)))) -> b(C(C(C(x1)))) B(A(x1)) -> c(x1) B(B(B(B(x1)))) -> b(b(b(x1))) B(B(B(c(x1)))) -> b(b(b(A(x1)))) B(a(a(a(x1)))) -> c(A(A(A(x1)))) B(b(x1)) -> x1 C(B(x1)) -> a(x1) C(C(C(C(x1)))) -> c(c(c(x1))) C(C(C(a(x1)))) -> c(c(c(B(x1)))) C(b(b(b(x1)))) -> a(B(B(B(x1)))) C(c(x1)) -> x1 a(A(x1)) -> x1 a(a(a(a(x1)))) -> A(A(A(x1))) a(b(x1)) -> C(x1) b(B(x1)) -> x1 b(b(b(b(x1)))) -> B(B(B(x1))) b(c(x1)) -> A(x1) c(C(x1)) -> x1 c(a(x1)) -> B(x1) c(c(c(c(x1)))) -> C(C(C(x1))) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: A#(A(A(A(x1)))) -> A(a(a(x1))) A#(A(A(A(x1)))) -> A(a(x1)) A#(A(A(A(x1)))) -> A(x1) A#(A(A(b(x1)))) -> C#(x1) A#(A(A(b(x1)))) -> A(C(x1)) A#(A(A(b(x1)))) -> A(a(C(x1))) A#(A(A(b(x1)))) -> A(a(a(C(x1)))) A#(C(x1)) -> B(x1) A#(c(c(c(x1)))) -> C#(C(C(x1))) A#(c(c(c(x1)))) -> C#(C(x1)) A#(c(c(c(x1)))) -> C#(x1) A#(c(c(c(x1)))) -> B(C(C(C(x1)))) B#(A(x1)) -> C(x1) B#(B(B(B(x1)))) -> B(b(b(x1))) B#(B(B(B(x1)))) -> B(b(x1)) B#(B(B(B(x1)))) -> B(x1) B#(B(B(c(x1)))) -> A#(x1) B#(B(B(c(x1)))) -> B(A(x1)) B#(B(B(c(x1)))) -> B(b(A(x1))) B#(B(B(c(x1)))) -> B(b(b(A(x1)))) B#(a(a(a(x1)))) -> A#(A(A(x1))) B#(a(a(a(x1)))) -> A#(A(x1)) B#(a(a(a(x1)))) -> A#(x1) B#(a(a(a(x1)))) -> C(A(A(A(x1)))) C#(B(x1)) -> A(x1) C#(C(C(C(x1)))) -> C(c(c(x1))) C#(C(C(C(x1)))) -> C(c(x1)) C#(C(C(C(x1)))) -> C(x1) C#(C(C(a(x1)))) -> B#(x1) C#(C(C(a(x1)))) -> C(B(x1)) C#(C(C(a(x1)))) -> C(c(B(x1))) C#(C(C(a(x1)))) -> C(c(c(B(x1)))) C#(b(b(b(x1)))) -> B#(B(B(x1))) C#(b(b(b(x1)))) -> B#(B(x1)) C#(b(b(b(x1)))) -> B#(x1) C#(b(b(b(x1)))) -> A(B(B(B(x1)))) A(a(a(a(x1)))) -> A#(A(A(x1))) A(a(a(a(x1)))) -> A#(A(x1)) A(a(a(a(x1)))) -> A#(x1) A(b(x1)) -> C#(x1) B(b(b(b(x1)))) -> B#(B(B(x1))) B(b(b(b(x1)))) -> B#(B(x1)) B(b(b(b(x1)))) -> B#(x1) B(c(x1)) -> A#(x1) C(a(x1)) -> B#(x1) C(c(c(c(x1)))) -> C#(C(C(x1))) C(c(c(c(x1)))) -> C#(C(x1)) C(c(c(c(x1)))) -> C#(x1) ->->-> Rules: A(A(A(A(x1)))) -> a(a(a(x1))) A(A(A(b(x1)))) -> a(a(a(C(x1)))) A(C(x1)) -> b(x1) A(a(x1)) -> x1 A(c(c(c(x1)))) -> b(C(C(C(x1)))) B(A(x1)) -> c(x1) B(B(B(B(x1)))) -> b(b(b(x1))) B(B(B(c(x1)))) -> b(b(b(A(x1)))) B(a(a(a(x1)))) -> c(A(A(A(x1)))) B(b(x1)) -> x1 C(B(x1)) -> a(x1) C(C(C(C(x1)))) -> c(c(c(x1))) C(C(C(a(x1)))) -> c(c(c(B(x1)))) C(b(b(b(x1)))) -> a(B(B(B(x1)))) C(c(x1)) -> x1 a(A(x1)) -> x1 a(a(a(a(x1)))) -> A(A(A(x1))) a(b(x1)) -> C(x1) b(B(x1)) -> x1 b(b(b(b(x1)))) -> B(B(B(x1))) b(c(x1)) -> A(x1) c(C(x1)) -> x1 c(a(x1)) -> B(x1) c(c(c(c(x1)))) -> C(C(C(x1))) Problem 1: Reduction Pair Processor: -> Pairs: A#(A(A(A(x1)))) -> A(a(a(x1))) A#(A(A(A(x1)))) -> A(a(x1)) A#(A(A(A(x1)))) -> A(x1) A#(A(A(b(x1)))) -> C#(x1) A#(A(A(b(x1)))) -> A(C(x1)) A#(A(A(b(x1)))) -> A(a(C(x1))) A#(A(A(b(x1)))) -> A(a(a(C(x1)))) A#(C(x1)) -> B(x1) A#(c(c(c(x1)))) -> C#(C(C(x1))) A#(c(c(c(x1)))) -> C#(C(x1)) A#(c(c(c(x1)))) -> C#(x1) A#(c(c(c(x1)))) -> B(C(C(C(x1)))) B#(A(x1)) -> C(x1) B#(B(B(B(x1)))) -> B(b(b(x1))) B#(B(B(B(x1)))) -> B(b(x1)) B#(B(B(B(x1)))) -> B(x1) B#(B(B(c(x1)))) -> A#(x1) B#(B(B(c(x1)))) -> B(A(x1)) B#(B(B(c(x1)))) -> B(b(A(x1))) B#(B(B(c(x1)))) -> B(b(b(A(x1)))) B#(a(a(a(x1)))) -> A#(A(A(x1))) B#(a(a(a(x1)))) -> A#(A(x1)) B#(a(a(a(x1)))) -> A#(x1) B#(a(a(a(x1)))) -> C(A(A(A(x1)))) C#(B(x1)) -> A(x1) C#(C(C(C(x1)))) -> C(c(c(x1))) C#(C(C(C(x1)))) -> C(c(x1)) C#(C(C(C(x1)))) -> C(x1) C#(C(C(a(x1)))) -> B#(x1) C#(C(C(a(x1)))) -> C(B(x1)) C#(C(C(a(x1)))) -> C(c(B(x1))) C#(C(C(a(x1)))) -> C(c(c(B(x1)))) C#(b(b(b(x1)))) -> B#(B(B(x1))) C#(b(b(b(x1)))) -> B#(B(x1)) C#(b(b(b(x1)))) -> B#(x1) C#(b(b(b(x1)))) -> A(B(B(B(x1)))) A(a(a(a(x1)))) -> A#(A(A(x1))) A(a(a(a(x1)))) -> A#(A(x1)) A(a(a(a(x1)))) -> A#(x1) A(b(x1)) -> C#(x1) B(b(b(b(x1)))) -> B#(B(B(x1))) B(b(b(b(x1)))) -> B#(B(x1)) B(b(b(b(x1)))) -> B#(x1) B(c(x1)) -> A#(x1) C(a(x1)) -> B#(x1) C(c(c(c(x1)))) -> C#(C(C(x1))) C(c(c(c(x1)))) -> C#(C(x1)) C(c(c(c(x1)))) -> C#(x1) -> Rules: A(A(A(A(x1)))) -> a(a(a(x1))) A(A(A(b(x1)))) -> a(a(a(C(x1)))) A(C(x1)) -> b(x1) A(a(x1)) -> x1 A(c(c(c(x1)))) -> b(C(C(C(x1)))) B(A(x1)) -> c(x1) B(B(B(B(x1)))) -> b(b(b(x1))) B(B(B(c(x1)))) -> b(b(b(A(x1)))) B(a(a(a(x1)))) -> c(A(A(A(x1)))) B(b(x1)) -> x1 C(B(x1)) -> a(x1) C(C(C(C(x1)))) -> c(c(c(x1))) C(C(C(a(x1)))) -> c(c(c(B(x1)))) C(b(b(b(x1)))) -> a(B(B(B(x1)))) C(c(x1)) -> x1 a(A(x1)) -> x1 a(a(a(a(x1)))) -> A(A(A(x1))) a(b(x1)) -> C(x1) b(B(x1)) -> x1 b(b(b(b(x1)))) -> B(B(B(x1))) b(c(x1)) -> A(x1) c(C(x1)) -> x1 c(a(x1)) -> B(x1) c(c(c(c(x1)))) -> C(C(C(x1))) -> Usable rules: A(A(A(A(x1)))) -> a(a(a(x1))) A(A(A(b(x1)))) -> a(a(a(C(x1)))) A(C(x1)) -> b(x1) A(a(x1)) -> x1 A(c(c(c(x1)))) -> b(C(C(C(x1)))) B(A(x1)) -> c(x1) B(B(B(B(x1)))) -> b(b(b(x1))) B(B(B(c(x1)))) -> b(b(b(A(x1)))) B(a(a(a(x1)))) -> c(A(A(A(x1)))) B(b(x1)) -> x1 C(B(x1)) -> a(x1) C(C(C(C(x1)))) -> c(c(c(x1))) C(C(C(a(x1)))) -> c(c(c(B(x1)))) C(b(b(b(x1)))) -> a(B(B(B(x1)))) C(c(x1)) -> x1 a(A(x1)) -> x1 a(a(a(a(x1)))) -> A(A(A(x1))) a(b(x1)) -> C(x1) b(B(x1)) -> x1 b(b(b(b(x1)))) -> B(B(B(x1))) b(c(x1)) -> A(x1) c(C(x1)) -> x1 c(a(x1)) -> B(x1) c(c(c(c(x1)))) -> C(C(C(x1))) ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [A](X) = 2.X + 2 [B](X) = 2.X + 2 [C](X) = 2.X + 2 [a](X) = 2.X + 2 [b](X) = 2.X + 2 [c](X) = 2.X + 2 [A#](X) = 2.X + 1 [B#](X) = X + 2 [C#](X) = 2.X + 2 [A](X) = 2.X + 1 [B](X) = X + 2 [C](X) = X + 2 Problem 1: SCC Processor: -> Pairs: A#(A(A(A(x1)))) -> A(a(x1)) A#(A(A(A(x1)))) -> A(x1) A#(A(A(b(x1)))) -> C#(x1) A#(A(A(b(x1)))) -> A(C(x1)) A#(A(A(b(x1)))) -> A(a(C(x1))) A#(A(A(b(x1)))) -> A(a(a(C(x1)))) A#(C(x1)) -> B(x1) A#(c(c(c(x1)))) -> C#(C(C(x1))) A#(c(c(c(x1)))) -> C#(C(x1)) A#(c(c(c(x1)))) -> C#(x1) A#(c(c(c(x1)))) -> B(C(C(C(x1)))) B#(A(x1)) -> C(x1) B#(B(B(B(x1)))) -> B(b(b(x1))) B#(B(B(B(x1)))) -> B(b(x1)) B#(B(B(B(x1)))) -> B(x1) B#(B(B(c(x1)))) -> A#(x1) B#(B(B(c(x1)))) -> B(A(x1)) B#(B(B(c(x1)))) -> B(b(A(x1))) B#(B(B(c(x1)))) -> B(b(b(A(x1)))) B#(a(a(a(x1)))) -> A#(A(A(x1))) B#(a(a(a(x1)))) -> A#(A(x1)) B#(a(a(a(x1)))) -> A#(x1) B#(a(a(a(x1)))) -> C(A(A(A(x1)))) C#(B(x1)) -> A(x1) C#(C(C(C(x1)))) -> C(c(c(x1))) C#(C(C(C(x1)))) -> C(c(x1)) C#(C(C(C(x1)))) -> C(x1) C#(C(C(a(x1)))) -> B#(x1) C#(C(C(a(x1)))) -> C(B(x1)) C#(C(C(a(x1)))) -> C(c(B(x1))) C#(C(C(a(x1)))) -> C(c(c(B(x1)))) C#(b(b(b(x1)))) -> B#(B(B(x1))) C#(b(b(b(x1)))) -> B#(B(x1)) C#(b(b(b(x1)))) -> B#(x1) C#(b(b(b(x1)))) -> A(B(B(B(x1)))) A(a(a(a(x1)))) -> A#(A(A(x1))) A(a(a(a(x1)))) -> A#(A(x1)) A(a(a(a(x1)))) -> A#(x1) A(b(x1)) -> C#(x1) B(b(b(b(x1)))) -> B#(B(B(x1))) B(b(b(b(x1)))) -> B#(B(x1)) B(b(b(b(x1)))) -> B#(x1) B(c(x1)) -> A#(x1) C(a(x1)) -> B#(x1) C(c(c(c(x1)))) -> C#(C(C(x1))) C(c(c(c(x1)))) -> C#(C(x1)) C(c(c(c(x1)))) -> C#(x1) -> Rules: A(A(A(A(x1)))) -> a(a(a(x1))) A(A(A(b(x1)))) -> a(a(a(C(x1)))) A(C(x1)) -> b(x1) A(a(x1)) -> x1 A(c(c(c(x1)))) -> b(C(C(C(x1)))) B(A(x1)) -> c(x1) B(B(B(B(x1)))) -> b(b(b(x1))) B(B(B(c(x1)))) -> b(b(b(A(x1)))) B(a(a(a(x1)))) -> c(A(A(A(x1)))) B(b(x1)) -> x1 C(B(x1)) -> a(x1) C(C(C(C(x1)))) -> c(c(c(x1))) C(C(C(a(x1)))) -> c(c(c(B(x1)))) C(b(b(b(x1)))) -> a(B(B(B(x1)))) C(c(x1)) -> x1 a(A(x1)) -> x1 a(a(a(a(x1)))) -> A(A(A(x1))) a(b(x1)) -> C(x1) b(B(x1)) -> x1 b(b(b(b(x1)))) -> B(B(B(x1))) b(c(x1)) -> A(x1) c(C(x1)) -> x1 c(a(x1)) -> B(x1) c(c(c(c(x1)))) -> C(C(C(x1))) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: A#(A(A(A(x1)))) -> A(a(x1)) A#(A(A(A(x1)))) -> A(x1) A#(A(A(b(x1)))) -> C#(x1) A#(A(A(b(x1)))) -> A(C(x1)) A#(A(A(b(x1)))) -> A(a(C(x1))) A#(A(A(b(x1)))) -> A(a(a(C(x1)))) A#(C(x1)) -> B(x1) A#(c(c(c(x1)))) -> C#(C(C(x1))) A#(c(c(c(x1)))) -> C#(C(x1)) A#(c(c(c(x1)))) -> C#(x1) A#(c(c(c(x1)))) -> B(C(C(C(x1)))) B#(A(x1)) -> C(x1) B#(B(B(B(x1)))) -> B(b(b(x1))) B#(B(B(B(x1)))) -> B(b(x1)) B#(B(B(B(x1)))) -> B(x1) B#(B(B(c(x1)))) -> A#(x1) B#(B(B(c(x1)))) -> B(A(x1)) B#(B(B(c(x1)))) -> B(b(A(x1))) B#(B(B(c(x1)))) -> B(b(b(A(x1)))) B#(a(a(a(x1)))) -> A#(A(A(x1))) B#(a(a(a(x1)))) -> A#(A(x1)) B#(a(a(a(x1)))) -> A#(x1) B#(a(a(a(x1)))) -> C(A(A(A(x1)))) C#(B(x1)) -> A(x1) C#(C(C(C(x1)))) -> C(c(c(x1))) C#(C(C(C(x1)))) -> C(c(x1)) C#(C(C(C(x1)))) -> C(x1) C#(C(C(a(x1)))) -> B#(x1) C#(C(C(a(x1)))) -> C(B(x1)) C#(C(C(a(x1)))) -> C(c(B(x1))) C#(C(C(a(x1)))) -> C(c(c(B(x1)))) C#(b(b(b(x1)))) -> B#(B(B(x1))) C#(b(b(b(x1)))) -> B#(B(x1)) C#(b(b(b(x1)))) -> B#(x1) C#(b(b(b(x1)))) -> A(B(B(B(x1)))) A(a(a(a(x1)))) -> A#(A(A(x1))) A(a(a(a(x1)))) -> A#(A(x1)) A(a(a(a(x1)))) -> A#(x1) A(b(x1)) -> C#(x1) B(b(b(b(x1)))) -> B#(B(B(x1))) B(b(b(b(x1)))) -> B#(B(x1)) B(b(b(b(x1)))) -> B#(x1) B(c(x1)) -> A#(x1) C(a(x1)) -> B#(x1) C(c(c(c(x1)))) -> C#(C(C(x1))) C(c(c(c(x1)))) -> C#(C(x1)) C(c(c(c(x1)))) -> C#(x1) ->->-> Rules: A(A(A(A(x1)))) -> a(a(a(x1))) A(A(A(b(x1)))) -> a(a(a(C(x1)))) A(C(x1)) -> b(x1) A(a(x1)) -> x1 A(c(c(c(x1)))) -> b(C(C(C(x1)))) B(A(x1)) -> c(x1) B(B(B(B(x1)))) -> b(b(b(x1))) B(B(B(c(x1)))) -> b(b(b(A(x1)))) B(a(a(a(x1)))) -> c(A(A(A(x1)))) B(b(x1)) -> x1 C(B(x1)) -> a(x1) C(C(C(C(x1)))) -> c(c(c(x1))) C(C(C(a(x1)))) -> c(c(c(B(x1)))) C(b(b(b(x1)))) -> a(B(B(B(x1)))) C(c(x1)) -> x1 a(A(x1)) -> x1 a(a(a(a(x1)))) -> A(A(A(x1))) a(b(x1)) -> C(x1) b(B(x1)) -> x1 b(b(b(b(x1)))) -> B(B(B(x1))) b(c(x1)) -> A(x1) c(C(x1)) -> x1 c(a(x1)) -> B(x1) c(c(c(c(x1)))) -> C(C(C(x1))) Problem 1: Reduction Pair Processor: -> Pairs: A#(A(A(A(x1)))) -> A(a(x1)) A#(A(A(A(x1)))) -> A(x1) A#(A(A(b(x1)))) -> C#(x1) A#(A(A(b(x1)))) -> A(C(x1)) A#(A(A(b(x1)))) -> A(a(C(x1))) A#(A(A(b(x1)))) -> A(a(a(C(x1)))) A#(C(x1)) -> B(x1) A#(c(c(c(x1)))) -> C#(C(C(x1))) A#(c(c(c(x1)))) -> C#(C(x1)) A#(c(c(c(x1)))) -> C#(x1) A#(c(c(c(x1)))) -> B(C(C(C(x1)))) B#(A(x1)) -> C(x1) B#(B(B(B(x1)))) -> B(b(b(x1))) B#(B(B(B(x1)))) -> B(b(x1)) B#(B(B(B(x1)))) -> B(x1) B#(B(B(c(x1)))) -> A#(x1) B#(B(B(c(x1)))) -> B(A(x1)) B#(B(B(c(x1)))) -> B(b(A(x1))) B#(B(B(c(x1)))) -> B(b(b(A(x1)))) B#(a(a(a(x1)))) -> A#(A(A(x1))) B#(a(a(a(x1)))) -> A#(A(x1)) B#(a(a(a(x1)))) -> A#(x1) B#(a(a(a(x1)))) -> C(A(A(A(x1)))) C#(B(x1)) -> A(x1) C#(C(C(C(x1)))) -> C(c(c(x1))) C#(C(C(C(x1)))) -> C(c(x1)) C#(C(C(C(x1)))) -> C(x1) C#(C(C(a(x1)))) -> B#(x1) C#(C(C(a(x1)))) -> C(B(x1)) C#(C(C(a(x1)))) -> C(c(B(x1))) C#(C(C(a(x1)))) -> C(c(c(B(x1)))) C#(b(b(b(x1)))) -> B#(B(B(x1))) C#(b(b(b(x1)))) -> B#(B(x1)) C#(b(b(b(x1)))) -> B#(x1) C#(b(b(b(x1)))) -> A(B(B(B(x1)))) A(a(a(a(x1)))) -> A#(A(A(x1))) A(a(a(a(x1)))) -> A#(A(x1)) A(a(a(a(x1)))) -> A#(x1) A(b(x1)) -> C#(x1) B(b(b(b(x1)))) -> B#(B(B(x1))) B(b(b(b(x1)))) -> B#(B(x1)) B(b(b(b(x1)))) -> B#(x1) B(c(x1)) -> A#(x1) C(a(x1)) -> B#(x1) C(c(c(c(x1)))) -> C#(C(C(x1))) C(c(c(c(x1)))) -> C#(C(x1)) C(c(c(c(x1)))) -> C#(x1) -> Rules: A(A(A(A(x1)))) -> a(a(a(x1))) A(A(A(b(x1)))) -> a(a(a(C(x1)))) A(C(x1)) -> b(x1) A(a(x1)) -> x1 A(c(c(c(x1)))) -> b(C(C(C(x1)))) B(A(x1)) -> c(x1) B(B(B(B(x1)))) -> b(b(b(x1))) B(B(B(c(x1)))) -> b(b(b(A(x1)))) B(a(a(a(x1)))) -> c(A(A(A(x1)))) B(b(x1)) -> x1 C(B(x1)) -> a(x1) C(C(C(C(x1)))) -> c(c(c(x1))) C(C(C(a(x1)))) -> c(c(c(B(x1)))) C(b(b(b(x1)))) -> a(B(B(B(x1)))) C(c(x1)) -> x1 a(A(x1)) -> x1 a(a(a(a(x1)))) -> A(A(A(x1))) a(b(x1)) -> C(x1) b(B(x1)) -> x1 b(b(b(b(x1)))) -> B(B(B(x1))) b(c(x1)) -> A(x1) c(C(x1)) -> x1 c(a(x1)) -> B(x1) c(c(c(c(x1)))) -> C(C(C(x1))) -> Usable rules: A(A(A(A(x1)))) -> a(a(a(x1))) A(A(A(b(x1)))) -> a(a(a(C(x1)))) A(C(x1)) -> b(x1) A(a(x1)) -> x1 A(c(c(c(x1)))) -> b(C(C(C(x1)))) B(A(x1)) -> c(x1) B(B(B(B(x1)))) -> b(b(b(x1))) B(B(B(c(x1)))) -> b(b(b(A(x1)))) B(a(a(a(x1)))) -> c(A(A(A(x1)))) B(b(x1)) -> x1 C(B(x1)) -> a(x1) C(C(C(C(x1)))) -> c(c(c(x1))) C(C(C(a(x1)))) -> c(c(c(B(x1)))) C(b(b(b(x1)))) -> a(B(B(B(x1)))) C(c(x1)) -> x1 a(A(x1)) -> x1 a(a(a(a(x1)))) -> A(A(A(x1))) a(b(x1)) -> C(x1) b(B(x1)) -> x1 b(b(b(b(x1)))) -> B(B(B(x1))) b(c(x1)) -> A(x1) c(C(x1)) -> x1 c(a(x1)) -> B(x1) c(c(c(c(x1)))) -> C(C(C(x1))) ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [A](X) = 2.X + 2 [B](X) = 2.X + 2 [C](X) = 2.X + 2 [a](X) = 2.X + 2 [b](X) = 2.X + 2 [c](X) = 2.X + 2 [A#](X) = 2.X + 2 [B#](X) = X + 2 [C#](X) = 2.X + 2 [A](X) = 2.X + 2 [B](X) = X + 2 [C](X) = X + 2 Problem 1: SCC Processor: -> Pairs: A#(A(A(A(x1)))) -> A(x1) A#(A(A(b(x1)))) -> C#(x1) A#(A(A(b(x1)))) -> A(C(x1)) A#(A(A(b(x1)))) -> A(a(C(x1))) A#(A(A(b(x1)))) -> A(a(a(C(x1)))) A#(C(x1)) -> B(x1) A#(c(c(c(x1)))) -> C#(C(C(x1))) A#(c(c(c(x1)))) -> C#(C(x1)) A#(c(c(c(x1)))) -> C#(x1) A#(c(c(c(x1)))) -> B(C(C(C(x1)))) B#(A(x1)) -> C(x1) B#(B(B(B(x1)))) -> B(b(b(x1))) B#(B(B(B(x1)))) -> B(b(x1)) B#(B(B(B(x1)))) -> B(x1) B#(B(B(c(x1)))) -> A#(x1) B#(B(B(c(x1)))) -> B(A(x1)) B#(B(B(c(x1)))) -> B(b(A(x1))) B#(B(B(c(x1)))) -> B(b(b(A(x1)))) B#(a(a(a(x1)))) -> A#(A(A(x1))) B#(a(a(a(x1)))) -> A#(A(x1)) B#(a(a(a(x1)))) -> A#(x1) B#(a(a(a(x1)))) -> C(A(A(A(x1)))) C#(B(x1)) -> A(x1) C#(C(C(C(x1)))) -> C(c(c(x1))) C#(C(C(C(x1)))) -> C(c(x1)) C#(C(C(C(x1)))) -> C(x1) C#(C(C(a(x1)))) -> B#(x1) C#(C(C(a(x1)))) -> C(B(x1)) C#(C(C(a(x1)))) -> C(c(B(x1))) C#(C(C(a(x1)))) -> C(c(c(B(x1)))) C#(b(b(b(x1)))) -> B#(B(B(x1))) C#(b(b(b(x1)))) -> B#(B(x1)) C#(b(b(b(x1)))) -> B#(x1) C#(b(b(b(x1)))) -> A(B(B(B(x1)))) A(a(a(a(x1)))) -> A#(A(A(x1))) A(a(a(a(x1)))) -> A#(A(x1)) A(a(a(a(x1)))) -> A#(x1) A(b(x1)) -> C#(x1) B(b(b(b(x1)))) -> B#(B(B(x1))) B(b(b(b(x1)))) -> B#(B(x1)) B(b(b(b(x1)))) -> B#(x1) B(c(x1)) -> A#(x1) C(a(x1)) -> B#(x1) C(c(c(c(x1)))) -> C#(C(C(x1))) C(c(c(c(x1)))) -> C#(C(x1)) C(c(c(c(x1)))) -> C#(x1) -> Rules: A(A(A(A(x1)))) -> a(a(a(x1))) A(A(A(b(x1)))) -> a(a(a(C(x1)))) A(C(x1)) -> b(x1) A(a(x1)) -> x1 A(c(c(c(x1)))) -> b(C(C(C(x1)))) B(A(x1)) -> c(x1) B(B(B(B(x1)))) -> b(b(b(x1))) B(B(B(c(x1)))) -> b(b(b(A(x1)))) B(a(a(a(x1)))) -> c(A(A(A(x1)))) B(b(x1)) -> x1 C(B(x1)) -> a(x1) C(C(C(C(x1)))) -> c(c(c(x1))) C(C(C(a(x1)))) -> c(c(c(B(x1)))) C(b(b(b(x1)))) -> a(B(B(B(x1)))) C(c(x1)) -> x1 a(A(x1)) -> x1 a(a(a(a(x1)))) -> A(A(A(x1))) a(b(x1)) -> C(x1) b(B(x1)) -> x1 b(b(b(b(x1)))) -> B(B(B(x1))) b(c(x1)) -> A(x1) c(C(x1)) -> x1 c(a(x1)) -> B(x1) c(c(c(c(x1)))) -> C(C(C(x1))) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: A#(A(A(A(x1)))) -> A(x1) A#(A(A(b(x1)))) -> C#(x1) A#(A(A(b(x1)))) -> A(C(x1)) A#(A(A(b(x1)))) -> A(a(C(x1))) A#(A(A(b(x1)))) -> A(a(a(C(x1)))) A#(C(x1)) -> B(x1) A#(c(c(c(x1)))) -> C#(C(C(x1))) A#(c(c(c(x1)))) -> C#(C(x1)) A#(c(c(c(x1)))) -> C#(x1) A#(c(c(c(x1)))) -> B(C(C(C(x1)))) B#(A(x1)) -> C(x1) B#(B(B(B(x1)))) -> B(b(b(x1))) B#(B(B(B(x1)))) -> B(b(x1)) B#(B(B(B(x1)))) -> B(x1) B#(B(B(c(x1)))) -> A#(x1) B#(B(B(c(x1)))) -> B(A(x1)) B#(B(B(c(x1)))) -> B(b(A(x1))) B#(B(B(c(x1)))) -> B(b(b(A(x1)))) B#(a(a(a(x1)))) -> A#(A(A(x1))) B#(a(a(a(x1)))) -> A#(A(x1)) B#(a(a(a(x1)))) -> A#(x1) B#(a(a(a(x1)))) -> C(A(A(A(x1)))) C#(B(x1)) -> A(x1) C#(C(C(C(x1)))) -> C(c(c(x1))) C#(C(C(C(x1)))) -> C(c(x1)) C#(C(C(C(x1)))) -> C(x1) C#(C(C(a(x1)))) -> B#(x1) C#(C(C(a(x1)))) -> C(B(x1)) C#(C(C(a(x1)))) -> C(c(B(x1))) C#(C(C(a(x1)))) -> C(c(c(B(x1)))) C#(b(b(b(x1)))) -> B#(B(B(x1))) C#(b(b(b(x1)))) -> B#(B(x1)) C#(b(b(b(x1)))) -> B#(x1) C#(b(b(b(x1)))) -> A(B(B(B(x1)))) A(a(a(a(x1)))) -> A#(A(A(x1))) A(a(a(a(x1)))) -> A#(A(x1)) A(a(a(a(x1)))) -> A#(x1) A(b(x1)) -> C#(x1) B(b(b(b(x1)))) -> B#(B(B(x1))) B(b(b(b(x1)))) -> B#(B(x1)) B(b(b(b(x1)))) -> B#(x1) B(c(x1)) -> A#(x1) C(a(x1)) -> B#(x1) C(c(c(c(x1)))) -> C#(C(C(x1))) C(c(c(c(x1)))) -> C#(C(x1)) C(c(c(c(x1)))) -> C#(x1) ->->-> Rules: A(A(A(A(x1)))) -> a(a(a(x1))) A(A(A(b(x1)))) -> a(a(a(C(x1)))) A(C(x1)) -> b(x1) A(a(x1)) -> x1 A(c(c(c(x1)))) -> b(C(C(C(x1)))) B(A(x1)) -> c(x1) B(B(B(B(x1)))) -> b(b(b(x1))) B(B(B(c(x1)))) -> b(b(b(A(x1)))) B(a(a(a(x1)))) -> c(A(A(A(x1)))) B(b(x1)) -> x1 C(B(x1)) -> a(x1) C(C(C(C(x1)))) -> c(c(c(x1))) C(C(C(a(x1)))) -> c(c(c(B(x1)))) C(b(b(b(x1)))) -> a(B(B(B(x1)))) C(c(x1)) -> x1 a(A(x1)) -> x1 a(a(a(a(x1)))) -> A(A(A(x1))) a(b(x1)) -> C(x1) b(B(x1)) -> x1 b(b(b(b(x1)))) -> B(B(B(x1))) b(c(x1)) -> A(x1) c(C(x1)) -> x1 c(a(x1)) -> B(x1) c(c(c(c(x1)))) -> C(C(C(x1))) Problem 1: Reduction Pair Processor: -> Pairs: A#(A(A(A(x1)))) -> A(x1) A#(A(A(b(x1)))) -> C#(x1) A#(A(A(b(x1)))) -> A(C(x1)) A#(A(A(b(x1)))) -> A(a(C(x1))) A#(A(A(b(x1)))) -> A(a(a(C(x1)))) A#(C(x1)) -> B(x1) A#(c(c(c(x1)))) -> C#(C(C(x1))) A#(c(c(c(x1)))) -> C#(C(x1)) A#(c(c(c(x1)))) -> C#(x1) A#(c(c(c(x1)))) -> B(C(C(C(x1)))) B#(A(x1)) -> C(x1) B#(B(B(B(x1)))) -> B(b(b(x1))) B#(B(B(B(x1)))) -> B(b(x1)) B#(B(B(B(x1)))) -> B(x1) B#(B(B(c(x1)))) -> A#(x1) B#(B(B(c(x1)))) -> B(A(x1)) B#(B(B(c(x1)))) -> B(b(A(x1))) B#(B(B(c(x1)))) -> B(b(b(A(x1)))) B#(a(a(a(x1)))) -> A#(A(A(x1))) B#(a(a(a(x1)))) -> A#(A(x1)) B#(a(a(a(x1)))) -> A#(x1) B#(a(a(a(x1)))) -> C(A(A(A(x1)))) C#(B(x1)) -> A(x1) C#(C(C(C(x1)))) -> C(c(c(x1))) C#(C(C(C(x1)))) -> C(c(x1)) C#(C(C(C(x1)))) -> C(x1) C#(C(C(a(x1)))) -> B#(x1) C#(C(C(a(x1)))) -> C(B(x1)) C#(C(C(a(x1)))) -> C(c(B(x1))) C#(C(C(a(x1)))) -> C(c(c(B(x1)))) C#(b(b(b(x1)))) -> B#(B(B(x1))) C#(b(b(b(x1)))) -> B#(B(x1)) C#(b(b(b(x1)))) -> B#(x1) C#(b(b(b(x1)))) -> A(B(B(B(x1)))) A(a(a(a(x1)))) -> A#(A(A(x1))) A(a(a(a(x1)))) -> A#(A(x1)) A(a(a(a(x1)))) -> A#(x1) A(b(x1)) -> C#(x1) B(b(b(b(x1)))) -> B#(B(B(x1))) B(b(b(b(x1)))) -> B#(B(x1)) B(b(b(b(x1)))) -> B#(x1) B(c(x1)) -> A#(x1) C(a(x1)) -> B#(x1) C(c(c(c(x1)))) -> C#(C(C(x1))) C(c(c(c(x1)))) -> C#(C(x1)) C(c(c(c(x1)))) -> C#(x1) -> Rules: A(A(A(A(x1)))) -> a(a(a(x1))) A(A(A(b(x1)))) -> a(a(a(C(x1)))) A(C(x1)) -> b(x1) A(a(x1)) -> x1 A(c(c(c(x1)))) -> b(C(C(C(x1)))) B(A(x1)) -> c(x1) B(B(B(B(x1)))) -> b(b(b(x1))) B(B(B(c(x1)))) -> b(b(b(A(x1)))) B(a(a(a(x1)))) -> c(A(A(A(x1)))) B(b(x1)) -> x1 C(B(x1)) -> a(x1) C(C(C(C(x1)))) -> c(c(c(x1))) C(C(C(a(x1)))) -> c(c(c(B(x1)))) C(b(b(b(x1)))) -> a(B(B(B(x1)))) C(c(x1)) -> x1 a(A(x1)) -> x1 a(a(a(a(x1)))) -> A(A(A(x1))) a(b(x1)) -> C(x1) b(B(x1)) -> x1 b(b(b(b(x1)))) -> B(B(B(x1))) b(c(x1)) -> A(x1) c(C(x1)) -> x1 c(a(x1)) -> B(x1) c(c(c(c(x1)))) -> C(C(C(x1))) -> Usable rules: A(A(A(A(x1)))) -> a(a(a(x1))) A(A(A(b(x1)))) -> a(a(a(C(x1)))) A(C(x1)) -> b(x1) A(a(x1)) -> x1 A(c(c(c(x1)))) -> b(C(C(C(x1)))) B(A(x1)) -> c(x1) B(B(B(B(x1)))) -> b(b(b(x1))) B(B(B(c(x1)))) -> b(b(b(A(x1)))) B(a(a(a(x1)))) -> c(A(A(A(x1)))) B(b(x1)) -> x1 C(B(x1)) -> a(x1) C(C(C(C(x1)))) -> c(c(c(x1))) C(C(C(a(x1)))) -> c(c(c(B(x1)))) C(b(b(b(x1)))) -> a(B(B(B(x1)))) C(c(x1)) -> x1 a(A(x1)) -> x1 a(a(a(a(x1)))) -> A(A(A(x1))) a(b(x1)) -> C(x1) b(B(x1)) -> x1 b(b(b(b(x1)))) -> B(B(B(x1))) b(c(x1)) -> A(x1) c(C(x1)) -> x1 c(a(x1)) -> B(x1) c(c(c(c(x1)))) -> C(C(C(x1))) ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [A](X) = 2.X + 2 [B](X) = 2.X + 2 [C](X) = 2.X + 2 [a](X) = 2.X + 2 [b](X) = 2.X + 2 [c](X) = 2.X + 2 [A#](X) = 2.X + 2 [B#](X) = X [C#](X) = 2.X + 2 [A](X) = 2.X + 2 [B](X) = X [C](X) = X Problem 1: SCC Processor: -> Pairs: A#(A(A(b(x1)))) -> C#(x1) A#(A(A(b(x1)))) -> A(C(x1)) A#(A(A(b(x1)))) -> A(a(C(x1))) A#(A(A(b(x1)))) -> A(a(a(C(x1)))) A#(C(x1)) -> B(x1) A#(c(c(c(x1)))) -> C#(C(C(x1))) A#(c(c(c(x1)))) -> C#(C(x1)) A#(c(c(c(x1)))) -> C#(x1) A#(c(c(c(x1)))) -> B(C(C(C(x1)))) B#(A(x1)) -> C(x1) B#(B(B(B(x1)))) -> B(b(b(x1))) B#(B(B(B(x1)))) -> B(b(x1)) B#(B(B(B(x1)))) -> B(x1) B#(B(B(c(x1)))) -> A#(x1) B#(B(B(c(x1)))) -> B(A(x1)) B#(B(B(c(x1)))) -> B(b(A(x1))) B#(B(B(c(x1)))) -> B(b(b(A(x1)))) B#(a(a(a(x1)))) -> A#(A(A(x1))) B#(a(a(a(x1)))) -> A#(A(x1)) B#(a(a(a(x1)))) -> A#(x1) B#(a(a(a(x1)))) -> C(A(A(A(x1)))) C#(B(x1)) -> A(x1) C#(C(C(C(x1)))) -> C(c(c(x1))) C#(C(C(C(x1)))) -> C(c(x1)) C#(C(C(C(x1)))) -> C(x1) C#(C(C(a(x1)))) -> B#(x1) C#(C(C(a(x1)))) -> C(B(x1)) C#(C(C(a(x1)))) -> C(c(B(x1))) C#(C(C(a(x1)))) -> C(c(c(B(x1)))) C#(b(b(b(x1)))) -> B#(B(B(x1))) C#(b(b(b(x1)))) -> B#(B(x1)) C#(b(b(b(x1)))) -> B#(x1) C#(b(b(b(x1)))) -> A(B(B(B(x1)))) A(a(a(a(x1)))) -> A#(A(A(x1))) A(a(a(a(x1)))) -> A#(A(x1)) A(a(a(a(x1)))) -> A#(x1) A(b(x1)) -> C#(x1) B(b(b(b(x1)))) -> B#(B(B(x1))) B(b(b(b(x1)))) -> B#(B(x1)) B(b(b(b(x1)))) -> B#(x1) B(c(x1)) -> A#(x1) C(a(x1)) -> B#(x1) C(c(c(c(x1)))) -> C#(C(C(x1))) C(c(c(c(x1)))) -> C#(C(x1)) C(c(c(c(x1)))) -> C#(x1) -> Rules: A(A(A(A(x1)))) -> a(a(a(x1))) A(A(A(b(x1)))) -> a(a(a(C(x1)))) A(C(x1)) -> b(x1) A(a(x1)) -> x1 A(c(c(c(x1)))) -> b(C(C(C(x1)))) B(A(x1)) -> c(x1) B(B(B(B(x1)))) -> b(b(b(x1))) B(B(B(c(x1)))) -> b(b(b(A(x1)))) B(a(a(a(x1)))) -> c(A(A(A(x1)))) B(b(x1)) -> x1 C(B(x1)) -> a(x1) C(C(C(C(x1)))) -> c(c(c(x1))) C(C(C(a(x1)))) -> c(c(c(B(x1)))) C(b(b(b(x1)))) -> a(B(B(B(x1)))) C(c(x1)) -> x1 a(A(x1)) -> x1 a(a(a(a(x1)))) -> A(A(A(x1))) a(b(x1)) -> C(x1) b(B(x1)) -> x1 b(b(b(b(x1)))) -> B(B(B(x1))) b(c(x1)) -> A(x1) c(C(x1)) -> x1 c(a(x1)) -> B(x1) c(c(c(c(x1)))) -> C(C(C(x1))) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: A#(A(A(b(x1)))) -> C#(x1) A#(A(A(b(x1)))) -> A(C(x1)) A#(A(A(b(x1)))) -> A(a(C(x1))) A#(A(A(b(x1)))) -> A(a(a(C(x1)))) A#(C(x1)) -> B(x1) A#(c(c(c(x1)))) -> C#(C(C(x1))) A#(c(c(c(x1)))) -> C#(C(x1)) A#(c(c(c(x1)))) -> C#(x1) A#(c(c(c(x1)))) -> B(C(C(C(x1)))) B#(A(x1)) -> C(x1) B#(B(B(B(x1)))) -> B(b(b(x1))) B#(B(B(B(x1)))) -> B(b(x1)) B#(B(B(B(x1)))) -> B(x1) B#(B(B(c(x1)))) -> A#(x1) B#(B(B(c(x1)))) -> B(A(x1)) B#(B(B(c(x1)))) -> B(b(A(x1))) B#(B(B(c(x1)))) -> B(b(b(A(x1)))) B#(a(a(a(x1)))) -> A#(A(A(x1))) B#(a(a(a(x1)))) -> A#(A(x1)) B#(a(a(a(x1)))) -> A#(x1) B#(a(a(a(x1)))) -> C(A(A(A(x1)))) C#(B(x1)) -> A(x1) C#(C(C(C(x1)))) -> C(c(c(x1))) C#(C(C(C(x1)))) -> C(c(x1)) C#(C(C(C(x1)))) -> C(x1) C#(C(C(a(x1)))) -> B#(x1) C#(C(C(a(x1)))) -> C(B(x1)) C#(C(C(a(x1)))) -> C(c(B(x1))) C#(C(C(a(x1)))) -> C(c(c(B(x1)))) C#(b(b(b(x1)))) -> B#(B(B(x1))) C#(b(b(b(x1)))) -> B#(B(x1)) C#(b(b(b(x1)))) -> B#(x1) C#(b(b(b(x1)))) -> A(B(B(B(x1)))) A(a(a(a(x1)))) -> A#(A(A(x1))) A(a(a(a(x1)))) -> A#(A(x1)) A(a(a(a(x1)))) -> A#(x1) A(b(x1)) -> C#(x1) B(b(b(b(x1)))) -> B#(B(B(x1))) B(b(b(b(x1)))) -> B#(B(x1)) B(b(b(b(x1)))) -> B#(x1) B(c(x1)) -> A#(x1) C(a(x1)) -> B#(x1) C(c(c(c(x1)))) -> C#(C(C(x1))) C(c(c(c(x1)))) -> C#(C(x1)) C(c(c(c(x1)))) -> C#(x1) ->->-> Rules: A(A(A(A(x1)))) -> a(a(a(x1))) A(A(A(b(x1)))) -> a(a(a(C(x1)))) A(C(x1)) -> b(x1) A(a(x1)) -> x1 A(c(c(c(x1)))) -> b(C(C(C(x1)))) B(A(x1)) -> c(x1) B(B(B(B(x1)))) -> b(b(b(x1))) B(B(B(c(x1)))) -> b(b(b(A(x1)))) B(a(a(a(x1)))) -> c(A(A(A(x1)))) B(b(x1)) -> x1 C(B(x1)) -> a(x1) C(C(C(C(x1)))) -> c(c(c(x1))) C(C(C(a(x1)))) -> c(c(c(B(x1)))) C(b(b(b(x1)))) -> a(B(B(B(x1)))) C(c(x1)) -> x1 a(A(x1)) -> x1 a(a(a(a(x1)))) -> A(A(A(x1))) a(b(x1)) -> C(x1) b(B(x1)) -> x1 b(b(b(b(x1)))) -> B(B(B(x1))) b(c(x1)) -> A(x1) c(C(x1)) -> x1 c(a(x1)) -> B(x1) c(c(c(c(x1)))) -> C(C(C(x1))) Problem 1: Reduction Pair Processor: -> Pairs: A#(A(A(b(x1)))) -> C#(x1) A#(A(A(b(x1)))) -> A(C(x1)) A#(A(A(b(x1)))) -> A(a(C(x1))) A#(A(A(b(x1)))) -> A(a(a(C(x1)))) A#(C(x1)) -> B(x1) A#(c(c(c(x1)))) -> C#(C(C(x1))) A#(c(c(c(x1)))) -> C#(C(x1)) A#(c(c(c(x1)))) -> C#(x1) A#(c(c(c(x1)))) -> B(C(C(C(x1)))) B#(A(x1)) -> C(x1) B#(B(B(B(x1)))) -> B(b(b(x1))) B#(B(B(B(x1)))) -> B(b(x1)) B#(B(B(B(x1)))) -> B(x1) B#(B(B(c(x1)))) -> A#(x1) B#(B(B(c(x1)))) -> B(A(x1)) B#(B(B(c(x1)))) -> B(b(A(x1))) B#(B(B(c(x1)))) -> B(b(b(A(x1)))) B#(a(a(a(x1)))) -> A#(A(A(x1))) B#(a(a(a(x1)))) -> A#(A(x1)) B#(a(a(a(x1)))) -> A#(x1) B#(a(a(a(x1)))) -> C(A(A(A(x1)))) C#(B(x1)) -> A(x1) C#(C(C(C(x1)))) -> C(c(c(x1))) C#(C(C(C(x1)))) -> C(c(x1)) C#(C(C(C(x1)))) -> C(x1) C#(C(C(a(x1)))) -> B#(x1) C#(C(C(a(x1)))) -> C(B(x1)) C#(C(C(a(x1)))) -> C(c(B(x1))) C#(C(C(a(x1)))) -> C(c(c(B(x1)))) C#(b(b(b(x1)))) -> B#(B(B(x1))) C#(b(b(b(x1)))) -> B#(B(x1)) C#(b(b(b(x1)))) -> B#(x1) C#(b(b(b(x1)))) -> A(B(B(B(x1)))) A(a(a(a(x1)))) -> A#(A(A(x1))) A(a(a(a(x1)))) -> A#(A(x1)) A(a(a(a(x1)))) -> A#(x1) A(b(x1)) -> C#(x1) B(b(b(b(x1)))) -> B#(B(B(x1))) B(b(b(b(x1)))) -> B#(B(x1)) B(b(b(b(x1)))) -> B#(x1) B(c(x1)) -> A#(x1) C(a(x1)) -> B#(x1) C(c(c(c(x1)))) -> C#(C(C(x1))) C(c(c(c(x1)))) -> C#(C(x1)) C(c(c(c(x1)))) -> C#(x1) -> Rules: A(A(A(A(x1)))) -> a(a(a(x1))) A(A(A(b(x1)))) -> a(a(a(C(x1)))) A(C(x1)) -> b(x1) A(a(x1)) -> x1 A(c(c(c(x1)))) -> b(C(C(C(x1)))) B(A(x1)) -> c(x1) B(B(B(B(x1)))) -> b(b(b(x1))) B(B(B(c(x1)))) -> b(b(b(A(x1)))) B(a(a(a(x1)))) -> c(A(A(A(x1)))) B(b(x1)) -> x1 C(B(x1)) -> a(x1) C(C(C(C(x1)))) -> c(c(c(x1))) C(C(C(a(x1)))) -> c(c(c(B(x1)))) C(b(b(b(x1)))) -> a(B(B(B(x1)))) C(c(x1)) -> x1 a(A(x1)) -> x1 a(a(a(a(x1)))) -> A(A(A(x1))) a(b(x1)) -> C(x1) b(B(x1)) -> x1 b(b(b(b(x1)))) -> B(B(B(x1))) b(c(x1)) -> A(x1) c(C(x1)) -> x1 c(a(x1)) -> B(x1) c(c(c(c(x1)))) -> C(C(C(x1))) -> Usable rules: A(A(A(A(x1)))) -> a(a(a(x1))) A(A(A(b(x1)))) -> a(a(a(C(x1)))) A(C(x1)) -> b(x1) A(a(x1)) -> x1 A(c(c(c(x1)))) -> b(C(C(C(x1)))) B(A(x1)) -> c(x1) B(B(B(B(x1)))) -> b(b(b(x1))) B(B(B(c(x1)))) -> b(b(b(A(x1)))) B(a(a(a(x1)))) -> c(A(A(A(x1)))) B(b(x1)) -> x1 C(B(x1)) -> a(x1) C(C(C(C(x1)))) -> c(c(c(x1))) C(C(C(a(x1)))) -> c(c(c(B(x1)))) C(b(b(b(x1)))) -> a(B(B(B(x1)))) C(c(x1)) -> x1 a(A(x1)) -> x1 a(a(a(a(x1)))) -> A(A(A(x1))) a(b(x1)) -> C(x1) b(B(x1)) -> x1 b(b(b(b(x1)))) -> B(B(B(x1))) b(c(x1)) -> A(x1) c(C(x1)) -> x1 c(a(x1)) -> B(x1) c(c(c(c(x1)))) -> C(C(C(x1))) ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [A](X) = 2.X + 2 [B](X) = 2.X + 2 [C](X) = 2.X + 2 [a](X) = 2.X + 2 [b](X) = 2.X + 2 [c](X) = 2.X + 2 [A#](X) = 2.X + 2 [B#](X) = 2.X + 2 [C#](X) = 2.X + 2 [A](X) = 2.X + 2 [B](X) = 2.X + 2 [C](X) = 2.X + 2 Problem 1: SCC Processor: -> Pairs: A#(A(A(b(x1)))) -> A(C(x1)) A#(A(A(b(x1)))) -> A(a(C(x1))) A#(A(A(b(x1)))) -> A(a(a(C(x1)))) A#(C(x1)) -> B(x1) A#(c(c(c(x1)))) -> C#(C(C(x1))) A#(c(c(c(x1)))) -> C#(C(x1)) A#(c(c(c(x1)))) -> C#(x1) A#(c(c(c(x1)))) -> B(C(C(C(x1)))) B#(A(x1)) -> C(x1) B#(B(B(B(x1)))) -> B(b(b(x1))) B#(B(B(B(x1)))) -> B(b(x1)) B#(B(B(B(x1)))) -> B(x1) B#(B(B(c(x1)))) -> A#(x1) B#(B(B(c(x1)))) -> B(A(x1)) B#(B(B(c(x1)))) -> B(b(A(x1))) B#(B(B(c(x1)))) -> B(b(b(A(x1)))) B#(a(a(a(x1)))) -> A#(A(A(x1))) B#(a(a(a(x1)))) -> A#(A(x1)) B#(a(a(a(x1)))) -> A#(x1) B#(a(a(a(x1)))) -> C(A(A(A(x1)))) C#(B(x1)) -> A(x1) C#(C(C(C(x1)))) -> C(c(c(x1))) C#(C(C(C(x1)))) -> C(c(x1)) C#(C(C(C(x1)))) -> C(x1) C#(C(C(a(x1)))) -> B#(x1) C#(C(C(a(x1)))) -> C(B(x1)) C#(C(C(a(x1)))) -> C(c(B(x1))) C#(C(C(a(x1)))) -> C(c(c(B(x1)))) C#(b(b(b(x1)))) -> B#(B(B(x1))) C#(b(b(b(x1)))) -> B#(B(x1)) C#(b(b(b(x1)))) -> B#(x1) C#(b(b(b(x1)))) -> A(B(B(B(x1)))) A(a(a(a(x1)))) -> A#(A(A(x1))) A(a(a(a(x1)))) -> A#(A(x1)) A(a(a(a(x1)))) -> A#(x1) A(b(x1)) -> C#(x1) B(b(b(b(x1)))) -> B#(B(B(x1))) B(b(b(b(x1)))) -> B#(B(x1)) B(b(b(b(x1)))) -> B#(x1) B(c(x1)) -> A#(x1) C(a(x1)) -> B#(x1) C(c(c(c(x1)))) -> C#(C(C(x1))) C(c(c(c(x1)))) -> C#(C(x1)) C(c(c(c(x1)))) -> C#(x1) -> Rules: A(A(A(A(x1)))) -> a(a(a(x1))) A(A(A(b(x1)))) -> a(a(a(C(x1)))) A(C(x1)) -> b(x1) A(a(x1)) -> x1 A(c(c(c(x1)))) -> b(C(C(C(x1)))) B(A(x1)) -> c(x1) B(B(B(B(x1)))) -> b(b(b(x1))) B(B(B(c(x1)))) -> b(b(b(A(x1)))) B(a(a(a(x1)))) -> c(A(A(A(x1)))) B(b(x1)) -> x1 C(B(x1)) -> a(x1) C(C(C(C(x1)))) -> c(c(c(x1))) C(C(C(a(x1)))) -> c(c(c(B(x1)))) C(b(b(b(x1)))) -> a(B(B(B(x1)))) C(c(x1)) -> x1 a(A(x1)) -> x1 a(a(a(a(x1)))) -> A(A(A(x1))) a(b(x1)) -> C(x1) b(B(x1)) -> x1 b(b(b(b(x1)))) -> B(B(B(x1))) b(c(x1)) -> A(x1) c(C(x1)) -> x1 c(a(x1)) -> B(x1) c(c(c(c(x1)))) -> C(C(C(x1))) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: A#(A(A(b(x1)))) -> A(C(x1)) A#(A(A(b(x1)))) -> A(a(C(x1))) A#(A(A(b(x1)))) -> A(a(a(C(x1)))) A#(C(x1)) -> B(x1) A#(c(c(c(x1)))) -> C#(C(C(x1))) A#(c(c(c(x1)))) -> C#(C(x1)) A#(c(c(c(x1)))) -> C#(x1) A#(c(c(c(x1)))) -> B(C(C(C(x1)))) B#(A(x1)) -> C(x1) B#(B(B(B(x1)))) -> B(b(b(x1))) B#(B(B(B(x1)))) -> B(b(x1)) B#(B(B(B(x1)))) -> B(x1) B#(B(B(c(x1)))) -> A#(x1) B#(B(B(c(x1)))) -> B(A(x1)) B#(B(B(c(x1)))) -> B(b(A(x1))) B#(B(B(c(x1)))) -> B(b(b(A(x1)))) B#(a(a(a(x1)))) -> A#(A(A(x1))) B#(a(a(a(x1)))) -> A#(A(x1)) B#(a(a(a(x1)))) -> A#(x1) B#(a(a(a(x1)))) -> C(A(A(A(x1)))) C#(B(x1)) -> A(x1) C#(C(C(C(x1)))) -> C(c(c(x1))) C#(C(C(C(x1)))) -> C(c(x1)) C#(C(C(C(x1)))) -> C(x1) C#(C(C(a(x1)))) -> B#(x1) C#(C(C(a(x1)))) -> C(B(x1)) C#(C(C(a(x1)))) -> C(c(B(x1))) C#(C(C(a(x1)))) -> C(c(c(B(x1)))) C#(b(b(b(x1)))) -> B#(B(B(x1))) C#(b(b(b(x1)))) -> B#(B(x1)) C#(b(b(b(x1)))) -> B#(x1) C#(b(b(b(x1)))) -> A(B(B(B(x1)))) A(a(a(a(x1)))) -> A#(A(A(x1))) A(a(a(a(x1)))) -> A#(A(x1)) A(a(a(a(x1)))) -> A#(x1) A(b(x1)) -> C#(x1) B(b(b(b(x1)))) -> B#(B(B(x1))) B(b(b(b(x1)))) -> B#(B(x1)) B(b(b(b(x1)))) -> B#(x1) B(c(x1)) -> A#(x1) C(a(x1)) -> B#(x1) C(c(c(c(x1)))) -> C#(C(C(x1))) C(c(c(c(x1)))) -> C#(C(x1)) C(c(c(c(x1)))) -> C#(x1) ->->-> Rules: A(A(A(A(x1)))) -> a(a(a(x1))) A(A(A(b(x1)))) -> a(a(a(C(x1)))) A(C(x1)) -> b(x1) A(a(x1)) -> x1 A(c(c(c(x1)))) -> b(C(C(C(x1)))) B(A(x1)) -> c(x1) B(B(B(B(x1)))) -> b(b(b(x1))) B(B(B(c(x1)))) -> b(b(b(A(x1)))) B(a(a(a(x1)))) -> c(A(A(A(x1)))) B(b(x1)) -> x1 C(B(x1)) -> a(x1) C(C(C(C(x1)))) -> c(c(c(x1))) C(C(C(a(x1)))) -> c(c(c(B(x1)))) C(b(b(b(x1)))) -> a(B(B(B(x1)))) C(c(x1)) -> x1 a(A(x1)) -> x1 a(a(a(a(x1)))) -> A(A(A(x1))) a(b(x1)) -> C(x1) b(B(x1)) -> x1 b(b(b(b(x1)))) -> B(B(B(x1))) b(c(x1)) -> A(x1) c(C(x1)) -> x1 c(a(x1)) -> B(x1) c(c(c(c(x1)))) -> C(C(C(x1))) Problem 1: Reduction Pair Processor: -> Pairs: A#(A(A(b(x1)))) -> A(C(x1)) A#(A(A(b(x1)))) -> A(a(C(x1))) A#(A(A(b(x1)))) -> A(a(a(C(x1)))) A#(C(x1)) -> B(x1) A#(c(c(c(x1)))) -> C#(C(C(x1))) A#(c(c(c(x1)))) -> C#(C(x1)) A#(c(c(c(x1)))) -> C#(x1) A#(c(c(c(x1)))) -> B(C(C(C(x1)))) B#(A(x1)) -> C(x1) B#(B(B(B(x1)))) -> B(b(b(x1))) B#(B(B(B(x1)))) -> B(b(x1)) B#(B(B(B(x1)))) -> B(x1) B#(B(B(c(x1)))) -> A#(x1) B#(B(B(c(x1)))) -> B(A(x1)) B#(B(B(c(x1)))) -> B(b(A(x1))) B#(B(B(c(x1)))) -> B(b(b(A(x1)))) B#(a(a(a(x1)))) -> A#(A(A(x1))) B#(a(a(a(x1)))) -> A#(A(x1)) B#(a(a(a(x1)))) -> A#(x1) B#(a(a(a(x1)))) -> C(A(A(A(x1)))) C#(B(x1)) -> A(x1) C#(C(C(C(x1)))) -> C(c(c(x1))) C#(C(C(C(x1)))) -> C(c(x1)) C#(C(C(C(x1)))) -> C(x1) C#(C(C(a(x1)))) -> B#(x1) C#(C(C(a(x1)))) -> C(B(x1)) C#(C(C(a(x1)))) -> C(c(B(x1))) C#(C(C(a(x1)))) -> C(c(c(B(x1)))) C#(b(b(b(x1)))) -> B#(B(B(x1))) C#(b(b(b(x1)))) -> B#(B(x1)) C#(b(b(b(x1)))) -> B#(x1) C#(b(b(b(x1)))) -> A(B(B(B(x1)))) A(a(a(a(x1)))) -> A#(A(A(x1))) A(a(a(a(x1)))) -> A#(A(x1)) A(a(a(a(x1)))) -> A#(x1) A(b(x1)) -> C#(x1) B(b(b(b(x1)))) -> B#(B(B(x1))) B(b(b(b(x1)))) -> B#(B(x1)) B(b(b(b(x1)))) -> B#(x1) B(c(x1)) -> A#(x1) C(a(x1)) -> B#(x1) C(c(c(c(x1)))) -> C#(C(C(x1))) C(c(c(c(x1)))) -> C#(C(x1)) C(c(c(c(x1)))) -> C#(x1) -> Rules: A(A(A(A(x1)))) -> a(a(a(x1))) A(A(A(b(x1)))) -> a(a(a(C(x1)))) A(C(x1)) -> b(x1) A(a(x1)) -> x1 A(c(c(c(x1)))) -> b(C(C(C(x1)))) B(A(x1)) -> c(x1) B(B(B(B(x1)))) -> b(b(b(x1))) B(B(B(c(x1)))) -> b(b(b(A(x1)))) B(a(a(a(x1)))) -> c(A(A(A(x1)))) B(b(x1)) -> x1 C(B(x1)) -> a(x1) C(C(C(C(x1)))) -> c(c(c(x1))) C(C(C(a(x1)))) -> c(c(c(B(x1)))) C(b(b(b(x1)))) -> a(B(B(B(x1)))) C(c(x1)) -> x1 a(A(x1)) -> x1 a(a(a(a(x1)))) -> A(A(A(x1))) a(b(x1)) -> C(x1) b(B(x1)) -> x1 b(b(b(b(x1)))) -> B(B(B(x1))) b(c(x1)) -> A(x1) c(C(x1)) -> x1 c(a(x1)) -> B(x1) c(c(c(c(x1)))) -> C(C(C(x1))) -> Usable rules: A(A(A(A(x1)))) -> a(a(a(x1))) A(A(A(b(x1)))) -> a(a(a(C(x1)))) A(C(x1)) -> b(x1) A(a(x1)) -> x1 A(c(c(c(x1)))) -> b(C(C(C(x1)))) B(A(x1)) -> c(x1) B(B(B(B(x1)))) -> b(b(b(x1))) B(B(B(c(x1)))) -> b(b(b(A(x1)))) B(a(a(a(x1)))) -> c(A(A(A(x1)))) B(b(x1)) -> x1 C(B(x1)) -> a(x1) C(C(C(C(x1)))) -> c(c(c(x1))) C(C(C(a(x1)))) -> c(c(c(B(x1)))) C(b(b(b(x1)))) -> a(B(B(B(x1)))) C(c(x1)) -> x1 a(A(x1)) -> x1 a(a(a(a(x1)))) -> A(A(A(x1))) a(b(x1)) -> C(x1) b(B(x1)) -> x1 b(b(b(b(x1)))) -> B(B(B(x1))) b(c(x1)) -> A(x1) c(C(x1)) -> x1 c(a(x1)) -> B(x1) c(c(c(c(x1)))) -> C(C(C(x1))) ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [A](X) = 2.X + 2 [B](X) = 2.X + 2 [C](X) = 2.X + 2 [a](X) = 2.X + 2 [b](X) = 2.X + 2 [c](X) = 2.X + 2 [A#](X) = 2.X + 2 [B#](X) = 2.X + 2 [C#](X) = 2.X + 2 [A](X) = 2.X + 2 [B](X) = 2.X + 2 [C](X) = 2.X + 2 Problem 1: SCC Processor: -> Pairs: A#(A(A(b(x1)))) -> A(a(C(x1))) A#(A(A(b(x1)))) -> A(a(a(C(x1)))) A#(C(x1)) -> B(x1) A#(c(c(c(x1)))) -> C#(C(C(x1))) A#(c(c(c(x1)))) -> C#(C(x1)) A#(c(c(c(x1)))) -> C#(x1) A#(c(c(c(x1)))) -> B(C(C(C(x1)))) B#(A(x1)) -> C(x1) B#(B(B(B(x1)))) -> B(b(b(x1))) B#(B(B(B(x1)))) -> B(b(x1)) B#(B(B(B(x1)))) -> B(x1) B#(B(B(c(x1)))) -> A#(x1) B#(B(B(c(x1)))) -> B(A(x1)) B#(B(B(c(x1)))) -> B(b(A(x1))) B#(B(B(c(x1)))) -> B(b(b(A(x1)))) B#(a(a(a(x1)))) -> A#(A(A(x1))) B#(a(a(a(x1)))) -> A#(A(x1)) B#(a(a(a(x1)))) -> A#(x1) B#(a(a(a(x1)))) -> C(A(A(A(x1)))) C#(B(x1)) -> A(x1) C#(C(C(C(x1)))) -> C(c(c(x1))) C#(C(C(C(x1)))) -> C(c(x1)) C#(C(C(C(x1)))) -> C(x1) C#(C(C(a(x1)))) -> B#(x1) C#(C(C(a(x1)))) -> C(B(x1)) C#(C(C(a(x1)))) -> C(c(B(x1))) C#(C(C(a(x1)))) -> C(c(c(B(x1)))) C#(b(b(b(x1)))) -> B#(B(B(x1))) C#(b(b(b(x1)))) -> B#(B(x1)) C#(b(b(b(x1)))) -> B#(x1) C#(b(b(b(x1)))) -> A(B(B(B(x1)))) A(a(a(a(x1)))) -> A#(A(A(x1))) A(a(a(a(x1)))) -> A#(A(x1)) A(a(a(a(x1)))) -> A#(x1) A(b(x1)) -> C#(x1) B(b(b(b(x1)))) -> B#(B(B(x1))) B(b(b(b(x1)))) -> B#(B(x1)) B(b(b(b(x1)))) -> B#(x1) B(c(x1)) -> A#(x1) C(a(x1)) -> B#(x1) C(c(c(c(x1)))) -> C#(C(C(x1))) C(c(c(c(x1)))) -> C#(C(x1)) C(c(c(c(x1)))) -> C#(x1) -> Rules: A(A(A(A(x1)))) -> a(a(a(x1))) A(A(A(b(x1)))) -> a(a(a(C(x1)))) A(C(x1)) -> b(x1) A(a(x1)) -> x1 A(c(c(c(x1)))) -> b(C(C(C(x1)))) B(A(x1)) -> c(x1) B(B(B(B(x1)))) -> b(b(b(x1))) B(B(B(c(x1)))) -> b(b(b(A(x1)))) B(a(a(a(x1)))) -> c(A(A(A(x1)))) B(b(x1)) -> x1 C(B(x1)) -> a(x1) C(C(C(C(x1)))) -> c(c(c(x1))) C(C(C(a(x1)))) -> c(c(c(B(x1)))) C(b(b(b(x1)))) -> a(B(B(B(x1)))) C(c(x1)) -> x1 a(A(x1)) -> x1 a(a(a(a(x1)))) -> A(A(A(x1))) a(b(x1)) -> C(x1) b(B(x1)) -> x1 b(b(b(b(x1)))) -> B(B(B(x1))) b(c(x1)) -> A(x1) c(C(x1)) -> x1 c(a(x1)) -> B(x1) c(c(c(c(x1)))) -> C(C(C(x1))) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: A#(A(A(b(x1)))) -> A(a(C(x1))) A#(A(A(b(x1)))) -> A(a(a(C(x1)))) A#(C(x1)) -> B(x1) A#(c(c(c(x1)))) -> C#(C(C(x1))) A#(c(c(c(x1)))) -> C#(C(x1)) A#(c(c(c(x1)))) -> C#(x1) A#(c(c(c(x1)))) -> B(C(C(C(x1)))) B#(A(x1)) -> C(x1) B#(B(B(B(x1)))) -> B(b(b(x1))) B#(B(B(B(x1)))) -> B(b(x1)) B#(B(B(B(x1)))) -> B(x1) B#(B(B(c(x1)))) -> A#(x1) B#(B(B(c(x1)))) -> B(A(x1)) B#(B(B(c(x1)))) -> B(b(A(x1))) B#(B(B(c(x1)))) -> B(b(b(A(x1)))) B#(a(a(a(x1)))) -> A#(A(A(x1))) B#(a(a(a(x1)))) -> A#(A(x1)) B#(a(a(a(x1)))) -> A#(x1) B#(a(a(a(x1)))) -> C(A(A(A(x1)))) C#(B(x1)) -> A(x1) C#(C(C(C(x1)))) -> C(c(c(x1))) C#(C(C(C(x1)))) -> C(c(x1)) C#(C(C(C(x1)))) -> C(x1) C#(C(C(a(x1)))) -> B#(x1) C#(C(C(a(x1)))) -> C(B(x1)) C#(C(C(a(x1)))) -> C(c(B(x1))) C#(C(C(a(x1)))) -> C(c(c(B(x1)))) C#(b(b(b(x1)))) -> B#(B(B(x1))) C#(b(b(b(x1)))) -> B#(B(x1)) C#(b(b(b(x1)))) -> B#(x1) C#(b(b(b(x1)))) -> A(B(B(B(x1)))) A(a(a(a(x1)))) -> A#(A(A(x1))) A(a(a(a(x1)))) -> A#(A(x1)) A(a(a(a(x1)))) -> A#(x1) A(b(x1)) -> C#(x1) B(b(b(b(x1)))) -> B#(B(B(x1))) B(b(b(b(x1)))) -> B#(B(x1)) B(b(b(b(x1)))) -> B#(x1) B(c(x1)) -> A#(x1) C(a(x1)) -> B#(x1) C(c(c(c(x1)))) -> C#(C(C(x1))) C(c(c(c(x1)))) -> C#(C(x1)) C(c(c(c(x1)))) -> C#(x1) ->->-> Rules: A(A(A(A(x1)))) -> a(a(a(x1))) A(A(A(b(x1)))) -> a(a(a(C(x1)))) A(C(x1)) -> b(x1) A(a(x1)) -> x1 A(c(c(c(x1)))) -> b(C(C(C(x1)))) B(A(x1)) -> c(x1) B(B(B(B(x1)))) -> b(b(b(x1))) B(B(B(c(x1)))) -> b(b(b(A(x1)))) B(a(a(a(x1)))) -> c(A(A(A(x1)))) B(b(x1)) -> x1 C(B(x1)) -> a(x1) C(C(C(C(x1)))) -> c(c(c(x1))) C(C(C(a(x1)))) -> c(c(c(B(x1)))) C(b(b(b(x1)))) -> a(B(B(B(x1)))) C(c(x1)) -> x1 a(A(x1)) -> x1 a(a(a(a(x1)))) -> A(A(A(x1))) a(b(x1)) -> C(x1) b(B(x1)) -> x1 b(b(b(b(x1)))) -> B(B(B(x1))) b(c(x1)) -> A(x1) c(C(x1)) -> x1 c(a(x1)) -> B(x1) c(c(c(c(x1)))) -> C(C(C(x1))) Problem 1: Reduction Pair Processor: -> Pairs: A#(A(A(b(x1)))) -> A(a(C(x1))) A#(A(A(b(x1)))) -> A(a(a(C(x1)))) A#(C(x1)) -> B(x1) A#(c(c(c(x1)))) -> C#(C(C(x1))) A#(c(c(c(x1)))) -> C#(C(x1)) A#(c(c(c(x1)))) -> C#(x1) A#(c(c(c(x1)))) -> B(C(C(C(x1)))) B#(A(x1)) -> C(x1) B#(B(B(B(x1)))) -> B(b(b(x1))) B#(B(B(B(x1)))) -> B(b(x1)) B#(B(B(B(x1)))) -> B(x1) B#(B(B(c(x1)))) -> A#(x1) B#(B(B(c(x1)))) -> B(A(x1)) B#(B(B(c(x1)))) -> B(b(A(x1))) B#(B(B(c(x1)))) -> B(b(b(A(x1)))) B#(a(a(a(x1)))) -> A#(A(A(x1))) B#(a(a(a(x1)))) -> A#(A(x1)) B#(a(a(a(x1)))) -> A#(x1) B#(a(a(a(x1)))) -> C(A(A(A(x1)))) C#(B(x1)) -> A(x1) C#(C(C(C(x1)))) -> C(c(c(x1))) C#(C(C(C(x1)))) -> C(c(x1)) C#(C(C(C(x1)))) -> C(x1) C#(C(C(a(x1)))) -> B#(x1) C#(C(C(a(x1)))) -> C(B(x1)) C#(C(C(a(x1)))) -> C(c(B(x1))) C#(C(C(a(x1)))) -> C(c(c(B(x1)))) C#(b(b(b(x1)))) -> B#(B(B(x1))) C#(b(b(b(x1)))) -> B#(B(x1)) C#(b(b(b(x1)))) -> B#(x1) C#(b(b(b(x1)))) -> A(B(B(B(x1)))) A(a(a(a(x1)))) -> A#(A(A(x1))) A(a(a(a(x1)))) -> A#(A(x1)) A(a(a(a(x1)))) -> A#(x1) A(b(x1)) -> C#(x1) B(b(b(b(x1)))) -> B#(B(B(x1))) B(b(b(b(x1)))) -> B#(B(x1)) B(b(b(b(x1)))) -> B#(x1) B(c(x1)) -> A#(x1) C(a(x1)) -> B#(x1) C(c(c(c(x1)))) -> C#(C(C(x1))) C(c(c(c(x1)))) -> C#(C(x1)) C(c(c(c(x1)))) -> C#(x1) -> Rules: A(A(A(A(x1)))) -> a(a(a(x1))) A(A(A(b(x1)))) -> a(a(a(C(x1)))) A(C(x1)) -> b(x1) A(a(x1)) -> x1 A(c(c(c(x1)))) -> b(C(C(C(x1)))) B(A(x1)) -> c(x1) B(B(B(B(x1)))) -> b(b(b(x1))) B(B(B(c(x1)))) -> b(b(b(A(x1)))) B(a(a(a(x1)))) -> c(A(A(A(x1)))) B(b(x1)) -> x1 C(B(x1)) -> a(x1) C(C(C(C(x1)))) -> c(c(c(x1))) C(C(C(a(x1)))) -> c(c(c(B(x1)))) C(b(b(b(x1)))) -> a(B(B(B(x1)))) C(c(x1)) -> x1 a(A(x1)) -> x1 a(a(a(a(x1)))) -> A(A(A(x1))) a(b(x1)) -> C(x1) b(B(x1)) -> x1 b(b(b(b(x1)))) -> B(B(B(x1))) b(c(x1)) -> A(x1) c(C(x1)) -> x1 c(a(x1)) -> B(x1) c(c(c(c(x1)))) -> C(C(C(x1))) -> Usable rules: A(A(A(A(x1)))) -> a(a(a(x1))) A(A(A(b(x1)))) -> a(a(a(C(x1)))) A(C(x1)) -> b(x1) A(a(x1)) -> x1 A(c(c(c(x1)))) -> b(C(C(C(x1)))) B(A(x1)) -> c(x1) B(B(B(B(x1)))) -> b(b(b(x1))) B(B(B(c(x1)))) -> b(b(b(A(x1)))) B(a(a(a(x1)))) -> c(A(A(A(x1)))) B(b(x1)) -> x1 C(B(x1)) -> a(x1) C(C(C(C(x1)))) -> c(c(c(x1))) C(C(C(a(x1)))) -> c(c(c(B(x1)))) C(b(b(b(x1)))) -> a(B(B(B(x1)))) C(c(x1)) -> x1 a(A(x1)) -> x1 a(a(a(a(x1)))) -> A(A(A(x1))) a(b(x1)) -> C(x1) b(B(x1)) -> x1 b(b(b(b(x1)))) -> B(B(B(x1))) b(c(x1)) -> A(x1) c(C(x1)) -> x1 c(a(x1)) -> B(x1) c(c(c(c(x1)))) -> C(C(C(x1))) ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [A](X) = 2.X + 2 [B](X) = 2.X + 2 [C](X) = 2.X + 2 [a](X) = 2.X + 2 [b](X) = 2.X + 2 [c](X) = 2.X + 2 [A#](X) = 2.X + 2 [B#](X) = 2.X + 2 [C#](X) = 2.X + 2 [A](X) = 2.X + 2 [B](X) = 2.X + 2 [C](X) = X + 2 Problem 1: SCC Processor: -> Pairs: A#(A(A(b(x1)))) -> A(a(a(C(x1)))) A#(C(x1)) -> B(x1) A#(c(c(c(x1)))) -> C#(C(C(x1))) A#(c(c(c(x1)))) -> C#(C(x1)) A#(c(c(c(x1)))) -> C#(x1) A#(c(c(c(x1)))) -> B(C(C(C(x1)))) B#(A(x1)) -> C(x1) B#(B(B(B(x1)))) -> B(b(b(x1))) B#(B(B(B(x1)))) -> B(b(x1)) B#(B(B(B(x1)))) -> B(x1) B#(B(B(c(x1)))) -> A#(x1) B#(B(B(c(x1)))) -> B(A(x1)) B#(B(B(c(x1)))) -> B(b(A(x1))) B#(B(B(c(x1)))) -> B(b(b(A(x1)))) B#(a(a(a(x1)))) -> A#(A(A(x1))) B#(a(a(a(x1)))) -> A#(A(x1)) B#(a(a(a(x1)))) -> A#(x1) B#(a(a(a(x1)))) -> C(A(A(A(x1)))) C#(B(x1)) -> A(x1) C#(C(C(C(x1)))) -> C(c(c(x1))) C#(C(C(C(x1)))) -> C(c(x1)) C#(C(C(C(x1)))) -> C(x1) C#(C(C(a(x1)))) -> B#(x1) C#(C(C(a(x1)))) -> C(B(x1)) C#(C(C(a(x1)))) -> C(c(B(x1))) C#(C(C(a(x1)))) -> C(c(c(B(x1)))) C#(b(b(b(x1)))) -> B#(B(B(x1))) C#(b(b(b(x1)))) -> B#(B(x1)) C#(b(b(b(x1)))) -> B#(x1) C#(b(b(b(x1)))) -> A(B(B(B(x1)))) A(a(a(a(x1)))) -> A#(A(A(x1))) A(a(a(a(x1)))) -> A#(A(x1)) A(a(a(a(x1)))) -> A#(x1) A(b(x1)) -> C#(x1) B(b(b(b(x1)))) -> B#(B(B(x1))) B(b(b(b(x1)))) -> B#(B(x1)) B(b(b(b(x1)))) -> B#(x1) B(c(x1)) -> A#(x1) C(a(x1)) -> B#(x1) C(c(c(c(x1)))) -> C#(C(C(x1))) C(c(c(c(x1)))) -> C#(C(x1)) C(c(c(c(x1)))) -> C#(x1) -> Rules: A(A(A(A(x1)))) -> a(a(a(x1))) A(A(A(b(x1)))) -> a(a(a(C(x1)))) A(C(x1)) -> b(x1) A(a(x1)) -> x1 A(c(c(c(x1)))) -> b(C(C(C(x1)))) B(A(x1)) -> c(x1) B(B(B(B(x1)))) -> b(b(b(x1))) B(B(B(c(x1)))) -> b(b(b(A(x1)))) B(a(a(a(x1)))) -> c(A(A(A(x1)))) B(b(x1)) -> x1 C(B(x1)) -> a(x1) C(C(C(C(x1)))) -> c(c(c(x1))) C(C(C(a(x1)))) -> c(c(c(B(x1)))) C(b(b(b(x1)))) -> a(B(B(B(x1)))) C(c(x1)) -> x1 a(A(x1)) -> x1 a(a(a(a(x1)))) -> A(A(A(x1))) a(b(x1)) -> C(x1) b(B(x1)) -> x1 b(b(b(b(x1)))) -> B(B(B(x1))) b(c(x1)) -> A(x1) c(C(x1)) -> x1 c(a(x1)) -> B(x1) c(c(c(c(x1)))) -> C(C(C(x1))) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: A#(A(A(b(x1)))) -> A(a(a(C(x1)))) A#(C(x1)) -> B(x1) A#(c(c(c(x1)))) -> C#(C(C(x1))) A#(c(c(c(x1)))) -> C#(C(x1)) A#(c(c(c(x1)))) -> C#(x1) A#(c(c(c(x1)))) -> B(C(C(C(x1)))) B#(A(x1)) -> C(x1) B#(B(B(B(x1)))) -> B(b(b(x1))) B#(B(B(B(x1)))) -> B(b(x1)) B#(B(B(B(x1)))) -> B(x1) B#(B(B(c(x1)))) -> A#(x1) B#(B(B(c(x1)))) -> B(A(x1)) B#(B(B(c(x1)))) -> B(b(A(x1))) B#(B(B(c(x1)))) -> B(b(b(A(x1)))) B#(a(a(a(x1)))) -> A#(A(A(x1))) B#(a(a(a(x1)))) -> A#(A(x1)) B#(a(a(a(x1)))) -> A#(x1) B#(a(a(a(x1)))) -> C(A(A(A(x1)))) C#(B(x1)) -> A(x1) C#(C(C(C(x1)))) -> C(c(c(x1))) C#(C(C(C(x1)))) -> C(c(x1)) C#(C(C(C(x1)))) -> C(x1) C#(C(C(a(x1)))) -> B#(x1) C#(C(C(a(x1)))) -> C(B(x1)) C#(C(C(a(x1)))) -> C(c(B(x1))) C#(C(C(a(x1)))) -> C(c(c(B(x1)))) C#(b(b(b(x1)))) -> B#(B(B(x1))) C#(b(b(b(x1)))) -> B#(B(x1)) C#(b(b(b(x1)))) -> B#(x1) C#(b(b(b(x1)))) -> A(B(B(B(x1)))) A(a(a(a(x1)))) -> A#(A(A(x1))) A(a(a(a(x1)))) -> A#(A(x1)) A(a(a(a(x1)))) -> A#(x1) A(b(x1)) -> C#(x1) B(b(b(b(x1)))) -> B#(B(B(x1))) B(b(b(b(x1)))) -> B#(B(x1)) B(b(b(b(x1)))) -> B#(x1) B(c(x1)) -> A#(x1) C(a(x1)) -> B#(x1) C(c(c(c(x1)))) -> C#(C(C(x1))) C(c(c(c(x1)))) -> C#(C(x1)) C(c(c(c(x1)))) -> C#(x1) ->->-> Rules: A(A(A(A(x1)))) -> a(a(a(x1))) A(A(A(b(x1)))) -> a(a(a(C(x1)))) A(C(x1)) -> b(x1) A(a(x1)) -> x1 A(c(c(c(x1)))) -> b(C(C(C(x1)))) B(A(x1)) -> c(x1) B(B(B(B(x1)))) -> b(b(b(x1))) B(B(B(c(x1)))) -> b(b(b(A(x1)))) B(a(a(a(x1)))) -> c(A(A(A(x1)))) B(b(x1)) -> x1 C(B(x1)) -> a(x1) C(C(C(C(x1)))) -> c(c(c(x1))) C(C(C(a(x1)))) -> c(c(c(B(x1)))) C(b(b(b(x1)))) -> a(B(B(B(x1)))) C(c(x1)) -> x1 a(A(x1)) -> x1 a(a(a(a(x1)))) -> A(A(A(x1))) a(b(x1)) -> C(x1) b(B(x1)) -> x1 b(b(b(b(x1)))) -> B(B(B(x1))) b(c(x1)) -> A(x1) c(C(x1)) -> x1 c(a(x1)) -> B(x1) c(c(c(c(x1)))) -> C(C(C(x1))) Problem 1: Reduction Pair Processor: -> Pairs: A#(A(A(b(x1)))) -> A(a(a(C(x1)))) A#(C(x1)) -> B(x1) A#(c(c(c(x1)))) -> C#(C(C(x1))) A#(c(c(c(x1)))) -> C#(C(x1)) A#(c(c(c(x1)))) -> C#(x1) A#(c(c(c(x1)))) -> B(C(C(C(x1)))) B#(A(x1)) -> C(x1) B#(B(B(B(x1)))) -> B(b(b(x1))) B#(B(B(B(x1)))) -> B(b(x1)) B#(B(B(B(x1)))) -> B(x1) B#(B(B(c(x1)))) -> A#(x1) B#(B(B(c(x1)))) -> B(A(x1)) B#(B(B(c(x1)))) -> B(b(A(x1))) B#(B(B(c(x1)))) -> B(b(b(A(x1)))) B#(a(a(a(x1)))) -> A#(A(A(x1))) B#(a(a(a(x1)))) -> A#(A(x1)) B#(a(a(a(x1)))) -> A#(x1) B#(a(a(a(x1)))) -> C(A(A(A(x1)))) C#(B(x1)) -> A(x1) C#(C(C(C(x1)))) -> C(c(c(x1))) C#(C(C(C(x1)))) -> C(c(x1)) C#(C(C(C(x1)))) -> C(x1) C#(C(C(a(x1)))) -> B#(x1) C#(C(C(a(x1)))) -> C(B(x1)) C#(C(C(a(x1)))) -> C(c(B(x1))) C#(C(C(a(x1)))) -> C(c(c(B(x1)))) C#(b(b(b(x1)))) -> B#(B(B(x1))) C#(b(b(b(x1)))) -> B#(B(x1)) C#(b(b(b(x1)))) -> B#(x1) C#(b(b(b(x1)))) -> A(B(B(B(x1)))) A(a(a(a(x1)))) -> A#(A(A(x1))) A(a(a(a(x1)))) -> A#(A(x1)) A(a(a(a(x1)))) -> A#(x1) A(b(x1)) -> C#(x1) B(b(b(b(x1)))) -> B#(B(B(x1))) B(b(b(b(x1)))) -> B#(B(x1)) B(b(b(b(x1)))) -> B#(x1) B(c(x1)) -> A#(x1) C(a(x1)) -> B#(x1) C(c(c(c(x1)))) -> C#(C(C(x1))) C(c(c(c(x1)))) -> C#(C(x1)) C(c(c(c(x1)))) -> C#(x1) -> Rules: A(A(A(A(x1)))) -> a(a(a(x1))) A(A(A(b(x1)))) -> a(a(a(C(x1)))) A(C(x1)) -> b(x1) A(a(x1)) -> x1 A(c(c(c(x1)))) -> b(C(C(C(x1)))) B(A(x1)) -> c(x1) B(B(B(B(x1)))) -> b(b(b(x1))) B(B(B(c(x1)))) -> b(b(b(A(x1)))) B(a(a(a(x1)))) -> c(A(A(A(x1)))) B(b(x1)) -> x1 C(B(x1)) -> a(x1) C(C(C(C(x1)))) -> c(c(c(x1))) C(C(C(a(x1)))) -> c(c(c(B(x1)))) C(b(b(b(x1)))) -> a(B(B(B(x1)))) C(c(x1)) -> x1 a(A(x1)) -> x1 a(a(a(a(x1)))) -> A(A(A(x1))) a(b(x1)) -> C(x1) b(B(x1)) -> x1 b(b(b(b(x1)))) -> B(B(B(x1))) b(c(x1)) -> A(x1) c(C(x1)) -> x1 c(a(x1)) -> B(x1) c(c(c(c(x1)))) -> C(C(C(x1))) -> Usable rules: A(A(A(A(x1)))) -> a(a(a(x1))) A(A(A(b(x1)))) -> a(a(a(C(x1)))) A(C(x1)) -> b(x1) A(a(x1)) -> x1 A(c(c(c(x1)))) -> b(C(C(C(x1)))) B(A(x1)) -> c(x1) B(B(B(B(x1)))) -> b(b(b(x1))) B(B(B(c(x1)))) -> b(b(b(A(x1)))) B(a(a(a(x1)))) -> c(A(A(A(x1)))) B(b(x1)) -> x1 C(B(x1)) -> a(x1) C(C(C(C(x1)))) -> c(c(c(x1))) C(C(C(a(x1)))) -> c(c(c(B(x1)))) C(b(b(b(x1)))) -> a(B(B(B(x1)))) C(c(x1)) -> x1 a(A(x1)) -> x1 a(a(a(a(x1)))) -> A(A(A(x1))) a(b(x1)) -> C(x1) b(B(x1)) -> x1 b(b(b(b(x1)))) -> B(B(B(x1))) b(c(x1)) -> A(x1) c(C(x1)) -> x1 c(a(x1)) -> B(x1) c(c(c(c(x1)))) -> C(C(C(x1))) ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [A](X) = 2.X + 2 [B](X) = 2.X + 2 [C](X) = 2.X + 2 [a](X) = 2.X + 2 [b](X) = 2.X + 2 [c](X) = 2.X + 2 [A#](X) = 2.X + 2 [B#](X) = 2.X [C#](X) = 2.X + 1 [A](X) = 2.X + 1 [B](X) = 2.X [C](X) = 2.X Problem 1: SCC Processor: -> Pairs: A#(C(x1)) -> B(x1) A#(c(c(c(x1)))) -> C#(C(C(x1))) A#(c(c(c(x1)))) -> C#(C(x1)) A#(c(c(c(x1)))) -> C#(x1) A#(c(c(c(x1)))) -> B(C(C(C(x1)))) B#(A(x1)) -> C(x1) B#(B(B(B(x1)))) -> B(b(b(x1))) B#(B(B(B(x1)))) -> B(b(x1)) B#(B(B(B(x1)))) -> B(x1) B#(B(B(c(x1)))) -> A#(x1) B#(B(B(c(x1)))) -> B(A(x1)) B#(B(B(c(x1)))) -> B(b(A(x1))) B#(B(B(c(x1)))) -> B(b(b(A(x1)))) B#(a(a(a(x1)))) -> A#(A(A(x1))) B#(a(a(a(x1)))) -> A#(A(x1)) B#(a(a(a(x1)))) -> A#(x1) B#(a(a(a(x1)))) -> C(A(A(A(x1)))) C#(B(x1)) -> A(x1) C#(C(C(C(x1)))) -> C(c(c(x1))) C#(C(C(C(x1)))) -> C(c(x1)) C#(C(C(C(x1)))) -> C(x1) C#(C(C(a(x1)))) -> B#(x1) C#(C(C(a(x1)))) -> C(B(x1)) C#(C(C(a(x1)))) -> C(c(B(x1))) C#(C(C(a(x1)))) -> C(c(c(B(x1)))) C#(b(b(b(x1)))) -> B#(B(B(x1))) C#(b(b(b(x1)))) -> B#(B(x1)) C#(b(b(b(x1)))) -> B#(x1) C#(b(b(b(x1)))) -> A(B(B(B(x1)))) A(a(a(a(x1)))) -> A#(A(A(x1))) A(a(a(a(x1)))) -> A#(A(x1)) A(a(a(a(x1)))) -> A#(x1) A(b(x1)) -> C#(x1) B(b(b(b(x1)))) -> B#(B(B(x1))) B(b(b(b(x1)))) -> B#(B(x1)) B(b(b(b(x1)))) -> B#(x1) B(c(x1)) -> A#(x1) C(a(x1)) -> B#(x1) C(c(c(c(x1)))) -> C#(C(C(x1))) C(c(c(c(x1)))) -> C#(C(x1)) C(c(c(c(x1)))) -> C#(x1) -> Rules: A(A(A(A(x1)))) -> a(a(a(x1))) A(A(A(b(x1)))) -> a(a(a(C(x1)))) A(C(x1)) -> b(x1) A(a(x1)) -> x1 A(c(c(c(x1)))) -> b(C(C(C(x1)))) B(A(x1)) -> c(x1) B(B(B(B(x1)))) -> b(b(b(x1))) B(B(B(c(x1)))) -> b(b(b(A(x1)))) B(a(a(a(x1)))) -> c(A(A(A(x1)))) B(b(x1)) -> x1 C(B(x1)) -> a(x1) C(C(C(C(x1)))) -> c(c(c(x1))) C(C(C(a(x1)))) -> c(c(c(B(x1)))) C(b(b(b(x1)))) -> a(B(B(B(x1)))) C(c(x1)) -> x1 a(A(x1)) -> x1 a(a(a(a(x1)))) -> A(A(A(x1))) a(b(x1)) -> C(x1) b(B(x1)) -> x1 b(b(b(b(x1)))) -> B(B(B(x1))) b(c(x1)) -> A(x1) c(C(x1)) -> x1 c(a(x1)) -> B(x1) c(c(c(c(x1)))) -> C(C(C(x1))) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: A#(C(x1)) -> B(x1) A#(c(c(c(x1)))) -> C#(C(C(x1))) A#(c(c(c(x1)))) -> C#(C(x1)) A#(c(c(c(x1)))) -> C#(x1) A#(c(c(c(x1)))) -> B(C(C(C(x1)))) B#(A(x1)) -> C(x1) B#(B(B(B(x1)))) -> B(b(b(x1))) B#(B(B(B(x1)))) -> B(b(x1)) B#(B(B(B(x1)))) -> B(x1) B#(B(B(c(x1)))) -> A#(x1) B#(B(B(c(x1)))) -> B(A(x1)) B#(B(B(c(x1)))) -> B(b(A(x1))) B#(B(B(c(x1)))) -> B(b(b(A(x1)))) B#(a(a(a(x1)))) -> A#(A(A(x1))) B#(a(a(a(x1)))) -> A#(A(x1)) B#(a(a(a(x1)))) -> A#(x1) B#(a(a(a(x1)))) -> C(A(A(A(x1)))) C#(B(x1)) -> A(x1) C#(C(C(C(x1)))) -> C(c(c(x1))) C#(C(C(C(x1)))) -> C(c(x1)) C#(C(C(C(x1)))) -> C(x1) C#(C(C(a(x1)))) -> B#(x1) C#(C(C(a(x1)))) -> C(B(x1)) C#(C(C(a(x1)))) -> C(c(B(x1))) C#(C(C(a(x1)))) -> C(c(c(B(x1)))) C#(b(b(b(x1)))) -> B#(B(B(x1))) C#(b(b(b(x1)))) -> B#(B(x1)) C#(b(b(b(x1)))) -> B#(x1) C#(b(b(b(x1)))) -> A(B(B(B(x1)))) A(a(a(a(x1)))) -> A#(A(A(x1))) A(a(a(a(x1)))) -> A#(A(x1)) A(a(a(a(x1)))) -> A#(x1) A(b(x1)) -> C#(x1) B(b(b(b(x1)))) -> B#(B(B(x1))) B(b(b(b(x1)))) -> B#(B(x1)) B(b(b(b(x1)))) -> B#(x1) B(c(x1)) -> A#(x1) C(a(x1)) -> B#(x1) C(c(c(c(x1)))) -> C#(C(C(x1))) C(c(c(c(x1)))) -> C#(C(x1)) C(c(c(c(x1)))) -> C#(x1) ->->-> Rules: A(A(A(A(x1)))) -> a(a(a(x1))) A(A(A(b(x1)))) -> a(a(a(C(x1)))) A(C(x1)) -> b(x1) A(a(x1)) -> x1 A(c(c(c(x1)))) -> b(C(C(C(x1)))) B(A(x1)) -> c(x1) B(B(B(B(x1)))) -> b(b(b(x1))) B(B(B(c(x1)))) -> b(b(b(A(x1)))) B(a(a(a(x1)))) -> c(A(A(A(x1)))) B(b(x1)) -> x1 C(B(x1)) -> a(x1) C(C(C(C(x1)))) -> c(c(c(x1))) C(C(C(a(x1)))) -> c(c(c(B(x1)))) C(b(b(b(x1)))) -> a(B(B(B(x1)))) C(c(x1)) -> x1 a(A(x1)) -> x1 a(a(a(a(x1)))) -> A(A(A(x1))) a(b(x1)) -> C(x1) b(B(x1)) -> x1 b(b(b(b(x1)))) -> B(B(B(x1))) b(c(x1)) -> A(x1) c(C(x1)) -> x1 c(a(x1)) -> B(x1) c(c(c(c(x1)))) -> C(C(C(x1))) Problem 1: Reduction Pair Processor: -> Pairs: A#(C(x1)) -> B(x1) A#(c(c(c(x1)))) -> C#(C(C(x1))) A#(c(c(c(x1)))) -> C#(C(x1)) A#(c(c(c(x1)))) -> C#(x1) A#(c(c(c(x1)))) -> B(C(C(C(x1)))) B#(A(x1)) -> C(x1) B#(B(B(B(x1)))) -> B(b(b(x1))) B#(B(B(B(x1)))) -> B(b(x1)) B#(B(B(B(x1)))) -> B(x1) B#(B(B(c(x1)))) -> A#(x1) B#(B(B(c(x1)))) -> B(A(x1)) B#(B(B(c(x1)))) -> B(b(A(x1))) B#(B(B(c(x1)))) -> B(b(b(A(x1)))) B#(a(a(a(x1)))) -> A#(A(A(x1))) B#(a(a(a(x1)))) -> A#(A(x1)) B#(a(a(a(x1)))) -> A#(x1) B#(a(a(a(x1)))) -> C(A(A(A(x1)))) C#(B(x1)) -> A(x1) C#(C(C(C(x1)))) -> C(c(c(x1))) C#(C(C(C(x1)))) -> C(c(x1)) C#(C(C(C(x1)))) -> C(x1) C#(C(C(a(x1)))) -> B#(x1) C#(C(C(a(x1)))) -> C(B(x1)) C#(C(C(a(x1)))) -> C(c(B(x1))) C#(C(C(a(x1)))) -> C(c(c(B(x1)))) C#(b(b(b(x1)))) -> B#(B(B(x1))) C#(b(b(b(x1)))) -> B#(B(x1)) C#(b(b(b(x1)))) -> B#(x1) C#(b(b(b(x1)))) -> A(B(B(B(x1)))) A(a(a(a(x1)))) -> A#(A(A(x1))) A(a(a(a(x1)))) -> A#(A(x1)) A(a(a(a(x1)))) -> A#(x1) A(b(x1)) -> C#(x1) B(b(b(b(x1)))) -> B#(B(B(x1))) B(b(b(b(x1)))) -> B#(B(x1)) B(b(b(b(x1)))) -> B#(x1) B(c(x1)) -> A#(x1) C(a(x1)) -> B#(x1) C(c(c(c(x1)))) -> C#(C(C(x1))) C(c(c(c(x1)))) -> C#(C(x1)) C(c(c(c(x1)))) -> C#(x1) -> Rules: A(A(A(A(x1)))) -> a(a(a(x1))) A(A(A(b(x1)))) -> a(a(a(C(x1)))) A(C(x1)) -> b(x1) A(a(x1)) -> x1 A(c(c(c(x1)))) -> b(C(C(C(x1)))) B(A(x1)) -> c(x1) B(B(B(B(x1)))) -> b(b(b(x1))) B(B(B(c(x1)))) -> b(b(b(A(x1)))) B(a(a(a(x1)))) -> c(A(A(A(x1)))) B(b(x1)) -> x1 C(B(x1)) -> a(x1) C(C(C(C(x1)))) -> c(c(c(x1))) C(C(C(a(x1)))) -> c(c(c(B(x1)))) C(b(b(b(x1)))) -> a(B(B(B(x1)))) C(c(x1)) -> x1 a(A(x1)) -> x1 a(a(a(a(x1)))) -> A(A(A(x1))) a(b(x1)) -> C(x1) b(B(x1)) -> x1 b(b(b(b(x1)))) -> B(B(B(x1))) b(c(x1)) -> A(x1) c(C(x1)) -> x1 c(a(x1)) -> B(x1) c(c(c(c(x1)))) -> C(C(C(x1))) -> Usable rules: A(A(A(A(x1)))) -> a(a(a(x1))) A(A(A(b(x1)))) -> a(a(a(C(x1)))) A(C(x1)) -> b(x1) A(a(x1)) -> x1 A(c(c(c(x1)))) -> b(C(C(C(x1)))) B(A(x1)) -> c(x1) B(B(B(B(x1)))) -> b(b(b(x1))) B(B(B(c(x1)))) -> b(b(b(A(x1)))) B(a(a(a(x1)))) -> c(A(A(A(x1)))) B(b(x1)) -> x1 C(B(x1)) -> a(x1) C(C(C(C(x1)))) -> c(c(c(x1))) C(C(C(a(x1)))) -> c(c(c(B(x1)))) C(b(b(b(x1)))) -> a(B(B(B(x1)))) C(c(x1)) -> x1 a(A(x1)) -> x1 a(a(a(a(x1)))) -> A(A(A(x1))) a(b(x1)) -> C(x1) b(B(x1)) -> x1 b(b(b(b(x1)))) -> B(B(B(x1))) b(c(x1)) -> A(x1) c(C(x1)) -> x1 c(a(x1)) -> B(x1) c(c(c(c(x1)))) -> C(C(C(x1))) ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [A](X) = 2.X + 2 [B](X) = 2.X + 2 [C](X) = 2.X + 2 [a](X) = 2.X + 2 [b](X) = 2.X + 2 [c](X) = 2.X + 2 [A#](X) = X + 2 [B#](X) = 2.X + 2 [C#](X) = 2.X + 2 [A](X) = 2.X [B](X) = X + 2 [C](X) = 2.X + 2 Problem 1: SCC Processor: -> Pairs: A#(c(c(c(x1)))) -> C#(C(C(x1))) A#(c(c(c(x1)))) -> C#(C(x1)) A#(c(c(c(x1)))) -> C#(x1) A#(c(c(c(x1)))) -> B(C(C(C(x1)))) B#(A(x1)) -> C(x1) B#(B(B(B(x1)))) -> B(b(b(x1))) B#(B(B(B(x1)))) -> B(b(x1)) B#(B(B(B(x1)))) -> B(x1) B#(B(B(c(x1)))) -> A#(x1) B#(B(B(c(x1)))) -> B(A(x1)) B#(B(B(c(x1)))) -> B(b(A(x1))) B#(B(B(c(x1)))) -> B(b(b(A(x1)))) B#(a(a(a(x1)))) -> A#(A(A(x1))) B#(a(a(a(x1)))) -> A#(A(x1)) B#(a(a(a(x1)))) -> A#(x1) B#(a(a(a(x1)))) -> C(A(A(A(x1)))) C#(B(x1)) -> A(x1) C#(C(C(C(x1)))) -> C(c(c(x1))) C#(C(C(C(x1)))) -> C(c(x1)) C#(C(C(C(x1)))) -> C(x1) C#(C(C(a(x1)))) -> B#(x1) C#(C(C(a(x1)))) -> C(B(x1)) C#(C(C(a(x1)))) -> C(c(B(x1))) C#(C(C(a(x1)))) -> C(c(c(B(x1)))) C#(b(b(b(x1)))) -> B#(B(B(x1))) C#(b(b(b(x1)))) -> B#(B(x1)) C#(b(b(b(x1)))) -> B#(x1) C#(b(b(b(x1)))) -> A(B(B(B(x1)))) A(a(a(a(x1)))) -> A#(A(A(x1))) A(a(a(a(x1)))) -> A#(A(x1)) A(a(a(a(x1)))) -> A#(x1) A(b(x1)) -> C#(x1) B(b(b(b(x1)))) -> B#(B(B(x1))) B(b(b(b(x1)))) -> B#(B(x1)) B(b(b(b(x1)))) -> B#(x1) B(c(x1)) -> A#(x1) C(a(x1)) -> B#(x1) C(c(c(c(x1)))) -> C#(C(C(x1))) C(c(c(c(x1)))) -> C#(C(x1)) C(c(c(c(x1)))) -> C#(x1) -> Rules: A(A(A(A(x1)))) -> a(a(a(x1))) A(A(A(b(x1)))) -> a(a(a(C(x1)))) A(C(x1)) -> b(x1) A(a(x1)) -> x1 A(c(c(c(x1)))) -> b(C(C(C(x1)))) B(A(x1)) -> c(x1) B(B(B(B(x1)))) -> b(b(b(x1))) B(B(B(c(x1)))) -> b(b(b(A(x1)))) B(a(a(a(x1)))) -> c(A(A(A(x1)))) B(b(x1)) -> x1 C(B(x1)) -> a(x1) C(C(C(C(x1)))) -> c(c(c(x1))) C(C(C(a(x1)))) -> c(c(c(B(x1)))) C(b(b(b(x1)))) -> a(B(B(B(x1)))) C(c(x1)) -> x1 a(A(x1)) -> x1 a(a(a(a(x1)))) -> A(A(A(x1))) a(b(x1)) -> C(x1) b(B(x1)) -> x1 b(b(b(b(x1)))) -> B(B(B(x1))) b(c(x1)) -> A(x1) c(C(x1)) -> x1 c(a(x1)) -> B(x1) c(c(c(c(x1)))) -> C(C(C(x1))) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: A#(c(c(c(x1)))) -> C#(C(C(x1))) A#(c(c(c(x1)))) -> C#(C(x1)) A#(c(c(c(x1)))) -> C#(x1) A#(c(c(c(x1)))) -> B(C(C(C(x1)))) B#(A(x1)) -> C(x1) B#(B(B(B(x1)))) -> B(b(b(x1))) B#(B(B(B(x1)))) -> B(b(x1)) B#(B(B(B(x1)))) -> B(x1) B#(B(B(c(x1)))) -> A#(x1) B#(B(B(c(x1)))) -> B(A(x1)) B#(B(B(c(x1)))) -> B(b(A(x1))) B#(B(B(c(x1)))) -> B(b(b(A(x1)))) B#(a(a(a(x1)))) -> A#(A(A(x1))) B#(a(a(a(x1)))) -> A#(A(x1)) B#(a(a(a(x1)))) -> A#(x1) B#(a(a(a(x1)))) -> C(A(A(A(x1)))) C#(B(x1)) -> A(x1) C#(C(C(C(x1)))) -> C(c(c(x1))) C#(C(C(C(x1)))) -> C(c(x1)) C#(C(C(C(x1)))) -> C(x1) C#(C(C(a(x1)))) -> B#(x1) C#(C(C(a(x1)))) -> C(B(x1)) C#(C(C(a(x1)))) -> C(c(B(x1))) C#(C(C(a(x1)))) -> C(c(c(B(x1)))) C#(b(b(b(x1)))) -> B#(B(B(x1))) C#(b(b(b(x1)))) -> B#(B(x1)) C#(b(b(b(x1)))) -> B#(x1) C#(b(b(b(x1)))) -> A(B(B(B(x1)))) A(a(a(a(x1)))) -> A#(A(A(x1))) A(a(a(a(x1)))) -> A#(A(x1)) A(a(a(a(x1)))) -> A#(x1) A(b(x1)) -> C#(x1) B(b(b(b(x1)))) -> B#(B(B(x1))) B(b(b(b(x1)))) -> B#(B(x1)) B(b(b(b(x1)))) -> B#(x1) B(c(x1)) -> A#(x1) C(a(x1)) -> B#(x1) C(c(c(c(x1)))) -> C#(C(C(x1))) C(c(c(c(x1)))) -> C#(C(x1)) C(c(c(c(x1)))) -> C#(x1) ->->-> Rules: A(A(A(A(x1)))) -> a(a(a(x1))) A(A(A(b(x1)))) -> a(a(a(C(x1)))) A(C(x1)) -> b(x1) A(a(x1)) -> x1 A(c(c(c(x1)))) -> b(C(C(C(x1)))) B(A(x1)) -> c(x1) B(B(B(B(x1)))) -> b(b(b(x1))) B(B(B(c(x1)))) -> b(b(b(A(x1)))) B(a(a(a(x1)))) -> c(A(A(A(x1)))) B(b(x1)) -> x1 C(B(x1)) -> a(x1) C(C(C(C(x1)))) -> c(c(c(x1))) C(C(C(a(x1)))) -> c(c(c(B(x1)))) C(b(b(b(x1)))) -> a(B(B(B(x1)))) C(c(x1)) -> x1 a(A(x1)) -> x1 a(a(a(a(x1)))) -> A(A(A(x1))) a(b(x1)) -> C(x1) b(B(x1)) -> x1 b(b(b(b(x1)))) -> B(B(B(x1))) b(c(x1)) -> A(x1) c(C(x1)) -> x1 c(a(x1)) -> B(x1) c(c(c(c(x1)))) -> C(C(C(x1))) Problem 1: Reduction Pair Processor: -> Pairs: A#(c(c(c(x1)))) -> C#(C(C(x1))) A#(c(c(c(x1)))) -> C#(C(x1)) A#(c(c(c(x1)))) -> C#(x1) A#(c(c(c(x1)))) -> B(C(C(C(x1)))) B#(A(x1)) -> C(x1) B#(B(B(B(x1)))) -> B(b(b(x1))) B#(B(B(B(x1)))) -> B(b(x1)) B#(B(B(B(x1)))) -> B(x1) B#(B(B(c(x1)))) -> A#(x1) B#(B(B(c(x1)))) -> B(A(x1)) B#(B(B(c(x1)))) -> B(b(A(x1))) B#(B(B(c(x1)))) -> B(b(b(A(x1)))) B#(a(a(a(x1)))) -> A#(A(A(x1))) B#(a(a(a(x1)))) -> A#(A(x1)) B#(a(a(a(x1)))) -> A#(x1) B#(a(a(a(x1)))) -> C(A(A(A(x1)))) C#(B(x1)) -> A(x1) C#(C(C(C(x1)))) -> C(c(c(x1))) C#(C(C(C(x1)))) -> C(c(x1)) C#(C(C(C(x1)))) -> C(x1) C#(C(C(a(x1)))) -> B#(x1) C#(C(C(a(x1)))) -> C(B(x1)) C#(C(C(a(x1)))) -> C(c(B(x1))) C#(C(C(a(x1)))) -> C(c(c(B(x1)))) C#(b(b(b(x1)))) -> B#(B(B(x1))) C#(b(b(b(x1)))) -> B#(B(x1)) C#(b(b(b(x1)))) -> B#(x1) C#(b(b(b(x1)))) -> A(B(B(B(x1)))) A(a(a(a(x1)))) -> A#(A(A(x1))) A(a(a(a(x1)))) -> A#(A(x1)) A(a(a(a(x1)))) -> A#(x1) A(b(x1)) -> C#(x1) B(b(b(b(x1)))) -> B#(B(B(x1))) B(b(b(b(x1)))) -> B#(B(x1)) B(b(b(b(x1)))) -> B#(x1) B(c(x1)) -> A#(x1) C(a(x1)) -> B#(x1) C(c(c(c(x1)))) -> C#(C(C(x1))) C(c(c(c(x1)))) -> C#(C(x1)) C(c(c(c(x1)))) -> C#(x1) -> Rules: A(A(A(A(x1)))) -> a(a(a(x1))) A(A(A(b(x1)))) -> a(a(a(C(x1)))) A(C(x1)) -> b(x1) A(a(x1)) -> x1 A(c(c(c(x1)))) -> b(C(C(C(x1)))) B(A(x1)) -> c(x1) B(B(B(B(x1)))) -> b(b(b(x1))) B(B(B(c(x1)))) -> b(b(b(A(x1)))) B(a(a(a(x1)))) -> c(A(A(A(x1)))) B(b(x1)) -> x1 C(B(x1)) -> a(x1) C(C(C(C(x1)))) -> c(c(c(x1))) C(C(C(a(x1)))) -> c(c(c(B(x1)))) C(b(b(b(x1)))) -> a(B(B(B(x1)))) C(c(x1)) -> x1 a(A(x1)) -> x1 a(a(a(a(x1)))) -> A(A(A(x1))) a(b(x1)) -> C(x1) b(B(x1)) -> x1 b(b(b(b(x1)))) -> B(B(B(x1))) b(c(x1)) -> A(x1) c(C(x1)) -> x1 c(a(x1)) -> B(x1) c(c(c(c(x1)))) -> C(C(C(x1))) -> Usable rules: A(A(A(A(x1)))) -> a(a(a(x1))) A(A(A(b(x1)))) -> a(a(a(C(x1)))) A(C(x1)) -> b(x1) A(a(x1)) -> x1 A(c(c(c(x1)))) -> b(C(C(C(x1)))) B(A(x1)) -> c(x1) B(B(B(B(x1)))) -> b(b(b(x1))) B(B(B(c(x1)))) -> b(b(b(A(x1)))) B(a(a(a(x1)))) -> c(A(A(A(x1)))) B(b(x1)) -> x1 C(B(x1)) -> a(x1) C(C(C(C(x1)))) -> c(c(c(x1))) C(C(C(a(x1)))) -> c(c(c(B(x1)))) C(b(b(b(x1)))) -> a(B(B(B(x1)))) C(c(x1)) -> x1 a(A(x1)) -> x1 a(a(a(a(x1)))) -> A(A(A(x1))) a(b(x1)) -> C(x1) b(B(x1)) -> x1 b(b(b(b(x1)))) -> B(B(B(x1))) b(c(x1)) -> A(x1) c(C(x1)) -> x1 c(a(x1)) -> B(x1) c(c(c(c(x1)))) -> C(C(C(x1))) ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [A](X) = 2.X + 2 [B](X) = 2.X + 2 [C](X) = 2.X + 2 [a](X) = 2.X + 2 [b](X) = 2.X + 2 [c](X) = 2.X + 2 [A#](X) = 2.X + 1 [B#](X) = X + 2 [C#](X) = 2.X + 2 [A](X) = 2.X + 1 [B](X) = X + 2 [C](X) = X + 2 Problem 1: SCC Processor: -> Pairs: A#(c(c(c(x1)))) -> C#(C(x1)) A#(c(c(c(x1)))) -> C#(x1) A#(c(c(c(x1)))) -> B(C(C(C(x1)))) B#(A(x1)) -> C(x1) B#(B(B(B(x1)))) -> B(b(b(x1))) B#(B(B(B(x1)))) -> B(b(x1)) B#(B(B(B(x1)))) -> B(x1) B#(B(B(c(x1)))) -> A#(x1) B#(B(B(c(x1)))) -> B(A(x1)) B#(B(B(c(x1)))) -> B(b(A(x1))) B#(B(B(c(x1)))) -> B(b(b(A(x1)))) B#(a(a(a(x1)))) -> A#(A(A(x1))) B#(a(a(a(x1)))) -> A#(A(x1)) B#(a(a(a(x1)))) -> A#(x1) B#(a(a(a(x1)))) -> C(A(A(A(x1)))) C#(B(x1)) -> A(x1) C#(C(C(C(x1)))) -> C(c(c(x1))) C#(C(C(C(x1)))) -> C(c(x1)) C#(C(C(C(x1)))) -> C(x1) C#(C(C(a(x1)))) -> B#(x1) C#(C(C(a(x1)))) -> C(B(x1)) C#(C(C(a(x1)))) -> C(c(B(x1))) C#(C(C(a(x1)))) -> C(c(c(B(x1)))) C#(b(b(b(x1)))) -> B#(B(B(x1))) C#(b(b(b(x1)))) -> B#(B(x1)) C#(b(b(b(x1)))) -> B#(x1) C#(b(b(b(x1)))) -> A(B(B(B(x1)))) A(a(a(a(x1)))) -> A#(A(A(x1))) A(a(a(a(x1)))) -> A#(A(x1)) A(a(a(a(x1)))) -> A#(x1) A(b(x1)) -> C#(x1) B(b(b(b(x1)))) -> B#(B(B(x1))) B(b(b(b(x1)))) -> B#(B(x1)) B(b(b(b(x1)))) -> B#(x1) B(c(x1)) -> A#(x1) C(a(x1)) -> B#(x1) C(c(c(c(x1)))) -> C#(C(C(x1))) C(c(c(c(x1)))) -> C#(C(x1)) C(c(c(c(x1)))) -> C#(x1) -> Rules: A(A(A(A(x1)))) -> a(a(a(x1))) A(A(A(b(x1)))) -> a(a(a(C(x1)))) A(C(x1)) -> b(x1) A(a(x1)) -> x1 A(c(c(c(x1)))) -> b(C(C(C(x1)))) B(A(x1)) -> c(x1) B(B(B(B(x1)))) -> b(b(b(x1))) B(B(B(c(x1)))) -> b(b(b(A(x1)))) B(a(a(a(x1)))) -> c(A(A(A(x1)))) B(b(x1)) -> x1 C(B(x1)) -> a(x1) C(C(C(C(x1)))) -> c(c(c(x1))) C(C(C(a(x1)))) -> c(c(c(B(x1)))) C(b(b(b(x1)))) -> a(B(B(B(x1)))) C(c(x1)) -> x1 a(A(x1)) -> x1 a(a(a(a(x1)))) -> A(A(A(x1))) a(b(x1)) -> C(x1) b(B(x1)) -> x1 b(b(b(b(x1)))) -> B(B(B(x1))) b(c(x1)) -> A(x1) c(C(x1)) -> x1 c(a(x1)) -> B(x1) c(c(c(c(x1)))) -> C(C(C(x1))) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: A#(c(c(c(x1)))) -> C#(C(x1)) A#(c(c(c(x1)))) -> C#(x1) A#(c(c(c(x1)))) -> B(C(C(C(x1)))) B#(A(x1)) -> C(x1) B#(B(B(B(x1)))) -> B(b(b(x1))) B#(B(B(B(x1)))) -> B(b(x1)) B#(B(B(B(x1)))) -> B(x1) B#(B(B(c(x1)))) -> A#(x1) B#(B(B(c(x1)))) -> B(A(x1)) B#(B(B(c(x1)))) -> B(b(A(x1))) B#(B(B(c(x1)))) -> B(b(b(A(x1)))) B#(a(a(a(x1)))) -> A#(A(A(x1))) B#(a(a(a(x1)))) -> A#(A(x1)) B#(a(a(a(x1)))) -> A#(x1) B#(a(a(a(x1)))) -> C(A(A(A(x1)))) C#(B(x1)) -> A(x1) C#(C(C(C(x1)))) -> C(c(c(x1))) C#(C(C(C(x1)))) -> C(c(x1)) C#(C(C(C(x1)))) -> C(x1) C#(C(C(a(x1)))) -> B#(x1) C#(C(C(a(x1)))) -> C(B(x1)) C#(C(C(a(x1)))) -> C(c(B(x1))) C#(C(C(a(x1)))) -> C(c(c(B(x1)))) C#(b(b(b(x1)))) -> B#(B(B(x1))) C#(b(b(b(x1)))) -> B#(B(x1)) C#(b(b(b(x1)))) -> B#(x1) C#(b(b(b(x1)))) -> A(B(B(B(x1)))) A(a(a(a(x1)))) -> A#(A(A(x1))) A(a(a(a(x1)))) -> A#(A(x1)) A(a(a(a(x1)))) -> A#(x1) A(b(x1)) -> C#(x1) B(b(b(b(x1)))) -> B#(B(B(x1))) B(b(b(b(x1)))) -> B#(B(x1)) B(b(b(b(x1)))) -> B#(x1) B(c(x1)) -> A#(x1) C(a(x1)) -> B#(x1) C(c(c(c(x1)))) -> C#(C(C(x1))) C(c(c(c(x1)))) -> C#(C(x1)) C(c(c(c(x1)))) -> C#(x1) ->->-> Rules: A(A(A(A(x1)))) -> a(a(a(x1))) A(A(A(b(x1)))) -> a(a(a(C(x1)))) A(C(x1)) -> b(x1) A(a(x1)) -> x1 A(c(c(c(x1)))) -> b(C(C(C(x1)))) B(A(x1)) -> c(x1) B(B(B(B(x1)))) -> b(b(b(x1))) B(B(B(c(x1)))) -> b(b(b(A(x1)))) B(a(a(a(x1)))) -> c(A(A(A(x1)))) B(b(x1)) -> x1 C(B(x1)) -> a(x1) C(C(C(C(x1)))) -> c(c(c(x1))) C(C(C(a(x1)))) -> c(c(c(B(x1)))) C(b(b(b(x1)))) -> a(B(B(B(x1)))) C(c(x1)) -> x1 a(A(x1)) -> x1 a(a(a(a(x1)))) -> A(A(A(x1))) a(b(x1)) -> C(x1) b(B(x1)) -> x1 b(b(b(b(x1)))) -> B(B(B(x1))) b(c(x1)) -> A(x1) c(C(x1)) -> x1 c(a(x1)) -> B(x1) c(c(c(c(x1)))) -> C(C(C(x1))) Problem 1: Reduction Pair Processor: -> Pairs: A#(c(c(c(x1)))) -> C#(C(x1)) A#(c(c(c(x1)))) -> C#(x1) A#(c(c(c(x1)))) -> B(C(C(C(x1)))) B#(A(x1)) -> C(x1) B#(B(B(B(x1)))) -> B(b(b(x1))) B#(B(B(B(x1)))) -> B(b(x1)) B#(B(B(B(x1)))) -> B(x1) B#(B(B(c(x1)))) -> A#(x1) B#(B(B(c(x1)))) -> B(A(x1)) B#(B(B(c(x1)))) -> B(b(A(x1))) B#(B(B(c(x1)))) -> B(b(b(A(x1)))) B#(a(a(a(x1)))) -> A#(A(A(x1))) B#(a(a(a(x1)))) -> A#(A(x1)) B#(a(a(a(x1)))) -> A#(x1) B#(a(a(a(x1)))) -> C(A(A(A(x1)))) C#(B(x1)) -> A(x1) C#(C(C(C(x1)))) -> C(c(c(x1))) C#(C(C(C(x1)))) -> C(c(x1)) C#(C(C(C(x1)))) -> C(x1) C#(C(C(a(x1)))) -> B#(x1) C#(C(C(a(x1)))) -> C(B(x1)) C#(C(C(a(x1)))) -> C(c(B(x1))) C#(C(C(a(x1)))) -> C(c(c(B(x1)))) C#(b(b(b(x1)))) -> B#(B(B(x1))) C#(b(b(b(x1)))) -> B#(B(x1)) C#(b(b(b(x1)))) -> B#(x1) C#(b(b(b(x1)))) -> A(B(B(B(x1)))) A(a(a(a(x1)))) -> A#(A(A(x1))) A(a(a(a(x1)))) -> A#(A(x1)) A(a(a(a(x1)))) -> A#(x1) A(b(x1)) -> C#(x1) B(b(b(b(x1)))) -> B#(B(B(x1))) B(b(b(b(x1)))) -> B#(B(x1)) B(b(b(b(x1)))) -> B#(x1) B(c(x1)) -> A#(x1) C(a(x1)) -> B#(x1) C(c(c(c(x1)))) -> C#(C(C(x1))) C(c(c(c(x1)))) -> C#(C(x1)) C(c(c(c(x1)))) -> C#(x1) -> Rules: A(A(A(A(x1)))) -> a(a(a(x1))) A(A(A(b(x1)))) -> a(a(a(C(x1)))) A(C(x1)) -> b(x1) A(a(x1)) -> x1 A(c(c(c(x1)))) -> b(C(C(C(x1)))) B(A(x1)) -> c(x1) B(B(B(B(x1)))) -> b(b(b(x1))) B(B(B(c(x1)))) -> b(b(b(A(x1)))) B(a(a(a(x1)))) -> c(A(A(A(x1)))) B(b(x1)) -> x1 C(B(x1)) -> a(x1) C(C(C(C(x1)))) -> c(c(c(x1))) C(C(C(a(x1)))) -> c(c(c(B(x1)))) C(b(b(b(x1)))) -> a(B(B(B(x1)))) C(c(x1)) -> x1 a(A(x1)) -> x1 a(a(a(a(x1)))) -> A(A(A(x1))) a(b(x1)) -> C(x1) b(B(x1)) -> x1 b(b(b(b(x1)))) -> B(B(B(x1))) b(c(x1)) -> A(x1) c(C(x1)) -> x1 c(a(x1)) -> B(x1) c(c(c(c(x1)))) -> C(C(C(x1))) -> Usable rules: A(A(A(A(x1)))) -> a(a(a(x1))) A(A(A(b(x1)))) -> a(a(a(C(x1)))) A(C(x1)) -> b(x1) A(a(x1)) -> x1 A(c(c(c(x1)))) -> b(C(C(C(x1)))) B(A(x1)) -> c(x1) B(B(B(B(x1)))) -> b(b(b(x1))) B(B(B(c(x1)))) -> b(b(b(A(x1)))) B(a(a(a(x1)))) -> c(A(A(A(x1)))) B(b(x1)) -> x1 C(B(x1)) -> a(x1) C(C(C(C(x1)))) -> c(c(c(x1))) C(C(C(a(x1)))) -> c(c(c(B(x1)))) C(b(b(b(x1)))) -> a(B(B(B(x1)))) C(c(x1)) -> x1 a(A(x1)) -> x1 a(a(a(a(x1)))) -> A(A(A(x1))) a(b(x1)) -> C(x1) b(B(x1)) -> x1 b(b(b(b(x1)))) -> B(B(B(x1))) b(c(x1)) -> A(x1) c(C(x1)) -> x1 c(a(x1)) -> B(x1) c(c(c(c(x1)))) -> C(C(C(x1))) ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [A](X) = 2.X + 2 [B](X) = 2.X + 2 [C](X) = 2.X + 2 [a](X) = 2.X + 2 [b](X) = 2.X + 2 [c](X) = 2.X + 2 [A#](X) = 2.X + 1 [B#](X) = 2.X + 2 [C#](X) = 2.X + 2 [A](X) = 2.X + 2 [B](X) = X + 2 [C](X) = 2.X + 1 Problem 1: SCC Processor: -> Pairs: A#(c(c(c(x1)))) -> C#(x1) A#(c(c(c(x1)))) -> B(C(C(C(x1)))) B#(A(x1)) -> C(x1) B#(B(B(B(x1)))) -> B(b(b(x1))) B#(B(B(B(x1)))) -> B(b(x1)) B#(B(B(B(x1)))) -> B(x1) B#(B(B(c(x1)))) -> A#(x1) B#(B(B(c(x1)))) -> B(A(x1)) B#(B(B(c(x1)))) -> B(b(A(x1))) B#(B(B(c(x1)))) -> B(b(b(A(x1)))) B#(a(a(a(x1)))) -> A#(A(A(x1))) B#(a(a(a(x1)))) -> A#(A(x1)) B#(a(a(a(x1)))) -> A#(x1) B#(a(a(a(x1)))) -> C(A(A(A(x1)))) C#(B(x1)) -> A(x1) C#(C(C(C(x1)))) -> C(c(c(x1))) C#(C(C(C(x1)))) -> C(c(x1)) C#(C(C(C(x1)))) -> C(x1) C#(C(C(a(x1)))) -> B#(x1) C#(C(C(a(x1)))) -> C(B(x1)) C#(C(C(a(x1)))) -> C(c(B(x1))) C#(C(C(a(x1)))) -> C(c(c(B(x1)))) C#(b(b(b(x1)))) -> B#(B(B(x1))) C#(b(b(b(x1)))) -> B#(B(x1)) C#(b(b(b(x1)))) -> B#(x1) C#(b(b(b(x1)))) -> A(B(B(B(x1)))) A(a(a(a(x1)))) -> A#(A(A(x1))) A(a(a(a(x1)))) -> A#(A(x1)) A(a(a(a(x1)))) -> A#(x1) A(b(x1)) -> C#(x1) B(b(b(b(x1)))) -> B#(B(B(x1))) B(b(b(b(x1)))) -> B#(B(x1)) B(b(b(b(x1)))) -> B#(x1) B(c(x1)) -> A#(x1) C(a(x1)) -> B#(x1) C(c(c(c(x1)))) -> C#(C(C(x1))) C(c(c(c(x1)))) -> C#(C(x1)) C(c(c(c(x1)))) -> C#(x1) -> Rules: A(A(A(A(x1)))) -> a(a(a(x1))) A(A(A(b(x1)))) -> a(a(a(C(x1)))) A(C(x1)) -> b(x1) A(a(x1)) -> x1 A(c(c(c(x1)))) -> b(C(C(C(x1)))) B(A(x1)) -> c(x1) B(B(B(B(x1)))) -> b(b(b(x1))) B(B(B(c(x1)))) -> b(b(b(A(x1)))) B(a(a(a(x1)))) -> c(A(A(A(x1)))) B(b(x1)) -> x1 C(B(x1)) -> a(x1) C(C(C(C(x1)))) -> c(c(c(x1))) C(C(C(a(x1)))) -> c(c(c(B(x1)))) C(b(b(b(x1)))) -> a(B(B(B(x1)))) C(c(x1)) -> x1 a(A(x1)) -> x1 a(a(a(a(x1)))) -> A(A(A(x1))) a(b(x1)) -> C(x1) b(B(x1)) -> x1 b(b(b(b(x1)))) -> B(B(B(x1))) b(c(x1)) -> A(x1) c(C(x1)) -> x1 c(a(x1)) -> B(x1) c(c(c(c(x1)))) -> C(C(C(x1))) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: A#(c(c(c(x1)))) -> C#(x1) A#(c(c(c(x1)))) -> B(C(C(C(x1)))) B#(A(x1)) -> C(x1) B#(B(B(B(x1)))) -> B(b(b(x1))) B#(B(B(B(x1)))) -> B(b(x1)) B#(B(B(B(x1)))) -> B(x1) B#(B(B(c(x1)))) -> A#(x1) B#(B(B(c(x1)))) -> B(A(x1)) B#(B(B(c(x1)))) -> B(b(A(x1))) B#(B(B(c(x1)))) -> B(b(b(A(x1)))) B#(a(a(a(x1)))) -> A#(A(A(x1))) B#(a(a(a(x1)))) -> A#(A(x1)) B#(a(a(a(x1)))) -> A#(x1) B#(a(a(a(x1)))) -> C(A(A(A(x1)))) C#(B(x1)) -> A(x1) C#(C(C(C(x1)))) -> C(c(c(x1))) C#(C(C(C(x1)))) -> C(c(x1)) C#(C(C(C(x1)))) -> C(x1) C#(C(C(a(x1)))) -> B#(x1) C#(C(C(a(x1)))) -> C(B(x1)) C#(C(C(a(x1)))) -> C(c(B(x1))) C#(C(C(a(x1)))) -> C(c(c(B(x1)))) C#(b(b(b(x1)))) -> B#(B(B(x1))) C#(b(b(b(x1)))) -> B#(B(x1)) C#(b(b(b(x1)))) -> B#(x1) C#(b(b(b(x1)))) -> A(B(B(B(x1)))) A(a(a(a(x1)))) -> A#(A(A(x1))) A(a(a(a(x1)))) -> A#(A(x1)) A(a(a(a(x1)))) -> A#(x1) A(b(x1)) -> C#(x1) B(b(b(b(x1)))) -> B#(B(B(x1))) B(b(b(b(x1)))) -> B#(B(x1)) B(b(b(b(x1)))) -> B#(x1) B(c(x1)) -> A#(x1) C(a(x1)) -> B#(x1) C(c(c(c(x1)))) -> C#(C(C(x1))) C(c(c(c(x1)))) -> C#(C(x1)) C(c(c(c(x1)))) -> C#(x1) ->->-> Rules: A(A(A(A(x1)))) -> a(a(a(x1))) A(A(A(b(x1)))) -> a(a(a(C(x1)))) A(C(x1)) -> b(x1) A(a(x1)) -> x1 A(c(c(c(x1)))) -> b(C(C(C(x1)))) B(A(x1)) -> c(x1) B(B(B(B(x1)))) -> b(b(b(x1))) B(B(B(c(x1)))) -> b(b(b(A(x1)))) B(a(a(a(x1)))) -> c(A(A(A(x1)))) B(b(x1)) -> x1 C(B(x1)) -> a(x1) C(C(C(C(x1)))) -> c(c(c(x1))) C(C(C(a(x1)))) -> c(c(c(B(x1)))) C(b(b(b(x1)))) -> a(B(B(B(x1)))) C(c(x1)) -> x1 a(A(x1)) -> x1 a(a(a(a(x1)))) -> A(A(A(x1))) a(b(x1)) -> C(x1) b(B(x1)) -> x1 b(b(b(b(x1)))) -> B(B(B(x1))) b(c(x1)) -> A(x1) c(C(x1)) -> x1 c(a(x1)) -> B(x1) c(c(c(c(x1)))) -> C(C(C(x1))) Problem 1: Reduction Pair Processor: -> Pairs: A#(c(c(c(x1)))) -> C#(x1) A#(c(c(c(x1)))) -> B(C(C(C(x1)))) B#(A(x1)) -> C(x1) B#(B(B(B(x1)))) -> B(b(b(x1))) B#(B(B(B(x1)))) -> B(b(x1)) B#(B(B(B(x1)))) -> B(x1) B#(B(B(c(x1)))) -> A#(x1) B#(B(B(c(x1)))) -> B(A(x1)) B#(B(B(c(x1)))) -> B(b(A(x1))) B#(B(B(c(x1)))) -> B(b(b(A(x1)))) B#(a(a(a(x1)))) -> A#(A(A(x1))) B#(a(a(a(x1)))) -> A#(A(x1)) B#(a(a(a(x1)))) -> A#(x1) B#(a(a(a(x1)))) -> C(A(A(A(x1)))) C#(B(x1)) -> A(x1) C#(C(C(C(x1)))) -> C(c(c(x1))) C#(C(C(C(x1)))) -> C(c(x1)) C#(C(C(C(x1)))) -> C(x1) C#(C(C(a(x1)))) -> B#(x1) C#(C(C(a(x1)))) -> C(B(x1)) C#(C(C(a(x1)))) -> C(c(B(x1))) C#(C(C(a(x1)))) -> C(c(c(B(x1)))) C#(b(b(b(x1)))) -> B#(B(B(x1))) C#(b(b(b(x1)))) -> B#(B(x1)) C#(b(b(b(x1)))) -> B#(x1) C#(b(b(b(x1)))) -> A(B(B(B(x1)))) A(a(a(a(x1)))) -> A#(A(A(x1))) A(a(a(a(x1)))) -> A#(A(x1)) A(a(a(a(x1)))) -> A#(x1) A(b(x1)) -> C#(x1) B(b(b(b(x1)))) -> B#(B(B(x1))) B(b(b(b(x1)))) -> B#(B(x1)) B(b(b(b(x1)))) -> B#(x1) B(c(x1)) -> A#(x1) C(a(x1)) -> B#(x1) C(c(c(c(x1)))) -> C#(C(C(x1))) C(c(c(c(x1)))) -> C#(C(x1)) C(c(c(c(x1)))) -> C#(x1) -> Rules: A(A(A(A(x1)))) -> a(a(a(x1))) A(A(A(b(x1)))) -> a(a(a(C(x1)))) A(C(x1)) -> b(x1) A(a(x1)) -> x1 A(c(c(c(x1)))) -> b(C(C(C(x1)))) B(A(x1)) -> c(x1) B(B(B(B(x1)))) -> b(b(b(x1))) B(B(B(c(x1)))) -> b(b(b(A(x1)))) B(a(a(a(x1)))) -> c(A(A(A(x1)))) B(b(x1)) -> x1 C(B(x1)) -> a(x1) C(C(C(C(x1)))) -> c(c(c(x1))) C(C(C(a(x1)))) -> c(c(c(B(x1)))) C(b(b(b(x1)))) -> a(B(B(B(x1)))) C(c(x1)) -> x1 a(A(x1)) -> x1 a(a(a(a(x1)))) -> A(A(A(x1))) a(b(x1)) -> C(x1) b(B(x1)) -> x1 b(b(b(b(x1)))) -> B(B(B(x1))) b(c(x1)) -> A(x1) c(C(x1)) -> x1 c(a(x1)) -> B(x1) c(c(c(c(x1)))) -> C(C(C(x1))) -> Usable rules: A(A(A(A(x1)))) -> a(a(a(x1))) A(A(A(b(x1)))) -> a(a(a(C(x1)))) A(C(x1)) -> b(x1) A(a(x1)) -> x1 A(c(c(c(x1)))) -> b(C(C(C(x1)))) B(A(x1)) -> c(x1) B(B(B(B(x1)))) -> b(b(b(x1))) B(B(B(c(x1)))) -> b(b(b(A(x1)))) B(a(a(a(x1)))) -> c(A(A(A(x1)))) B(b(x1)) -> x1 C(B(x1)) -> a(x1) C(C(C(C(x1)))) -> c(c(c(x1))) C(C(C(a(x1)))) -> c(c(c(B(x1)))) C(b(b(b(x1)))) -> a(B(B(B(x1)))) C(c(x1)) -> x1 a(A(x1)) -> x1 a(a(a(a(x1)))) -> A(A(A(x1))) a(b(x1)) -> C(x1) b(B(x1)) -> x1 b(b(b(b(x1)))) -> B(B(B(x1))) b(c(x1)) -> A(x1) c(C(x1)) -> x1 c(a(x1)) -> B(x1) c(c(c(c(x1)))) -> C(C(C(x1))) ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [A](X) = 2.X + 2 [B](X) = 2.X + 2 [C](X) = 2.X + 2 [a](X) = 2.X + 2 [b](X) = 2.X + 2 [c](X) = 2.X + 2 [A#](X) = 2.X + 1 [B#](X) = 2.X + 2 [C#](X) = 2.X + 2 [A](X) = 2.X + 1 [B](X) = 2.X + 1 [C](X) = 2.X Problem 1: SCC Processor: -> Pairs: A#(c(c(c(x1)))) -> B(C(C(C(x1)))) B#(A(x1)) -> C(x1) B#(B(B(B(x1)))) -> B(b(b(x1))) B#(B(B(B(x1)))) -> B(b(x1)) B#(B(B(B(x1)))) -> B(x1) B#(B(B(c(x1)))) -> A#(x1) B#(B(B(c(x1)))) -> B(A(x1)) B#(B(B(c(x1)))) -> B(b(A(x1))) B#(B(B(c(x1)))) -> B(b(b(A(x1)))) B#(a(a(a(x1)))) -> A#(A(A(x1))) B#(a(a(a(x1)))) -> A#(A(x1)) B#(a(a(a(x1)))) -> A#(x1) B#(a(a(a(x1)))) -> C(A(A(A(x1)))) C#(B(x1)) -> A(x1) C#(C(C(C(x1)))) -> C(c(c(x1))) C#(C(C(C(x1)))) -> C(c(x1)) C#(C(C(C(x1)))) -> C(x1) C#(C(C(a(x1)))) -> B#(x1) C#(C(C(a(x1)))) -> C(B(x1)) C#(C(C(a(x1)))) -> C(c(B(x1))) C#(C(C(a(x1)))) -> C(c(c(B(x1)))) C#(b(b(b(x1)))) -> B#(B(B(x1))) C#(b(b(b(x1)))) -> B#(B(x1)) C#(b(b(b(x1)))) -> B#(x1) C#(b(b(b(x1)))) -> A(B(B(B(x1)))) A(a(a(a(x1)))) -> A#(A(A(x1))) A(a(a(a(x1)))) -> A#(A(x1)) A(a(a(a(x1)))) -> A#(x1) A(b(x1)) -> C#(x1) B(b(b(b(x1)))) -> B#(B(B(x1))) B(b(b(b(x1)))) -> B#(B(x1)) B(b(b(b(x1)))) -> B#(x1) B(c(x1)) -> A#(x1) C(a(x1)) -> B#(x1) C(c(c(c(x1)))) -> C#(C(C(x1))) C(c(c(c(x1)))) -> C#(C(x1)) C(c(c(c(x1)))) -> C#(x1) -> Rules: A(A(A(A(x1)))) -> a(a(a(x1))) A(A(A(b(x1)))) -> a(a(a(C(x1)))) A(C(x1)) -> b(x1) A(a(x1)) -> x1 A(c(c(c(x1)))) -> b(C(C(C(x1)))) B(A(x1)) -> c(x1) B(B(B(B(x1)))) -> b(b(b(x1))) B(B(B(c(x1)))) -> b(b(b(A(x1)))) B(a(a(a(x1)))) -> c(A(A(A(x1)))) B(b(x1)) -> x1 C(B(x1)) -> a(x1) C(C(C(C(x1)))) -> c(c(c(x1))) C(C(C(a(x1)))) -> c(c(c(B(x1)))) C(b(b(b(x1)))) -> a(B(B(B(x1)))) C(c(x1)) -> x1 a(A(x1)) -> x1 a(a(a(a(x1)))) -> A(A(A(x1))) a(b(x1)) -> C(x1) b(B(x1)) -> x1 b(b(b(b(x1)))) -> B(B(B(x1))) b(c(x1)) -> A(x1) c(C(x1)) -> x1 c(a(x1)) -> B(x1) c(c(c(c(x1)))) -> C(C(C(x1))) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: A#(c(c(c(x1)))) -> B(C(C(C(x1)))) B#(A(x1)) -> C(x1) B#(B(B(B(x1)))) -> B(b(b(x1))) B#(B(B(B(x1)))) -> B(b(x1)) B#(B(B(B(x1)))) -> B(x1) B#(B(B(c(x1)))) -> A#(x1) B#(B(B(c(x1)))) -> B(A(x1)) B#(B(B(c(x1)))) -> B(b(A(x1))) B#(B(B(c(x1)))) -> B(b(b(A(x1)))) B#(a(a(a(x1)))) -> A#(A(A(x1))) B#(a(a(a(x1)))) -> A#(A(x1)) B#(a(a(a(x1)))) -> A#(x1) B#(a(a(a(x1)))) -> C(A(A(A(x1)))) C#(B(x1)) -> A(x1) C#(C(C(C(x1)))) -> C(c(c(x1))) C#(C(C(C(x1)))) -> C(c(x1)) C#(C(C(C(x1)))) -> C(x1) C#(C(C(a(x1)))) -> B#(x1) C#(C(C(a(x1)))) -> C(B(x1)) C#(C(C(a(x1)))) -> C(c(B(x1))) C#(C(C(a(x1)))) -> C(c(c(B(x1)))) C#(b(b(b(x1)))) -> B#(B(B(x1))) C#(b(b(b(x1)))) -> B#(B(x1)) C#(b(b(b(x1)))) -> B#(x1) C#(b(b(b(x1)))) -> A(B(B(B(x1)))) A(a(a(a(x1)))) -> A#(A(A(x1))) A(a(a(a(x1)))) -> A#(A(x1)) A(a(a(a(x1)))) -> A#(x1) A(b(x1)) -> C#(x1) B(b(b(b(x1)))) -> B#(B(B(x1))) B(b(b(b(x1)))) -> B#(B(x1)) B(b(b(b(x1)))) -> B#(x1) B(c(x1)) -> A#(x1) C(a(x1)) -> B#(x1) C(c(c(c(x1)))) -> C#(C(C(x1))) C(c(c(c(x1)))) -> C#(C(x1)) C(c(c(c(x1)))) -> C#(x1) ->->-> Rules: A(A(A(A(x1)))) -> a(a(a(x1))) A(A(A(b(x1)))) -> a(a(a(C(x1)))) A(C(x1)) -> b(x1) A(a(x1)) -> x1 A(c(c(c(x1)))) -> b(C(C(C(x1)))) B(A(x1)) -> c(x1) B(B(B(B(x1)))) -> b(b(b(x1))) B(B(B(c(x1)))) -> b(b(b(A(x1)))) B(a(a(a(x1)))) -> c(A(A(A(x1)))) B(b(x1)) -> x1 C(B(x1)) -> a(x1) C(C(C(C(x1)))) -> c(c(c(x1))) C(C(C(a(x1)))) -> c(c(c(B(x1)))) C(b(b(b(x1)))) -> a(B(B(B(x1)))) C(c(x1)) -> x1 a(A(x1)) -> x1 a(a(a(a(x1)))) -> A(A(A(x1))) a(b(x1)) -> C(x1) b(B(x1)) -> x1 b(b(b(b(x1)))) -> B(B(B(x1))) b(c(x1)) -> A(x1) c(C(x1)) -> x1 c(a(x1)) -> B(x1) c(c(c(c(x1)))) -> C(C(C(x1))) Problem 1: Reduction Pair Processor: -> Pairs: A#(c(c(c(x1)))) -> B(C(C(C(x1)))) B#(A(x1)) -> C(x1) B#(B(B(B(x1)))) -> B(b(b(x1))) B#(B(B(B(x1)))) -> B(b(x1)) B#(B(B(B(x1)))) -> B(x1) B#(B(B(c(x1)))) -> A#(x1) B#(B(B(c(x1)))) -> B(A(x1)) B#(B(B(c(x1)))) -> B(b(A(x1))) B#(B(B(c(x1)))) -> B(b(b(A(x1)))) B#(a(a(a(x1)))) -> A#(A(A(x1))) B#(a(a(a(x1)))) -> A#(A(x1)) B#(a(a(a(x1)))) -> A#(x1) B#(a(a(a(x1)))) -> C(A(A(A(x1)))) C#(B(x1)) -> A(x1) C#(C(C(C(x1)))) -> C(c(c(x1))) C#(C(C(C(x1)))) -> C(c(x1)) C#(C(C(C(x1)))) -> C(x1) C#(C(C(a(x1)))) -> B#(x1) C#(C(C(a(x1)))) -> C(B(x1)) C#(C(C(a(x1)))) -> C(c(B(x1))) C#(C(C(a(x1)))) -> C(c(c(B(x1)))) C#(b(b(b(x1)))) -> B#(B(B(x1))) C#(b(b(b(x1)))) -> B#(B(x1)) C#(b(b(b(x1)))) -> B#(x1) C#(b(b(b(x1)))) -> A(B(B(B(x1)))) A(a(a(a(x1)))) -> A#(A(A(x1))) A(a(a(a(x1)))) -> A#(A(x1)) A(a(a(a(x1)))) -> A#(x1) A(b(x1)) -> C#(x1) B(b(b(b(x1)))) -> B#(B(B(x1))) B(b(b(b(x1)))) -> B#(B(x1)) B(b(b(b(x1)))) -> B#(x1) B(c(x1)) -> A#(x1) C(a(x1)) -> B#(x1) C(c(c(c(x1)))) -> C#(C(C(x1))) C(c(c(c(x1)))) -> C#(C(x1)) C(c(c(c(x1)))) -> C#(x1) -> Rules: A(A(A(A(x1)))) -> a(a(a(x1))) A(A(A(b(x1)))) -> a(a(a(C(x1)))) A(C(x1)) -> b(x1) A(a(x1)) -> x1 A(c(c(c(x1)))) -> b(C(C(C(x1)))) B(A(x1)) -> c(x1) B(B(B(B(x1)))) -> b(b(b(x1))) B(B(B(c(x1)))) -> b(b(b(A(x1)))) B(a(a(a(x1)))) -> c(A(A(A(x1)))) B(b(x1)) -> x1 C(B(x1)) -> a(x1) C(C(C(C(x1)))) -> c(c(c(x1))) C(C(C(a(x1)))) -> c(c(c(B(x1)))) C(b(b(b(x1)))) -> a(B(B(B(x1)))) C(c(x1)) -> x1 a(A(x1)) -> x1 a(a(a(a(x1)))) -> A(A(A(x1))) a(b(x1)) -> C(x1) b(B(x1)) -> x1 b(b(b(b(x1)))) -> B(B(B(x1))) b(c(x1)) -> A(x1) c(C(x1)) -> x1 c(a(x1)) -> B(x1) c(c(c(c(x1)))) -> C(C(C(x1))) -> Usable rules: A(A(A(A(x1)))) -> a(a(a(x1))) A(A(A(b(x1)))) -> a(a(a(C(x1)))) A(C(x1)) -> b(x1) A(a(x1)) -> x1 A(c(c(c(x1)))) -> b(C(C(C(x1)))) B(A(x1)) -> c(x1) B(B(B(B(x1)))) -> b(b(b(x1))) B(B(B(c(x1)))) -> b(b(b(A(x1)))) B(a(a(a(x1)))) -> c(A(A(A(x1)))) B(b(x1)) -> x1 C(B(x1)) -> a(x1) C(C(C(C(x1)))) -> c(c(c(x1))) C(C(C(a(x1)))) -> c(c(c(B(x1)))) C(b(b(b(x1)))) -> a(B(B(B(x1)))) C(c(x1)) -> x1 a(A(x1)) -> x1 a(a(a(a(x1)))) -> A(A(A(x1))) a(b(x1)) -> C(x1) b(B(x1)) -> x1 b(b(b(b(x1)))) -> B(B(B(x1))) b(c(x1)) -> A(x1) c(C(x1)) -> x1 c(a(x1)) -> B(x1) c(c(c(c(x1)))) -> C(C(C(x1))) ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [A](X) = 2.X + 2 [B](X) = 2.X + 2 [C](X) = 2.X + 2 [a](X) = 2.X + 2 [b](X) = 2.X + 2 [c](X) = 2.X + 2 [A#](X) = 2.X [B#](X) = 2.X + 1 [C#](X) = 2.X + 2 [A](X) = 2.X + 2 [B](X) = X + 2 [C](X) = 2.X Problem 1: SCC Processor: -> Pairs: B#(A(x1)) -> C(x1) B#(B(B(B(x1)))) -> B(b(b(x1))) B#(B(B(B(x1)))) -> B(b(x1)) B#(B(B(B(x1)))) -> B(x1) B#(B(B(c(x1)))) -> A#(x1) B#(B(B(c(x1)))) -> B(A(x1)) B#(B(B(c(x1)))) -> B(b(A(x1))) B#(B(B(c(x1)))) -> B(b(b(A(x1)))) B#(a(a(a(x1)))) -> A#(A(A(x1))) B#(a(a(a(x1)))) -> A#(A(x1)) B#(a(a(a(x1)))) -> A#(x1) B#(a(a(a(x1)))) -> C(A(A(A(x1)))) C#(B(x1)) -> A(x1) C#(C(C(C(x1)))) -> C(c(c(x1))) C#(C(C(C(x1)))) -> C(c(x1)) C#(C(C(C(x1)))) -> C(x1) C#(C(C(a(x1)))) -> B#(x1) C#(C(C(a(x1)))) -> C(B(x1)) C#(C(C(a(x1)))) -> C(c(B(x1))) C#(C(C(a(x1)))) -> C(c(c(B(x1)))) C#(b(b(b(x1)))) -> B#(B(B(x1))) C#(b(b(b(x1)))) -> B#(B(x1)) C#(b(b(b(x1)))) -> B#(x1) C#(b(b(b(x1)))) -> A(B(B(B(x1)))) A(a(a(a(x1)))) -> A#(A(A(x1))) A(a(a(a(x1)))) -> A#(A(x1)) A(a(a(a(x1)))) -> A#(x1) A(b(x1)) -> C#(x1) B(b(b(b(x1)))) -> B#(B(B(x1))) B(b(b(b(x1)))) -> B#(B(x1)) B(b(b(b(x1)))) -> B#(x1) B(c(x1)) -> A#(x1) C(a(x1)) -> B#(x1) C(c(c(c(x1)))) -> C#(C(C(x1))) C(c(c(c(x1)))) -> C#(C(x1)) C(c(c(c(x1)))) -> C#(x1) -> Rules: A(A(A(A(x1)))) -> a(a(a(x1))) A(A(A(b(x1)))) -> a(a(a(C(x1)))) A(C(x1)) -> b(x1) A(a(x1)) -> x1 A(c(c(c(x1)))) -> b(C(C(C(x1)))) B(A(x1)) -> c(x1) B(B(B(B(x1)))) -> b(b(b(x1))) B(B(B(c(x1)))) -> b(b(b(A(x1)))) B(a(a(a(x1)))) -> c(A(A(A(x1)))) B(b(x1)) -> x1 C(B(x1)) -> a(x1) C(C(C(C(x1)))) -> c(c(c(x1))) C(C(C(a(x1)))) -> c(c(c(B(x1)))) C(b(b(b(x1)))) -> a(B(B(B(x1)))) C(c(x1)) -> x1 a(A(x1)) -> x1 a(a(a(a(x1)))) -> A(A(A(x1))) a(b(x1)) -> C(x1) b(B(x1)) -> x1 b(b(b(b(x1)))) -> B(B(B(x1))) b(c(x1)) -> A(x1) c(C(x1)) -> x1 c(a(x1)) -> B(x1) c(c(c(c(x1)))) -> C(C(C(x1))) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: B#(A(x1)) -> C(x1) B#(B(B(B(x1)))) -> B(b(b(x1))) B#(B(B(B(x1)))) -> B(b(x1)) B#(B(B(B(x1)))) -> B(x1) B#(B(B(c(x1)))) -> B(A(x1)) B#(B(B(c(x1)))) -> B(b(A(x1))) B#(B(B(c(x1)))) -> B(b(b(A(x1)))) B#(a(a(a(x1)))) -> C(A(A(A(x1)))) C#(B(x1)) -> A(x1) C#(C(C(C(x1)))) -> C(c(c(x1))) C#(C(C(C(x1)))) -> C(c(x1)) C#(C(C(C(x1)))) -> C(x1) C#(C(C(a(x1)))) -> B#(x1) C#(C(C(a(x1)))) -> C(B(x1)) C#(C(C(a(x1)))) -> C(c(B(x1))) C#(C(C(a(x1)))) -> C(c(c(B(x1)))) C#(b(b(b(x1)))) -> B#(B(B(x1))) C#(b(b(b(x1)))) -> B#(B(x1)) C#(b(b(b(x1)))) -> B#(x1) C#(b(b(b(x1)))) -> A(B(B(B(x1)))) A(b(x1)) -> C#(x1) B(b(b(b(x1)))) -> B#(B(B(x1))) B(b(b(b(x1)))) -> B#(B(x1)) B(b(b(b(x1)))) -> B#(x1) C(a(x1)) -> B#(x1) C(c(c(c(x1)))) -> C#(C(C(x1))) C(c(c(c(x1)))) -> C#(C(x1)) C(c(c(c(x1)))) -> C#(x1) ->->-> Rules: A(A(A(A(x1)))) -> a(a(a(x1))) A(A(A(b(x1)))) -> a(a(a(C(x1)))) A(C(x1)) -> b(x1) A(a(x1)) -> x1 A(c(c(c(x1)))) -> b(C(C(C(x1)))) B(A(x1)) -> c(x1) B(B(B(B(x1)))) -> b(b(b(x1))) B(B(B(c(x1)))) -> b(b(b(A(x1)))) B(a(a(a(x1)))) -> c(A(A(A(x1)))) B(b(x1)) -> x1 C(B(x1)) -> a(x1) C(C(C(C(x1)))) -> c(c(c(x1))) C(C(C(a(x1)))) -> c(c(c(B(x1)))) C(b(b(b(x1)))) -> a(B(B(B(x1)))) C(c(x1)) -> x1 a(A(x1)) -> x1 a(a(a(a(x1)))) -> A(A(A(x1))) a(b(x1)) -> C(x1) b(B(x1)) -> x1 b(b(b(b(x1)))) -> B(B(B(x1))) b(c(x1)) -> A(x1) c(C(x1)) -> x1 c(a(x1)) -> B(x1) c(c(c(c(x1)))) -> C(C(C(x1))) Problem 1: Reduction Pair Processor: -> Pairs: B#(A(x1)) -> C(x1) B#(B(B(B(x1)))) -> B(b(b(x1))) B#(B(B(B(x1)))) -> B(b(x1)) B#(B(B(B(x1)))) -> B(x1) B#(B(B(c(x1)))) -> B(A(x1)) B#(B(B(c(x1)))) -> B(b(A(x1))) B#(B(B(c(x1)))) -> B(b(b(A(x1)))) B#(a(a(a(x1)))) -> C(A(A(A(x1)))) C#(B(x1)) -> A(x1) C#(C(C(C(x1)))) -> C(c(c(x1))) C#(C(C(C(x1)))) -> C(c(x1)) C#(C(C(C(x1)))) -> C(x1) C#(C(C(a(x1)))) -> B#(x1) C#(C(C(a(x1)))) -> C(B(x1)) C#(C(C(a(x1)))) -> C(c(B(x1))) C#(C(C(a(x1)))) -> C(c(c(B(x1)))) C#(b(b(b(x1)))) -> B#(B(B(x1))) C#(b(b(b(x1)))) -> B#(B(x1)) C#(b(b(b(x1)))) -> B#(x1) C#(b(b(b(x1)))) -> A(B(B(B(x1)))) A(b(x1)) -> C#(x1) B(b(b(b(x1)))) -> B#(B(B(x1))) B(b(b(b(x1)))) -> B#(B(x1)) B(b(b(b(x1)))) -> B#(x1) C(a(x1)) -> B#(x1) C(c(c(c(x1)))) -> C#(C(C(x1))) C(c(c(c(x1)))) -> C#(C(x1)) C(c(c(c(x1)))) -> C#(x1) -> Rules: A(A(A(A(x1)))) -> a(a(a(x1))) A(A(A(b(x1)))) -> a(a(a(C(x1)))) A(C(x1)) -> b(x1) A(a(x1)) -> x1 A(c(c(c(x1)))) -> b(C(C(C(x1)))) B(A(x1)) -> c(x1) B(B(B(B(x1)))) -> b(b(b(x1))) B(B(B(c(x1)))) -> b(b(b(A(x1)))) B(a(a(a(x1)))) -> c(A(A(A(x1)))) B(b(x1)) -> x1 C(B(x1)) -> a(x1) C(C(C(C(x1)))) -> c(c(c(x1))) C(C(C(a(x1)))) -> c(c(c(B(x1)))) C(b(b(b(x1)))) -> a(B(B(B(x1)))) C(c(x1)) -> x1 a(A(x1)) -> x1 a(a(a(a(x1)))) -> A(A(A(x1))) a(b(x1)) -> C(x1) b(B(x1)) -> x1 b(b(b(b(x1)))) -> B(B(B(x1))) b(c(x1)) -> A(x1) c(C(x1)) -> x1 c(a(x1)) -> B(x1) c(c(c(c(x1)))) -> C(C(C(x1))) -> Usable rules: A(A(A(A(x1)))) -> a(a(a(x1))) A(A(A(b(x1)))) -> a(a(a(C(x1)))) A(C(x1)) -> b(x1) A(a(x1)) -> x1 A(c(c(c(x1)))) -> b(C(C(C(x1)))) B(A(x1)) -> c(x1) B(B(B(B(x1)))) -> b(b(b(x1))) B(B(B(c(x1)))) -> b(b(b(A(x1)))) B(a(a(a(x1)))) -> c(A(A(A(x1)))) B(b(x1)) -> x1 C(B(x1)) -> a(x1) C(C(C(C(x1)))) -> c(c(c(x1))) C(C(C(a(x1)))) -> c(c(c(B(x1)))) C(b(b(b(x1)))) -> a(B(B(B(x1)))) C(c(x1)) -> x1 a(A(x1)) -> x1 a(a(a(a(x1)))) -> A(A(A(x1))) a(b(x1)) -> C(x1) b(B(x1)) -> x1 b(b(b(b(x1)))) -> B(B(B(x1))) b(c(x1)) -> A(x1) c(C(x1)) -> x1 c(a(x1)) -> B(x1) c(c(c(c(x1)))) -> C(C(C(x1))) ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [A](X) = 2.X + 2 [B](X) = 2.X + 2 [C](X) = 2.X + 2 [a](X) = 2.X + 2 [b](X) = 2.X + 2 [c](X) = 2.X + 2 [B#](X) = 2.X + 2 [C#](X) = 2.X + 1 [A](X) = 2.X + 1 [B](X) = 2.X + 2 [C](X) = X + 2 Problem 1: SCC Processor: -> Pairs: B#(B(B(B(x1)))) -> B(b(b(x1))) B#(B(B(B(x1)))) -> B(b(x1)) B#(B(B(B(x1)))) -> B(x1) B#(B(B(c(x1)))) -> B(A(x1)) B#(B(B(c(x1)))) -> B(b(A(x1))) B#(B(B(c(x1)))) -> B(b(b(A(x1)))) B#(a(a(a(x1)))) -> C(A(A(A(x1)))) C#(B(x1)) -> A(x1) C#(C(C(C(x1)))) -> C(c(c(x1))) C#(C(C(C(x1)))) -> C(c(x1)) C#(C(C(C(x1)))) -> C(x1) C#(C(C(a(x1)))) -> B#(x1) C#(C(C(a(x1)))) -> C(B(x1)) C#(C(C(a(x1)))) -> C(c(B(x1))) C#(C(C(a(x1)))) -> C(c(c(B(x1)))) C#(b(b(b(x1)))) -> B#(B(B(x1))) C#(b(b(b(x1)))) -> B#(B(x1)) C#(b(b(b(x1)))) -> B#(x1) C#(b(b(b(x1)))) -> A(B(B(B(x1)))) A(b(x1)) -> C#(x1) B(b(b(b(x1)))) -> B#(B(B(x1))) B(b(b(b(x1)))) -> B#(B(x1)) B(b(b(b(x1)))) -> B#(x1) C(a(x1)) -> B#(x1) C(c(c(c(x1)))) -> C#(C(C(x1))) C(c(c(c(x1)))) -> C#(C(x1)) C(c(c(c(x1)))) -> C#(x1) -> Rules: A(A(A(A(x1)))) -> a(a(a(x1))) A(A(A(b(x1)))) -> a(a(a(C(x1)))) A(C(x1)) -> b(x1) A(a(x1)) -> x1 A(c(c(c(x1)))) -> b(C(C(C(x1)))) B(A(x1)) -> c(x1) B(B(B(B(x1)))) -> b(b(b(x1))) B(B(B(c(x1)))) -> b(b(b(A(x1)))) B(a(a(a(x1)))) -> c(A(A(A(x1)))) B(b(x1)) -> x1 C(B(x1)) -> a(x1) C(C(C(C(x1)))) -> c(c(c(x1))) C(C(C(a(x1)))) -> c(c(c(B(x1)))) C(b(b(b(x1)))) -> a(B(B(B(x1)))) C(c(x1)) -> x1 a(A(x1)) -> x1 a(a(a(a(x1)))) -> A(A(A(x1))) a(b(x1)) -> C(x1) b(B(x1)) -> x1 b(b(b(b(x1)))) -> B(B(B(x1))) b(c(x1)) -> A(x1) c(C(x1)) -> x1 c(a(x1)) -> B(x1) c(c(c(c(x1)))) -> C(C(C(x1))) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: B#(B(B(B(x1)))) -> B(b(b(x1))) B#(B(B(B(x1)))) -> B(b(x1)) B#(B(B(B(x1)))) -> B(x1) B#(B(B(c(x1)))) -> B(A(x1)) B#(B(B(c(x1)))) -> B(b(A(x1))) B#(B(B(c(x1)))) -> B(b(b(A(x1)))) B#(a(a(a(x1)))) -> C(A(A(A(x1)))) C#(B(x1)) -> A(x1) C#(C(C(C(x1)))) -> C(c(c(x1))) C#(C(C(C(x1)))) -> C(c(x1)) C#(C(C(C(x1)))) -> C(x1) C#(C(C(a(x1)))) -> B#(x1) C#(C(C(a(x1)))) -> C(B(x1)) C#(C(C(a(x1)))) -> C(c(B(x1))) C#(C(C(a(x1)))) -> C(c(c(B(x1)))) C#(b(b(b(x1)))) -> B#(B(B(x1))) C#(b(b(b(x1)))) -> B#(B(x1)) C#(b(b(b(x1)))) -> B#(x1) C#(b(b(b(x1)))) -> A(B(B(B(x1)))) A(b(x1)) -> C#(x1) B(b(b(b(x1)))) -> B#(B(B(x1))) B(b(b(b(x1)))) -> B#(B(x1)) B(b(b(b(x1)))) -> B#(x1) C(a(x1)) -> B#(x1) C(c(c(c(x1)))) -> C#(C(C(x1))) C(c(c(c(x1)))) -> C#(C(x1)) C(c(c(c(x1)))) -> C#(x1) ->->-> Rules: A(A(A(A(x1)))) -> a(a(a(x1))) A(A(A(b(x1)))) -> a(a(a(C(x1)))) A(C(x1)) -> b(x1) A(a(x1)) -> x1 A(c(c(c(x1)))) -> b(C(C(C(x1)))) B(A(x1)) -> c(x1) B(B(B(B(x1)))) -> b(b(b(x1))) B(B(B(c(x1)))) -> b(b(b(A(x1)))) B(a(a(a(x1)))) -> c(A(A(A(x1)))) B(b(x1)) -> x1 C(B(x1)) -> a(x1) C(C(C(C(x1)))) -> c(c(c(x1))) C(C(C(a(x1)))) -> c(c(c(B(x1)))) C(b(b(b(x1)))) -> a(B(B(B(x1)))) C(c(x1)) -> x1 a(A(x1)) -> x1 a(a(a(a(x1)))) -> A(A(A(x1))) a(b(x1)) -> C(x1) b(B(x1)) -> x1 b(b(b(b(x1)))) -> B(B(B(x1))) b(c(x1)) -> A(x1) c(C(x1)) -> x1 c(a(x1)) -> B(x1) c(c(c(c(x1)))) -> C(C(C(x1))) Problem 1: Reduction Pair Processor: -> Pairs: B#(B(B(B(x1)))) -> B(b(b(x1))) B#(B(B(B(x1)))) -> B(b(x1)) B#(B(B(B(x1)))) -> B(x1) B#(B(B(c(x1)))) -> B(A(x1)) B#(B(B(c(x1)))) -> B(b(A(x1))) B#(B(B(c(x1)))) -> B(b(b(A(x1)))) B#(a(a(a(x1)))) -> C(A(A(A(x1)))) C#(B(x1)) -> A(x1) C#(C(C(C(x1)))) -> C(c(c(x1))) C#(C(C(C(x1)))) -> C(c(x1)) C#(C(C(C(x1)))) -> C(x1) C#(C(C(a(x1)))) -> B#(x1) C#(C(C(a(x1)))) -> C(B(x1)) C#(C(C(a(x1)))) -> C(c(B(x1))) C#(C(C(a(x1)))) -> C(c(c(B(x1)))) C#(b(b(b(x1)))) -> B#(B(B(x1))) C#(b(b(b(x1)))) -> B#(B(x1)) C#(b(b(b(x1)))) -> B#(x1) C#(b(b(b(x1)))) -> A(B(B(B(x1)))) A(b(x1)) -> C#(x1) B(b(b(b(x1)))) -> B#(B(B(x1))) B(b(b(b(x1)))) -> B#(B(x1)) B(b(b(b(x1)))) -> B#(x1) C(a(x1)) -> B#(x1) C(c(c(c(x1)))) -> C#(C(C(x1))) C(c(c(c(x1)))) -> C#(C(x1)) C(c(c(c(x1)))) -> C#(x1) -> Rules: A(A(A(A(x1)))) -> a(a(a(x1))) A(A(A(b(x1)))) -> a(a(a(C(x1)))) A(C(x1)) -> b(x1) A(a(x1)) -> x1 A(c(c(c(x1)))) -> b(C(C(C(x1)))) B(A(x1)) -> c(x1) B(B(B(B(x1)))) -> b(b(b(x1))) B(B(B(c(x1)))) -> b(b(b(A(x1)))) B(a(a(a(x1)))) -> c(A(A(A(x1)))) B(b(x1)) -> x1 C(B(x1)) -> a(x1) C(C(C(C(x1)))) -> c(c(c(x1))) C(C(C(a(x1)))) -> c(c(c(B(x1)))) C(b(b(b(x1)))) -> a(B(B(B(x1)))) C(c(x1)) -> x1 a(A(x1)) -> x1 a(a(a(a(x1)))) -> A(A(A(x1))) a(b(x1)) -> C(x1) b(B(x1)) -> x1 b(b(b(b(x1)))) -> B(B(B(x1))) b(c(x1)) -> A(x1) c(C(x1)) -> x1 c(a(x1)) -> B(x1) c(c(c(c(x1)))) -> C(C(C(x1))) -> Usable rules: A(A(A(A(x1)))) -> a(a(a(x1))) A(A(A(b(x1)))) -> a(a(a(C(x1)))) A(C(x1)) -> b(x1) A(a(x1)) -> x1 A(c(c(c(x1)))) -> b(C(C(C(x1)))) B(A(x1)) -> c(x1) B(B(B(B(x1)))) -> b(b(b(x1))) B(B(B(c(x1)))) -> b(b(b(A(x1)))) B(a(a(a(x1)))) -> c(A(A(A(x1)))) B(b(x1)) -> x1 C(B(x1)) -> a(x1) C(C(C(C(x1)))) -> c(c(c(x1))) C(C(C(a(x1)))) -> c(c(c(B(x1)))) C(b(b(b(x1)))) -> a(B(B(B(x1)))) C(c(x1)) -> x1 a(A(x1)) -> x1 a(a(a(a(x1)))) -> A(A(A(x1))) a(b(x1)) -> C(x1) b(B(x1)) -> x1 b(b(b(b(x1)))) -> B(B(B(x1))) b(c(x1)) -> A(x1) c(C(x1)) -> x1 c(a(x1)) -> B(x1) c(c(c(c(x1)))) -> C(C(C(x1))) ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [A](X) = 2.X + 2 [B](X) = 2.X + 2 [C](X) = 2.X + 2 [a](X) = 2.X + 2 [b](X) = 2.X + 2 [c](X) = 2.X + 2 [B#](X) = 2.X [C#](X) = 2.X + 2 [A](X) = X [B](X) = 2.X [C](X) = 2.X Problem 1: SCC Processor: -> Pairs: B#(B(B(B(x1)))) -> B(b(x1)) B#(B(B(B(x1)))) -> B(x1) B#(B(B(c(x1)))) -> B(A(x1)) B#(B(B(c(x1)))) -> B(b(A(x1))) B#(B(B(c(x1)))) -> B(b(b(A(x1)))) B#(a(a(a(x1)))) -> C(A(A(A(x1)))) C#(B(x1)) -> A(x1) C#(C(C(C(x1)))) -> C(c(c(x1))) C#(C(C(C(x1)))) -> C(c(x1)) C#(C(C(C(x1)))) -> C(x1) C#(C(C(a(x1)))) -> B#(x1) C#(C(C(a(x1)))) -> C(B(x1)) C#(C(C(a(x1)))) -> C(c(B(x1))) C#(C(C(a(x1)))) -> C(c(c(B(x1)))) C#(b(b(b(x1)))) -> B#(B(B(x1))) C#(b(b(b(x1)))) -> B#(B(x1)) C#(b(b(b(x1)))) -> B#(x1) C#(b(b(b(x1)))) -> A(B(B(B(x1)))) A(b(x1)) -> C#(x1) B(b(b(b(x1)))) -> B#(B(B(x1))) B(b(b(b(x1)))) -> B#(B(x1)) B(b(b(b(x1)))) -> B#(x1) C(a(x1)) -> B#(x1) C(c(c(c(x1)))) -> C#(C(C(x1))) C(c(c(c(x1)))) -> C#(C(x1)) C(c(c(c(x1)))) -> C#(x1) -> Rules: A(A(A(A(x1)))) -> a(a(a(x1))) A(A(A(b(x1)))) -> a(a(a(C(x1)))) A(C(x1)) -> b(x1) A(a(x1)) -> x1 A(c(c(c(x1)))) -> b(C(C(C(x1)))) B(A(x1)) -> c(x1) B(B(B(B(x1)))) -> b(b(b(x1))) B(B(B(c(x1)))) -> b(b(b(A(x1)))) B(a(a(a(x1)))) -> c(A(A(A(x1)))) B(b(x1)) -> x1 C(B(x1)) -> a(x1) C(C(C(C(x1)))) -> c(c(c(x1))) C(C(C(a(x1)))) -> c(c(c(B(x1)))) C(b(b(b(x1)))) -> a(B(B(B(x1)))) C(c(x1)) -> x1 a(A(x1)) -> x1 a(a(a(a(x1)))) -> A(A(A(x1))) a(b(x1)) -> C(x1) b(B(x1)) -> x1 b(b(b(b(x1)))) -> B(B(B(x1))) b(c(x1)) -> A(x1) c(C(x1)) -> x1 c(a(x1)) -> B(x1) c(c(c(c(x1)))) -> C(C(C(x1))) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: B#(B(B(B(x1)))) -> B(b(x1)) B#(B(B(B(x1)))) -> B(x1) B#(B(B(c(x1)))) -> B(A(x1)) B#(B(B(c(x1)))) -> B(b(A(x1))) B#(B(B(c(x1)))) -> B(b(b(A(x1)))) B#(a(a(a(x1)))) -> C(A(A(A(x1)))) C#(B(x1)) -> A(x1) C#(C(C(C(x1)))) -> C(c(c(x1))) C#(C(C(C(x1)))) -> C(c(x1)) C#(C(C(C(x1)))) -> C(x1) C#(C(C(a(x1)))) -> B#(x1) C#(C(C(a(x1)))) -> C(B(x1)) C#(C(C(a(x1)))) -> C(c(B(x1))) C#(C(C(a(x1)))) -> C(c(c(B(x1)))) C#(b(b(b(x1)))) -> B#(B(B(x1))) C#(b(b(b(x1)))) -> B#(B(x1)) C#(b(b(b(x1)))) -> B#(x1) C#(b(b(b(x1)))) -> A(B(B(B(x1)))) A(b(x1)) -> C#(x1) B(b(b(b(x1)))) -> B#(B(B(x1))) B(b(b(b(x1)))) -> B#(B(x1)) B(b(b(b(x1)))) -> B#(x1) C(a(x1)) -> B#(x1) C(c(c(c(x1)))) -> C#(C(C(x1))) C(c(c(c(x1)))) -> C#(C(x1)) C(c(c(c(x1)))) -> C#(x1) ->->-> Rules: A(A(A(A(x1)))) -> a(a(a(x1))) A(A(A(b(x1)))) -> a(a(a(C(x1)))) A(C(x1)) -> b(x1) A(a(x1)) -> x1 A(c(c(c(x1)))) -> b(C(C(C(x1)))) B(A(x1)) -> c(x1) B(B(B(B(x1)))) -> b(b(b(x1))) B(B(B(c(x1)))) -> b(b(b(A(x1)))) B(a(a(a(x1)))) -> c(A(A(A(x1)))) B(b(x1)) -> x1 C(B(x1)) -> a(x1) C(C(C(C(x1)))) -> c(c(c(x1))) C(C(C(a(x1)))) -> c(c(c(B(x1)))) C(b(b(b(x1)))) -> a(B(B(B(x1)))) C(c(x1)) -> x1 a(A(x1)) -> x1 a(a(a(a(x1)))) -> A(A(A(x1))) a(b(x1)) -> C(x1) b(B(x1)) -> x1 b(b(b(b(x1)))) -> B(B(B(x1))) b(c(x1)) -> A(x1) c(C(x1)) -> x1 c(a(x1)) -> B(x1) c(c(c(c(x1)))) -> C(C(C(x1))) Problem 1: Reduction Pair Processor: -> Pairs: B#(B(B(B(x1)))) -> B(b(x1)) B#(B(B(B(x1)))) -> B(x1) B#(B(B(c(x1)))) -> B(A(x1)) B#(B(B(c(x1)))) -> B(b(A(x1))) B#(B(B(c(x1)))) -> B(b(b(A(x1)))) B#(a(a(a(x1)))) -> C(A(A(A(x1)))) C#(B(x1)) -> A(x1) C#(C(C(C(x1)))) -> C(c(c(x1))) C#(C(C(C(x1)))) -> C(c(x1)) C#(C(C(C(x1)))) -> C(x1) C#(C(C(a(x1)))) -> B#(x1) C#(C(C(a(x1)))) -> C(B(x1)) C#(C(C(a(x1)))) -> C(c(B(x1))) C#(C(C(a(x1)))) -> C(c(c(B(x1)))) C#(b(b(b(x1)))) -> B#(B(B(x1))) C#(b(b(b(x1)))) -> B#(B(x1)) C#(b(b(b(x1)))) -> B#(x1) C#(b(b(b(x1)))) -> A(B(B(B(x1)))) A(b(x1)) -> C#(x1) B(b(b(b(x1)))) -> B#(B(B(x1))) B(b(b(b(x1)))) -> B#(B(x1)) B(b(b(b(x1)))) -> B#(x1) C(a(x1)) -> B#(x1) C(c(c(c(x1)))) -> C#(C(C(x1))) C(c(c(c(x1)))) -> C#(C(x1)) C(c(c(c(x1)))) -> C#(x1) -> Rules: A(A(A(A(x1)))) -> a(a(a(x1))) A(A(A(b(x1)))) -> a(a(a(C(x1)))) A(C(x1)) -> b(x1) A(a(x1)) -> x1 A(c(c(c(x1)))) -> b(C(C(C(x1)))) B(A(x1)) -> c(x1) B(B(B(B(x1)))) -> b(b(b(x1))) B(B(B(c(x1)))) -> b(b(b(A(x1)))) B(a(a(a(x1)))) -> c(A(A(A(x1)))) B(b(x1)) -> x1 C(B(x1)) -> a(x1) C(C(C(C(x1)))) -> c(c(c(x1))) C(C(C(a(x1)))) -> c(c(c(B(x1)))) C(b(b(b(x1)))) -> a(B(B(B(x1)))) C(c(x1)) -> x1 a(A(x1)) -> x1 a(a(a(a(x1)))) -> A(A(A(x1))) a(b(x1)) -> C(x1) b(B(x1)) -> x1 b(b(b(b(x1)))) -> B(B(B(x1))) b(c(x1)) -> A(x1) c(C(x1)) -> x1 c(a(x1)) -> B(x1) c(c(c(c(x1)))) -> C(C(C(x1))) -> Usable rules: A(A(A(A(x1)))) -> a(a(a(x1))) A(A(A(b(x1)))) -> a(a(a(C(x1)))) A(C(x1)) -> b(x1) A(a(x1)) -> x1 A(c(c(c(x1)))) -> b(C(C(C(x1)))) B(A(x1)) -> c(x1) B(B(B(B(x1)))) -> b(b(b(x1))) B(B(B(c(x1)))) -> b(b(b(A(x1)))) B(a(a(a(x1)))) -> c(A(A(A(x1)))) B(b(x1)) -> x1 C(B(x1)) -> a(x1) C(C(C(C(x1)))) -> c(c(c(x1))) C(C(C(a(x1)))) -> c(c(c(B(x1)))) C(b(b(b(x1)))) -> a(B(B(B(x1)))) C(c(x1)) -> x1 a(A(x1)) -> x1 a(a(a(a(x1)))) -> A(A(A(x1))) a(b(x1)) -> C(x1) b(B(x1)) -> x1 b(b(b(b(x1)))) -> B(B(B(x1))) b(c(x1)) -> A(x1) c(C(x1)) -> x1 c(a(x1)) -> B(x1) c(c(c(c(x1)))) -> C(C(C(x1))) ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [A](X) = 2.X + 2 [B](X) = 2.X + 2 [C](X) = 2.X + 2 [a](X) = 2.X + 2 [b](X) = 2.X + 2 [c](X) = 2.X + 2 [B#](X) = 2.X + 2 [C#](X) = X + 2 [A](X) = X + 2 [B](X) = 2.X + 1 [C](X) = X Problem 1: SCC Processor: -> Pairs: B#(B(B(B(x1)))) -> B(x1) B#(B(B(c(x1)))) -> B(A(x1)) B#(B(B(c(x1)))) -> B(b(A(x1))) B#(B(B(c(x1)))) -> B(b(b(A(x1)))) B#(a(a(a(x1)))) -> C(A(A(A(x1)))) C#(B(x1)) -> A(x1) C#(C(C(C(x1)))) -> C(c(c(x1))) C#(C(C(C(x1)))) -> C(c(x1)) C#(C(C(C(x1)))) -> C(x1) C#(C(C(a(x1)))) -> B#(x1) C#(C(C(a(x1)))) -> C(B(x1)) C#(C(C(a(x1)))) -> C(c(B(x1))) C#(C(C(a(x1)))) -> C(c(c(B(x1)))) C#(b(b(b(x1)))) -> B#(B(B(x1))) C#(b(b(b(x1)))) -> B#(B(x1)) C#(b(b(b(x1)))) -> B#(x1) C#(b(b(b(x1)))) -> A(B(B(B(x1)))) A(b(x1)) -> C#(x1) B(b(b(b(x1)))) -> B#(B(B(x1))) B(b(b(b(x1)))) -> B#(B(x1)) B(b(b(b(x1)))) -> B#(x1) C(a(x1)) -> B#(x1) C(c(c(c(x1)))) -> C#(C(C(x1))) C(c(c(c(x1)))) -> C#(C(x1)) C(c(c(c(x1)))) -> C#(x1) -> Rules: A(A(A(A(x1)))) -> a(a(a(x1))) A(A(A(b(x1)))) -> a(a(a(C(x1)))) A(C(x1)) -> b(x1) A(a(x1)) -> x1 A(c(c(c(x1)))) -> b(C(C(C(x1)))) B(A(x1)) -> c(x1) B(B(B(B(x1)))) -> b(b(b(x1))) B(B(B(c(x1)))) -> b(b(b(A(x1)))) B(a(a(a(x1)))) -> c(A(A(A(x1)))) B(b(x1)) -> x1 C(B(x1)) -> a(x1) C(C(C(C(x1)))) -> c(c(c(x1))) C(C(C(a(x1)))) -> c(c(c(B(x1)))) C(b(b(b(x1)))) -> a(B(B(B(x1)))) C(c(x1)) -> x1 a(A(x1)) -> x1 a(a(a(a(x1)))) -> A(A(A(x1))) a(b(x1)) -> C(x1) b(B(x1)) -> x1 b(b(b(b(x1)))) -> B(B(B(x1))) b(c(x1)) -> A(x1) c(C(x1)) -> x1 c(a(x1)) -> B(x1) c(c(c(c(x1)))) -> C(C(C(x1))) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: B#(B(B(B(x1)))) -> B(x1) B#(B(B(c(x1)))) -> B(A(x1)) B#(B(B(c(x1)))) -> B(b(A(x1))) B#(B(B(c(x1)))) -> B(b(b(A(x1)))) B#(a(a(a(x1)))) -> C(A(A(A(x1)))) C#(B(x1)) -> A(x1) C#(C(C(C(x1)))) -> C(c(c(x1))) C#(C(C(C(x1)))) -> C(c(x1)) C#(C(C(C(x1)))) -> C(x1) C#(C(C(a(x1)))) -> B#(x1) C#(C(C(a(x1)))) -> C(B(x1)) C#(C(C(a(x1)))) -> C(c(B(x1))) C#(C(C(a(x1)))) -> C(c(c(B(x1)))) C#(b(b(b(x1)))) -> B#(B(B(x1))) C#(b(b(b(x1)))) -> B#(B(x1)) C#(b(b(b(x1)))) -> B#(x1) C#(b(b(b(x1)))) -> A(B(B(B(x1)))) A(b(x1)) -> C#(x1) B(b(b(b(x1)))) -> B#(B(B(x1))) B(b(b(b(x1)))) -> B#(B(x1)) B(b(b(b(x1)))) -> B#(x1) C(a(x1)) -> B#(x1) C(c(c(c(x1)))) -> C#(C(C(x1))) C(c(c(c(x1)))) -> C#(C(x1)) C(c(c(c(x1)))) -> C#(x1) ->->-> Rules: A(A(A(A(x1)))) -> a(a(a(x1))) A(A(A(b(x1)))) -> a(a(a(C(x1)))) A(C(x1)) -> b(x1) A(a(x1)) -> x1 A(c(c(c(x1)))) -> b(C(C(C(x1)))) B(A(x1)) -> c(x1) B(B(B(B(x1)))) -> b(b(b(x1))) B(B(B(c(x1)))) -> b(b(b(A(x1)))) B(a(a(a(x1)))) -> c(A(A(A(x1)))) B(b(x1)) -> x1 C(B(x1)) -> a(x1) C(C(C(C(x1)))) -> c(c(c(x1))) C(C(C(a(x1)))) -> c(c(c(B(x1)))) C(b(b(b(x1)))) -> a(B(B(B(x1)))) C(c(x1)) -> x1 a(A(x1)) -> x1 a(a(a(a(x1)))) -> A(A(A(x1))) a(b(x1)) -> C(x1) b(B(x1)) -> x1 b(b(b(b(x1)))) -> B(B(B(x1))) b(c(x1)) -> A(x1) c(C(x1)) -> x1 c(a(x1)) -> B(x1) c(c(c(c(x1)))) -> C(C(C(x1))) Problem 1: Reduction Pair Processor: -> Pairs: B#(B(B(B(x1)))) -> B(x1) B#(B(B(c(x1)))) -> B(A(x1)) B#(B(B(c(x1)))) -> B(b(A(x1))) B#(B(B(c(x1)))) -> B(b(b(A(x1)))) B#(a(a(a(x1)))) -> C(A(A(A(x1)))) C#(B(x1)) -> A(x1) C#(C(C(C(x1)))) -> C(c(c(x1))) C#(C(C(C(x1)))) -> C(c(x1)) C#(C(C(C(x1)))) -> C(x1) C#(C(C(a(x1)))) -> B#(x1) C#(C(C(a(x1)))) -> C(B(x1)) C#(C(C(a(x1)))) -> C(c(B(x1))) C#(C(C(a(x1)))) -> C(c(c(B(x1)))) C#(b(b(b(x1)))) -> B#(B(B(x1))) C#(b(b(b(x1)))) -> B#(B(x1)) C#(b(b(b(x1)))) -> B#(x1) C#(b(b(b(x1)))) -> A(B(B(B(x1)))) A(b(x1)) -> C#(x1) B(b(b(b(x1)))) -> B#(B(B(x1))) B(b(b(b(x1)))) -> B#(B(x1)) B(b(b(b(x1)))) -> B#(x1) C(a(x1)) -> B#(x1) C(c(c(c(x1)))) -> C#(C(C(x1))) C(c(c(c(x1)))) -> C#(C(x1)) C(c(c(c(x1)))) -> C#(x1) -> Rules: A(A(A(A(x1)))) -> a(a(a(x1))) A(A(A(b(x1)))) -> a(a(a(C(x1)))) A(C(x1)) -> b(x1) A(a(x1)) -> x1 A(c(c(c(x1)))) -> b(C(C(C(x1)))) B(A(x1)) -> c(x1) B(B(B(B(x1)))) -> b(b(b(x1))) B(B(B(c(x1)))) -> b(b(b(A(x1)))) B(a(a(a(x1)))) -> c(A(A(A(x1)))) B(b(x1)) -> x1 C(B(x1)) -> a(x1) C(C(C(C(x1)))) -> c(c(c(x1))) C(C(C(a(x1)))) -> c(c(c(B(x1)))) C(b(b(b(x1)))) -> a(B(B(B(x1)))) C(c(x1)) -> x1 a(A(x1)) -> x1 a(a(a(a(x1)))) -> A(A(A(x1))) a(b(x1)) -> C(x1) b(B(x1)) -> x1 b(b(b(b(x1)))) -> B(B(B(x1))) b(c(x1)) -> A(x1) c(C(x1)) -> x1 c(a(x1)) -> B(x1) c(c(c(c(x1)))) -> C(C(C(x1))) -> Usable rules: A(A(A(A(x1)))) -> a(a(a(x1))) A(A(A(b(x1)))) -> a(a(a(C(x1)))) A(C(x1)) -> b(x1) A(a(x1)) -> x1 A(c(c(c(x1)))) -> b(C(C(C(x1)))) B(A(x1)) -> c(x1) B(B(B(B(x1)))) -> b(b(b(x1))) B(B(B(c(x1)))) -> b(b(b(A(x1)))) B(a(a(a(x1)))) -> c(A(A(A(x1)))) B(b(x1)) -> x1 C(B(x1)) -> a(x1) C(C(C(C(x1)))) -> c(c(c(x1))) C(C(C(a(x1)))) -> c(c(c(B(x1)))) C(b(b(b(x1)))) -> a(B(B(B(x1)))) C(c(x1)) -> x1 a(A(x1)) -> x1 a(a(a(a(x1)))) -> A(A(A(x1))) a(b(x1)) -> C(x1) b(B(x1)) -> x1 b(b(b(b(x1)))) -> B(B(B(x1))) b(c(x1)) -> A(x1) c(C(x1)) -> x1 c(a(x1)) -> B(x1) c(c(c(c(x1)))) -> C(C(C(x1))) ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [A](X) = 2.X + 2 [B](X) = 2.X + 2 [C](X) = 2.X + 2 [a](X) = 2.X + 2 [b](X) = 2.X + 2 [c](X) = 2.X + 2 [B#](X) = 2.X + 2 [C#](X) = 2.X + 2 [A](X) = 2.X [B](X) = 2.X + 2 [C](X) = 2.X + 2 Problem 1: SCC Processor: -> Pairs: B#(B(B(c(x1)))) -> B(A(x1)) B#(B(B(c(x1)))) -> B(b(A(x1))) B#(B(B(c(x1)))) -> B(b(b(A(x1)))) B#(a(a(a(x1)))) -> C(A(A(A(x1)))) C#(B(x1)) -> A(x1) C#(C(C(C(x1)))) -> C(c(c(x1))) C#(C(C(C(x1)))) -> C(c(x1)) C#(C(C(C(x1)))) -> C(x1) C#(C(C(a(x1)))) -> B#(x1) C#(C(C(a(x1)))) -> C(B(x1)) C#(C(C(a(x1)))) -> C(c(B(x1))) C#(C(C(a(x1)))) -> C(c(c(B(x1)))) C#(b(b(b(x1)))) -> B#(B(B(x1))) C#(b(b(b(x1)))) -> B#(B(x1)) C#(b(b(b(x1)))) -> B#(x1) C#(b(b(b(x1)))) -> A(B(B(B(x1)))) A(b(x1)) -> C#(x1) B(b(b(b(x1)))) -> B#(B(B(x1))) B(b(b(b(x1)))) -> B#(B(x1)) B(b(b(b(x1)))) -> B#(x1) C(a(x1)) -> B#(x1) C(c(c(c(x1)))) -> C#(C(C(x1))) C(c(c(c(x1)))) -> C#(C(x1)) C(c(c(c(x1)))) -> C#(x1) -> Rules: A(A(A(A(x1)))) -> a(a(a(x1))) A(A(A(b(x1)))) -> a(a(a(C(x1)))) A(C(x1)) -> b(x1) A(a(x1)) -> x1 A(c(c(c(x1)))) -> b(C(C(C(x1)))) B(A(x1)) -> c(x1) B(B(B(B(x1)))) -> b(b(b(x1))) B(B(B(c(x1)))) -> b(b(b(A(x1)))) B(a(a(a(x1)))) -> c(A(A(A(x1)))) B(b(x1)) -> x1 C(B(x1)) -> a(x1) C(C(C(C(x1)))) -> c(c(c(x1))) C(C(C(a(x1)))) -> c(c(c(B(x1)))) C(b(b(b(x1)))) -> a(B(B(B(x1)))) C(c(x1)) -> x1 a(A(x1)) -> x1 a(a(a(a(x1)))) -> A(A(A(x1))) a(b(x1)) -> C(x1) b(B(x1)) -> x1 b(b(b(b(x1)))) -> B(B(B(x1))) b(c(x1)) -> A(x1) c(C(x1)) -> x1 c(a(x1)) -> B(x1) c(c(c(c(x1)))) -> C(C(C(x1))) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: B#(B(B(c(x1)))) -> B(A(x1)) B#(B(B(c(x1)))) -> B(b(A(x1))) B#(B(B(c(x1)))) -> B(b(b(A(x1)))) B#(a(a(a(x1)))) -> C(A(A(A(x1)))) C#(B(x1)) -> A(x1) C#(C(C(C(x1)))) -> C(c(c(x1))) C#(C(C(C(x1)))) -> C(c(x1)) C#(C(C(C(x1)))) -> C(x1) C#(C(C(a(x1)))) -> B#(x1) C#(C(C(a(x1)))) -> C(B(x1)) C#(C(C(a(x1)))) -> C(c(B(x1))) C#(C(C(a(x1)))) -> C(c(c(B(x1)))) C#(b(b(b(x1)))) -> B#(B(B(x1))) C#(b(b(b(x1)))) -> B#(B(x1)) C#(b(b(b(x1)))) -> B#(x1) C#(b(b(b(x1)))) -> A(B(B(B(x1)))) A(b(x1)) -> C#(x1) B(b(b(b(x1)))) -> B#(B(B(x1))) B(b(b(b(x1)))) -> B#(B(x1)) B(b(b(b(x1)))) -> B#(x1) C(a(x1)) -> B#(x1) C(c(c(c(x1)))) -> C#(C(C(x1))) C(c(c(c(x1)))) -> C#(C(x1)) C(c(c(c(x1)))) -> C#(x1) ->->-> Rules: A(A(A(A(x1)))) -> a(a(a(x1))) A(A(A(b(x1)))) -> a(a(a(C(x1)))) A(C(x1)) -> b(x1) A(a(x1)) -> x1 A(c(c(c(x1)))) -> b(C(C(C(x1)))) B(A(x1)) -> c(x1) B(B(B(B(x1)))) -> b(b(b(x1))) B(B(B(c(x1)))) -> b(b(b(A(x1)))) B(a(a(a(x1)))) -> c(A(A(A(x1)))) B(b(x1)) -> x1 C(B(x1)) -> a(x1) C(C(C(C(x1)))) -> c(c(c(x1))) C(C(C(a(x1)))) -> c(c(c(B(x1)))) C(b(b(b(x1)))) -> a(B(B(B(x1)))) C(c(x1)) -> x1 a(A(x1)) -> x1 a(a(a(a(x1)))) -> A(A(A(x1))) a(b(x1)) -> C(x1) b(B(x1)) -> x1 b(b(b(b(x1)))) -> B(B(B(x1))) b(c(x1)) -> A(x1) c(C(x1)) -> x1 c(a(x1)) -> B(x1) c(c(c(c(x1)))) -> C(C(C(x1))) Problem 1: Reduction Pair Processor: -> Pairs: B#(B(B(c(x1)))) -> B(A(x1)) B#(B(B(c(x1)))) -> B(b(A(x1))) B#(B(B(c(x1)))) -> B(b(b(A(x1)))) B#(a(a(a(x1)))) -> C(A(A(A(x1)))) C#(B(x1)) -> A(x1) C#(C(C(C(x1)))) -> C(c(c(x1))) C#(C(C(C(x1)))) -> C(c(x1)) C#(C(C(C(x1)))) -> C(x1) C#(C(C(a(x1)))) -> B#(x1) C#(C(C(a(x1)))) -> C(B(x1)) C#(C(C(a(x1)))) -> C(c(B(x1))) C#(C(C(a(x1)))) -> C(c(c(B(x1)))) C#(b(b(b(x1)))) -> B#(B(B(x1))) C#(b(b(b(x1)))) -> B#(B(x1)) C#(b(b(b(x1)))) -> B#(x1) C#(b(b(b(x1)))) -> A(B(B(B(x1)))) A(b(x1)) -> C#(x1) B(b(b(b(x1)))) -> B#(B(B(x1))) B(b(b(b(x1)))) -> B#(B(x1)) B(b(b(b(x1)))) -> B#(x1) C(a(x1)) -> B#(x1) C(c(c(c(x1)))) -> C#(C(C(x1))) C(c(c(c(x1)))) -> C#(C(x1)) C(c(c(c(x1)))) -> C#(x1) -> Rules: A(A(A(A(x1)))) -> a(a(a(x1))) A(A(A(b(x1)))) -> a(a(a(C(x1)))) A(C(x1)) -> b(x1) A(a(x1)) -> x1 A(c(c(c(x1)))) -> b(C(C(C(x1)))) B(A(x1)) -> c(x1) B(B(B(B(x1)))) -> b(b(b(x1))) B(B(B(c(x1)))) -> b(b(b(A(x1)))) B(a(a(a(x1)))) -> c(A(A(A(x1)))) B(b(x1)) -> x1 C(B(x1)) -> a(x1) C(C(C(C(x1)))) -> c(c(c(x1))) C(C(C(a(x1)))) -> c(c(c(B(x1)))) C(b(b(b(x1)))) -> a(B(B(B(x1)))) C(c(x1)) -> x1 a(A(x1)) -> x1 a(a(a(a(x1)))) -> A(A(A(x1))) a(b(x1)) -> C(x1) b(B(x1)) -> x1 b(b(b(b(x1)))) -> B(B(B(x1))) b(c(x1)) -> A(x1) c(C(x1)) -> x1 c(a(x1)) -> B(x1) c(c(c(c(x1)))) -> C(C(C(x1))) -> Usable rules: A(A(A(A(x1)))) -> a(a(a(x1))) A(A(A(b(x1)))) -> a(a(a(C(x1)))) A(C(x1)) -> b(x1) A(a(x1)) -> x1 A(c(c(c(x1)))) -> b(C(C(C(x1)))) B(A(x1)) -> c(x1) B(B(B(B(x1)))) -> b(b(b(x1))) B(B(B(c(x1)))) -> b(b(b(A(x1)))) B(a(a(a(x1)))) -> c(A(A(A(x1)))) B(b(x1)) -> x1 C(B(x1)) -> a(x1) C(C(C(C(x1)))) -> c(c(c(x1))) C(C(C(a(x1)))) -> c(c(c(B(x1)))) C(b(b(b(x1)))) -> a(B(B(B(x1)))) C(c(x1)) -> x1 a(A(x1)) -> x1 a(a(a(a(x1)))) -> A(A(A(x1))) a(b(x1)) -> C(x1) b(B(x1)) -> x1 b(b(b(b(x1)))) -> B(B(B(x1))) b(c(x1)) -> A(x1) c(C(x1)) -> x1 c(a(x1)) -> B(x1) c(c(c(c(x1)))) -> C(C(C(x1))) ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [A](X) = 2.X + 2 [B](X) = 2.X + 2 [C](X) = 2.X + 2 [a](X) = 2.X + 2 [b](X) = 2.X + 2 [c](X) = 2.X + 2 [B#](X) = 2.X + 2 [C#](X) = 2.X + 2 [A](X) = X + 2 [B](X) = 2.X [C](X) = 2.X + 2 Problem 1: SCC Processor: -> Pairs: B#(B(B(c(x1)))) -> B(b(A(x1))) B#(B(B(c(x1)))) -> B(b(b(A(x1)))) B#(a(a(a(x1)))) -> C(A(A(A(x1)))) C#(B(x1)) -> A(x1) C#(C(C(C(x1)))) -> C(c(c(x1))) C#(C(C(C(x1)))) -> C(c(x1)) C#(C(C(C(x1)))) -> C(x1) C#(C(C(a(x1)))) -> B#(x1) C#(C(C(a(x1)))) -> C(B(x1)) C#(C(C(a(x1)))) -> C(c(B(x1))) C#(C(C(a(x1)))) -> C(c(c(B(x1)))) C#(b(b(b(x1)))) -> B#(B(B(x1))) C#(b(b(b(x1)))) -> B#(B(x1)) C#(b(b(b(x1)))) -> B#(x1) C#(b(b(b(x1)))) -> A(B(B(B(x1)))) A(b(x1)) -> C#(x1) B(b(b(b(x1)))) -> B#(B(B(x1))) B(b(b(b(x1)))) -> B#(B(x1)) B(b(b(b(x1)))) -> B#(x1) C(a(x1)) -> B#(x1) C(c(c(c(x1)))) -> C#(C(C(x1))) C(c(c(c(x1)))) -> C#(C(x1)) C(c(c(c(x1)))) -> C#(x1) -> Rules: A(A(A(A(x1)))) -> a(a(a(x1))) A(A(A(b(x1)))) -> a(a(a(C(x1)))) A(C(x1)) -> b(x1) A(a(x1)) -> x1 A(c(c(c(x1)))) -> b(C(C(C(x1)))) B(A(x1)) -> c(x1) B(B(B(B(x1)))) -> b(b(b(x1))) B(B(B(c(x1)))) -> b(b(b(A(x1)))) B(a(a(a(x1)))) -> c(A(A(A(x1)))) B(b(x1)) -> x1 C(B(x1)) -> a(x1) C(C(C(C(x1)))) -> c(c(c(x1))) C(C(C(a(x1)))) -> c(c(c(B(x1)))) C(b(b(b(x1)))) -> a(B(B(B(x1)))) C(c(x1)) -> x1 a(A(x1)) -> x1 a(a(a(a(x1)))) -> A(A(A(x1))) a(b(x1)) -> C(x1) b(B(x1)) -> x1 b(b(b(b(x1)))) -> B(B(B(x1))) b(c(x1)) -> A(x1) c(C(x1)) -> x1 c(a(x1)) -> B(x1) c(c(c(c(x1)))) -> C(C(C(x1))) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: B#(B(B(c(x1)))) -> B(b(A(x1))) B#(B(B(c(x1)))) -> B(b(b(A(x1)))) B#(a(a(a(x1)))) -> C(A(A(A(x1)))) C#(B(x1)) -> A(x1) C#(C(C(C(x1)))) -> C(c(c(x1))) C#(C(C(C(x1)))) -> C(c(x1)) C#(C(C(C(x1)))) -> C(x1) C#(C(C(a(x1)))) -> B#(x1) C#(C(C(a(x1)))) -> C(B(x1)) C#(C(C(a(x1)))) -> C(c(B(x1))) C#(C(C(a(x1)))) -> C(c(c(B(x1)))) C#(b(b(b(x1)))) -> B#(B(B(x1))) C#(b(b(b(x1)))) -> B#(B(x1)) C#(b(b(b(x1)))) -> B#(x1) C#(b(b(b(x1)))) -> A(B(B(B(x1)))) A(b(x1)) -> C#(x1) B(b(b(b(x1)))) -> B#(B(B(x1))) B(b(b(b(x1)))) -> B#(B(x1)) B(b(b(b(x1)))) -> B#(x1) C(a(x1)) -> B#(x1) C(c(c(c(x1)))) -> C#(C(C(x1))) C(c(c(c(x1)))) -> C#(C(x1)) C(c(c(c(x1)))) -> C#(x1) ->->-> Rules: A(A(A(A(x1)))) -> a(a(a(x1))) A(A(A(b(x1)))) -> a(a(a(C(x1)))) A(C(x1)) -> b(x1) A(a(x1)) -> x1 A(c(c(c(x1)))) -> b(C(C(C(x1)))) B(A(x1)) -> c(x1) B(B(B(B(x1)))) -> b(b(b(x1))) B(B(B(c(x1)))) -> b(b(b(A(x1)))) B(a(a(a(x1)))) -> c(A(A(A(x1)))) B(b(x1)) -> x1 C(B(x1)) -> a(x1) C(C(C(C(x1)))) -> c(c(c(x1))) C(C(C(a(x1)))) -> c(c(c(B(x1)))) C(b(b(b(x1)))) -> a(B(B(B(x1)))) C(c(x1)) -> x1 a(A(x1)) -> x1 a(a(a(a(x1)))) -> A(A(A(x1))) a(b(x1)) -> C(x1) b(B(x1)) -> x1 b(b(b(b(x1)))) -> B(B(B(x1))) b(c(x1)) -> A(x1) c(C(x1)) -> x1 c(a(x1)) -> B(x1) c(c(c(c(x1)))) -> C(C(C(x1))) Problem 1: Reduction Pair Processor: -> Pairs: B#(B(B(c(x1)))) -> B(b(A(x1))) B#(B(B(c(x1)))) -> B(b(b(A(x1)))) B#(a(a(a(x1)))) -> C(A(A(A(x1)))) C#(B(x1)) -> A(x1) C#(C(C(C(x1)))) -> C(c(c(x1))) C#(C(C(C(x1)))) -> C(c(x1)) C#(C(C(C(x1)))) -> C(x1) C#(C(C(a(x1)))) -> B#(x1) C#(C(C(a(x1)))) -> C(B(x1)) C#(C(C(a(x1)))) -> C(c(B(x1))) C#(C(C(a(x1)))) -> C(c(c(B(x1)))) C#(b(b(b(x1)))) -> B#(B(B(x1))) C#(b(b(b(x1)))) -> B#(B(x1)) C#(b(b(b(x1)))) -> B#(x1) C#(b(b(b(x1)))) -> A(B(B(B(x1)))) A(b(x1)) -> C#(x1) B(b(b(b(x1)))) -> B#(B(B(x1))) B(b(b(b(x1)))) -> B#(B(x1)) B(b(b(b(x1)))) -> B#(x1) C(a(x1)) -> B#(x1) C(c(c(c(x1)))) -> C#(C(C(x1))) C(c(c(c(x1)))) -> C#(C(x1)) C(c(c(c(x1)))) -> C#(x1) -> Rules: A(A(A(A(x1)))) -> a(a(a(x1))) A(A(A(b(x1)))) -> a(a(a(C(x1)))) A(C(x1)) -> b(x1) A(a(x1)) -> x1 A(c(c(c(x1)))) -> b(C(C(C(x1)))) B(A(x1)) -> c(x1) B(B(B(B(x1)))) -> b(b(b(x1))) B(B(B(c(x1)))) -> b(b(b(A(x1)))) B(a(a(a(x1)))) -> c(A(A(A(x1)))) B(b(x1)) -> x1 C(B(x1)) -> a(x1) C(C(C(C(x1)))) -> c(c(c(x1))) C(C(C(a(x1)))) -> c(c(c(B(x1)))) C(b(b(b(x1)))) -> a(B(B(B(x1)))) C(c(x1)) -> x1 a(A(x1)) -> x1 a(a(a(a(x1)))) -> A(A(A(x1))) a(b(x1)) -> C(x1) b(B(x1)) -> x1 b(b(b(b(x1)))) -> B(B(B(x1))) b(c(x1)) -> A(x1) c(C(x1)) -> x1 c(a(x1)) -> B(x1) c(c(c(c(x1)))) -> C(C(C(x1))) -> Usable rules: A(A(A(A(x1)))) -> a(a(a(x1))) A(A(A(b(x1)))) -> a(a(a(C(x1)))) A(C(x1)) -> b(x1) A(a(x1)) -> x1 A(c(c(c(x1)))) -> b(C(C(C(x1)))) B(A(x1)) -> c(x1) B(B(B(B(x1)))) -> b(b(b(x1))) B(B(B(c(x1)))) -> b(b(b(A(x1)))) B(a(a(a(x1)))) -> c(A(A(A(x1)))) B(b(x1)) -> x1 C(B(x1)) -> a(x1) C(C(C(C(x1)))) -> c(c(c(x1))) C(C(C(a(x1)))) -> c(c(c(B(x1)))) C(b(b(b(x1)))) -> a(B(B(B(x1)))) C(c(x1)) -> x1 a(A(x1)) -> x1 a(a(a(a(x1)))) -> A(A(A(x1))) a(b(x1)) -> C(x1) b(B(x1)) -> x1 b(b(b(b(x1)))) -> B(B(B(x1))) b(c(x1)) -> A(x1) c(C(x1)) -> x1 c(a(x1)) -> B(x1) c(c(c(c(x1)))) -> C(C(C(x1))) ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [A](X) = X + 2 [B](X) = X + 2 [C](X) = X + 2 [a](X) = X + 2 [b](X) = X + 2 [c](X) = X + 2 [B#](X) = 2.X + 1 [C#](X) = 2.X + 1 [A](X) = 2.X [B](X) = 2.X + 1 [C](X) = 2.X Problem 1: SCC Processor: -> Pairs: B#(B(B(c(x1)))) -> B(b(b(A(x1)))) B#(a(a(a(x1)))) -> C(A(A(A(x1)))) C#(B(x1)) -> A(x1) C#(C(C(C(x1)))) -> C(c(c(x1))) C#(C(C(C(x1)))) -> C(c(x1)) C#(C(C(C(x1)))) -> C(x1) C#(C(C(a(x1)))) -> B#(x1) C#(C(C(a(x1)))) -> C(B(x1)) C#(C(C(a(x1)))) -> C(c(B(x1))) C#(C(C(a(x1)))) -> C(c(c(B(x1)))) C#(b(b(b(x1)))) -> B#(B(B(x1))) C#(b(b(b(x1)))) -> B#(B(x1)) C#(b(b(b(x1)))) -> B#(x1) C#(b(b(b(x1)))) -> A(B(B(B(x1)))) A(b(x1)) -> C#(x1) B(b(b(b(x1)))) -> B#(B(B(x1))) B(b(b(b(x1)))) -> B#(B(x1)) B(b(b(b(x1)))) -> B#(x1) C(a(x1)) -> B#(x1) C(c(c(c(x1)))) -> C#(C(C(x1))) C(c(c(c(x1)))) -> C#(C(x1)) C(c(c(c(x1)))) -> C#(x1) -> Rules: A(A(A(A(x1)))) -> a(a(a(x1))) A(A(A(b(x1)))) -> a(a(a(C(x1)))) A(C(x1)) -> b(x1) A(a(x1)) -> x1 A(c(c(c(x1)))) -> b(C(C(C(x1)))) B(A(x1)) -> c(x1) B(B(B(B(x1)))) -> b(b(b(x1))) B(B(B(c(x1)))) -> b(b(b(A(x1)))) B(a(a(a(x1)))) -> c(A(A(A(x1)))) B(b(x1)) -> x1 C(B(x1)) -> a(x1) C(C(C(C(x1)))) -> c(c(c(x1))) C(C(C(a(x1)))) -> c(c(c(B(x1)))) C(b(b(b(x1)))) -> a(B(B(B(x1)))) C(c(x1)) -> x1 a(A(x1)) -> x1 a(a(a(a(x1)))) -> A(A(A(x1))) a(b(x1)) -> C(x1) b(B(x1)) -> x1 b(b(b(b(x1)))) -> B(B(B(x1))) b(c(x1)) -> A(x1) c(C(x1)) -> x1 c(a(x1)) -> B(x1) c(c(c(c(x1)))) -> C(C(C(x1))) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: B#(B(B(c(x1)))) -> B(b(b(A(x1)))) B#(a(a(a(x1)))) -> C(A(A(A(x1)))) C#(B(x1)) -> A(x1) C#(C(C(C(x1)))) -> C(c(c(x1))) C#(C(C(C(x1)))) -> C(c(x1)) C#(C(C(C(x1)))) -> C(x1) C#(C(C(a(x1)))) -> B#(x1) C#(C(C(a(x1)))) -> C(B(x1)) C#(C(C(a(x1)))) -> C(c(B(x1))) C#(C(C(a(x1)))) -> C(c(c(B(x1)))) C#(b(b(b(x1)))) -> B#(B(B(x1))) C#(b(b(b(x1)))) -> B#(B(x1)) C#(b(b(b(x1)))) -> B#(x1) C#(b(b(b(x1)))) -> A(B(B(B(x1)))) A(b(x1)) -> C#(x1) B(b(b(b(x1)))) -> B#(B(B(x1))) B(b(b(b(x1)))) -> B#(B(x1)) B(b(b(b(x1)))) -> B#(x1) C(a(x1)) -> B#(x1) C(c(c(c(x1)))) -> C#(C(C(x1))) C(c(c(c(x1)))) -> C#(C(x1)) C(c(c(c(x1)))) -> C#(x1) ->->-> Rules: A(A(A(A(x1)))) -> a(a(a(x1))) A(A(A(b(x1)))) -> a(a(a(C(x1)))) A(C(x1)) -> b(x1) A(a(x1)) -> x1 A(c(c(c(x1)))) -> b(C(C(C(x1)))) B(A(x1)) -> c(x1) B(B(B(B(x1)))) -> b(b(b(x1))) B(B(B(c(x1)))) -> b(b(b(A(x1)))) B(a(a(a(x1)))) -> c(A(A(A(x1)))) B(b(x1)) -> x1 C(B(x1)) -> a(x1) C(C(C(C(x1)))) -> c(c(c(x1))) C(C(C(a(x1)))) -> c(c(c(B(x1)))) C(b(b(b(x1)))) -> a(B(B(B(x1)))) C(c(x1)) -> x1 a(A(x1)) -> x1 a(a(a(a(x1)))) -> A(A(A(x1))) a(b(x1)) -> C(x1) b(B(x1)) -> x1 b(b(b(b(x1)))) -> B(B(B(x1))) b(c(x1)) -> A(x1) c(C(x1)) -> x1 c(a(x1)) -> B(x1) c(c(c(c(x1)))) -> C(C(C(x1))) Problem 1: Reduction Pair Processor: -> Pairs: B#(B(B(c(x1)))) -> B(b(b(A(x1)))) B#(a(a(a(x1)))) -> C(A(A(A(x1)))) C#(B(x1)) -> A(x1) C#(C(C(C(x1)))) -> C(c(c(x1))) C#(C(C(C(x1)))) -> C(c(x1)) C#(C(C(C(x1)))) -> C(x1) C#(C(C(a(x1)))) -> B#(x1) C#(C(C(a(x1)))) -> C(B(x1)) C#(C(C(a(x1)))) -> C(c(B(x1))) C#(C(C(a(x1)))) -> C(c(c(B(x1)))) C#(b(b(b(x1)))) -> B#(B(B(x1))) C#(b(b(b(x1)))) -> B#(B(x1)) C#(b(b(b(x1)))) -> B#(x1) C#(b(b(b(x1)))) -> A(B(B(B(x1)))) A(b(x1)) -> C#(x1) B(b(b(b(x1)))) -> B#(B(B(x1))) B(b(b(b(x1)))) -> B#(B(x1)) B(b(b(b(x1)))) -> B#(x1) C(a(x1)) -> B#(x1) C(c(c(c(x1)))) -> C#(C(C(x1))) C(c(c(c(x1)))) -> C#(C(x1)) C(c(c(c(x1)))) -> C#(x1) -> Rules: A(A(A(A(x1)))) -> a(a(a(x1))) A(A(A(b(x1)))) -> a(a(a(C(x1)))) A(C(x1)) -> b(x1) A(a(x1)) -> x1 A(c(c(c(x1)))) -> b(C(C(C(x1)))) B(A(x1)) -> c(x1) B(B(B(B(x1)))) -> b(b(b(x1))) B(B(B(c(x1)))) -> b(b(b(A(x1)))) B(a(a(a(x1)))) -> c(A(A(A(x1)))) B(b(x1)) -> x1 C(B(x1)) -> a(x1) C(C(C(C(x1)))) -> c(c(c(x1))) C(C(C(a(x1)))) -> c(c(c(B(x1)))) C(b(b(b(x1)))) -> a(B(B(B(x1)))) C(c(x1)) -> x1 a(A(x1)) -> x1 a(a(a(a(x1)))) -> A(A(A(x1))) a(b(x1)) -> C(x1) b(B(x1)) -> x1 b(b(b(b(x1)))) -> B(B(B(x1))) b(c(x1)) -> A(x1) c(C(x1)) -> x1 c(a(x1)) -> B(x1) c(c(c(c(x1)))) -> C(C(C(x1))) -> Usable rules: A(A(A(A(x1)))) -> a(a(a(x1))) A(A(A(b(x1)))) -> a(a(a(C(x1)))) A(C(x1)) -> b(x1) A(a(x1)) -> x1 A(c(c(c(x1)))) -> b(C(C(C(x1)))) B(A(x1)) -> c(x1) B(B(B(B(x1)))) -> b(b(b(x1))) B(B(B(c(x1)))) -> b(b(b(A(x1)))) B(a(a(a(x1)))) -> c(A(A(A(x1)))) B(b(x1)) -> x1 C(B(x1)) -> a(x1) C(C(C(C(x1)))) -> c(c(c(x1))) C(C(C(a(x1)))) -> c(c(c(B(x1)))) C(b(b(b(x1)))) -> a(B(B(B(x1)))) C(c(x1)) -> x1 a(A(x1)) -> x1 a(a(a(a(x1)))) -> A(A(A(x1))) a(b(x1)) -> C(x1) b(B(x1)) -> x1 b(b(b(b(x1)))) -> B(B(B(x1))) b(c(x1)) -> A(x1) c(C(x1)) -> x1 c(a(x1)) -> B(x1) c(c(c(c(x1)))) -> C(C(C(x1))) ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [A](X) = 2.X + 2 [B](X) = 2.X + 2 [C](X) = 2.X + 2 [a](X) = 2.X + 2 [b](X) = 2.X + 2 [c](X) = 2.X + 2 [B#](X) = 2.X + 2 [C#](X) = 2.X + 2 [A](X) = 2.X + 2 [B](X) = 2.X + 1 [C](X) = 2.X + 2 Problem 1: SCC Processor: -> Pairs: B#(a(a(a(x1)))) -> C(A(A(A(x1)))) C#(B(x1)) -> A(x1) C#(C(C(C(x1)))) -> C(c(c(x1))) C#(C(C(C(x1)))) -> C(c(x1)) C#(C(C(C(x1)))) -> C(x1) C#(C(C(a(x1)))) -> B#(x1) C#(C(C(a(x1)))) -> C(B(x1)) C#(C(C(a(x1)))) -> C(c(B(x1))) C#(C(C(a(x1)))) -> C(c(c(B(x1)))) C#(b(b(b(x1)))) -> B#(B(B(x1))) C#(b(b(b(x1)))) -> B#(B(x1)) C#(b(b(b(x1)))) -> B#(x1) C#(b(b(b(x1)))) -> A(B(B(B(x1)))) A(b(x1)) -> C#(x1) B(b(b(b(x1)))) -> B#(B(B(x1))) B(b(b(b(x1)))) -> B#(B(x1)) B(b(b(b(x1)))) -> B#(x1) C(a(x1)) -> B#(x1) C(c(c(c(x1)))) -> C#(C(C(x1))) C(c(c(c(x1)))) -> C#(C(x1)) C(c(c(c(x1)))) -> C#(x1) -> Rules: A(A(A(A(x1)))) -> a(a(a(x1))) A(A(A(b(x1)))) -> a(a(a(C(x1)))) A(C(x1)) -> b(x1) A(a(x1)) -> x1 A(c(c(c(x1)))) -> b(C(C(C(x1)))) B(A(x1)) -> c(x1) B(B(B(B(x1)))) -> b(b(b(x1))) B(B(B(c(x1)))) -> b(b(b(A(x1)))) B(a(a(a(x1)))) -> c(A(A(A(x1)))) B(b(x1)) -> x1 C(B(x1)) -> a(x1) C(C(C(C(x1)))) -> c(c(c(x1))) C(C(C(a(x1)))) -> c(c(c(B(x1)))) C(b(b(b(x1)))) -> a(B(B(B(x1)))) C(c(x1)) -> x1 a(A(x1)) -> x1 a(a(a(a(x1)))) -> A(A(A(x1))) a(b(x1)) -> C(x1) b(B(x1)) -> x1 b(b(b(b(x1)))) -> B(B(B(x1))) b(c(x1)) -> A(x1) c(C(x1)) -> x1 c(a(x1)) -> B(x1) c(c(c(c(x1)))) -> C(C(C(x1))) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: B#(a(a(a(x1)))) -> C(A(A(A(x1)))) C#(B(x1)) -> A(x1) C#(C(C(C(x1)))) -> C(c(c(x1))) C#(C(C(C(x1)))) -> C(c(x1)) C#(C(C(C(x1)))) -> C(x1) C#(C(C(a(x1)))) -> B#(x1) C#(C(C(a(x1)))) -> C(B(x1)) C#(C(C(a(x1)))) -> C(c(B(x1))) C#(C(C(a(x1)))) -> C(c(c(B(x1)))) C#(b(b(b(x1)))) -> B#(B(B(x1))) C#(b(b(b(x1)))) -> B#(B(x1)) C#(b(b(b(x1)))) -> B#(x1) C#(b(b(b(x1)))) -> A(B(B(B(x1)))) A(b(x1)) -> C#(x1) C(a(x1)) -> B#(x1) C(c(c(c(x1)))) -> C#(C(C(x1))) C(c(c(c(x1)))) -> C#(C(x1)) C(c(c(c(x1)))) -> C#(x1) ->->-> Rules: A(A(A(A(x1)))) -> a(a(a(x1))) A(A(A(b(x1)))) -> a(a(a(C(x1)))) A(C(x1)) -> b(x1) A(a(x1)) -> x1 A(c(c(c(x1)))) -> b(C(C(C(x1)))) B(A(x1)) -> c(x1) B(B(B(B(x1)))) -> b(b(b(x1))) B(B(B(c(x1)))) -> b(b(b(A(x1)))) B(a(a(a(x1)))) -> c(A(A(A(x1)))) B(b(x1)) -> x1 C(B(x1)) -> a(x1) C(C(C(C(x1)))) -> c(c(c(x1))) C(C(C(a(x1)))) -> c(c(c(B(x1)))) C(b(b(b(x1)))) -> a(B(B(B(x1)))) C(c(x1)) -> x1 a(A(x1)) -> x1 a(a(a(a(x1)))) -> A(A(A(x1))) a(b(x1)) -> C(x1) b(B(x1)) -> x1 b(b(b(b(x1)))) -> B(B(B(x1))) b(c(x1)) -> A(x1) c(C(x1)) -> x1 c(a(x1)) -> B(x1) c(c(c(c(x1)))) -> C(C(C(x1))) Problem 1: Reduction Pair Processor: -> Pairs: B#(a(a(a(x1)))) -> C(A(A(A(x1)))) C#(B(x1)) -> A(x1) C#(C(C(C(x1)))) -> C(c(c(x1))) C#(C(C(C(x1)))) -> C(c(x1)) C#(C(C(C(x1)))) -> C(x1) C#(C(C(a(x1)))) -> B#(x1) C#(C(C(a(x1)))) -> C(B(x1)) C#(C(C(a(x1)))) -> C(c(B(x1))) C#(C(C(a(x1)))) -> C(c(c(B(x1)))) C#(b(b(b(x1)))) -> B#(B(B(x1))) C#(b(b(b(x1)))) -> B#(B(x1)) C#(b(b(b(x1)))) -> B#(x1) C#(b(b(b(x1)))) -> A(B(B(B(x1)))) A(b(x1)) -> C#(x1) C(a(x1)) -> B#(x1) C(c(c(c(x1)))) -> C#(C(C(x1))) C(c(c(c(x1)))) -> C#(C(x1)) C(c(c(c(x1)))) -> C#(x1) -> Rules: A(A(A(A(x1)))) -> a(a(a(x1))) A(A(A(b(x1)))) -> a(a(a(C(x1)))) A(C(x1)) -> b(x1) A(a(x1)) -> x1 A(c(c(c(x1)))) -> b(C(C(C(x1)))) B(A(x1)) -> c(x1) B(B(B(B(x1)))) -> b(b(b(x1))) B(B(B(c(x1)))) -> b(b(b(A(x1)))) B(a(a(a(x1)))) -> c(A(A(A(x1)))) B(b(x1)) -> x1 C(B(x1)) -> a(x1) C(C(C(C(x1)))) -> c(c(c(x1))) C(C(C(a(x1)))) -> c(c(c(B(x1)))) C(b(b(b(x1)))) -> a(B(B(B(x1)))) C(c(x1)) -> x1 a(A(x1)) -> x1 a(a(a(a(x1)))) -> A(A(A(x1))) a(b(x1)) -> C(x1) b(B(x1)) -> x1 b(b(b(b(x1)))) -> B(B(B(x1))) b(c(x1)) -> A(x1) c(C(x1)) -> x1 c(a(x1)) -> B(x1) c(c(c(c(x1)))) -> C(C(C(x1))) -> Usable rules: A(A(A(A(x1)))) -> a(a(a(x1))) A(A(A(b(x1)))) -> a(a(a(C(x1)))) A(C(x1)) -> b(x1) A(a(x1)) -> x1 A(c(c(c(x1)))) -> b(C(C(C(x1)))) B(A(x1)) -> c(x1) B(B(B(B(x1)))) -> b(b(b(x1))) B(B(B(c(x1)))) -> b(b(b(A(x1)))) B(a(a(a(x1)))) -> c(A(A(A(x1)))) B(b(x1)) -> x1 C(B(x1)) -> a(x1) C(C(C(C(x1)))) -> c(c(c(x1))) C(C(C(a(x1)))) -> c(c(c(B(x1)))) C(b(b(b(x1)))) -> a(B(B(B(x1)))) C(c(x1)) -> x1 a(A(x1)) -> x1 a(a(a(a(x1)))) -> A(A(A(x1))) a(b(x1)) -> C(x1) b(B(x1)) -> x1 b(b(b(b(x1)))) -> B(B(B(x1))) b(c(x1)) -> A(x1) c(C(x1)) -> x1 c(a(x1)) -> B(x1) c(c(c(c(x1)))) -> C(C(C(x1))) ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [A](X) = 2.X + 2 [B](X) = 2.X + 2 [C](X) = 2.X + 2 [a](X) = 2.X + 2 [b](X) = 2.X + 2 [c](X) = 2.X + 2 [B#](X) = 2.X + 1 [C#](X) = 2.X + 1 [A](X) = 2.X + 1 [C](X) = 2.X Problem 1: SCC Processor: -> Pairs: C#(B(x1)) -> A(x1) C#(C(C(C(x1)))) -> C(c(c(x1))) C#(C(C(C(x1)))) -> C(c(x1)) C#(C(C(C(x1)))) -> C(x1) C#(C(C(a(x1)))) -> B#(x1) C#(C(C(a(x1)))) -> C(B(x1)) C#(C(C(a(x1)))) -> C(c(B(x1))) C#(C(C(a(x1)))) -> C(c(c(B(x1)))) C#(b(b(b(x1)))) -> B#(B(B(x1))) C#(b(b(b(x1)))) -> B#(B(x1)) C#(b(b(b(x1)))) -> B#(x1) C#(b(b(b(x1)))) -> A(B(B(B(x1)))) A(b(x1)) -> C#(x1) C(a(x1)) -> B#(x1) C(c(c(c(x1)))) -> C#(C(C(x1))) C(c(c(c(x1)))) -> C#(C(x1)) C(c(c(c(x1)))) -> C#(x1) -> Rules: A(A(A(A(x1)))) -> a(a(a(x1))) A(A(A(b(x1)))) -> a(a(a(C(x1)))) A(C(x1)) -> b(x1) A(a(x1)) -> x1 A(c(c(c(x1)))) -> b(C(C(C(x1)))) B(A(x1)) -> c(x1) B(B(B(B(x1)))) -> b(b(b(x1))) B(B(B(c(x1)))) -> b(b(b(A(x1)))) B(a(a(a(x1)))) -> c(A(A(A(x1)))) B(b(x1)) -> x1 C(B(x1)) -> a(x1) C(C(C(C(x1)))) -> c(c(c(x1))) C(C(C(a(x1)))) -> c(c(c(B(x1)))) C(b(b(b(x1)))) -> a(B(B(B(x1)))) C(c(x1)) -> x1 a(A(x1)) -> x1 a(a(a(a(x1)))) -> A(A(A(x1))) a(b(x1)) -> C(x1) b(B(x1)) -> x1 b(b(b(b(x1)))) -> B(B(B(x1))) b(c(x1)) -> A(x1) c(C(x1)) -> x1 c(a(x1)) -> B(x1) c(c(c(c(x1)))) -> C(C(C(x1))) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: C#(B(x1)) -> A(x1) C#(C(C(C(x1)))) -> C(c(c(x1))) C#(C(C(C(x1)))) -> C(c(x1)) C#(C(C(C(x1)))) -> C(x1) C#(C(C(a(x1)))) -> C(B(x1)) C#(C(C(a(x1)))) -> C(c(B(x1))) C#(C(C(a(x1)))) -> C(c(c(B(x1)))) C#(b(b(b(x1)))) -> A(B(B(B(x1)))) A(b(x1)) -> C#(x1) C(c(c(c(x1)))) -> C#(C(C(x1))) C(c(c(c(x1)))) -> C#(C(x1)) C(c(c(c(x1)))) -> C#(x1) ->->-> Rules: A(A(A(A(x1)))) -> a(a(a(x1))) A(A(A(b(x1)))) -> a(a(a(C(x1)))) A(C(x1)) -> b(x1) A(a(x1)) -> x1 A(c(c(c(x1)))) -> b(C(C(C(x1)))) B(A(x1)) -> c(x1) B(B(B(B(x1)))) -> b(b(b(x1))) B(B(B(c(x1)))) -> b(b(b(A(x1)))) B(a(a(a(x1)))) -> c(A(A(A(x1)))) B(b(x1)) -> x1 C(B(x1)) -> a(x1) C(C(C(C(x1)))) -> c(c(c(x1))) C(C(C(a(x1)))) -> c(c(c(B(x1)))) C(b(b(b(x1)))) -> a(B(B(B(x1)))) C(c(x1)) -> x1 a(A(x1)) -> x1 a(a(a(a(x1)))) -> A(A(A(x1))) a(b(x1)) -> C(x1) b(B(x1)) -> x1 b(b(b(b(x1)))) -> B(B(B(x1))) b(c(x1)) -> A(x1) c(C(x1)) -> x1 c(a(x1)) -> B(x1) c(c(c(c(x1)))) -> C(C(C(x1))) Problem 1: Reduction Pair Processor: -> Pairs: C#(B(x1)) -> A(x1) C#(C(C(C(x1)))) -> C(c(c(x1))) C#(C(C(C(x1)))) -> C(c(x1)) C#(C(C(C(x1)))) -> C(x1) C#(C(C(a(x1)))) -> C(B(x1)) C#(C(C(a(x1)))) -> C(c(B(x1))) C#(C(C(a(x1)))) -> C(c(c(B(x1)))) C#(b(b(b(x1)))) -> A(B(B(B(x1)))) A(b(x1)) -> C#(x1) C(c(c(c(x1)))) -> C#(C(C(x1))) C(c(c(c(x1)))) -> C#(C(x1)) C(c(c(c(x1)))) -> C#(x1) -> Rules: A(A(A(A(x1)))) -> a(a(a(x1))) A(A(A(b(x1)))) -> a(a(a(C(x1)))) A(C(x1)) -> b(x1) A(a(x1)) -> x1 A(c(c(c(x1)))) -> b(C(C(C(x1)))) B(A(x1)) -> c(x1) B(B(B(B(x1)))) -> b(b(b(x1))) B(B(B(c(x1)))) -> b(b(b(A(x1)))) B(a(a(a(x1)))) -> c(A(A(A(x1)))) B(b(x1)) -> x1 C(B(x1)) -> a(x1) C(C(C(C(x1)))) -> c(c(c(x1))) C(C(C(a(x1)))) -> c(c(c(B(x1)))) C(b(b(b(x1)))) -> a(B(B(B(x1)))) C(c(x1)) -> x1 a(A(x1)) -> x1 a(a(a(a(x1)))) -> A(A(A(x1))) a(b(x1)) -> C(x1) b(B(x1)) -> x1 b(b(b(b(x1)))) -> B(B(B(x1))) b(c(x1)) -> A(x1) c(C(x1)) -> x1 c(a(x1)) -> B(x1) c(c(c(c(x1)))) -> C(C(C(x1))) -> Usable rules: A(A(A(A(x1)))) -> a(a(a(x1))) A(A(A(b(x1)))) -> a(a(a(C(x1)))) A(C(x1)) -> b(x1) A(a(x1)) -> x1 A(c(c(c(x1)))) -> b(C(C(C(x1)))) B(A(x1)) -> c(x1) B(B(B(B(x1)))) -> b(b(b(x1))) B(B(B(c(x1)))) -> b(b(b(A(x1)))) B(a(a(a(x1)))) -> c(A(A(A(x1)))) B(b(x1)) -> x1 C(B(x1)) -> a(x1) C(C(C(C(x1)))) -> c(c(c(x1))) C(C(C(a(x1)))) -> c(c(c(B(x1)))) C(b(b(b(x1)))) -> a(B(B(B(x1)))) C(c(x1)) -> x1 a(A(x1)) -> x1 a(a(a(a(x1)))) -> A(A(A(x1))) a(b(x1)) -> C(x1) b(B(x1)) -> x1 b(b(b(b(x1)))) -> B(B(B(x1))) b(c(x1)) -> A(x1) c(C(x1)) -> x1 c(a(x1)) -> B(x1) c(c(c(c(x1)))) -> C(C(C(x1))) ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [A](X) = 2.X + 1 [B](X) = 2.X + 1 [C](X) = 2.X + 1 [a](X) = 2.X + 2 [b](X) = 2.X + 2 [c](X) = 2.X + 2 [C#](X) = 2.X [A](X) = 2.X [C](X) = X + 2 Problem 1: SCC Processor: -> Pairs: C#(C(C(C(x1)))) -> C(c(c(x1))) C#(C(C(C(x1)))) -> C(c(x1)) C#(C(C(C(x1)))) -> C(x1) C#(C(C(a(x1)))) -> C(B(x1)) C#(C(C(a(x1)))) -> C(c(B(x1))) C#(C(C(a(x1)))) -> C(c(c(B(x1)))) C#(b(b(b(x1)))) -> A(B(B(B(x1)))) A(b(x1)) -> C#(x1) C(c(c(c(x1)))) -> C#(C(C(x1))) C(c(c(c(x1)))) -> C#(C(x1)) C(c(c(c(x1)))) -> C#(x1) -> Rules: A(A(A(A(x1)))) -> a(a(a(x1))) A(A(A(b(x1)))) -> a(a(a(C(x1)))) A(C(x1)) -> b(x1) A(a(x1)) -> x1 A(c(c(c(x1)))) -> b(C(C(C(x1)))) B(A(x1)) -> c(x1) B(B(B(B(x1)))) -> b(b(b(x1))) B(B(B(c(x1)))) -> b(b(b(A(x1)))) B(a(a(a(x1)))) -> c(A(A(A(x1)))) B(b(x1)) -> x1 C(B(x1)) -> a(x1) C(C(C(C(x1)))) -> c(c(c(x1))) C(C(C(a(x1)))) -> c(c(c(B(x1)))) C(b(b(b(x1)))) -> a(B(B(B(x1)))) C(c(x1)) -> x1 a(A(x1)) -> x1 a(a(a(a(x1)))) -> A(A(A(x1))) a(b(x1)) -> C(x1) b(B(x1)) -> x1 b(b(b(b(x1)))) -> B(B(B(x1))) b(c(x1)) -> A(x1) c(C(x1)) -> x1 c(a(x1)) -> B(x1) c(c(c(c(x1)))) -> C(C(C(x1))) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: C#(C(C(C(x1)))) -> C(c(c(x1))) C#(C(C(C(x1)))) -> C(c(x1)) C#(C(C(C(x1)))) -> C(x1) C#(C(C(a(x1)))) -> C(B(x1)) C#(C(C(a(x1)))) -> C(c(B(x1))) C#(C(C(a(x1)))) -> C(c(c(B(x1)))) C#(b(b(b(x1)))) -> A(B(B(B(x1)))) A(b(x1)) -> C#(x1) C(c(c(c(x1)))) -> C#(C(C(x1))) C(c(c(c(x1)))) -> C#(C(x1)) C(c(c(c(x1)))) -> C#(x1) ->->-> Rules: A(A(A(A(x1)))) -> a(a(a(x1))) A(A(A(b(x1)))) -> a(a(a(C(x1)))) A(C(x1)) -> b(x1) A(a(x1)) -> x1 A(c(c(c(x1)))) -> b(C(C(C(x1)))) B(A(x1)) -> c(x1) B(B(B(B(x1)))) -> b(b(b(x1))) B(B(B(c(x1)))) -> b(b(b(A(x1)))) B(a(a(a(x1)))) -> c(A(A(A(x1)))) B(b(x1)) -> x1 C(B(x1)) -> a(x1) C(C(C(C(x1)))) -> c(c(c(x1))) C(C(C(a(x1)))) -> c(c(c(B(x1)))) C(b(b(b(x1)))) -> a(B(B(B(x1)))) C(c(x1)) -> x1 a(A(x1)) -> x1 a(a(a(a(x1)))) -> A(A(A(x1))) a(b(x1)) -> C(x1) b(B(x1)) -> x1 b(b(b(b(x1)))) -> B(B(B(x1))) b(c(x1)) -> A(x1) c(C(x1)) -> x1 c(a(x1)) -> B(x1) c(c(c(c(x1)))) -> C(C(C(x1))) Problem 1: Reduction Pair Processor: -> Pairs: C#(C(C(C(x1)))) -> C(c(c(x1))) C#(C(C(C(x1)))) -> C(c(x1)) C#(C(C(C(x1)))) -> C(x1) C#(C(C(a(x1)))) -> C(B(x1)) C#(C(C(a(x1)))) -> C(c(B(x1))) C#(C(C(a(x1)))) -> C(c(c(B(x1)))) C#(b(b(b(x1)))) -> A(B(B(B(x1)))) A(b(x1)) -> C#(x1) C(c(c(c(x1)))) -> C#(C(C(x1))) C(c(c(c(x1)))) -> C#(C(x1)) C(c(c(c(x1)))) -> C#(x1) -> Rules: A(A(A(A(x1)))) -> a(a(a(x1))) A(A(A(b(x1)))) -> a(a(a(C(x1)))) A(C(x1)) -> b(x1) A(a(x1)) -> x1 A(c(c(c(x1)))) -> b(C(C(C(x1)))) B(A(x1)) -> c(x1) B(B(B(B(x1)))) -> b(b(b(x1))) B(B(B(c(x1)))) -> b(b(b(A(x1)))) B(a(a(a(x1)))) -> c(A(A(A(x1)))) B(b(x1)) -> x1 C(B(x1)) -> a(x1) C(C(C(C(x1)))) -> c(c(c(x1))) C(C(C(a(x1)))) -> c(c(c(B(x1)))) C(b(b(b(x1)))) -> a(B(B(B(x1)))) C(c(x1)) -> x1 a(A(x1)) -> x1 a(a(a(a(x1)))) -> A(A(A(x1))) a(b(x1)) -> C(x1) b(B(x1)) -> x1 b(b(b(b(x1)))) -> B(B(B(x1))) b(c(x1)) -> A(x1) c(C(x1)) -> x1 c(a(x1)) -> B(x1) c(c(c(c(x1)))) -> C(C(C(x1))) -> Usable rules: A(A(A(A(x1)))) -> a(a(a(x1))) A(A(A(b(x1)))) -> a(a(a(C(x1)))) A(C(x1)) -> b(x1) A(a(x1)) -> x1 A(c(c(c(x1)))) -> b(C(C(C(x1)))) B(A(x1)) -> c(x1) B(B(B(B(x1)))) -> b(b(b(x1))) B(B(B(c(x1)))) -> b(b(b(A(x1)))) B(a(a(a(x1)))) -> c(A(A(A(x1)))) B(b(x1)) -> x1 C(B(x1)) -> a(x1) C(C(C(C(x1)))) -> c(c(c(x1))) C(C(C(a(x1)))) -> c(c(c(B(x1)))) C(b(b(b(x1)))) -> a(B(B(B(x1)))) C(c(x1)) -> x1 a(A(x1)) -> x1 a(a(a(a(x1)))) -> A(A(A(x1))) a(b(x1)) -> C(x1) b(B(x1)) -> x1 b(b(b(b(x1)))) -> B(B(B(x1))) b(c(x1)) -> A(x1) c(C(x1)) -> x1 c(a(x1)) -> B(x1) c(c(c(c(x1)))) -> C(C(C(x1))) ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [A](X) = 2.X + 2 [B](X) = 2.X + 2 [C](X) = 2.X + 2 [a](X) = 2.X + 2 [b](X) = 2.X + 2 [c](X) = 2.X + 2 [C#](X) = 2.X + 2 [A](X) = 2.X + 1 [C](X) = X + 2 Problem 1: SCC Processor: -> Pairs: C#(C(C(C(x1)))) -> C(c(x1)) C#(C(C(C(x1)))) -> C(x1) C#(C(C(a(x1)))) -> C(B(x1)) C#(C(C(a(x1)))) -> C(c(B(x1))) C#(C(C(a(x1)))) -> C(c(c(B(x1)))) C#(b(b(b(x1)))) -> A(B(B(B(x1)))) A(b(x1)) -> C#(x1) C(c(c(c(x1)))) -> C#(C(C(x1))) C(c(c(c(x1)))) -> C#(C(x1)) C(c(c(c(x1)))) -> C#(x1) -> Rules: A(A(A(A(x1)))) -> a(a(a(x1))) A(A(A(b(x1)))) -> a(a(a(C(x1)))) A(C(x1)) -> b(x1) A(a(x1)) -> x1 A(c(c(c(x1)))) -> b(C(C(C(x1)))) B(A(x1)) -> c(x1) B(B(B(B(x1)))) -> b(b(b(x1))) B(B(B(c(x1)))) -> b(b(b(A(x1)))) B(a(a(a(x1)))) -> c(A(A(A(x1)))) B(b(x1)) -> x1 C(B(x1)) -> a(x1) C(C(C(C(x1)))) -> c(c(c(x1))) C(C(C(a(x1)))) -> c(c(c(B(x1)))) C(b(b(b(x1)))) -> a(B(B(B(x1)))) C(c(x1)) -> x1 a(A(x1)) -> x1 a(a(a(a(x1)))) -> A(A(A(x1))) a(b(x1)) -> C(x1) b(B(x1)) -> x1 b(b(b(b(x1)))) -> B(B(B(x1))) b(c(x1)) -> A(x1) c(C(x1)) -> x1 c(a(x1)) -> B(x1) c(c(c(c(x1)))) -> C(C(C(x1))) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: C#(C(C(C(x1)))) -> C(c(x1)) C#(C(C(C(x1)))) -> C(x1) C#(C(C(a(x1)))) -> C(B(x1)) C#(C(C(a(x1)))) -> C(c(B(x1))) C#(C(C(a(x1)))) -> C(c(c(B(x1)))) C#(b(b(b(x1)))) -> A(B(B(B(x1)))) A(b(x1)) -> C#(x1) C(c(c(c(x1)))) -> C#(C(C(x1))) C(c(c(c(x1)))) -> C#(C(x1)) C(c(c(c(x1)))) -> C#(x1) ->->-> Rules: A(A(A(A(x1)))) -> a(a(a(x1))) A(A(A(b(x1)))) -> a(a(a(C(x1)))) A(C(x1)) -> b(x1) A(a(x1)) -> x1 A(c(c(c(x1)))) -> b(C(C(C(x1)))) B(A(x1)) -> c(x1) B(B(B(B(x1)))) -> b(b(b(x1))) B(B(B(c(x1)))) -> b(b(b(A(x1)))) B(a(a(a(x1)))) -> c(A(A(A(x1)))) B(b(x1)) -> x1 C(B(x1)) -> a(x1) C(C(C(C(x1)))) -> c(c(c(x1))) C(C(C(a(x1)))) -> c(c(c(B(x1)))) C(b(b(b(x1)))) -> a(B(B(B(x1)))) C(c(x1)) -> x1 a(A(x1)) -> x1 a(a(a(a(x1)))) -> A(A(A(x1))) a(b(x1)) -> C(x1) b(B(x1)) -> x1 b(b(b(b(x1)))) -> B(B(B(x1))) b(c(x1)) -> A(x1) c(C(x1)) -> x1 c(a(x1)) -> B(x1) c(c(c(c(x1)))) -> C(C(C(x1))) Problem 1: Reduction Pair Processor: -> Pairs: C#(C(C(C(x1)))) -> C(c(x1)) C#(C(C(C(x1)))) -> C(x1) C#(C(C(a(x1)))) -> C(B(x1)) C#(C(C(a(x1)))) -> C(c(B(x1))) C#(C(C(a(x1)))) -> C(c(c(B(x1)))) C#(b(b(b(x1)))) -> A(B(B(B(x1)))) A(b(x1)) -> C#(x1) C(c(c(c(x1)))) -> C#(C(C(x1))) C(c(c(c(x1)))) -> C#(C(x1)) C(c(c(c(x1)))) -> C#(x1) -> Rules: A(A(A(A(x1)))) -> a(a(a(x1))) A(A(A(b(x1)))) -> a(a(a(C(x1)))) A(C(x1)) -> b(x1) A(a(x1)) -> x1 A(c(c(c(x1)))) -> b(C(C(C(x1)))) B(A(x1)) -> c(x1) B(B(B(B(x1)))) -> b(b(b(x1))) B(B(B(c(x1)))) -> b(b(b(A(x1)))) B(a(a(a(x1)))) -> c(A(A(A(x1)))) B(b(x1)) -> x1 C(B(x1)) -> a(x1) C(C(C(C(x1)))) -> c(c(c(x1))) C(C(C(a(x1)))) -> c(c(c(B(x1)))) C(b(b(b(x1)))) -> a(B(B(B(x1)))) C(c(x1)) -> x1 a(A(x1)) -> x1 a(a(a(a(x1)))) -> A(A(A(x1))) a(b(x1)) -> C(x1) b(B(x1)) -> x1 b(b(b(b(x1)))) -> B(B(B(x1))) b(c(x1)) -> A(x1) c(C(x1)) -> x1 c(a(x1)) -> B(x1) c(c(c(c(x1)))) -> C(C(C(x1))) -> Usable rules: A(A(A(A(x1)))) -> a(a(a(x1))) A(A(A(b(x1)))) -> a(a(a(C(x1)))) A(C(x1)) -> b(x1) A(a(x1)) -> x1 A(c(c(c(x1)))) -> b(C(C(C(x1)))) B(A(x1)) -> c(x1) B(B(B(B(x1)))) -> b(b(b(x1))) B(B(B(c(x1)))) -> b(b(b(A(x1)))) B(a(a(a(x1)))) -> c(A(A(A(x1)))) B(b(x1)) -> x1 C(B(x1)) -> a(x1) C(C(C(C(x1)))) -> c(c(c(x1))) C(C(C(a(x1)))) -> c(c(c(B(x1)))) C(b(b(b(x1)))) -> a(B(B(B(x1)))) C(c(x1)) -> x1 a(A(x1)) -> x1 a(a(a(a(x1)))) -> A(A(A(x1))) a(b(x1)) -> C(x1) b(B(x1)) -> x1 b(b(b(b(x1)))) -> B(B(B(x1))) b(c(x1)) -> A(x1) c(C(x1)) -> x1 c(a(x1)) -> B(x1) c(c(c(c(x1)))) -> C(C(C(x1))) ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [A](X) = 2.X + 2 [B](X) = 2.X + 2 [C](X) = 2.X + 2 [a](X) = 2.X + 2 [b](X) = 2.X + 2 [c](X) = 2.X + 2 [C#](X) = 2.X + 1 [A](X) = X + 1 [C](X) = 2.X + 1 Problem 1: SCC Processor: -> Pairs: C#(C(C(C(x1)))) -> C(x1) C#(C(C(a(x1)))) -> C(B(x1)) C#(C(C(a(x1)))) -> C(c(B(x1))) C#(C(C(a(x1)))) -> C(c(c(B(x1)))) C#(b(b(b(x1)))) -> A(B(B(B(x1)))) A(b(x1)) -> C#(x1) C(c(c(c(x1)))) -> C#(C(C(x1))) C(c(c(c(x1)))) -> C#(C(x1)) C(c(c(c(x1)))) -> C#(x1) -> Rules: A(A(A(A(x1)))) -> a(a(a(x1))) A(A(A(b(x1)))) -> a(a(a(C(x1)))) A(C(x1)) -> b(x1) A(a(x1)) -> x1 A(c(c(c(x1)))) -> b(C(C(C(x1)))) B(A(x1)) -> c(x1) B(B(B(B(x1)))) -> b(b(b(x1))) B(B(B(c(x1)))) -> b(b(b(A(x1)))) B(a(a(a(x1)))) -> c(A(A(A(x1)))) B(b(x1)) -> x1 C(B(x1)) -> a(x1) C(C(C(C(x1)))) -> c(c(c(x1))) C(C(C(a(x1)))) -> c(c(c(B(x1)))) C(b(b(b(x1)))) -> a(B(B(B(x1)))) C(c(x1)) -> x1 a(A(x1)) -> x1 a(a(a(a(x1)))) -> A(A(A(x1))) a(b(x1)) -> C(x1) b(B(x1)) -> x1 b(b(b(b(x1)))) -> B(B(B(x1))) b(c(x1)) -> A(x1) c(C(x1)) -> x1 c(a(x1)) -> B(x1) c(c(c(c(x1)))) -> C(C(C(x1))) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: C#(C(C(C(x1)))) -> C(x1) C#(C(C(a(x1)))) -> C(B(x1)) C#(C(C(a(x1)))) -> C(c(B(x1))) C#(C(C(a(x1)))) -> C(c(c(B(x1)))) C#(b(b(b(x1)))) -> A(B(B(B(x1)))) A(b(x1)) -> C#(x1) C(c(c(c(x1)))) -> C#(C(C(x1))) C(c(c(c(x1)))) -> C#(C(x1)) C(c(c(c(x1)))) -> C#(x1) ->->-> Rules: A(A(A(A(x1)))) -> a(a(a(x1))) A(A(A(b(x1)))) -> a(a(a(C(x1)))) A(C(x1)) -> b(x1) A(a(x1)) -> x1 A(c(c(c(x1)))) -> b(C(C(C(x1)))) B(A(x1)) -> c(x1) B(B(B(B(x1)))) -> b(b(b(x1))) B(B(B(c(x1)))) -> b(b(b(A(x1)))) B(a(a(a(x1)))) -> c(A(A(A(x1)))) B(b(x1)) -> x1 C(B(x1)) -> a(x1) C(C(C(C(x1)))) -> c(c(c(x1))) C(C(C(a(x1)))) -> c(c(c(B(x1)))) C(b(b(b(x1)))) -> a(B(B(B(x1)))) C(c(x1)) -> x1 a(A(x1)) -> x1 a(a(a(a(x1)))) -> A(A(A(x1))) a(b(x1)) -> C(x1) b(B(x1)) -> x1 b(b(b(b(x1)))) -> B(B(B(x1))) b(c(x1)) -> A(x1) c(C(x1)) -> x1 c(a(x1)) -> B(x1) c(c(c(c(x1)))) -> C(C(C(x1))) Problem 1: Reduction Pair Processor: -> Pairs: C#(C(C(C(x1)))) -> C(x1) C#(C(C(a(x1)))) -> C(B(x1)) C#(C(C(a(x1)))) -> C(c(B(x1))) C#(C(C(a(x1)))) -> C(c(c(B(x1)))) C#(b(b(b(x1)))) -> A(B(B(B(x1)))) A(b(x1)) -> C#(x1) C(c(c(c(x1)))) -> C#(C(C(x1))) C(c(c(c(x1)))) -> C#(C(x1)) C(c(c(c(x1)))) -> C#(x1) -> Rules: A(A(A(A(x1)))) -> a(a(a(x1))) A(A(A(b(x1)))) -> a(a(a(C(x1)))) A(C(x1)) -> b(x1) A(a(x1)) -> x1 A(c(c(c(x1)))) -> b(C(C(C(x1)))) B(A(x1)) -> c(x1) B(B(B(B(x1)))) -> b(b(b(x1))) B(B(B(c(x1)))) -> b(b(b(A(x1)))) B(a(a(a(x1)))) -> c(A(A(A(x1)))) B(b(x1)) -> x1 C(B(x1)) -> a(x1) C(C(C(C(x1)))) -> c(c(c(x1))) C(C(C(a(x1)))) -> c(c(c(B(x1)))) C(b(b(b(x1)))) -> a(B(B(B(x1)))) C(c(x1)) -> x1 a(A(x1)) -> x1 a(a(a(a(x1)))) -> A(A(A(x1))) a(b(x1)) -> C(x1) b(B(x1)) -> x1 b(b(b(b(x1)))) -> B(B(B(x1))) b(c(x1)) -> A(x1) c(C(x1)) -> x1 c(a(x1)) -> B(x1) c(c(c(c(x1)))) -> C(C(C(x1))) -> Usable rules: A(A(A(A(x1)))) -> a(a(a(x1))) A(A(A(b(x1)))) -> a(a(a(C(x1)))) A(C(x1)) -> b(x1) A(a(x1)) -> x1 A(c(c(c(x1)))) -> b(C(C(C(x1)))) B(A(x1)) -> c(x1) B(B(B(B(x1)))) -> b(b(b(x1))) B(B(B(c(x1)))) -> b(b(b(A(x1)))) B(a(a(a(x1)))) -> c(A(A(A(x1)))) B(b(x1)) -> x1 C(B(x1)) -> a(x1) C(C(C(C(x1)))) -> c(c(c(x1))) C(C(C(a(x1)))) -> c(c(c(B(x1)))) C(b(b(b(x1)))) -> a(B(B(B(x1)))) C(c(x1)) -> x1 a(A(x1)) -> x1 a(a(a(a(x1)))) -> A(A(A(x1))) a(b(x1)) -> C(x1) b(B(x1)) -> x1 b(b(b(b(x1)))) -> B(B(B(x1))) b(c(x1)) -> A(x1) c(C(x1)) -> x1 c(a(x1)) -> B(x1) c(c(c(c(x1)))) -> C(C(C(x1))) ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [A](X) = 2.X + 2 [B](X) = 2.X + 2 [C](X) = 2.X + 2 [a](X) = 2.X + 2 [b](X) = 2.X + 2 [c](X) = 2.X + 2 [C#](X) = 2.X + 2 [A](X) = 2.X + 2 [C](X) = X + 2 Problem 1: SCC Processor: -> Pairs: C#(C(C(a(x1)))) -> C(B(x1)) C#(C(C(a(x1)))) -> C(c(B(x1))) C#(C(C(a(x1)))) -> C(c(c(B(x1)))) C#(b(b(b(x1)))) -> A(B(B(B(x1)))) A(b(x1)) -> C#(x1) C(c(c(c(x1)))) -> C#(C(C(x1))) C(c(c(c(x1)))) -> C#(C(x1)) C(c(c(c(x1)))) -> C#(x1) -> Rules: A(A(A(A(x1)))) -> a(a(a(x1))) A(A(A(b(x1)))) -> a(a(a(C(x1)))) A(C(x1)) -> b(x1) A(a(x1)) -> x1 A(c(c(c(x1)))) -> b(C(C(C(x1)))) B(A(x1)) -> c(x1) B(B(B(B(x1)))) -> b(b(b(x1))) B(B(B(c(x1)))) -> b(b(b(A(x1)))) B(a(a(a(x1)))) -> c(A(A(A(x1)))) B(b(x1)) -> x1 C(B(x1)) -> a(x1) C(C(C(C(x1)))) -> c(c(c(x1))) C(C(C(a(x1)))) -> c(c(c(B(x1)))) C(b(b(b(x1)))) -> a(B(B(B(x1)))) C(c(x1)) -> x1 a(A(x1)) -> x1 a(a(a(a(x1)))) -> A(A(A(x1))) a(b(x1)) -> C(x1) b(B(x1)) -> x1 b(b(b(b(x1)))) -> B(B(B(x1))) b(c(x1)) -> A(x1) c(C(x1)) -> x1 c(a(x1)) -> B(x1) c(c(c(c(x1)))) -> C(C(C(x1))) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: C#(C(C(a(x1)))) -> C(B(x1)) C#(C(C(a(x1)))) -> C(c(B(x1))) C#(C(C(a(x1)))) -> C(c(c(B(x1)))) C#(b(b(b(x1)))) -> A(B(B(B(x1)))) A(b(x1)) -> C#(x1) C(c(c(c(x1)))) -> C#(C(C(x1))) C(c(c(c(x1)))) -> C#(C(x1)) C(c(c(c(x1)))) -> C#(x1) ->->-> Rules: A(A(A(A(x1)))) -> a(a(a(x1))) A(A(A(b(x1)))) -> a(a(a(C(x1)))) A(C(x1)) -> b(x1) A(a(x1)) -> x1 A(c(c(c(x1)))) -> b(C(C(C(x1)))) B(A(x1)) -> c(x1) B(B(B(B(x1)))) -> b(b(b(x1))) B(B(B(c(x1)))) -> b(b(b(A(x1)))) B(a(a(a(x1)))) -> c(A(A(A(x1)))) B(b(x1)) -> x1 C(B(x1)) -> a(x1) C(C(C(C(x1)))) -> c(c(c(x1))) C(C(C(a(x1)))) -> c(c(c(B(x1)))) C(b(b(b(x1)))) -> a(B(B(B(x1)))) C(c(x1)) -> x1 a(A(x1)) -> x1 a(a(a(a(x1)))) -> A(A(A(x1))) a(b(x1)) -> C(x1) b(B(x1)) -> x1 b(b(b(b(x1)))) -> B(B(B(x1))) b(c(x1)) -> A(x1) c(C(x1)) -> x1 c(a(x1)) -> B(x1) c(c(c(c(x1)))) -> C(C(C(x1))) Problem 1: Reduction Pair Processor: -> Pairs: C#(C(C(a(x1)))) -> C(B(x1)) C#(C(C(a(x1)))) -> C(c(B(x1))) C#(C(C(a(x1)))) -> C(c(c(B(x1)))) C#(b(b(b(x1)))) -> A(B(B(B(x1)))) A(b(x1)) -> C#(x1) C(c(c(c(x1)))) -> C#(C(C(x1))) C(c(c(c(x1)))) -> C#(C(x1)) C(c(c(c(x1)))) -> C#(x1) -> Rules: A(A(A(A(x1)))) -> a(a(a(x1))) A(A(A(b(x1)))) -> a(a(a(C(x1)))) A(C(x1)) -> b(x1) A(a(x1)) -> x1 A(c(c(c(x1)))) -> b(C(C(C(x1)))) B(A(x1)) -> c(x1) B(B(B(B(x1)))) -> b(b(b(x1))) B(B(B(c(x1)))) -> b(b(b(A(x1)))) B(a(a(a(x1)))) -> c(A(A(A(x1)))) B(b(x1)) -> x1 C(B(x1)) -> a(x1) C(C(C(C(x1)))) -> c(c(c(x1))) C(C(C(a(x1)))) -> c(c(c(B(x1)))) C(b(b(b(x1)))) -> a(B(B(B(x1)))) C(c(x1)) -> x1 a(A(x1)) -> x1 a(a(a(a(x1)))) -> A(A(A(x1))) a(b(x1)) -> C(x1) b(B(x1)) -> x1 b(b(b(b(x1)))) -> B(B(B(x1))) b(c(x1)) -> A(x1) c(C(x1)) -> x1 c(a(x1)) -> B(x1) c(c(c(c(x1)))) -> C(C(C(x1))) -> Usable rules: A(A(A(A(x1)))) -> a(a(a(x1))) A(A(A(b(x1)))) -> a(a(a(C(x1)))) A(C(x1)) -> b(x1) A(a(x1)) -> x1 A(c(c(c(x1)))) -> b(C(C(C(x1)))) B(A(x1)) -> c(x1) B(B(B(B(x1)))) -> b(b(b(x1))) B(B(B(c(x1)))) -> b(b(b(A(x1)))) B(a(a(a(x1)))) -> c(A(A(A(x1)))) B(b(x1)) -> x1 C(B(x1)) -> a(x1) C(C(C(C(x1)))) -> c(c(c(x1))) C(C(C(a(x1)))) -> c(c(c(B(x1)))) C(b(b(b(x1)))) -> a(B(B(B(x1)))) C(c(x1)) -> x1 a(A(x1)) -> x1 a(a(a(a(x1)))) -> A(A(A(x1))) a(b(x1)) -> C(x1) b(B(x1)) -> x1 b(b(b(b(x1)))) -> B(B(B(x1))) b(c(x1)) -> A(x1) c(C(x1)) -> x1 c(a(x1)) -> B(x1) c(c(c(c(x1)))) -> C(C(C(x1))) ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [A](X) = 2.X + 2 [B](X) = 2.X + 2 [C](X) = 2.X + 2 [a](X) = 2.X + 2 [b](X) = 2.X + 2 [c](X) = 2.X + 2 [C#](X) = 2.X + 2 [A](X) = 2.X + 2 [C](X) = 2.X + 2 Problem 1: SCC Processor: -> Pairs: C#(C(C(a(x1)))) -> C(c(B(x1))) C#(C(C(a(x1)))) -> C(c(c(B(x1)))) C#(b(b(b(x1)))) -> A(B(B(B(x1)))) A(b(x1)) -> C#(x1) C(c(c(c(x1)))) -> C#(C(C(x1))) C(c(c(c(x1)))) -> C#(C(x1)) C(c(c(c(x1)))) -> C#(x1) -> Rules: A(A(A(A(x1)))) -> a(a(a(x1))) A(A(A(b(x1)))) -> a(a(a(C(x1)))) A(C(x1)) -> b(x1) A(a(x1)) -> x1 A(c(c(c(x1)))) -> b(C(C(C(x1)))) B(A(x1)) -> c(x1) B(B(B(B(x1)))) -> b(b(b(x1))) B(B(B(c(x1)))) -> b(b(b(A(x1)))) B(a(a(a(x1)))) -> c(A(A(A(x1)))) B(b(x1)) -> x1 C(B(x1)) -> a(x1) C(C(C(C(x1)))) -> c(c(c(x1))) C(C(C(a(x1)))) -> c(c(c(B(x1)))) C(b(b(b(x1)))) -> a(B(B(B(x1)))) C(c(x1)) -> x1 a(A(x1)) -> x1 a(a(a(a(x1)))) -> A(A(A(x1))) a(b(x1)) -> C(x1) b(B(x1)) -> x1 b(b(b(b(x1)))) -> B(B(B(x1))) b(c(x1)) -> A(x1) c(C(x1)) -> x1 c(a(x1)) -> B(x1) c(c(c(c(x1)))) -> C(C(C(x1))) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: C#(C(C(a(x1)))) -> C(c(B(x1))) C#(C(C(a(x1)))) -> C(c(c(B(x1)))) C#(b(b(b(x1)))) -> A(B(B(B(x1)))) A(b(x1)) -> C#(x1) C(c(c(c(x1)))) -> C#(C(C(x1))) C(c(c(c(x1)))) -> C#(C(x1)) C(c(c(c(x1)))) -> C#(x1) ->->-> Rules: A(A(A(A(x1)))) -> a(a(a(x1))) A(A(A(b(x1)))) -> a(a(a(C(x1)))) A(C(x1)) -> b(x1) A(a(x1)) -> x1 A(c(c(c(x1)))) -> b(C(C(C(x1)))) B(A(x1)) -> c(x1) B(B(B(B(x1)))) -> b(b(b(x1))) B(B(B(c(x1)))) -> b(b(b(A(x1)))) B(a(a(a(x1)))) -> c(A(A(A(x1)))) B(b(x1)) -> x1 C(B(x1)) -> a(x1) C(C(C(C(x1)))) -> c(c(c(x1))) C(C(C(a(x1)))) -> c(c(c(B(x1)))) C(b(b(b(x1)))) -> a(B(B(B(x1)))) C(c(x1)) -> x1 a(A(x1)) -> x1 a(a(a(a(x1)))) -> A(A(A(x1))) a(b(x1)) -> C(x1) b(B(x1)) -> x1 b(b(b(b(x1)))) -> B(B(B(x1))) b(c(x1)) -> A(x1) c(C(x1)) -> x1 c(a(x1)) -> B(x1) c(c(c(c(x1)))) -> C(C(C(x1))) Problem 1: Reduction Pair Processor: -> Pairs: C#(C(C(a(x1)))) -> C(c(B(x1))) C#(C(C(a(x1)))) -> C(c(c(B(x1)))) C#(b(b(b(x1)))) -> A(B(B(B(x1)))) A(b(x1)) -> C#(x1) C(c(c(c(x1)))) -> C#(C(C(x1))) C(c(c(c(x1)))) -> C#(C(x1)) C(c(c(c(x1)))) -> C#(x1) -> Rules: A(A(A(A(x1)))) -> a(a(a(x1))) A(A(A(b(x1)))) -> a(a(a(C(x1)))) A(C(x1)) -> b(x1) A(a(x1)) -> x1 A(c(c(c(x1)))) -> b(C(C(C(x1)))) B(A(x1)) -> c(x1) B(B(B(B(x1)))) -> b(b(b(x1))) B(B(B(c(x1)))) -> b(b(b(A(x1)))) B(a(a(a(x1)))) -> c(A(A(A(x1)))) B(b(x1)) -> x1 C(B(x1)) -> a(x1) C(C(C(C(x1)))) -> c(c(c(x1))) C(C(C(a(x1)))) -> c(c(c(B(x1)))) C(b(b(b(x1)))) -> a(B(B(B(x1)))) C(c(x1)) -> x1 a(A(x1)) -> x1 a(a(a(a(x1)))) -> A(A(A(x1))) a(b(x1)) -> C(x1) b(B(x1)) -> x1 b(b(b(b(x1)))) -> B(B(B(x1))) b(c(x1)) -> A(x1) c(C(x1)) -> x1 c(a(x1)) -> B(x1) c(c(c(c(x1)))) -> C(C(C(x1))) -> Usable rules: A(A(A(A(x1)))) -> a(a(a(x1))) A(A(A(b(x1)))) -> a(a(a(C(x1)))) A(C(x1)) -> b(x1) A(a(x1)) -> x1 A(c(c(c(x1)))) -> b(C(C(C(x1)))) B(A(x1)) -> c(x1) B(B(B(B(x1)))) -> b(b(b(x1))) B(B(B(c(x1)))) -> b(b(b(A(x1)))) B(a(a(a(x1)))) -> c(A(A(A(x1)))) B(b(x1)) -> x1 C(B(x1)) -> a(x1) C(C(C(C(x1)))) -> c(c(c(x1))) C(C(C(a(x1)))) -> c(c(c(B(x1)))) C(b(b(b(x1)))) -> a(B(B(B(x1)))) C(c(x1)) -> x1 a(A(x1)) -> x1 a(a(a(a(x1)))) -> A(A(A(x1))) a(b(x1)) -> C(x1) b(B(x1)) -> x1 b(b(b(b(x1)))) -> B(B(B(x1))) b(c(x1)) -> A(x1) c(C(x1)) -> x1 c(a(x1)) -> B(x1) c(c(c(c(x1)))) -> C(C(C(x1))) ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [A](X) = 2.X + 2 [B](X) = 2.X + 2 [C](X) = 2.X + 2 [a](X) = 2.X + 2 [b](X) = 2.X + 2 [c](X) = 2.X + 2 [C#](X) = 2.X + 2 [A](X) = X [C](X) = 2.X + 2 Problem 1: SCC Processor: -> Pairs: C#(C(C(a(x1)))) -> C(c(c(B(x1)))) C#(b(b(b(x1)))) -> A(B(B(B(x1)))) A(b(x1)) -> C#(x1) C(c(c(c(x1)))) -> C#(C(C(x1))) C(c(c(c(x1)))) -> C#(C(x1)) C(c(c(c(x1)))) -> C#(x1) -> Rules: A(A(A(A(x1)))) -> a(a(a(x1))) A(A(A(b(x1)))) -> a(a(a(C(x1)))) A(C(x1)) -> b(x1) A(a(x1)) -> x1 A(c(c(c(x1)))) -> b(C(C(C(x1)))) B(A(x1)) -> c(x1) B(B(B(B(x1)))) -> b(b(b(x1))) B(B(B(c(x1)))) -> b(b(b(A(x1)))) B(a(a(a(x1)))) -> c(A(A(A(x1)))) B(b(x1)) -> x1 C(B(x1)) -> a(x1) C(C(C(C(x1)))) -> c(c(c(x1))) C(C(C(a(x1)))) -> c(c(c(B(x1)))) C(b(b(b(x1)))) -> a(B(B(B(x1)))) C(c(x1)) -> x1 a(A(x1)) -> x1 a(a(a(a(x1)))) -> A(A(A(x1))) a(b(x1)) -> C(x1) b(B(x1)) -> x1 b(b(b(b(x1)))) -> B(B(B(x1))) b(c(x1)) -> A(x1) c(C(x1)) -> x1 c(a(x1)) -> B(x1) c(c(c(c(x1)))) -> C(C(C(x1))) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: C#(C(C(a(x1)))) -> C(c(c(B(x1)))) C#(b(b(b(x1)))) -> A(B(B(B(x1)))) A(b(x1)) -> C#(x1) C(c(c(c(x1)))) -> C#(C(C(x1))) C(c(c(c(x1)))) -> C#(C(x1)) C(c(c(c(x1)))) -> C#(x1) ->->-> Rules: A(A(A(A(x1)))) -> a(a(a(x1))) A(A(A(b(x1)))) -> a(a(a(C(x1)))) A(C(x1)) -> b(x1) A(a(x1)) -> x1 A(c(c(c(x1)))) -> b(C(C(C(x1)))) B(A(x1)) -> c(x1) B(B(B(B(x1)))) -> b(b(b(x1))) B(B(B(c(x1)))) -> b(b(b(A(x1)))) B(a(a(a(x1)))) -> c(A(A(A(x1)))) B(b(x1)) -> x1 C(B(x1)) -> a(x1) C(C(C(C(x1)))) -> c(c(c(x1))) C(C(C(a(x1)))) -> c(c(c(B(x1)))) C(b(b(b(x1)))) -> a(B(B(B(x1)))) C(c(x1)) -> x1 a(A(x1)) -> x1 a(a(a(a(x1)))) -> A(A(A(x1))) a(b(x1)) -> C(x1) b(B(x1)) -> x1 b(b(b(b(x1)))) -> B(B(B(x1))) b(c(x1)) -> A(x1) c(C(x1)) -> x1 c(a(x1)) -> B(x1) c(c(c(c(x1)))) -> C(C(C(x1))) Problem 1: Reduction Pair Processor: -> Pairs: C#(C(C(a(x1)))) -> C(c(c(B(x1)))) C#(b(b(b(x1)))) -> A(B(B(B(x1)))) A(b(x1)) -> C#(x1) C(c(c(c(x1)))) -> C#(C(C(x1))) C(c(c(c(x1)))) -> C#(C(x1)) C(c(c(c(x1)))) -> C#(x1) -> Rules: A(A(A(A(x1)))) -> a(a(a(x1))) A(A(A(b(x1)))) -> a(a(a(C(x1)))) A(C(x1)) -> b(x1) A(a(x1)) -> x1 A(c(c(c(x1)))) -> b(C(C(C(x1)))) B(A(x1)) -> c(x1) B(B(B(B(x1)))) -> b(b(b(x1))) B(B(B(c(x1)))) -> b(b(b(A(x1)))) B(a(a(a(x1)))) -> c(A(A(A(x1)))) B(b(x1)) -> x1 C(B(x1)) -> a(x1) C(C(C(C(x1)))) -> c(c(c(x1))) C(C(C(a(x1)))) -> c(c(c(B(x1)))) C(b(b(b(x1)))) -> a(B(B(B(x1)))) C(c(x1)) -> x1 a(A(x1)) -> x1 a(a(a(a(x1)))) -> A(A(A(x1))) a(b(x1)) -> C(x1) b(B(x1)) -> x1 b(b(b(b(x1)))) -> B(B(B(x1))) b(c(x1)) -> A(x1) c(C(x1)) -> x1 c(a(x1)) -> B(x1) c(c(c(c(x1)))) -> C(C(C(x1))) -> Usable rules: A(A(A(A(x1)))) -> a(a(a(x1))) A(A(A(b(x1)))) -> a(a(a(C(x1)))) A(C(x1)) -> b(x1) A(a(x1)) -> x1 A(c(c(c(x1)))) -> b(C(C(C(x1)))) B(A(x1)) -> c(x1) B(B(B(B(x1)))) -> b(b(b(x1))) B(B(B(c(x1)))) -> b(b(b(A(x1)))) B(a(a(a(x1)))) -> c(A(A(A(x1)))) B(b(x1)) -> x1 C(B(x1)) -> a(x1) C(C(C(C(x1)))) -> c(c(c(x1))) C(C(C(a(x1)))) -> c(c(c(B(x1)))) C(b(b(b(x1)))) -> a(B(B(B(x1)))) C(c(x1)) -> x1 a(A(x1)) -> x1 a(a(a(a(x1)))) -> A(A(A(x1))) a(b(x1)) -> C(x1) b(B(x1)) -> x1 b(b(b(b(x1)))) -> B(B(B(x1))) b(c(x1)) -> A(x1) c(C(x1)) -> x1 c(a(x1)) -> B(x1) c(c(c(c(x1)))) -> C(C(C(x1))) ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [A](X) = 2.X + 2 [B](X) = 2.X + 2 [C](X) = 2.X + 2 [a](X) = 2.X + 2 [b](X) = 2.X + 2 [c](X) = 2.X + 2 [C#](X) = 2.X + 2 [A](X) = 2.X [C](X) = 2.X + 1 Problem 1: SCC Processor: -> Pairs: C#(b(b(b(x1)))) -> A(B(B(B(x1)))) A(b(x1)) -> C#(x1) C(c(c(c(x1)))) -> C#(C(C(x1))) C(c(c(c(x1)))) -> C#(C(x1)) C(c(c(c(x1)))) -> C#(x1) -> Rules: A(A(A(A(x1)))) -> a(a(a(x1))) A(A(A(b(x1)))) -> a(a(a(C(x1)))) A(C(x1)) -> b(x1) A(a(x1)) -> x1 A(c(c(c(x1)))) -> b(C(C(C(x1)))) B(A(x1)) -> c(x1) B(B(B(B(x1)))) -> b(b(b(x1))) B(B(B(c(x1)))) -> b(b(b(A(x1)))) B(a(a(a(x1)))) -> c(A(A(A(x1)))) B(b(x1)) -> x1 C(B(x1)) -> a(x1) C(C(C(C(x1)))) -> c(c(c(x1))) C(C(C(a(x1)))) -> c(c(c(B(x1)))) C(b(b(b(x1)))) -> a(B(B(B(x1)))) C(c(x1)) -> x1 a(A(x1)) -> x1 a(a(a(a(x1)))) -> A(A(A(x1))) a(b(x1)) -> C(x1) b(B(x1)) -> x1 b(b(b(b(x1)))) -> B(B(B(x1))) b(c(x1)) -> A(x1) c(C(x1)) -> x1 c(a(x1)) -> B(x1) c(c(c(c(x1)))) -> C(C(C(x1))) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: C#(b(b(b(x1)))) -> A(B(B(B(x1)))) A(b(x1)) -> C#(x1) ->->-> Rules: A(A(A(A(x1)))) -> a(a(a(x1))) A(A(A(b(x1)))) -> a(a(a(C(x1)))) A(C(x1)) -> b(x1) A(a(x1)) -> x1 A(c(c(c(x1)))) -> b(C(C(C(x1)))) B(A(x1)) -> c(x1) B(B(B(B(x1)))) -> b(b(b(x1))) B(B(B(c(x1)))) -> b(b(b(A(x1)))) B(a(a(a(x1)))) -> c(A(A(A(x1)))) B(b(x1)) -> x1 C(B(x1)) -> a(x1) C(C(C(C(x1)))) -> c(c(c(x1))) C(C(C(a(x1)))) -> c(c(c(B(x1)))) C(b(b(b(x1)))) -> a(B(B(B(x1)))) C(c(x1)) -> x1 a(A(x1)) -> x1 a(a(a(a(x1)))) -> A(A(A(x1))) a(b(x1)) -> C(x1) b(B(x1)) -> x1 b(b(b(b(x1)))) -> B(B(B(x1))) b(c(x1)) -> A(x1) c(C(x1)) -> x1 c(a(x1)) -> B(x1) c(c(c(c(x1)))) -> C(C(C(x1))) Problem 1: Reduction Pair Processor: -> Pairs: C#(b(b(b(x1)))) -> A(B(B(B(x1)))) A(b(x1)) -> C#(x1) -> Rules: A(A(A(A(x1)))) -> a(a(a(x1))) A(A(A(b(x1)))) -> a(a(a(C(x1)))) A(C(x1)) -> b(x1) A(a(x1)) -> x1 A(c(c(c(x1)))) -> b(C(C(C(x1)))) B(A(x1)) -> c(x1) B(B(B(B(x1)))) -> b(b(b(x1))) B(B(B(c(x1)))) -> b(b(b(A(x1)))) B(a(a(a(x1)))) -> c(A(A(A(x1)))) B(b(x1)) -> x1 C(B(x1)) -> a(x1) C(C(C(C(x1)))) -> c(c(c(x1))) C(C(C(a(x1)))) -> c(c(c(B(x1)))) C(b(b(b(x1)))) -> a(B(B(B(x1)))) C(c(x1)) -> x1 a(A(x1)) -> x1 a(a(a(a(x1)))) -> A(A(A(x1))) a(b(x1)) -> C(x1) b(B(x1)) -> x1 b(b(b(b(x1)))) -> B(B(B(x1))) b(c(x1)) -> A(x1) c(C(x1)) -> x1 c(a(x1)) -> B(x1) c(c(c(c(x1)))) -> C(C(C(x1))) -> Usable rules: A(A(A(A(x1)))) -> a(a(a(x1))) A(A(A(b(x1)))) -> a(a(a(C(x1)))) A(C(x1)) -> b(x1) A(a(x1)) -> x1 A(c(c(c(x1)))) -> b(C(C(C(x1)))) B(A(x1)) -> c(x1) B(B(B(B(x1)))) -> b(b(b(x1))) B(B(B(c(x1)))) -> b(b(b(A(x1)))) B(a(a(a(x1)))) -> c(A(A(A(x1)))) B(b(x1)) -> x1 C(B(x1)) -> a(x1) C(C(C(C(x1)))) -> c(c(c(x1))) C(C(C(a(x1)))) -> c(c(c(B(x1)))) C(b(b(b(x1)))) -> a(B(B(B(x1)))) C(c(x1)) -> x1 a(A(x1)) -> x1 a(a(a(a(x1)))) -> A(A(A(x1))) a(b(x1)) -> C(x1) b(B(x1)) -> x1 b(b(b(b(x1)))) -> B(B(B(x1))) b(c(x1)) -> A(x1) c(C(x1)) -> x1 c(a(x1)) -> B(x1) c(c(c(c(x1)))) -> C(C(C(x1))) ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [A](X) = 2.X + 1 [B](X) = 2.X + 1 [C](X) = 2.X + 1 [a](X) = 2.X + 2 [b](X) = 2.X + 2 [c](X) = 2.X + 2 [C#](X) = 2.X + 2 [A](X) = 2.X Problem 1: SCC Processor: -> Pairs: A(b(x1)) -> C#(x1) -> Rules: A(A(A(A(x1)))) -> a(a(a(x1))) A(A(A(b(x1)))) -> a(a(a(C(x1)))) A(C(x1)) -> b(x1) A(a(x1)) -> x1 A(c(c(c(x1)))) -> b(C(C(C(x1)))) B(A(x1)) -> c(x1) B(B(B(B(x1)))) -> b(b(b(x1))) B(B(B(c(x1)))) -> b(b(b(A(x1)))) B(a(a(a(x1)))) -> c(A(A(A(x1)))) B(b(x1)) -> x1 C(B(x1)) -> a(x1) C(C(C(C(x1)))) -> c(c(c(x1))) C(C(C(a(x1)))) -> c(c(c(B(x1)))) C(b(b(b(x1)))) -> a(B(B(B(x1)))) C(c(x1)) -> x1 a(A(x1)) -> x1 a(a(a(a(x1)))) -> A(A(A(x1))) a(b(x1)) -> C(x1) b(B(x1)) -> x1 b(b(b(b(x1)))) -> B(B(B(x1))) b(c(x1)) -> A(x1) c(C(x1)) -> x1 c(a(x1)) -> B(x1) c(c(c(c(x1)))) -> C(C(C(x1))) ->Strongly Connected Components: There is no strongly connected component The problem is finite.