0.00/0.25 NO 0.00/0.25 0.00/0.25 Problem 1: 0.00/0.25 0.00/0.25 (VAR L N X) 0.00/0.25 (STRATEGY CONTEXTSENSITIVE 0.00/0.25 (and 1) 0.00/0.25 (length 1) 0.00/0.25 (zeros) 0.00/0.25 (0) 0.00/0.25 (cons 1) 0.00/0.25 (nil) 0.00/0.25 (s 1) 0.00/0.25 (tt) 0.00/0.25 ) 0.00/0.25 (RULES 0.00/0.25 and(tt,X) -> X 0.00/0.25 length(cons(N,L)) -> s(length(L)) 0.00/0.25 length(nil) -> 0 0.00/0.25 zeros -> cons(0,zeros) 0.00/0.25 ) 0.00/0.25 0.00/0.25 Problem 1: 0.00/0.25 0.00/0.25 Dependency Pairs Processor: 0.00/0.25 -> Pairs: 0.00/0.25 AND(tt,X) -> X 0.00/0.25 LENGTH(cons(N,L)) -> LENGTH(L) 0.00/0.25 LENGTH(cons(N,L)) -> L 0.00/0.25 -> Rules: 0.00/0.25 and(tt,X) -> X 0.00/0.25 length(cons(N,L)) -> s(length(L)) 0.00/0.25 length(nil) -> 0 0.00/0.25 zeros -> cons(0,zeros) 0.00/0.25 -> Unhiding Rules: 0.00/0.25 zeros -> ZEROS 0.00/0.25 0.00/0.25 Problem 1: 0.00/0.25 0.00/0.25 SCC Processor: 0.00/0.25 -> Pairs: 0.00/0.25 AND(tt,X) -> X 0.00/0.25 LENGTH(cons(N,L)) -> LENGTH(L) 0.00/0.25 LENGTH(cons(N,L)) -> L 0.00/0.25 -> Rules: 0.00/0.25 and(tt,X) -> X 0.00/0.25 length(cons(N,L)) -> s(length(L)) 0.00/0.25 length(nil) -> 0 0.00/0.25 zeros -> cons(0,zeros) 0.00/0.25 -> Unhiding rules: 0.00/0.25 zeros -> ZEROS 0.00/0.25 ->Strongly Connected Components: 0.00/0.25 ->->Cycle: 0.00/0.25 ->->-> Pairs: 0.00/0.25 LENGTH(cons(N,L)) -> LENGTH(L) 0.00/0.25 ->->-> Rules: 0.00/0.25 and(tt,X) -> X 0.00/0.25 length(cons(N,L)) -> s(length(L)) 0.00/0.25 length(nil) -> 0 0.00/0.25 zeros -> cons(0,zeros) 0.00/0.25 ->->-> Unhiding rules: 0.00/0.25 Empty 0.00/0.25 0.00/0.25 Problem 1: 0.00/0.25 0.00/0.25 Basic Processor: 0.00/0.25 -> Pairs: 0.00/0.25 LENGTH(cons(N,L)) -> LENGTH(L) 0.00/0.25 -> Rules: 0.00/0.25 and(tt,X) -> X 0.00/0.25 length(cons(N,L)) -> s(length(L)) 0.00/0.25 length(nil) -> 0 0.00/0.25 zeros -> cons(0,zeros) 0.00/0.25 -> Unhiding rules: 0.00/0.25 Empty 0.00/0.25 -> Pairs in cycle: 0.00/0.25 LENGTH(zeros) -> LENGTH(cons(0,zeros)) 0.00/0.25 LENGTH(cons(0,zeros)) -> LENGTH(zeros) 0.00/0.25 0.00/0.25 The problem is infinite. 0.00/0.25 EOF