0.00/0.21 YES 0.00/0.21 0.00/0.21 Problem 1: 0.00/0.21 0.00/0.21 (VAR v_NonEmpty:S X:S X1:S X2:S XS:S) 0.00/0.21 (RULES 0.00/0.21 active(tail(cons(X:S,XS:S))) -> mark(XS:S) 0.00/0.21 active(zeros) -> mark(cons(0,zeros)) 0.00/0.21 cons(active(X1:S),X2:S) -> cons(X1:S,X2:S) 0.00/0.21 cons(mark(X1:S),X2:S) -> cons(X1:S,X2:S) 0.00/0.21 cons(X1:S,active(X2:S)) -> cons(X1:S,X2:S) 0.00/0.21 cons(X1:S,mark(X2:S)) -> cons(X1:S,X2:S) 0.00/0.21 mark(cons(X1:S,X2:S)) -> active(cons(mark(X1:S),X2:S)) 0.00/0.21 mark(tail(X:S)) -> active(tail(mark(X:S))) 0.00/0.21 mark(0) -> active(0) 0.00/0.21 mark(zeros) -> active(zeros) 0.00/0.21 tail(active(X:S)) -> tail(X:S) 0.00/0.21 tail(mark(X:S)) -> tail(X:S) 0.00/0.21 ) 0.00/0.21 (STRATEGY INNERMOST) 0.00/0.21 0.00/0.21 Problem 1: 0.00/0.21 0.00/0.21 Dependency Pairs Processor: 0.00/0.21 -> Pairs: 0.00/0.21 ACTIVE(tail(cons(X:S,XS:S))) -> MARK(XS:S) 0.00/0.21 ACTIVE(zeros) -> MARK(cons(0,zeros)) 0.00/0.21 CONS(active(X1:S),X2:S) -> CONS(X1:S,X2:S) 0.00/0.21 CONS(mark(X1:S),X2:S) -> CONS(X1:S,X2:S) 0.00/0.21 CONS(X1:S,active(X2:S)) -> CONS(X1:S,X2:S) 0.00/0.21 CONS(X1:S,mark(X2:S)) -> CONS(X1:S,X2:S) 0.00/0.21 MARK(cons(X1:S,X2:S)) -> ACTIVE(cons(mark(X1:S),X2:S)) 0.00/0.21 MARK(cons(X1:S,X2:S)) -> CONS(mark(X1:S),X2:S) 0.00/0.21 MARK(cons(X1:S,X2:S)) -> MARK(X1:S) 0.00/0.21 MARK(tail(X:S)) -> ACTIVE(tail(mark(X:S))) 0.00/0.21 MARK(tail(X:S)) -> MARK(X:S) 0.00/0.21 MARK(tail(X:S)) -> TAIL(mark(X:S)) 0.00/0.21 MARK(zeros) -> ACTIVE(zeros) 0.00/0.21 TAIL(active(X:S)) -> TAIL(X:S) 0.00/0.21 TAIL(mark(X:S)) -> TAIL(X:S) 0.00/0.21 -> Rules: 0.00/0.21 active(tail(cons(X:S,XS:S))) -> mark(XS:S) 0.00/0.21 active(zeros) -> mark(cons(0,zeros)) 0.00/0.21 cons(active(X1:S),X2:S) -> cons(X1:S,X2:S) 0.00/0.21 cons(mark(X1:S),X2:S) -> cons(X1:S,X2:S) 0.00/0.21 cons(X1:S,active(X2:S)) -> cons(X1:S,X2:S) 0.00/0.21 cons(X1:S,mark(X2:S)) -> cons(X1:S,X2:S) 0.00/0.21 mark(cons(X1:S,X2:S)) -> active(cons(mark(X1:S),X2:S)) 0.00/0.21 mark(tail(X:S)) -> active(tail(mark(X:S))) 0.00/0.21 mark(0) -> active(0) 0.00/0.21 mark(zeros) -> active(zeros) 0.00/0.21 tail(active(X:S)) -> tail(X:S) 0.00/0.21 tail(mark(X:S)) -> tail(X:S) 0.00/0.21 0.00/0.21 Problem 1: 0.00/0.21 0.00/0.21 SCC Processor: 0.00/0.21 -> Pairs: 0.00/0.21 ACTIVE(tail(cons(X:S,XS:S))) -> MARK(XS:S) 0.00/0.21 ACTIVE(zeros) -> MARK(cons(0,zeros)) 0.00/0.21 CONS(active(X1:S),X2:S) -> CONS(X1:S,X2:S) 0.00/0.21 CONS(mark(X1:S),X2:S) -> CONS(X1:S,X2:S) 0.00/0.21 CONS(X1:S,active(X2:S)) -> CONS(X1:S,X2:S) 0.00/0.21 CONS(X1:S,mark(X2:S)) -> CONS(X1:S,X2:S) 0.00/0.21 MARK(cons(X1:S,X2:S)) -> ACTIVE(cons(mark(X1:S),X2:S)) 0.00/0.21 MARK(cons(X1:S,X2:S)) -> CONS(mark(X1:S),X2:S) 0.00/0.21 MARK(cons(X1:S,X2:S)) -> MARK(X1:S) 0.00/0.21 MARK(tail(X:S)) -> ACTIVE(tail(mark(X:S))) 0.00/0.21 MARK(tail(X:S)) -> MARK(X:S) 0.00/0.21 MARK(tail(X:S)) -> TAIL(mark(X:S)) 0.00/0.21 MARK(zeros) -> ACTIVE(zeros) 0.00/0.21 TAIL(active(X:S)) -> TAIL(X:S) 0.00/0.21 TAIL(mark(X:S)) -> TAIL(X:S) 0.00/0.21 -> Rules: 0.00/0.21 active(tail(cons(X:S,XS:S))) -> mark(XS:S) 0.00/0.21 active(zeros) -> mark(cons(0,zeros)) 0.00/0.21 cons(active(X1:S),X2:S) -> cons(X1:S,X2:S) 0.00/0.21 cons(mark(X1:S),X2:S) -> cons(X1:S,X2:S) 0.00/0.21 cons(X1:S,active(X2:S)) -> cons(X1:S,X2:S) 0.00/0.21 cons(X1:S,mark(X2:S)) -> cons(X1:S,X2:S) 0.00/0.21 mark(cons(X1:S,X2:S)) -> active(cons(mark(X1:S),X2:S)) 0.00/0.21 mark(tail(X:S)) -> active(tail(mark(X:S))) 0.00/0.21 mark(0) -> active(0) 0.00/0.21 mark(zeros) -> active(zeros) 0.00/0.21 tail(active(X:S)) -> tail(X:S) 0.00/0.21 tail(mark(X:S)) -> tail(X:S) 0.00/0.21 ->Strongly Connected Components: 0.00/0.21 ->->Cycle: 0.00/0.21 ->->-> Pairs: 0.00/0.21 TAIL(active(X:S)) -> TAIL(X:S) 0.00/0.21 TAIL(mark(X:S)) -> TAIL(X:S) 0.00/0.21 ->->-> Rules: 0.00/0.21 active(tail(cons(X:S,XS:S))) -> mark(XS:S) 0.00/0.21 active(zeros) -> mark(cons(0,zeros)) 0.00/0.21 cons(active(X1:S),X2:S) -> cons(X1:S,X2:S) 0.00/0.21 cons(mark(X1:S),X2:S) -> cons(X1:S,X2:S) 0.00/0.21 cons(X1:S,active(X2:S)) -> cons(X1:S,X2:S) 0.00/0.21 cons(X1:S,mark(X2:S)) -> cons(X1:S,X2:S) 0.00/0.21 mark(cons(X1:S,X2:S)) -> active(cons(mark(X1:S),X2:S)) 0.00/0.21 mark(tail(X:S)) -> active(tail(mark(X:S))) 0.00/0.21 mark(0) -> active(0) 0.00/0.21 mark(zeros) -> active(zeros) 0.00/0.21 tail(active(X:S)) -> tail(X:S) 0.00/0.21 tail(mark(X:S)) -> tail(X:S) 0.00/0.21 ->->Cycle: 0.00/0.21 ->->-> Pairs: 0.00/0.21 CONS(active(X1:S),X2:S) -> CONS(X1:S,X2:S) 0.00/0.21 CONS(mark(X1:S),X2:S) -> CONS(X1:S,X2:S) 0.00/0.21 CONS(X1:S,active(X2:S)) -> CONS(X1:S,X2:S) 0.00/0.21 CONS(X1:S,mark(X2:S)) -> CONS(X1:S,X2:S) 0.00/0.21 ->->-> Rules: 0.00/0.21 active(tail(cons(X:S,XS:S))) -> mark(XS:S) 0.00/0.21 active(zeros) -> mark(cons(0,zeros)) 0.00/0.21 cons(active(X1:S),X2:S) -> cons(X1:S,X2:S) 0.00/0.21 cons(mark(X1:S),X2:S) -> cons(X1:S,X2:S) 0.00/0.21 cons(X1:S,active(X2:S)) -> cons(X1:S,X2:S) 0.00/0.21 cons(X1:S,mark(X2:S)) -> cons(X1:S,X2:S) 0.00/0.21 mark(cons(X1:S,X2:S)) -> active(cons(mark(X1:S),X2:S)) 0.00/0.21 mark(tail(X:S)) -> active(tail(mark(X:S))) 0.00/0.21 mark(0) -> active(0) 0.00/0.21 mark(zeros) -> active(zeros) 0.00/0.21 tail(active(X:S)) -> tail(X:S) 0.00/0.21 tail(mark(X:S)) -> tail(X:S) 0.00/0.21 ->->Cycle: 0.00/0.21 ->->-> Pairs: 0.00/0.21 ACTIVE(tail(cons(X:S,XS:S))) -> MARK(XS:S) 0.00/0.21 ACTIVE(zeros) -> MARK(cons(0,zeros)) 0.00/0.21 MARK(cons(X1:S,X2:S)) -> ACTIVE(cons(mark(X1:S),X2:S)) 0.00/0.21 MARK(cons(X1:S,X2:S)) -> MARK(X1:S) 0.00/0.21 MARK(tail(X:S)) -> ACTIVE(tail(mark(X:S))) 0.00/0.21 MARK(tail(X:S)) -> MARK(X:S) 0.00/0.21 MARK(zeros) -> ACTIVE(zeros) 0.00/0.21 ->->-> Rules: 0.00/0.21 active(tail(cons(X:S,XS:S))) -> mark(XS:S) 0.00/0.21 active(zeros) -> mark(cons(0,zeros)) 0.00/0.21 cons(active(X1:S),X2:S) -> cons(X1:S,X2:S) 0.00/0.21 cons(mark(X1:S),X2:S) -> cons(X1:S,X2:S) 0.00/0.21 cons(X1:S,active(X2:S)) -> cons(X1:S,X2:S) 0.00/0.21 cons(X1:S,mark(X2:S)) -> cons(X1:S,X2:S) 0.00/0.21 mark(cons(X1:S,X2:S)) -> active(cons(mark(X1:S),X2:S)) 0.00/0.21 mark(tail(X:S)) -> active(tail(mark(X:S))) 0.00/0.21 mark(0) -> active(0) 0.00/0.21 mark(zeros) -> active(zeros) 0.00/0.21 tail(active(X:S)) -> tail(X:S) 0.00/0.21 tail(mark(X:S)) -> tail(X:S) 0.00/0.21 0.00/0.21 0.00/0.21 The problem is decomposed in 3 subproblems. 0.00/0.21 0.00/0.21 Problem 1.1: 0.00/0.21 0.00/0.21 Subterm Processor: 0.00/0.21 -> Pairs: 0.00/0.21 TAIL(active(X:S)) -> TAIL(X:S) 0.00/0.21 TAIL(mark(X:S)) -> TAIL(X:S) 0.00/0.21 -> Rules: 0.00/0.21 active(tail(cons(X:S,XS:S))) -> mark(XS:S) 0.00/0.21 active(zeros) -> mark(cons(0,zeros)) 0.00/0.21 cons(active(X1:S),X2:S) -> cons(X1:S,X2:S) 0.00/0.21 cons(mark(X1:S),X2:S) -> cons(X1:S,X2:S) 0.00/0.21 cons(X1:S,active(X2:S)) -> cons(X1:S,X2:S) 0.00/0.21 cons(X1:S,mark(X2:S)) -> cons(X1:S,X2:S) 0.00/0.21 mark(cons(X1:S,X2:S)) -> active(cons(mark(X1:S),X2:S)) 0.00/0.21 mark(tail(X:S)) -> active(tail(mark(X:S))) 0.00/0.21 mark(0) -> active(0) 0.00/0.21 mark(zeros) -> active(zeros) 0.00/0.21 tail(active(X:S)) -> tail(X:S) 0.00/0.21 tail(mark(X:S)) -> tail(X:S) 0.00/0.21 ->Projection: 0.00/0.21 pi(TAIL) = 1 0.00/0.21 0.00/0.21 Problem 1.1: 0.00/0.21 0.00/0.21 SCC Processor: 0.00/0.21 -> Pairs: 0.00/0.21 Empty 0.00/0.21 -> Rules: 0.00/0.21 active(tail(cons(X:S,XS:S))) -> mark(XS:S) 0.00/0.21 active(zeros) -> mark(cons(0,zeros)) 0.00/0.21 cons(active(X1:S),X2:S) -> cons(X1:S,X2:S) 0.00/0.21 cons(mark(X1:S),X2:S) -> cons(X1:S,X2:S) 0.00/0.21 cons(X1:S,active(X2:S)) -> cons(X1:S,X2:S) 0.00/0.21 cons(X1:S,mark(X2:S)) -> cons(X1:S,X2:S) 0.00/0.21 mark(cons(X1:S,X2:S)) -> active(cons(mark(X1:S),X2:S)) 0.00/0.21 mark(tail(X:S)) -> active(tail(mark(X:S))) 0.00/0.21 mark(0) -> active(0) 0.00/0.21 mark(zeros) -> active(zeros) 0.00/0.21 tail(active(X:S)) -> tail(X:S) 0.00/0.21 tail(mark(X:S)) -> tail(X:S) 0.00/0.21 ->Strongly Connected Components: 0.00/0.21 There is no strongly connected component 0.00/0.21 0.00/0.21 The problem is finite. 0.00/0.21 0.00/0.21 Problem 1.2: 0.00/0.21 0.00/0.21 Subterm Processor: 0.00/0.21 -> Pairs: 0.00/0.21 CONS(active(X1:S),X2:S) -> CONS(X1:S,X2:S) 0.00/0.21 CONS(mark(X1:S),X2:S) -> CONS(X1:S,X2:S) 0.00/0.21 CONS(X1:S,active(X2:S)) -> CONS(X1:S,X2:S) 0.00/0.21 CONS(X1:S,mark(X2:S)) -> CONS(X1:S,X2:S) 0.00/0.21 -> Rules: 0.00/0.21 active(tail(cons(X:S,XS:S))) -> mark(XS:S) 0.00/0.21 active(zeros) -> mark(cons(0,zeros)) 0.00/0.21 cons(active(X1:S),X2:S) -> cons(X1:S,X2:S) 0.00/0.21 cons(mark(X1:S),X2:S) -> cons(X1:S,X2:S) 0.00/0.21 cons(X1:S,active(X2:S)) -> cons(X1:S,X2:S) 0.00/0.21 cons(X1:S,mark(X2:S)) -> cons(X1:S,X2:S) 0.00/0.21 mark(cons(X1:S,X2:S)) -> active(cons(mark(X1:S),X2:S)) 0.00/0.21 mark(tail(X:S)) -> active(tail(mark(X:S))) 0.00/0.21 mark(0) -> active(0) 0.00/0.21 mark(zeros) -> active(zeros) 0.00/0.21 tail(active(X:S)) -> tail(X:S) 0.00/0.21 tail(mark(X:S)) -> tail(X:S) 0.00/0.21 ->Projection: 0.00/0.21 pi(CONS) = 1 0.00/0.21 0.00/0.21 Problem 1.2: 0.00/0.21 0.00/0.21 SCC Processor: 0.00/0.21 -> Pairs: 0.00/0.21 CONS(X1:S,active(X2:S)) -> CONS(X1:S,X2:S) 0.00/0.21 CONS(X1:S,mark(X2:S)) -> CONS(X1:S,X2:S) 0.00/0.21 -> Rules: 0.00/0.21 active(tail(cons(X:S,XS:S))) -> mark(XS:S) 0.00/0.21 active(zeros) -> mark(cons(0,zeros)) 0.00/0.21 cons(active(X1:S),X2:S) -> cons(X1:S,X2:S) 0.00/0.21 cons(mark(X1:S),X2:S) -> cons(X1:S,X2:S) 0.00/0.21 cons(X1:S,active(X2:S)) -> cons(X1:S,X2:S) 0.00/0.21 cons(X1:S,mark(X2:S)) -> cons(X1:S,X2:S) 0.00/0.21 mark(cons(X1:S,X2:S)) -> active(cons(mark(X1:S),X2:S)) 0.00/0.21 mark(tail(X:S)) -> active(tail(mark(X:S))) 0.00/0.21 mark(0) -> active(0) 0.00/0.21 mark(zeros) -> active(zeros) 0.00/0.21 tail(active(X:S)) -> tail(X:S) 0.00/0.21 tail(mark(X:S)) -> tail(X:S) 0.00/0.21 ->Strongly Connected Components: 0.00/0.21 ->->Cycle: 0.00/0.21 ->->-> Pairs: 0.00/0.21 CONS(X1:S,active(X2:S)) -> CONS(X1:S,X2:S) 0.00/0.21 CONS(X1:S,mark(X2:S)) -> CONS(X1:S,X2:S) 0.00/0.21 ->->-> Rules: 0.00/0.21 active(tail(cons(X:S,XS:S))) -> mark(XS:S) 0.00/0.21 active(zeros) -> mark(cons(0,zeros)) 0.00/0.21 cons(active(X1:S),X2:S) -> cons(X1:S,X2:S) 0.00/0.21 cons(mark(X1:S),X2:S) -> cons(X1:S,X2:S) 0.00/0.21 cons(X1:S,active(X2:S)) -> cons(X1:S,X2:S) 0.00/0.21 cons(X1:S,mark(X2:S)) -> cons(X1:S,X2:S) 0.00/0.21 mark(cons(X1:S,X2:S)) -> active(cons(mark(X1:S),X2:S)) 0.00/0.21 mark(tail(X:S)) -> active(tail(mark(X:S))) 0.00/0.21 mark(0) -> active(0) 0.00/0.21 mark(zeros) -> active(zeros) 0.00/0.21 tail(active(X:S)) -> tail(X:S) 0.00/0.21 tail(mark(X:S)) -> tail(X:S) 0.00/0.21 0.00/0.21 Problem 1.2: 0.00/0.21 0.00/0.21 Subterm Processor: 0.00/0.21 -> Pairs: 0.00/0.21 CONS(X1:S,active(X2:S)) -> CONS(X1:S,X2:S) 0.00/0.21 CONS(X1:S,mark(X2:S)) -> CONS(X1:S,X2:S) 0.00/0.21 -> Rules: 0.00/0.21 active(tail(cons(X:S,XS:S))) -> mark(XS:S) 0.00/0.21 active(zeros) -> mark(cons(0,zeros)) 0.00/0.21 cons(active(X1:S),X2:S) -> cons(X1:S,X2:S) 0.00/0.21 cons(mark(X1:S),X2:S) -> cons(X1:S,X2:S) 0.00/0.21 cons(X1:S,active(X2:S)) -> cons(X1:S,X2:S) 0.00/0.21 cons(X1:S,mark(X2:S)) -> cons(X1:S,X2:S) 0.00/0.21 mark(cons(X1:S,X2:S)) -> active(cons(mark(X1:S),X2:S)) 0.00/0.21 mark(tail(X:S)) -> active(tail(mark(X:S))) 0.00/0.21 mark(0) -> active(0) 0.00/0.21 mark(zeros) -> active(zeros) 0.00/0.21 tail(active(X:S)) -> tail(X:S) 0.00/0.21 tail(mark(X:S)) -> tail(X:S) 0.00/0.21 ->Projection: 0.00/0.21 pi(CONS) = 2 0.00/0.21 0.00/0.21 Problem 1.2: 0.00/0.21 0.00/0.21 SCC Processor: 0.00/0.21 -> Pairs: 0.00/0.21 Empty 0.00/0.21 -> Rules: 0.00/0.21 active(tail(cons(X:S,XS:S))) -> mark(XS:S) 0.00/0.21 active(zeros) -> mark(cons(0,zeros)) 0.00/0.21 cons(active(X1:S),X2:S) -> cons(X1:S,X2:S) 0.00/0.21 cons(mark(X1:S),X2:S) -> cons(X1:S,X2:S) 0.00/0.21 cons(X1:S,active(X2:S)) -> cons(X1:S,X2:S) 0.00/0.21 cons(X1:S,mark(X2:S)) -> cons(X1:S,X2:S) 0.00/0.21 mark(cons(X1:S,X2:S)) -> active(cons(mark(X1:S),X2:S)) 0.00/0.21 mark(tail(X:S)) -> active(tail(mark(X:S))) 0.00/0.21 mark(0) -> active(0) 0.00/0.21 mark(zeros) -> active(zeros) 0.00/0.21 tail(active(X:S)) -> tail(X:S) 0.00/0.21 tail(mark(X:S)) -> tail(X:S) 0.00/0.21 ->Strongly Connected Components: 0.00/0.21 There is no strongly connected component 0.00/0.21 0.00/0.21 The problem is finite. 0.00/0.21 0.00/0.21 Problem 1.3: 0.00/0.21 0.00/0.21 Reduction Pairs Processor: 0.00/0.21 -> Pairs: 0.00/0.21 ACTIVE(tail(cons(X:S,XS:S))) -> MARK(XS:S) 0.00/0.21 ACTIVE(zeros) -> MARK(cons(0,zeros)) 0.00/0.21 MARK(cons(X1:S,X2:S)) -> ACTIVE(cons(mark(X1:S),X2:S)) 0.00/0.21 MARK(cons(X1:S,X2:S)) -> MARK(X1:S) 0.00/0.21 MARK(tail(X:S)) -> ACTIVE(tail(mark(X:S))) 0.00/0.21 MARK(tail(X:S)) -> MARK(X:S) 0.00/0.21 MARK(zeros) -> ACTIVE(zeros) 0.00/0.21 -> Rules: 0.00/0.21 active(tail(cons(X:S,XS:S))) -> mark(XS:S) 0.00/0.21 active(zeros) -> mark(cons(0,zeros)) 0.00/0.21 cons(active(X1:S),X2:S) -> cons(X1:S,X2:S) 0.00/0.21 cons(mark(X1:S),X2:S) -> cons(X1:S,X2:S) 0.00/0.21 cons(X1:S,active(X2:S)) -> cons(X1:S,X2:S) 0.00/0.21 cons(X1:S,mark(X2:S)) -> cons(X1:S,X2:S) 0.00/0.21 mark(cons(X1:S,X2:S)) -> active(cons(mark(X1:S),X2:S)) 0.00/0.21 mark(tail(X:S)) -> active(tail(mark(X:S))) 0.00/0.21 mark(0) -> active(0) 0.00/0.21 mark(zeros) -> active(zeros) 0.00/0.21 tail(active(X:S)) -> tail(X:S) 0.00/0.21 tail(mark(X:S)) -> tail(X:S) 0.00/0.21 -> Usable rules: 0.00/0.21 active(tail(cons(X:S,XS:S))) -> mark(XS:S) 0.00/0.21 active(zeros) -> mark(cons(0,zeros)) 0.00/0.21 cons(active(X1:S),X2:S) -> cons(X1:S,X2:S) 0.00/0.21 cons(mark(X1:S),X2:S) -> cons(X1:S,X2:S) 0.00/0.21 cons(X1:S,active(X2:S)) -> cons(X1:S,X2:S) 0.00/0.21 cons(X1:S,mark(X2:S)) -> cons(X1:S,X2:S) 0.00/0.21 mark(cons(X1:S,X2:S)) -> active(cons(mark(X1:S),X2:S)) 0.00/0.21 mark(tail(X:S)) -> active(tail(mark(X:S))) 0.00/0.21 mark(0) -> active(0) 0.00/0.21 mark(zeros) -> active(zeros) 0.00/0.21 tail(active(X:S)) -> tail(X:S) 0.00/0.21 tail(mark(X:S)) -> tail(X:S) 0.00/0.21 ->Interpretation type: 0.00/0.21 Linear 0.00/0.21 ->Coefficients: 0.00/0.21 Natural Numbers 0.00/0.21 ->Dimension: 0.00/0.21 1 0.00/0.21 ->Bound: 0.00/0.21 2 0.00/0.21 ->Interpretation: 0.00/0.21 0.00/0.21 [active](X) = X 0.00/0.21 [cons](X1,X2) = 2.X1 + X2 0.00/0.21 [mark](X) = 2.X 0.00/0.21 [tail](X) = 2.X + 1 0.00/0.21 [0] = 0 0.00/0.21 [fSNonEmpty] = 0 0.00/0.21 [zeros] = 0 0.00/0.21 [ACTIVE](X) = X + 2 0.00/0.21 [CONS](X1,X2) = 0 0.00/0.21 [MARK](X) = 2.X + 2 0.00/0.21 [TAIL](X) = 0 0.00/0.21 0.00/0.21 Problem 1.3: 0.00/0.21 0.00/0.21 SCC Processor: 0.00/0.21 -> Pairs: 0.00/0.21 ACTIVE(zeros) -> MARK(cons(0,zeros)) 0.00/0.21 MARK(cons(X1:S,X2:S)) -> ACTIVE(cons(mark(X1:S),X2:S)) 0.00/0.21 MARK(cons(X1:S,X2:S)) -> MARK(X1:S) 0.00/0.21 MARK(tail(X:S)) -> ACTIVE(tail(mark(X:S))) 0.00/0.21 MARK(tail(X:S)) -> MARK(X:S) 0.00/0.21 MARK(zeros) -> ACTIVE(zeros) 0.00/0.21 -> Rules: 0.00/0.21 active(tail(cons(X:S,XS:S))) -> mark(XS:S) 0.00/0.21 active(zeros) -> mark(cons(0,zeros)) 0.00/0.21 cons(active(X1:S),X2:S) -> cons(X1:S,X2:S) 0.00/0.21 cons(mark(X1:S),X2:S) -> cons(X1:S,X2:S) 0.00/0.21 cons(X1:S,active(X2:S)) -> cons(X1:S,X2:S) 0.00/0.21 cons(X1:S,mark(X2:S)) -> cons(X1:S,X2:S) 0.00/0.21 mark(cons(X1:S,X2:S)) -> active(cons(mark(X1:S),X2:S)) 0.00/0.21 mark(tail(X:S)) -> active(tail(mark(X:S))) 0.00/0.21 mark(0) -> active(0) 0.00/0.21 mark(zeros) -> active(zeros) 0.00/0.21 tail(active(X:S)) -> tail(X:S) 0.00/0.21 tail(mark(X:S)) -> tail(X:S) 0.00/0.21 ->Strongly Connected Components: 0.00/0.21 ->->Cycle: 0.00/0.21 ->->-> Pairs: 0.00/0.21 ACTIVE(zeros) -> MARK(cons(0,zeros)) 0.00/0.21 MARK(cons(X1:S,X2:S)) -> ACTIVE(cons(mark(X1:S),X2:S)) 0.00/0.21 MARK(cons(X1:S,X2:S)) -> MARK(X1:S) 0.00/0.21 MARK(tail(X:S)) -> ACTIVE(tail(mark(X:S))) 0.00/0.21 MARK(tail(X:S)) -> MARK(X:S) 0.00/0.21 MARK(zeros) -> ACTIVE(zeros) 0.00/0.21 ->->-> Rules: 0.00/0.21 active(tail(cons(X:S,XS:S))) -> mark(XS:S) 0.00/0.21 active(zeros) -> mark(cons(0,zeros)) 0.00/0.21 cons(active(X1:S),X2:S) -> cons(X1:S,X2:S) 0.00/0.21 cons(mark(X1:S),X2:S) -> cons(X1:S,X2:S) 0.00/0.21 cons(X1:S,active(X2:S)) -> cons(X1:S,X2:S) 0.00/0.21 cons(X1:S,mark(X2:S)) -> cons(X1:S,X2:S) 0.00/0.21 mark(cons(X1:S,X2:S)) -> active(cons(mark(X1:S),X2:S)) 0.00/0.21 mark(tail(X:S)) -> active(tail(mark(X:S))) 0.00/0.21 mark(0) -> active(0) 0.00/0.21 mark(zeros) -> active(zeros) 0.00/0.21 tail(active(X:S)) -> tail(X:S) 0.00/0.21 tail(mark(X:S)) -> tail(X:S) 0.00/0.21 0.00/0.21 Problem 1.3: 0.00/0.21 0.00/0.21 Reduction Pairs Processor: 0.00/0.21 -> Pairs: 0.00/0.21 ACTIVE(zeros) -> MARK(cons(0,zeros)) 0.00/0.21 MARK(cons(X1:S,X2:S)) -> ACTIVE(cons(mark(X1:S),X2:S)) 0.00/0.21 MARK(cons(X1:S,X2:S)) -> MARK(X1:S) 0.00/0.21 MARK(tail(X:S)) -> ACTIVE(tail(mark(X:S))) 0.00/0.21 MARK(tail(X:S)) -> MARK(X:S) 0.00/0.21 MARK(zeros) -> ACTIVE(zeros) 0.00/0.21 -> Rules: 0.00/0.21 active(tail(cons(X:S,XS:S))) -> mark(XS:S) 0.00/0.21 active(zeros) -> mark(cons(0,zeros)) 0.00/0.21 cons(active(X1:S),X2:S) -> cons(X1:S,X2:S) 0.00/0.21 cons(mark(X1:S),X2:S) -> cons(X1:S,X2:S) 0.00/0.21 cons(X1:S,active(X2:S)) -> cons(X1:S,X2:S) 0.00/0.21 cons(X1:S,mark(X2:S)) -> cons(X1:S,X2:S) 0.00/0.21 mark(cons(X1:S,X2:S)) -> active(cons(mark(X1:S),X2:S)) 0.00/0.21 mark(tail(X:S)) -> active(tail(mark(X:S))) 0.00/0.21 mark(0) -> active(0) 0.00/0.21 mark(zeros) -> active(zeros) 0.00/0.21 tail(active(X:S)) -> tail(X:S) 0.00/0.21 tail(mark(X:S)) -> tail(X:S) 0.00/0.21 -> Usable rules: 0.00/0.21 active(tail(cons(X:S,XS:S))) -> mark(XS:S) 0.00/0.21 active(zeros) -> mark(cons(0,zeros)) 0.00/0.21 cons(active(X1:S),X2:S) -> cons(X1:S,X2:S) 0.00/0.21 cons(mark(X1:S),X2:S) -> cons(X1:S,X2:S) 0.00/0.21 cons(X1:S,active(X2:S)) -> cons(X1:S,X2:S) 0.00/0.21 cons(X1:S,mark(X2:S)) -> cons(X1:S,X2:S) 0.00/0.21 mark(cons(X1:S,X2:S)) -> active(cons(mark(X1:S),X2:S)) 0.00/0.21 mark(tail(X:S)) -> active(tail(mark(X:S))) 0.00/0.21 mark(0) -> active(0) 0.00/0.21 mark(zeros) -> active(zeros) 0.00/0.21 tail(active(X:S)) -> tail(X:S) 0.00/0.21 tail(mark(X:S)) -> tail(X:S) 0.00/0.21 ->Interpretation type: 0.00/0.21 Linear 0.00/0.21 ->Coefficients: 0.00/0.21 Natural Numbers 0.00/0.21 ->Dimension: 0.00/0.21 1 0.00/0.21 ->Bound: 0.00/0.21 2 0.00/0.21 ->Interpretation: 0.00/0.21 0.00/0.21 [active](X) = 2 0.00/0.21 [cons](X1,X2) = 1 0.00/0.21 [mark](X) = 2 0.00/0.21 [tail](X) = 2 0.00/0.21 [0] = 2 0.00/0.21 [fSNonEmpty] = 0 0.00/0.21 [zeros] = 2 0.00/0.21 [ACTIVE](X) = X 0.00/0.21 [CONS](X1,X2) = 0 0.00/0.21 [MARK](X) = 2 0.00/0.21 [TAIL](X) = 0 0.00/0.21 0.00/0.21 Problem 1.3: 0.00/0.21 0.00/0.21 SCC Processor: 0.00/0.21 -> Pairs: 0.00/0.21 ACTIVE(zeros) -> MARK(cons(0,zeros)) 0.00/0.21 MARK(cons(X1:S,X2:S)) -> MARK(X1:S) 0.00/0.21 MARK(tail(X:S)) -> ACTIVE(tail(mark(X:S))) 0.00/0.21 MARK(tail(X:S)) -> MARK(X:S) 0.00/0.21 MARK(zeros) -> ACTIVE(zeros) 0.00/0.21 -> Rules: 0.00/0.21 active(tail(cons(X:S,XS:S))) -> mark(XS:S) 0.00/0.21 active(zeros) -> mark(cons(0,zeros)) 0.00/0.21 cons(active(X1:S),X2:S) -> cons(X1:S,X2:S) 0.00/0.21 cons(mark(X1:S),X2:S) -> cons(X1:S,X2:S) 0.00/0.21 cons(X1:S,active(X2:S)) -> cons(X1:S,X2:S) 0.00/0.21 cons(X1:S,mark(X2:S)) -> cons(X1:S,X2:S) 0.00/0.21 mark(cons(X1:S,X2:S)) -> active(cons(mark(X1:S),X2:S)) 0.00/0.21 mark(tail(X:S)) -> active(tail(mark(X:S))) 0.00/0.21 mark(0) -> active(0) 0.00/0.21 mark(zeros) -> active(zeros) 0.00/0.21 tail(active(X:S)) -> tail(X:S) 0.00/0.21 tail(mark(X:S)) -> tail(X:S) 0.00/0.21 ->Strongly Connected Components: 0.00/0.21 ->->Cycle: 0.00/0.21 ->->-> Pairs: 0.00/0.21 ACTIVE(zeros) -> MARK(cons(0,zeros)) 0.00/0.21 MARK(cons(X1:S,X2:S)) -> MARK(X1:S) 0.00/0.21 MARK(tail(X:S)) -> ACTIVE(tail(mark(X:S))) 0.00/0.21 MARK(tail(X:S)) -> MARK(X:S) 0.00/0.21 MARK(zeros) -> ACTIVE(zeros) 0.00/0.21 ->->-> Rules: 0.00/0.21 active(tail(cons(X:S,XS:S))) -> mark(XS:S) 0.00/0.21 active(zeros) -> mark(cons(0,zeros)) 0.00/0.21 cons(active(X1:S),X2:S) -> cons(X1:S,X2:S) 0.00/0.21 cons(mark(X1:S),X2:S) -> cons(X1:S,X2:S) 0.00/0.21 cons(X1:S,active(X2:S)) -> cons(X1:S,X2:S) 0.00/0.21 cons(X1:S,mark(X2:S)) -> cons(X1:S,X2:S) 0.00/0.21 mark(cons(X1:S,X2:S)) -> active(cons(mark(X1:S),X2:S)) 0.00/0.21 mark(tail(X:S)) -> active(tail(mark(X:S))) 0.00/0.21 mark(0) -> active(0) 0.00/0.21 mark(zeros) -> active(zeros) 0.00/0.21 tail(active(X:S)) -> tail(X:S) 0.00/0.21 tail(mark(X:S)) -> tail(X:S) 0.00/0.21 0.00/0.21 Problem 1.3: 0.00/0.21 0.00/0.21 Reduction Pairs Processor: 0.00/0.21 -> Pairs: 0.00/0.21 ACTIVE(zeros) -> MARK(cons(0,zeros)) 0.00/0.21 MARK(cons(X1:S,X2:S)) -> MARK(X1:S) 0.00/0.21 MARK(tail(X:S)) -> ACTIVE(tail(mark(X:S))) 0.00/0.21 MARK(tail(X:S)) -> MARK(X:S) 0.00/0.21 MARK(zeros) -> ACTIVE(zeros) 0.00/0.21 -> Rules: 0.00/0.21 active(tail(cons(X:S,XS:S))) -> mark(XS:S) 0.00/0.21 active(zeros) -> mark(cons(0,zeros)) 0.00/0.21 cons(active(X1:S),X2:S) -> cons(X1:S,X2:S) 0.00/0.21 cons(mark(X1:S),X2:S) -> cons(X1:S,X2:S) 0.00/0.21 cons(X1:S,active(X2:S)) -> cons(X1:S,X2:S) 0.00/0.21 cons(X1:S,mark(X2:S)) -> cons(X1:S,X2:S) 0.00/0.21 mark(cons(X1:S,X2:S)) -> active(cons(mark(X1:S),X2:S)) 0.00/0.21 mark(tail(X:S)) -> active(tail(mark(X:S))) 0.00/0.21 mark(0) -> active(0) 0.00/0.21 mark(zeros) -> active(zeros) 0.00/0.21 tail(active(X:S)) -> tail(X:S) 0.00/0.21 tail(mark(X:S)) -> tail(X:S) 0.00/0.21 -> Usable rules: 0.00/0.21 active(tail(cons(X:S,XS:S))) -> mark(XS:S) 0.00/0.21 active(zeros) -> mark(cons(0,zeros)) 0.00/0.21 cons(active(X1:S),X2:S) -> cons(X1:S,X2:S) 0.00/0.21 cons(mark(X1:S),X2:S) -> cons(X1:S,X2:S) 0.00/0.21 cons(X1:S,active(X2:S)) -> cons(X1:S,X2:S) 0.00/0.21 cons(X1:S,mark(X2:S)) -> cons(X1:S,X2:S) 0.00/0.21 mark(cons(X1:S,X2:S)) -> active(cons(mark(X1:S),X2:S)) 0.00/0.21 mark(tail(X:S)) -> active(tail(mark(X:S))) 0.00/0.21 mark(0) -> active(0) 0.00/0.21 mark(zeros) -> active(zeros) 0.00/0.21 tail(active(X:S)) -> tail(X:S) 0.00/0.21 tail(mark(X:S)) -> tail(X:S) 0.00/0.21 ->Interpretation type: 0.00/0.21 Linear 0.00/0.21 ->Coefficients: 0.00/0.21 Natural Numbers 0.00/0.21 ->Dimension: 0.00/0.21 1 0.00/0.21 ->Bound: 0.00/0.21 2 0.00/0.21 ->Interpretation: 0.00/0.21 0.00/0.21 [active](X) = X 0.00/0.21 [cons](X1,X2) = X1 + X2 0.00/0.21 [mark](X) = X 0.00/0.21 [tail](X) = 2.X + 2 0.00/0.21 [0] = 0 0.00/0.21 [fSNonEmpty] = 0 0.00/0.21 [zeros] = 1 0.00/0.21 [ACTIVE](X) = X + 2 0.00/0.21 [CONS](X1,X2) = 0 0.00/0.21 [MARK](X) = 2.X + 1 0.00/0.21 [TAIL](X) = 0 0.00/0.21 0.00/0.21 Problem 1.3: 0.00/0.21 0.00/0.21 SCC Processor: 0.00/0.21 -> Pairs: 0.00/0.21 ACTIVE(zeros) -> MARK(cons(0,zeros)) 0.00/0.21 MARK(cons(X1:S,X2:S)) -> MARK(X1:S) 0.00/0.21 MARK(tail(X:S)) -> MARK(X:S) 0.00/0.21 MARK(zeros) -> ACTIVE(zeros) 0.00/0.21 -> Rules: 0.00/0.21 active(tail(cons(X:S,XS:S))) -> mark(XS:S) 0.00/0.21 active(zeros) -> mark(cons(0,zeros)) 0.00/0.21 cons(active(X1:S),X2:S) -> cons(X1:S,X2:S) 0.00/0.21 cons(mark(X1:S),X2:S) -> cons(X1:S,X2:S) 0.00/0.21 cons(X1:S,active(X2:S)) -> cons(X1:S,X2:S) 0.00/0.21 cons(X1:S,mark(X2:S)) -> cons(X1:S,X2:S) 0.00/0.21 mark(cons(X1:S,X2:S)) -> active(cons(mark(X1:S),X2:S)) 0.00/0.21 mark(tail(X:S)) -> active(tail(mark(X:S))) 0.00/0.21 mark(0) -> active(0) 0.00/0.21 mark(zeros) -> active(zeros) 0.00/0.21 tail(active(X:S)) -> tail(X:S) 0.00/0.21 tail(mark(X:S)) -> tail(X:S) 0.00/0.21 ->Strongly Connected Components: 0.00/0.21 ->->Cycle: 0.00/0.21 ->->-> Pairs: 0.00/0.21 ACTIVE(zeros) -> MARK(cons(0,zeros)) 0.00/0.21 MARK(cons(X1:S,X2:S)) -> MARK(X1:S) 0.00/0.21 MARK(tail(X:S)) -> MARK(X:S) 0.00/0.21 MARK(zeros) -> ACTIVE(zeros) 0.00/0.21 ->->-> Rules: 0.00/0.21 active(tail(cons(X:S,XS:S))) -> mark(XS:S) 0.00/0.21 active(zeros) -> mark(cons(0,zeros)) 0.00/0.21 cons(active(X1:S),X2:S) -> cons(X1:S,X2:S) 0.00/0.21 cons(mark(X1:S),X2:S) -> cons(X1:S,X2:S) 0.00/0.21 cons(X1:S,active(X2:S)) -> cons(X1:S,X2:S) 0.00/0.21 cons(X1:S,mark(X2:S)) -> cons(X1:S,X2:S) 0.00/0.21 mark(cons(X1:S,X2:S)) -> active(cons(mark(X1:S),X2:S)) 0.00/0.21 mark(tail(X:S)) -> active(tail(mark(X:S))) 0.00/0.21 mark(0) -> active(0) 0.00/0.21 mark(zeros) -> active(zeros) 0.00/0.21 tail(active(X:S)) -> tail(X:S) 0.00/0.21 tail(mark(X:S)) -> tail(X:S) 0.00/0.21 0.00/0.21 Problem 1.3: 0.00/0.21 0.00/0.21 Reduction Pairs Processor: 0.00/0.21 -> Pairs: 0.00/0.21 ACTIVE(zeros) -> MARK(cons(0,zeros)) 0.00/0.21 MARK(cons(X1:S,X2:S)) -> MARK(X1:S) 0.00/0.21 MARK(tail(X:S)) -> MARK(X:S) 0.00/0.21 MARK(zeros) -> ACTIVE(zeros) 0.00/0.21 -> Rules: 0.00/0.21 active(tail(cons(X:S,XS:S))) -> mark(XS:S) 0.00/0.21 active(zeros) -> mark(cons(0,zeros)) 0.00/0.21 cons(active(X1:S),X2:S) -> cons(X1:S,X2:S) 0.00/0.21 cons(mark(X1:S),X2:S) -> cons(X1:S,X2:S) 0.00/0.21 cons(X1:S,active(X2:S)) -> cons(X1:S,X2:S) 0.00/0.21 cons(X1:S,mark(X2:S)) -> cons(X1:S,X2:S) 0.00/0.21 mark(cons(X1:S,X2:S)) -> active(cons(mark(X1:S),X2:S)) 0.00/0.21 mark(tail(X:S)) -> active(tail(mark(X:S))) 0.00/0.21 mark(0) -> active(0) 0.00/0.21 mark(zeros) -> active(zeros) 0.00/0.21 tail(active(X:S)) -> tail(X:S) 0.00/0.21 tail(mark(X:S)) -> tail(X:S) 0.00/0.21 -> Usable rules: 0.00/0.21 cons(active(X1:S),X2:S) -> cons(X1:S,X2:S) 0.00/0.21 cons(mark(X1:S),X2:S) -> cons(X1:S,X2:S) 0.00/0.21 cons(X1:S,active(X2:S)) -> cons(X1:S,X2:S) 0.00/0.21 cons(X1:S,mark(X2:S)) -> cons(X1:S,X2:S) 0.00/0.21 ->Interpretation type: 0.00/0.21 Linear 0.00/0.21 ->Coefficients: 0.00/0.21 Natural Numbers 0.00/0.21 ->Dimension: 0.00/0.21 1 0.00/0.21 ->Bound: 0.00/0.21 2 0.00/0.21 ->Interpretation: 0.00/0.21 0.00/0.21 [active](X) = 2.X 0.00/0.21 [cons](X1,X2) = 2.X1 + 1 0.00/0.21 [mark](X) = 2.X 0.00/0.21 [tail](X) = 2.X 0.00/0.21 [0] = 0 0.00/0.21 [fSNonEmpty] = 0 0.00/0.21 [zeros] = 2 0.00/0.21 [ACTIVE](X) = 2.X + 2 0.00/0.21 [CONS](X1,X2) = 0 0.00/0.21 [MARK](X) = 2.X + 2 0.00/0.21 [TAIL](X) = 0 0.00/0.21 0.00/0.21 Problem 1.3: 0.00/0.21 0.00/0.21 SCC Processor: 0.00/0.21 -> Pairs: 0.00/0.21 MARK(cons(X1:S,X2:S)) -> MARK(X1:S) 0.00/0.21 MARK(tail(X:S)) -> MARK(X:S) 0.00/0.21 MARK(zeros) -> ACTIVE(zeros) 0.00/0.21 -> Rules: 0.00/0.21 active(tail(cons(X:S,XS:S))) -> mark(XS:S) 0.00/0.21 active(zeros) -> mark(cons(0,zeros)) 0.00/0.21 cons(active(X1:S),X2:S) -> cons(X1:S,X2:S) 0.00/0.21 cons(mark(X1:S),X2:S) -> cons(X1:S,X2:S) 0.00/0.21 cons(X1:S,active(X2:S)) -> cons(X1:S,X2:S) 0.00/0.21 cons(X1:S,mark(X2:S)) -> cons(X1:S,X2:S) 0.00/0.21 mark(cons(X1:S,X2:S)) -> active(cons(mark(X1:S),X2:S)) 0.00/0.21 mark(tail(X:S)) -> active(tail(mark(X:S))) 0.00/0.21 mark(0) -> active(0) 0.00/0.21 mark(zeros) -> active(zeros) 0.00/0.21 tail(active(X:S)) -> tail(X:S) 0.00/0.21 tail(mark(X:S)) -> tail(X:S) 0.00/0.21 ->Strongly Connected Components: 0.00/0.21 ->->Cycle: 0.00/0.21 ->->-> Pairs: 0.00/0.21 MARK(cons(X1:S,X2:S)) -> MARK(X1:S) 0.00/0.21 MARK(tail(X:S)) -> MARK(X:S) 0.00/0.21 ->->-> Rules: 0.00/0.21 active(tail(cons(X:S,XS:S))) -> mark(XS:S) 0.00/0.21 active(zeros) -> mark(cons(0,zeros)) 0.00/0.21 cons(active(X1:S),X2:S) -> cons(X1:S,X2:S) 0.00/0.21 cons(mark(X1:S),X2:S) -> cons(X1:S,X2:S) 0.00/0.21 cons(X1:S,active(X2:S)) -> cons(X1:S,X2:S) 0.00/0.21 cons(X1:S,mark(X2:S)) -> cons(X1:S,X2:S) 0.00/0.21 mark(cons(X1:S,X2:S)) -> active(cons(mark(X1:S),X2:S)) 0.00/0.21 mark(tail(X:S)) -> active(tail(mark(X:S))) 0.00/0.21 mark(0) -> active(0) 0.00/0.21 mark(zeros) -> active(zeros) 0.00/0.21 tail(active(X:S)) -> tail(X:S) 0.00/0.21 tail(mark(X:S)) -> tail(X:S) 0.00/0.21 0.00/0.21 Problem 1.3: 0.00/0.21 0.00/0.21 Subterm Processor: 0.00/0.21 -> Pairs: 0.00/0.21 MARK(cons(X1:S,X2:S)) -> MARK(X1:S) 0.00/0.21 MARK(tail(X:S)) -> MARK(X:S) 0.00/0.21 -> Rules: 0.00/0.21 active(tail(cons(X:S,XS:S))) -> mark(XS:S) 0.00/0.21 active(zeros) -> mark(cons(0,zeros)) 0.00/0.21 cons(active(X1:S),X2:S) -> cons(X1:S,X2:S) 0.00/0.21 cons(mark(X1:S),X2:S) -> cons(X1:S,X2:S) 0.00/0.21 cons(X1:S,active(X2:S)) -> cons(X1:S,X2:S) 0.00/0.21 cons(X1:S,mark(X2:S)) -> cons(X1:S,X2:S) 0.00/0.21 mark(cons(X1:S,X2:S)) -> active(cons(mark(X1:S),X2:S)) 0.00/0.21 mark(tail(X:S)) -> active(tail(mark(X:S))) 0.00/0.21 mark(0) -> active(0) 0.00/0.21 mark(zeros) -> active(zeros) 0.00/0.21 tail(active(X:S)) -> tail(X:S) 0.00/0.21 tail(mark(X:S)) -> tail(X:S) 0.00/0.21 ->Projection: 0.00/0.21 pi(MARK) = 1 0.00/0.21 0.00/0.21 Problem 1.3: 0.00/0.21 0.00/0.21 SCC Processor: 0.00/0.21 -> Pairs: 0.00/0.21 Empty 0.00/0.21 -> Rules: 0.00/0.21 active(tail(cons(X:S,XS:S))) -> mark(XS:S) 0.00/0.21 active(zeros) -> mark(cons(0,zeros)) 0.00/0.21 cons(active(X1:S),X2:S) -> cons(X1:S,X2:S) 0.00/0.21 cons(mark(X1:S),X2:S) -> cons(X1:S,X2:S) 0.00/0.21 cons(X1:S,active(X2:S)) -> cons(X1:S,X2:S) 0.00/0.21 cons(X1:S,mark(X2:S)) -> cons(X1:S,X2:S) 0.00/0.21 mark(cons(X1:S,X2:S)) -> active(cons(mark(X1:S),X2:S)) 0.00/0.21 mark(tail(X:S)) -> active(tail(mark(X:S))) 0.00/0.21 mark(0) -> active(0) 0.00/0.21 mark(zeros) -> active(zeros) 0.00/0.21 tail(active(X:S)) -> tail(X:S) 0.00/0.21 tail(mark(X:S)) -> tail(X:S) 0.00/0.21 ->Strongly Connected Components: 0.00/0.21 There is no strongly connected component 0.00/0.21 0.00/0.21 The problem is finite. 0.00/0.21 EOF