0.00/0.01 YES 0.00/0.01 0.00/0.01 Problem 1: 0.00/0.01 0.00/0.01 (VAR v_NonEmpty:S x:S) 0.00/0.01 (RULES 0.00/0.01 f(g(x:S),s(0)) -> f(g(x:S),g(x:S)) 0.00/0.01 g(0) -> 0 0.00/0.01 g(s(x:S)) -> s(g(x:S)) 0.00/0.01 ) 0.00/0.01 (STRATEGY INNERMOST) 0.00/0.01 0.00/0.01 Problem 1: 0.00/0.01 0.00/0.01 Dependency Pairs Processor: 0.00/0.01 -> Pairs: 0.00/0.01 F(g(x:S),s(0)) -> F(g(x:S),g(x:S)) 0.00/0.01 G(s(x:S)) -> G(x:S) 0.00/0.01 -> Rules: 0.00/0.01 f(g(x:S),s(0)) -> f(g(x:S),g(x:S)) 0.00/0.01 g(0) -> 0 0.00/0.01 g(s(x:S)) -> s(g(x:S)) 0.00/0.01 0.00/0.01 Problem 1: 0.00/0.01 0.00/0.01 SCC Processor: 0.00/0.01 -> Pairs: 0.00/0.01 F(g(x:S),s(0)) -> F(g(x:S),g(x:S)) 0.00/0.01 G(s(x:S)) -> G(x:S) 0.00/0.01 -> Rules: 0.00/0.01 f(g(x:S),s(0)) -> f(g(x:S),g(x:S)) 0.00/0.01 g(0) -> 0 0.00/0.01 g(s(x:S)) -> s(g(x:S)) 0.00/0.01 ->Strongly Connected Components: 0.00/0.01 ->->Cycle: 0.00/0.01 ->->-> Pairs: 0.00/0.01 G(s(x:S)) -> G(x:S) 0.00/0.01 ->->-> Rules: 0.00/0.01 f(g(x:S),s(0)) -> f(g(x:S),g(x:S)) 0.00/0.01 g(0) -> 0 0.00/0.01 g(s(x:S)) -> s(g(x:S)) 0.00/0.01 0.00/0.01 Problem 1: 0.00/0.01 0.00/0.01 Subterm Processor: 0.00/0.01 -> Pairs: 0.00/0.01 G(s(x:S)) -> G(x:S) 0.00/0.01 -> Rules: 0.00/0.01 f(g(x:S),s(0)) -> f(g(x:S),g(x:S)) 0.00/0.01 g(0) -> 0 0.00/0.01 g(s(x:S)) -> s(g(x:S)) 0.00/0.01 ->Projection: 0.00/0.01 pi(G) = 1 0.00/0.01 0.00/0.01 Problem 1: 0.00/0.01 0.00/0.01 SCC Processor: 0.00/0.01 -> Pairs: 0.00/0.01 Empty 0.00/0.01 -> Rules: 0.00/0.01 f(g(x:S),s(0)) -> f(g(x:S),g(x:S)) 0.00/0.01 g(0) -> 0 0.00/0.01 g(s(x:S)) -> s(g(x:S)) 0.00/0.01 ->Strongly Connected Components: 0.00/0.01 There is no strongly connected component 0.00/0.01 0.00/0.01 The problem is finite. 0.00/0.01 EOF