0.00/0.36 YES 0.00/0.36 0.00/0.36 Problem 1: 0.00/0.36 0.00/0.36 (VAR v_NonEmpty:S X:S) 0.00/0.36 (RULES 0.00/0.36 f(0) -> cons(0) 0.00/0.36 f(s(0)) -> f(p(s(0))) 0.00/0.36 p(s(X:S)) -> X:S 0.00/0.36 ) 0.00/0.36 (STRATEGY INNERMOST) 0.00/0.36 0.00/0.36 Problem 1: 0.00/0.36 0.00/0.36 Dependency Pairs Processor: 0.00/0.36 -> Pairs: 0.00/0.36 F(s(0)) -> F(p(s(0))) 0.00/0.36 F(s(0)) -> P(s(0)) 0.00/0.36 -> Rules: 0.00/0.36 f(0) -> cons(0) 0.00/0.36 f(s(0)) -> f(p(s(0))) 0.00/0.36 p(s(X:S)) -> X:S 0.00/0.36 0.00/0.36 Problem 1: 0.00/0.36 0.00/0.36 SCC Processor: 0.00/0.36 -> Pairs: 0.00/0.36 F(s(0)) -> F(p(s(0))) 0.00/0.36 F(s(0)) -> P(s(0)) 0.00/0.36 -> Rules: 0.00/0.36 f(0) -> cons(0) 0.00/0.36 f(s(0)) -> f(p(s(0))) 0.00/0.36 p(s(X:S)) -> X:S 0.00/0.36 ->Strongly Connected Components: 0.00/0.36 ->->Cycle: 0.00/0.36 ->->-> Pairs: 0.00/0.36 F(s(0)) -> F(p(s(0))) 0.00/0.36 ->->-> Rules: 0.00/0.36 f(0) -> cons(0) 0.00/0.36 f(s(0)) -> f(p(s(0))) 0.00/0.36 p(s(X:S)) -> X:S 0.00/0.36 0.00/0.36 Problem 1: 0.00/0.36 0.00/0.36 Reduction Pairs Processor: 0.00/0.36 -> Pairs: 0.00/0.36 F(s(0)) -> F(p(s(0))) 0.00/0.36 -> Rules: 0.00/0.36 f(0) -> cons(0) 0.00/0.36 f(s(0)) -> f(p(s(0))) 0.00/0.36 p(s(X:S)) -> X:S 0.00/0.36 -> Usable rules: 0.00/0.36 p(s(X:S)) -> X:S 0.00/0.36 ->Interpretation type: 0.00/0.36 Linear 0.00/0.36 ->Coefficients: 0.00/0.36 All rationals 0.00/0.36 ->Dimension: 0.00/0.36 1 0.00/0.36 ->Bound: 0.00/0.36 2 0.00/0.36 ->Interpretation: 0.00/0.36 0.00/0.36 [f](X) = 0 0.00/0.36 [p](X) = 1/2.X + 1 0.00/0.36 [0] = 2 0.00/0.36 [cons](X) = 0 0.00/0.36 [fSNonEmpty] = 0 0.00/0.36 [s](X) = 2.X 0.00/0.36 [F](X) = 2.X 0.00/0.36 [P](X) = 0 0.00/0.36 0.00/0.36 Problem 1: 0.00/0.36 0.00/0.36 SCC Processor: 0.00/0.36 -> Pairs: 0.00/0.36 Empty 0.00/0.36 -> Rules: 0.00/0.36 f(0) -> cons(0) 0.00/0.36 f(s(0)) -> f(p(s(0))) 0.00/0.36 p(s(X:S)) -> X:S 0.00/0.36 ->Strongly Connected Components: 0.00/0.36 There is no strongly connected component 0.00/0.36 0.00/0.36 The problem is finite. 0.00/0.36 EOF