0.00/0.01 YES 0.00/0.01 0.00/0.01 Problem 1: 0.00/0.01 0.00/0.01 (VAR X) 0.00/0.01 (STRATEGY CONTEXTSENSITIVE 0.00/0.01 (c) 0.00/0.01 (f 2) 0.00/0.01 (b) 0.00/0.01 ) 0.00/0.01 (RULES 0.00/0.01 c -> b 0.00/0.01 f(b,X,c) -> f(X,c,X) 0.00/0.01 ) 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(b,X,c) -> C 0.00/0.01 F(b,X,c) -> F(X,c,X) 0.00/0.01 -> Rules: 0.00/0.01 c -> b 0.00/0.01 f(b,X,c) -> f(X,c,X) 0.00/0.01 -> Unhiding Rules: 0.00/0.01 Empty 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(b,X,c) -> C 0.00/0.01 F(b,X,c) -> F(X,c,X) 0.00/0.01 -> Rules: 0.00/0.01 c -> b 0.00/0.01 f(b,X,c) -> f(X,c,X) 0.00/0.01 -> Unhiding rules: 0.00/0.01 Empty 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