/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES Problem 1: (VAR x1) (RULES a(a(x1)) -> a(c(a(x1))) a(b(x1)) -> b(a(a(x1))) b(x1) -> c(a(c(x1))) ) Problem 1: Dependency Pairs Processor: -> Pairs: A(a(x1)) -> A(c(a(x1))) A(b(x1)) -> A(a(x1)) A(b(x1)) -> A(x1) A(b(x1)) -> B(a(a(x1))) -> Rules: a(a(x1)) -> a(c(a(x1))) a(b(x1)) -> b(a(a(x1))) b(x1) -> c(a(c(x1))) Problem 1: SCC Processor: -> Pairs: A(a(x1)) -> A(c(a(x1))) A(b(x1)) -> A(a(x1)) A(b(x1)) -> A(x1) A(b(x1)) -> B(a(a(x1))) -> Rules: a(a(x1)) -> a(c(a(x1))) a(b(x1)) -> b(a(a(x1))) b(x1) -> c(a(c(x1))) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: A(b(x1)) -> A(a(x1)) A(b(x1)) -> A(x1) ->->-> Rules: a(a(x1)) -> a(c(a(x1))) a(b(x1)) -> b(a(a(x1))) b(x1) -> c(a(c(x1))) Problem 1: Reduction Pair Processor: -> Pairs: A(b(x1)) -> A(a(x1)) A(b(x1)) -> A(x1) -> Rules: a(a(x1)) -> a(c(a(x1))) a(b(x1)) -> b(a(a(x1))) b(x1) -> c(a(c(x1))) -> Usable rules: a(a(x1)) -> a(c(a(x1))) a(b(x1)) -> b(a(a(x1))) b(x1) -> c(a(c(x1))) ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [a](X) = X [b](X) = 2.X + 1 [c](X) = X [A](X) = X Problem 1: SCC Processor: -> Pairs: A(b(x1)) -> A(x1) -> Rules: a(a(x1)) -> a(c(a(x1))) a(b(x1)) -> b(a(a(x1))) b(x1) -> c(a(c(x1))) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: A(b(x1)) -> A(x1) ->->-> Rules: a(a(x1)) -> a(c(a(x1))) a(b(x1)) -> b(a(a(x1))) b(x1) -> c(a(c(x1))) Problem 1: Subterm Processor: -> Pairs: A(b(x1)) -> A(x1) -> Rules: a(a(x1)) -> a(c(a(x1))) a(b(x1)) -> b(a(a(x1))) b(x1) -> c(a(c(x1))) ->Projection: pi(A) = 1 Problem 1: SCC Processor: -> Pairs: Empty -> Rules: a(a(x1)) -> a(c(a(x1))) a(b(x1)) -> b(a(a(x1))) b(x1) -> c(a(c(x1))) ->Strongly Connected Components: There is no strongly connected component The problem is finite.