YES Problem 1: (VAR v_NonEmpty:S X:S X1:S X2:S Y:S Z:S) (RULES active(cons(X1:S,X2:S)) -> cons(active(X1:S),X2:S) active(first(s(X:S),cons(Y:S,Z:S))) -> mark(cons(Y:S,first(X:S,Z:S))) active(first(0,X:S)) -> mark(nil) active(first(X1:S,X2:S)) -> first(active(X1:S),X2:S) active(first(X1:S,X2:S)) -> first(X1:S,active(X2:S)) active(from(X:S)) -> from(active(X:S)) active(from(X:S)) -> mark(cons(X:S,from(s(X:S)))) active(s(X:S)) -> s(active(X:S)) cons(mark(X1:S),X2:S) -> mark(cons(X1:S,X2:S)) cons(ok(X1:S),ok(X2:S)) -> ok(cons(X1:S,X2:S)) first(mark(X1:S),X2:S) -> mark(first(X1:S,X2:S)) first(ok(X1:S),ok(X2:S)) -> ok(first(X1:S,X2:S)) first(X1:S,mark(X2:S)) -> mark(first(X1:S,X2:S)) from(mark(X:S)) -> mark(from(X:S)) from(ok(X:S)) -> ok(from(X:S)) proper(cons(X1:S,X2:S)) -> cons(proper(X1:S),proper(X2:S)) proper(first(X1:S,X2:S)) -> first(proper(X1:S),proper(X2:S)) proper(from(X:S)) -> from(proper(X:S)) proper(s(X:S)) -> s(proper(X:S)) proper(0) -> ok(0) proper(nil) -> ok(nil) s(mark(X:S)) -> mark(s(X:S)) s(ok(X:S)) -> ok(s(X:S)) top(mark(X:S)) -> top(proper(X:S)) top(ok(X:S)) -> top(active(X:S)) ) (STRATEGY INNERMOST) Problem 1: Dependency Pairs Processor: -> Pairs: ACTIVE(cons(X1:S,X2:S)) -> ACTIVE(X1:S) ACTIVE(cons(X1:S,X2:S)) -> CONS(active(X1:S),X2:S) ACTIVE(first(s(X:S),cons(Y:S,Z:S))) -> CONS(Y:S,first(X:S,Z:S)) ACTIVE(first(s(X:S),cons(Y:S,Z:S))) -> FIRST(X:S,Z:S) ACTIVE(first(X1:S,X2:S)) -> ACTIVE(X1:S) ACTIVE(first(X1:S,X2:S)) -> ACTIVE(X2:S) ACTIVE(first(X1:S,X2:S)) -> FIRST(active(X1:S),X2:S) ACTIVE(first(X1:S,X2:S)) -> FIRST(X1:S,active(X2:S)) ACTIVE(from(X:S)) -> ACTIVE(X:S) ACTIVE(from(X:S)) -> CONS(X:S,from(s(X:S))) ACTIVE(from(X:S)) -> FROM(active(X:S)) ACTIVE(from(X:S)) -> FROM(s(X:S)) ACTIVE(from(X:S)) -> S(X:S) ACTIVE(s(X:S)) -> ACTIVE(X:S) ACTIVE(s(X:S)) -> S(active(X:S)) CONS(mark(X1:S),X2:S) -> CONS(X1:S,X2:S) CONS(ok(X1:S),ok(X2:S)) -> CONS(X1:S,X2:S) FIRST(mark(X1:S),X2:S) -> FIRST(X1:S,X2:S) FIRST(ok(X1:S),ok(X2:S)) -> FIRST(X1:S,X2:S) FIRST(X1:S,mark(X2:S)) -> FIRST(X1:S,X2:S) FROM(mark(X:S)) -> FROM(X:S) FROM(ok(X:S)) -> FROM(X:S) PROPER(cons(X1:S,X2:S)) -> CONS(proper(X1:S),proper(X2:S)) PROPER(cons(X1:S,X2:S)) -> PROPER(X1:S) PROPER(cons(X1:S,X2:S)) -> PROPER(X2:S) PROPER(first(X1:S,X2:S)) -> FIRST(proper(X1:S),proper(X2:S)) PROPER(first(X1:S,X2:S)) -> PROPER(X1:S) PROPER(first(X1:S,X2:S)) -> PROPER(X2:S) PROPER(from(X:S)) -> FROM(proper(X:S)) PROPER(from(X:S)) -> PROPER(X:S) PROPER(s(X:S)) -> PROPER(X:S) PROPER(s(X:S)) -> S(proper(X:S)) S(mark(X:S)) -> S(X:S) S(ok(X:S)) -> S(X:S) TOP(mark(X:S)) -> PROPER(X:S) TOP(mark(X:S)) -> TOP(proper(X:S)) TOP(ok(X:S)) -> ACTIVE(X:S) TOP(ok(X:S)) -> TOP(active(X:S)) -> Rules: active(cons(X1:S,X2:S)) -> cons(active(X1:S),X2:S) active(first(s(X:S),cons(Y:S,Z:S))) -> mark(cons(Y:S,first(X:S,Z:S))) active(first(0,X:S)) -> mark(nil) active(first(X1:S,X2:S)) -> first(active(X1:S),X2:S) active(first(X1:S,X2:S)) -> first(X1:S,active(X2:S)) active(from(X:S)) -> from(active(X:S)) active(from(X:S)) -> mark(cons(X:S,from(s(X:S)))) active(s(X:S)) -> s(active(X:S)) cons(mark(X1:S),X2:S) -> mark(cons(X1:S,X2:S)) cons(ok(X1:S),ok(X2:S)) -> ok(cons(X1:S,X2:S)) first(mark(X1:S),X2:S) -> mark(first(X1:S,X2:S)) first(ok(X1:S),ok(X2:S)) -> ok(first(X1:S,X2:S)) first(X1:S,mark(X2:S)) -> mark(first(X1:S,X2:S)) from(mark(X:S)) -> mark(from(X:S)) from(ok(X:S)) -> ok(from(X:S)) proper(cons(X1:S,X2:S)) -> cons(proper(X1:S),proper(X2:S)) proper(first(X1:S,X2:S)) -> first(proper(X1:S),proper(X2:S)) proper(from(X:S)) -> from(proper(X:S)) proper(s(X:S)) -> s(proper(X:S)) proper(0) -> ok(0) proper(nil) -> ok(nil) s(mark(X:S)) -> mark(s(X:S)) s(ok(X:S)) -> ok(s(X:S)) top(mark(X:S)) -> top(proper(X:S)) top(ok(X:S)) -> top(active(X:S)) Problem 1: SCC Processor: -> Pairs: ACTIVE(cons(X1:S,X2:S)) -> ACTIVE(X1:S) ACTIVE(cons(X1:S,X2:S)) -> CONS(active(X1:S),X2:S) ACTIVE(first(s(X:S),cons(Y:S,Z:S))) -> CONS(Y:S,first(X:S,Z:S)) ACTIVE(first(s(X:S),cons(Y:S,Z:S))) -> FIRST(X:S,Z:S) ACTIVE(first(X1:S,X2:S)) -> ACTIVE(X1:S) ACTIVE(first(X1:S,X2:S)) -> ACTIVE(X2:S) ACTIVE(first(X1:S,X2:S)) -> FIRST(active(X1:S),X2:S) ACTIVE(first(X1:S,X2:S)) -> FIRST(X1:S,active(X2:S)) ACTIVE(from(X:S)) -> ACTIVE(X:S) ACTIVE(from(X:S)) -> CONS(X:S,from(s(X:S))) ACTIVE(from(X:S)) -> FROM(active(X:S)) ACTIVE(from(X:S)) -> FROM(s(X:S)) ACTIVE(from(X:S)) -> S(X:S) ACTIVE(s(X:S)) -> ACTIVE(X:S) ACTIVE(s(X:S)) -> S(active(X:S)) CONS(mark(X1:S),X2:S) -> CONS(X1:S,X2:S) CONS(ok(X1:S),ok(X2:S)) -> CONS(X1:S,X2:S) FIRST(mark(X1:S),X2:S) -> FIRST(X1:S,X2:S) FIRST(ok(X1:S),ok(X2:S)) -> FIRST(X1:S,X2:S) FIRST(X1:S,mark(X2:S)) -> FIRST(X1:S,X2:S) FROM(mark(X:S)) -> FROM(X:S) FROM(ok(X:S)) -> FROM(X:S) PROPER(cons(X1:S,X2:S)) -> CONS(proper(X1:S),proper(X2:S)) PROPER(cons(X1:S,X2:S)) -> PROPER(X1:S) PROPER(cons(X1:S,X2:S)) -> PROPER(X2:S) PROPER(first(X1:S,X2:S)) -> FIRST(proper(X1:S),proper(X2:S)) PROPER(first(X1:S,X2:S)) -> PROPER(X1:S) PROPER(first(X1:S,X2:S)) -> PROPER(X2:S) PROPER(from(X:S)) -> FROM(proper(X:S)) PROPER(from(X:S)) -> PROPER(X:S) PROPER(s(X:S)) -> PROPER(X:S) PROPER(s(X:S)) -> S(proper(X:S)) S(mark(X:S)) -> S(X:S) S(ok(X:S)) -> S(X:S) TOP(mark(X:S)) -> PROPER(X:S) TOP(mark(X:S)) -> TOP(proper(X:S)) TOP(ok(X:S)) -> ACTIVE(X:S) TOP(ok(X:S)) -> TOP(active(X:S)) -> Rules: active(cons(X1:S,X2:S)) -> cons(active(X1:S),X2:S) active(first(s(X:S),cons(Y:S,Z:S))) -> mark(cons(Y:S,first(X:S,Z:S))) active(first(0,X:S)) -> mark(nil) active(first(X1:S,X2:S)) -> first(active(X1:S),X2:S) active(first(X1:S,X2:S)) -> first(X1:S,active(X2:S)) active(from(X:S)) -> from(active(X:S)) active(from(X:S)) -> mark(cons(X:S,from(s(X:S)))) active(s(X:S)) -> s(active(X:S)) cons(mark(X1:S),X2:S) -> mark(cons(X1:S,X2:S)) cons(ok(X1:S),ok(X2:S)) -> ok(cons(X1:S,X2:S)) first(mark(X1:S),X2:S) -> mark(first(X1:S,X2:S)) first(ok(X1:S),ok(X2:S)) -> ok(first(X1:S,X2:S)) first(X1:S,mark(X2:S)) -> mark(first(X1:S,X2:S)) from(mark(X:S)) -> mark(from(X:S)) from(ok(X:S)) -> ok(from(X:S)) proper(cons(X1:S,X2:S)) -> cons(proper(X1:S),proper(X2:S)) proper(first(X1:S,X2:S)) -> first(proper(X1:S),proper(X2:S)) proper(from(X:S)) -> from(proper(X:S)) proper(s(X:S)) -> s(proper(X:S)) proper(0) -> ok(0) proper(nil) -> ok(nil) s(mark(X:S)) -> mark(s(X:S)) s(ok(X:S)) -> ok(s(X:S)) top(mark(X:S)) -> top(proper(X:S)) top(ok(X:S)) -> top(active(X:S)) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: S(mark(X:S)) -> S(X:S) S(ok(X:S)) -> S(X:S) ->->-> Rules: active(cons(X1:S,X2:S)) -> cons(active(X1:S),X2:S) active(first(s(X:S),cons(Y:S,Z:S))) -> mark(cons(Y:S,first(X:S,Z:S))) active(first(0,X:S)) -> mark(nil) active(first(X1:S,X2:S)) -> first(active(X1:S),X2:S) active(first(X1:S,X2:S)) -> first(X1:S,active(X2:S)) active(from(X:S)) -> from(active(X:S)) active(from(X:S)) -> mark(cons(X:S,from(s(X:S)))) active(s(X:S)) -> s(active(X:S)) cons(mark(X1:S),X2:S) -> mark(cons(X1:S,X2:S)) cons(ok(X1:S),ok(X2:S)) -> ok(cons(X1:S,X2:S)) first(mark(X1:S),X2:S) -> mark(first(X1:S,X2:S)) first(ok(X1:S),ok(X2:S)) -> ok(first(X1:S,X2:S)) first(X1:S,mark(X2:S)) -> mark(first(X1:S,X2:S)) from(mark(X:S)) -> mark(from(X:S)) from(ok(X:S)) -> ok(from(X:S)) proper(cons(X1:S,X2:S)) -> cons(proper(X1:S),proper(X2:S)) proper(first(X1:S,X2:S)) -> first(proper(X1:S),proper(X2:S)) proper(from(X:S)) -> from(proper(X:S)) proper(s(X:S)) -> s(proper(X:S)) proper(0) -> ok(0) proper(nil) -> ok(nil) s(mark(X:S)) -> mark(s(X:S)) s(ok(X:S)) -> ok(s(X:S)) top(mark(X:S)) -> top(proper(X:S)) top(ok(X:S)) -> top(active(X:S)) ->->Cycle: ->->-> Pairs: FROM(mark(X:S)) -> FROM(X:S) FROM(ok(X:S)) -> FROM(X:S) ->->-> Rules: active(cons(X1:S,X2:S)) -> cons(active(X1:S),X2:S) active(first(s(X:S),cons(Y:S,Z:S))) -> mark(cons(Y:S,first(X:S,Z:S))) active(first(0,X:S)) -> mark(nil) active(first(X1:S,X2:S)) -> first(active(X1:S),X2:S) active(first(X1:S,X2:S)) -> first(X1:S,active(X2:S)) active(from(X:S)) -> from(active(X:S)) active(from(X:S)) -> mark(cons(X:S,from(s(X:S)))) active(s(X:S)) -> s(active(X:S)) cons(mark(X1:S),X2:S) -> mark(cons(X1:S,X2:S)) cons(ok(X1:S),ok(X2:S)) -> ok(cons(X1:S,X2:S)) first(mark(X1:S),X2:S) -> mark(first(X1:S,X2:S)) first(ok(X1:S),ok(X2:S)) -> ok(first(X1:S,X2:S)) first(X1:S,mark(X2:S)) -> mark(first(X1:S,X2:S)) from(mark(X:S)) -> mark(from(X:S)) from(ok(X:S)) -> ok(from(X:S)) proper(cons(X1:S,X2:S)) -> cons(proper(X1:S),proper(X2:S)) proper(first(X1:S,X2:S)) -> first(proper(X1:S),proper(X2:S)) proper(from(X:S)) -> from(proper(X:S)) proper(s(X:S)) -> s(proper(X:S)) proper(0) -> ok(0) proper(nil) -> ok(nil) s(mark(X:S)) -> mark(s(X:S)) s(ok(X:S)) -> ok(s(X:S)) top(mark(X:S)) -> top(proper(X:S)) top(ok(X:S)) -> top(active(X:S)) ->->Cycle: ->->-> Pairs: FIRST(mark(X1:S),X2:S) -> FIRST(X1:S,X2:S) FIRST(ok(X1:S),ok(X2:S)) -> FIRST(X1:S,X2:S) FIRST(X1:S,mark(X2:S)) -> FIRST(X1:S,X2:S) ->->-> Rules: active(cons(X1:S,X2:S)) -> cons(active(X1:S),X2:S) active(first(s(X:S),cons(Y:S,Z:S))) -> mark(cons(Y:S,first(X:S,Z:S))) active(first(0,X:S)) -> mark(nil) active(first(X1:S,X2:S)) -> first(active(X1:S),X2:S) active(first(X1:S,X2:S)) -> first(X1:S,active(X2:S)) active(from(X:S)) -> from(active(X:S)) active(from(X:S)) -> mark(cons(X:S,from(s(X:S)))) active(s(X:S)) -> s(active(X:S)) cons(mark(X1:S),X2:S) -> mark(cons(X1:S,X2:S)) cons(ok(X1:S),ok(X2:S)) -> ok(cons(X1:S,X2:S)) first(mark(X1:S),X2:S) -> mark(first(X1:S,X2:S)) first(ok(X1:S),ok(X2:S)) -> ok(first(X1:S,X2:S)) first(X1:S,mark(X2:S)) -> mark(first(X1:S,X2:S)) from(mark(X:S)) -> mark(from(X:S)) from(ok(X:S)) -> ok(from(X:S)) proper(cons(X1:S,X2:S)) -> cons(proper(X1:S),proper(X2:S)) proper(first(X1:S,X2:S)) -> first(proper(X1:S),proper(X2:S)) proper(from(X:S)) -> from(proper(X:S)) proper(s(X:S)) -> s(proper(X:S)) proper(0) -> ok(0) proper(nil) -> ok(nil) s(mark(X:S)) -> mark(s(X:S)) s(ok(X:S)) -> ok(s(X:S)) top(mark(X:S)) -> top(proper(X:S)) top(ok(X:S)) -> top(active(X:S)) ->->Cycle: ->->-> Pairs: CONS(mark(X1:S),X2:S) -> CONS(X1:S,X2:S) CONS(ok(X1:S),ok(X2:S)) -> CONS(X1:S,X2:S) ->->-> Rules: active(cons(X1:S,X2:S)) -> cons(active(X1:S),X2:S) active(first(s(X:S),cons(Y:S,Z:S))) -> mark(cons(Y:S,first(X:S,Z:S))) active(first(0,X:S)) -> mark(nil) active(first(X1:S,X2:S)) -> first(active(X1:S),X2:S) active(first(X1:S,X2:S)) -> first(X1:S,active(X2:S)) active(from(X:S)) -> from(active(X:S)) active(from(X:S)) -> mark(cons(X:S,from(s(X:S)))) active(s(X:S)) -> s(active(X:S)) cons(mark(X1:S),X2:S) -> mark(cons(X1:S,X2:S)) cons(ok(X1:S),ok(X2:S)) -> ok(cons(X1:S,X2:S)) first(mark(X1:S),X2:S) -> mark(first(X1:S,X2:S)) first(ok(X1:S),ok(X2:S)) -> ok(first(X1:S,X2:S)) first(X1:S,mark(X2:S)) -> mark(first(X1:S,X2:S)) from(mark(X:S)) -> mark(from(X:S)) from(ok(X:S)) -> ok(from(X:S)) proper(cons(X1:S,X2:S)) -> cons(proper(X1:S),proper(X2:S)) proper(first(X1:S,X2:S)) -> first(proper(X1:S),proper(X2:S)) proper(from(X:S)) -> from(proper(X:S)) proper(s(X:S)) -> s(proper(X:S)) proper(0) -> ok(0) proper(nil) -> ok(nil) s(mark(X:S)) -> mark(s(X:S)) s(ok(X:S)) -> ok(s(X:S)) top(mark(X:S)) -> top(proper(X:S)) top(ok(X:S)) -> top(active(X:S)) ->->Cycle: ->->-> Pairs: PROPER(cons(X1:S,X2:S)) -> PROPER(X1:S) PROPER(cons(X1:S,X2:S)) -> PROPER(X2:S) PROPER(first(X1:S,X2:S)) -> PROPER(X1:S) PROPER(first(X1:S,X2:S)) -> PROPER(X2:S) PROPER(from(X:S)) -> PROPER(X:S) PROPER(s(X:S)) -> PROPER(X:S) ->->-> Rules: active(cons(X1:S,X2:S)) -> cons(active(X1:S),X2:S) active(first(s(X:S),cons(Y:S,Z:S))) -> mark(cons(Y:S,first(X:S,Z:S))) active(first(0,X:S)) -> mark(nil) active(first(X1:S,X2:S)) -> first(active(X1:S),X2:S) active(first(X1:S,X2:S)) -> first(X1:S,active(X2:S)) active(from(X:S)) -> from(active(X:S)) active(from(X:S)) -> mark(cons(X:S,from(s(X:S)))) active(s(X:S)) -> s(active(X:S)) cons(mark(X1:S),X2:S) -> mark(cons(X1:S,X2:S)) cons(ok(X1:S),ok(X2:S)) -> ok(cons(X1:S,X2:S)) first(mark(X1:S),X2:S) -> mark(first(X1:S,X2:S)) first(ok(X1:S),ok(X2:S)) -> ok(first(X1:S,X2:S)) first(X1:S,mark(X2:S)) -> mark(first(X1:S,X2:S)) from(mark(X:S)) -> mark(from(X:S)) from(ok(X:S)) -> ok(from(X:S)) proper(cons(X1:S,X2:S)) -> cons(proper(X1:S),proper(X2:S)) proper(first(X1:S,X2:S)) -> first(proper(X1:S),proper(X2:S)) proper(from(X:S)) -> from(proper(X:S)) proper(s(X:S)) -> s(proper(X:S)) proper(0) -> ok(0) proper(nil) -> ok(nil) s(mark(X:S)) -> mark(s(X:S)) s(ok(X:S)) -> ok(s(X:S)) top(mark(X:S)) -> top(proper(X:S)) top(ok(X:S)) -> top(active(X:S)) ->->Cycle: ->->-> Pairs: ACTIVE(cons(X1:S,X2:S)) -> ACTIVE(X1:S) ACTIVE(first(X1:S,X2:S)) -> ACTIVE(X1:S) ACTIVE(first(X1:S,X2:S)) -> ACTIVE(X2:S) ACTIVE(from(X:S)) -> ACTIVE(X:S) ACTIVE(s(X:S)) -> ACTIVE(X:S) ->->-> Rules: active(cons(X1:S,X2:S)) -> cons(active(X1:S),X2:S) active(first(s(X:S),cons(Y:S,Z:S))) -> mark(cons(Y:S,first(X:S,Z:S))) active(first(0,X:S)) -> mark(nil) active(first(X1:S,X2:S)) -> first(active(X1:S),X2:S) active(first(X1:S,X2:S)) -> first(X1:S,active(X2:S)) active(from(X:S)) -> from(active(X:S)) active(from(X:S)) -> mark(cons(X:S,from(s(X:S)))) active(s(X:S)) -> s(active(X:S)) cons(mark(X1:S),X2:S) -> mark(cons(X1:S,X2:S)) cons(ok(X1:S),ok(X2:S)) -> ok(cons(X1:S,X2:S)) first(mark(X1:S),X2:S) -> mark(first(X1:S,X2:S)) first(ok(X1:S),ok(X2:S)) -> ok(first(X1:S,X2:S)) first(X1:S,mark(X2:S)) -> mark(first(X1:S,X2:S)) from(mark(X:S)) -> mark(from(X:S)) from(ok(X:S)) -> ok(from(X:S)) proper(cons(X1:S,X2:S)) -> cons(proper(X1:S),proper(X2:S)) proper(first(X1:S,X2:S)) -> first(proper(X1:S),proper(X2:S)) proper(from(X:S)) -> from(proper(X:S)) proper(s(X:S)) -> s(proper(X:S)) proper(0) -> ok(0) proper(nil) -> ok(nil) s(mark(X:S)) -> mark(s(X:S)) s(ok(X:S)) -> ok(s(X:S)) top(mark(X:S)) -> top(proper(X:S)) top(ok(X:S)) -> top(active(X:S)) ->->Cycle: ->->-> Pairs: TOP(mark(X:S)) -> TOP(proper(X:S)) TOP(ok(X:S)) -> TOP(active(X:S)) ->->-> Rules: active(cons(X1:S,X2:S)) -> cons(active(X1:S),X2:S) active(first(s(X:S),cons(Y:S,Z:S))) -> mark(cons(Y:S,first(X:S,Z:S))) active(first(0,X:S)) -> mark(nil) active(first(X1:S,X2:S)) -> first(active(X1:S),X2:S) active(first(X1:S,X2:S)) -> first(X1:S,active(X2:S)) active(from(X:S)) -> from(active(X:S)) active(from(X:S)) -> mark(cons(X:S,from(s(X:S)))) active(s(X:S)) -> s(active(X:S)) cons(mark(X1:S),X2:S) -> mark(cons(X1:S,X2:S)) cons(ok(X1:S),ok(X2:S)) -> ok(cons(X1:S,X2:S)) first(mark(X1:S),X2:S) -> mark(first(X1:S,X2:S)) first(ok(X1:S),ok(X2:S)) -> ok(first(X1:S,X2:S)) first(X1:S,mark(X2:S)) -> mark(first(X1:S,X2:S)) from(mark(X:S)) -> mark(from(X:S)) from(ok(X:S)) -> ok(from(X:S)) proper(cons(X1:S,X2:S)) -> cons(proper(X1:S),proper(X2:S)) proper(first(X1:S,X2:S)) -> first(proper(X1:S),proper(X2:S)) proper(from(X:S)) -> from(proper(X:S)) proper(s(X:S)) -> s(proper(X:S)) proper(0) -> ok(0) proper(nil) -> ok(nil) s(mark(X:S)) -> mark(s(X:S)) s(ok(X:S)) -> ok(s(X:S)) top(mark(X:S)) -> top(proper(X:S)) top(ok(X:S)) -> top(active(X:S)) The problem is decomposed in 7 subproblems. Problem 1.1: Subterm Processor: -> Pairs: S(mark(X:S)) -> S(X:S) S(ok(X:S)) -> S(X:S) -> Rules: active(cons(X1:S,X2:S)) -> cons(active(X1:S),X2:S) active(first(s(X:S),cons(Y:S,Z:S))) -> mark(cons(Y:S,first(X:S,Z:S))) active(first(0,X:S)) -> mark(nil) active(first(X1:S,X2:S)) -> first(active(X1:S),X2:S) active(first(X1:S,X2:S)) -> first(X1:S,active(X2:S)) active(from(X:S)) -> from(active(X:S)) active(from(X:S)) -> mark(cons(X:S,from(s(X:S)))) active(s(X:S)) -> s(active(X:S)) cons(mark(X1:S),X2:S) -> mark(cons(X1:S,X2:S)) cons(ok(X1:S),ok(X2:S)) -> ok(cons(X1:S,X2:S)) first(mark(X1:S),X2:S) -> mark(first(X1:S,X2:S)) first(ok(X1:S),ok(X2:S)) -> ok(first(X1:S,X2:S)) first(X1:S,mark(X2:S)) -> mark(first(X1:S,X2:S)) from(mark(X:S)) -> mark(from(X:S)) from(ok(X:S)) -> ok(from(X:S)) proper(cons(X1:S,X2:S)) -> cons(proper(X1:S),proper(X2:S)) proper(first(X1:S,X2:S)) -> first(proper(X1:S),proper(X2:S)) proper(from(X:S)) -> from(proper(X:S)) proper(s(X:S)) -> s(proper(X:S)) proper(0) -> ok(0) proper(nil) -> ok(nil) s(mark(X:S)) -> mark(s(X:S)) s(ok(X:S)) -> ok(s(X:S)) top(mark(X:S)) -> top(proper(X:S)) top(ok(X:S)) -> top(active(X:S)) ->Projection: pi(S) = 1 Problem 1.1: SCC Processor: -> Pairs: Empty -> Rules: active(cons(X1:S,X2:S)) -> cons(active(X1:S),X2:S) active(first(s(X:S),cons(Y:S,Z:S))) -> mark(cons(Y:S,first(X:S,Z:S))) active(first(0,X:S)) -> mark(nil) active(first(X1:S,X2:S)) -> first(active(X1:S),X2:S) active(first(X1:S,X2:S)) -> first(X1:S,active(X2:S)) active(from(X:S)) -> from(active(X:S)) active(from(X:S)) -> mark(cons(X:S,from(s(X:S)))) active(s(X:S)) -> s(active(X:S)) cons(mark(X1:S),X2:S) -> mark(cons(X1:S,X2:S)) cons(ok(X1:S),ok(X2:S)) -> ok(cons(X1:S,X2:S)) first(mark(X1:S),X2:S) -> mark(first(X1:S,X2:S)) first(ok(X1:S),ok(X2:S)) -> ok(first(X1:S,X2:S)) first(X1:S,mark(X2:S)) -> mark(first(X1:S,X2:S)) from(mark(X:S)) -> mark(from(X:S)) from(ok(X:S)) -> ok(from(X:S)) proper(cons(X1:S,X2:S)) -> cons(proper(X1:S),proper(X2:S)) proper(first(X1:S,X2:S)) -> first(proper(X1:S),proper(X2:S)) proper(from(X:S)) -> from(proper(X:S)) proper(s(X:S)) -> s(proper(X:S)) proper(0) -> ok(0) proper(nil) -> ok(nil) s(mark(X:S)) -> mark(s(X:S)) s(ok(X:S)) -> ok(s(X:S)) top(mark(X:S)) -> top(proper(X:S)) top(ok(X:S)) -> top(active(X:S)) ->Strongly Connected Components: There is no strongly connected component The problem is finite. Problem 1.2: Subterm Processor: -> Pairs: FROM(mark(X:S)) -> FROM(X:S) FROM(ok(X:S)) -> FROM(X:S) -> Rules: active(cons(X1:S,X2:S)) -> cons(active(X1:S),X2:S) active(first(s(X:S),cons(Y:S,Z:S))) -> mark(cons(Y:S,first(X:S,Z:S))) active(first(0,X:S)) -> mark(nil) active(first(X1:S,X2:S)) -> first(active(X1:S),X2:S) active(first(X1:S,X2:S)) -> first(X1:S,active(X2:S)) active(from(X:S)) -> from(active(X:S)) active(from(X:S)) -> mark(cons(X:S,from(s(X:S)))) active(s(X:S)) -> s(active(X:S)) cons(mark(X1:S),X2:S) -> mark(cons(X1:S,X2:S)) cons(ok(X1:S),ok(X2:S)) -> ok(cons(X1:S,X2:S)) first(mark(X1:S),X2:S) -> mark(first(X1:S,X2:S)) first(ok(X1:S),ok(X2:S)) -> ok(first(X1:S,X2:S)) first(X1:S,mark(X2:S)) -> mark(first(X1:S,X2:S)) from(mark(X:S)) -> mark(from(X:S)) from(ok(X:S)) -> ok(from(X:S)) proper(cons(X1:S,X2:S)) -> cons(proper(X1:S),proper(X2:S)) proper(first(X1:S,X2:S)) -> first(proper(X1:S),proper(X2:S)) proper(from(X:S)) -> from(proper(X:S)) proper(s(X:S)) -> s(proper(X:S)) proper(0) -> ok(0) proper(nil) -> ok(nil) s(mark(X:S)) -> mark(s(X:S)) s(ok(X:S)) -> ok(s(X:S)) top(mark(X:S)) -> top(proper(X:S)) top(ok(X:S)) -> top(active(X:S)) ->Projection: pi(FROM) = 1 Problem 1.2: SCC Processor: -> Pairs: Empty -> Rules: active(cons(X1:S,X2:S)) -> cons(active(X1:S),X2:S) active(first(s(X:S),cons(Y:S,Z:S))) -> mark(cons(Y:S,first(X:S,Z:S))) active(first(0,X:S)) -> mark(nil) active(first(X1:S,X2:S)) -> first(active(X1:S),X2:S) active(first(X1:S,X2:S)) -> first(X1:S,active(X2:S)) active(from(X:S)) -> from(active(X:S)) active(from(X:S)) -> mark(cons(X:S,from(s(X:S)))) active(s(X:S)) -> s(active(X:S)) cons(mark(X1:S),X2:S) -> mark(cons(X1:S,X2:S)) cons(ok(X1:S),ok(X2:S)) -> ok(cons(X1:S,X2:S)) first(mark(X1:S),X2:S) -> mark(first(X1:S,X2:S)) first(ok(X1:S),ok(X2:S)) -> ok(first(X1:S,X2:S)) first(X1:S,mark(X2:S)) -> mark(first(X1:S,X2:S)) from(mark(X:S)) -> mark(from(X:S)) from(ok(X:S)) -> ok(from(X:S)) proper(cons(X1:S,X2:S)) -> cons(proper(X1:S),proper(X2:S)) proper(first(X1:S,X2:S)) -> first(proper(X1:S),proper(X2:S)) proper(from(X:S)) -> from(proper(X:S)) proper(s(X:S)) -> s(proper(X:S)) proper(0) -> ok(0) proper(nil) -> ok(nil) s(mark(X:S)) -> mark(s(X:S)) s(ok(X:S)) -> ok(s(X:S)) top(mark(X:S)) -> top(proper(X:S)) top(ok(X:S)) -> top(active(X:S)) ->Strongly Connected Components: There is no strongly connected component The problem is finite. Problem 1.3: Subterm Processor: -> Pairs: FIRST(mark(X1:S),X2:S) -> FIRST(X1:S,X2:S) FIRST(ok(X1:S),ok(X2:S)) -> FIRST(X1:S,X2:S) FIRST(X1:S,mark(X2:S)) -> FIRST(X1:S,X2:S) -> Rules: active(cons(X1:S,X2:S)) -> cons(active(X1:S),X2:S) active(first(s(X:S),cons(Y:S,Z:S))) -> mark(cons(Y:S,first(X:S,Z:S))) active(first(0,X:S)) -> mark(nil) active(first(X1:S,X2:S)) -> first(active(X1:S),X2:S) active(first(X1:S,X2:S)) -> first(X1:S,active(X2:S)) active(from(X:S)) -> from(active(X:S)) active(from(X:S)) -> mark(cons(X:S,from(s(X:S)))) active(s(X:S)) -> s(active(X:S)) cons(mark(X1:S),X2:S) -> mark(cons(X1:S,X2:S)) cons(ok(X1:S),ok(X2:S)) -> ok(cons(X1:S,X2:S)) first(mark(X1:S),X2:S) -> mark(first(X1:S,X2:S)) first(ok(X1:S),ok(X2:S)) -> ok(first(X1:S,X2:S)) first(X1:S,mark(X2:S)) -> mark(first(X1:S,X2:S)) from(mark(X:S)) -> mark(from(X:S)) from(ok(X:S)) -> ok(from(X:S)) proper(cons(X1:S,X2:S)) -> cons(proper(X1:S),proper(X2:S)) proper(first(X1:S,X2:S)) -> first(proper(X1:S),proper(X2:S)) proper(from(X:S)) -> from(proper(X:S)) proper(s(X:S)) -> s(proper(X:S)) proper(0) -> ok(0) proper(nil) -> ok(nil) s(mark(X:S)) -> mark(s(X:S)) s(ok(X:S)) -> ok(s(X:S)) top(mark(X:S)) -> top(proper(X:S)) top(ok(X:S)) -> top(active(X:S)) ->Projection: pi(FIRST) = 1 Problem 1.3: SCC Processor: -> Pairs: FIRST(X1:S,mark(X2:S)) -> FIRST(X1:S,X2:S) -> Rules: active(cons(X1:S,X2:S)) -> cons(active(X1:S),X2:S) active(first(s(X:S),cons(Y:S,Z:S))) -> mark(cons(Y:S,first(X:S,Z:S))) active(first(0,X:S)) -> mark(nil) active(first(X1:S,X2:S)) -> first(active(X1:S),X2:S) active(first(X1:S,X2:S)) -> first(X1:S,active(X2:S)) active(from(X:S)) -> from(active(X:S)) active(from(X:S)) -> mark(cons(X:S,from(s(X:S)))) active(s(X:S)) -> s(active(X:S)) cons(mark(X1:S),X2:S) -> mark(cons(X1:S,X2:S)) cons(ok(X1:S),ok(X2:S)) -> ok(cons(X1:S,X2:S)) first(mark(X1:S),X2:S) -> mark(first(X1:S,X2:S)) first(ok(X1:S),ok(X2:S)) -> ok(first(X1:S,X2:S)) first(X1:S,mark(X2:S)) -> mark(first(X1:S,X2:S)) from(mark(X:S)) -> mark(from(X:S)) from(ok(X:S)) -> ok(from(X:S)) proper(cons(X1:S,X2:S)) -> cons(proper(X1:S),proper(X2:S)) proper(first(X1:S,X2:S)) -> first(proper(X1:S),proper(X2:S)) proper(from(X:S)) -> from(proper(X:S)) proper(s(X:S)) -> s(proper(X:S)) proper(0) -> ok(0) proper(nil) -> ok(nil) s(mark(X:S)) -> mark(s(X:S)) s(ok(X:S)) -> ok(s(X:S)) top(mark(X:S)) -> top(proper(X:S)) top(ok(X:S)) -> top(active(X:S)) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: FIRST(X1:S,mark(X2:S)) -> FIRST(X1:S,X2:S) ->->-> Rules: active(cons(X1:S,X2:S)) -> cons(active(X1:S),X2:S) active(first(s(X:S),cons(Y:S,Z:S))) -> mark(cons(Y:S,first(X:S,Z:S))) active(first(0,X:S)) -> mark(nil) active(first(X1:S,X2:S)) -> first(active(X1:S),X2:S) active(first(X1:S,X2:S)) -> first(X1:S,active(X2:S)) active(from(X:S)) -> from(active(X:S)) active(from(X:S)) -> mark(cons(X:S,from(s(X:S)))) active(s(X:S)) -> s(active(X:S)) cons(mark(X1:S),X2:S) -> mark(cons(X1:S,X2:S)) cons(ok(X1:S),ok(X2:S)) -> ok(cons(X1:S,X2:S)) first(mark(X1:S),X2:S) -> mark(first(X1:S,X2:S)) first(ok(X1:S),ok(X2:S)) -> ok(first(X1:S,X2:S)) first(X1:S,mark(X2:S)) -> mark(first(X1:S,X2:S)) from(mark(X:S)) -> mark(from(X:S)) from(ok(X:S)) -> ok(from(X:S)) proper(cons(X1:S,X2:S)) -> cons(proper(X1:S),proper(X2:S)) proper(first(X1:S,X2:S)) -> first(proper(X1:S),proper(X2:S)) proper(from(X:S)) -> from(proper(X:S)) proper(s(X:S)) -> s(proper(X:S)) proper(0) -> ok(0) proper(nil) -> ok(nil) s(mark(X:S)) -> mark(s(X:S)) s(ok(X:S)) -> ok(s(X:S)) top(mark(X:S)) -> top(proper(X:S)) top(ok(X:S)) -> top(active(X:S)) Problem 1.3: Subterm Processor: -> Pairs: FIRST(X1:S,mark(X2:S)) -> FIRST(X1:S,X2:S) -> Rules: active(cons(X1:S,X2:S)) -> cons(active(X1:S),X2:S) active(first(s(X:S),cons(Y:S,Z:S))) -> mark(cons(Y:S,first(X:S,Z:S))) active(first(0,X:S)) -> mark(nil) active(first(X1:S,X2:S)) -> first(active(X1:S),X2:S) active(first(X1:S,X2:S)) -> first(X1:S,active(X2:S)) active(from(X:S)) -> from(active(X:S)) active(from(X:S)) -> mark(cons(X:S,from(s(X:S)))) active(s(X:S)) -> s(active(X:S)) cons(mark(X1:S),X2:S) -> mark(cons(X1:S,X2:S)) cons(ok(X1:S),ok(X2:S)) -> ok(cons(X1:S,X2:S)) first(mark(X1:S),X2:S) -> mark(first(X1:S,X2:S)) first(ok(X1:S),ok(X2:S)) -> ok(first(X1:S,X2:S)) first(X1:S,mark(X2:S)) -> mark(first(X1:S,X2:S)) from(mark(X:S)) -> mark(from(X:S)) from(ok(X:S)) -> ok(from(X:S)) proper(cons(X1:S,X2:S)) -> cons(proper(X1:S),proper(X2:S)) proper(first(X1:S,X2:S)) -> first(proper(X1:S),proper(X2:S)) proper(from(X:S)) -> from(proper(X:S)) proper(s(X:S)) -> s(proper(X:S)) proper(0) -> ok(0) proper(nil) -> ok(nil) s(mark(X:S)) -> mark(s(X:S)) s(ok(X:S)) -> ok(s(X:S)) top(mark(X:S)) -> top(proper(X:S)) top(ok(X:S)) -> top(active(X:S)) ->Projection: pi(FIRST) = 2 Problem 1.3: SCC Processor: -> Pairs: Empty -> Rules: active(cons(X1:S,X2:S)) -> cons(active(X1:S),X2:S) active(first(s(X:S),cons(Y:S,Z:S))) -> mark(cons(Y:S,first(X:S,Z:S))) active(first(0,X:S)) -> mark(nil) active(first(X1:S,X2:S)) -> first(active(X1:S),X2:S) active(first(X1:S,X2:S)) -> first(X1:S,active(X2:S)) active(from(X:S)) -> from(active(X:S)) active(from(X:S)) -> mark(cons(X:S,from(s(X:S)))) active(s(X:S)) -> s(active(X:S)) cons(mark(X1:S),X2:S) -> mark(cons(X1:S,X2:S)) cons(ok(X1:S),ok(X2:S)) -> ok(cons(X1:S,X2:S)) first(mark(X1:S),X2:S) -> mark(first(X1:S,X2:S)) first(ok(X1:S),ok(X2:S)) -> ok(first(X1:S,X2:S)) first(X1:S,mark(X2:S)) -> mark(first(X1:S,X2:S)) from(mark(X:S)) -> mark(from(X:S)) from(ok(X:S)) -> ok(from(X:S)) proper(cons(X1:S,X2:S)) -> cons(proper(X1:S),proper(X2:S)) proper(first(X1:S,X2:S)) -> first(proper(X1:S),proper(X2:S)) proper(from(X:S)) -> from(proper(X:S)) proper(s(X:S)) -> s(proper(X:S)) proper(0) -> ok(0) proper(nil) -> ok(nil) s(mark(X:S)) -> mark(s(X:S)) s(ok(X:S)) -> ok(s(X:S)) top(mark(X:S)) -> top(proper(X:S)) top(ok(X:S)) -> top(active(X:S)) ->Strongly Connected Components: There is no strongly connected component The problem is finite. Problem 1.4: Subterm Processor: -> Pairs: CONS(mark(X1:S),X2:S) -> CONS(X1:S,X2:S) CONS(ok(X1:S),ok(X2:S)) -> CONS(X1:S,X2:S) -> Rules: active(cons(X1:S,X2:S)) -> cons(active(X1:S),X2:S) active(first(s(X:S),cons(Y:S,Z:S))) -> mark(cons(Y:S,first(X:S,Z:S))) active(first(0,X:S)) -> mark(nil) active(first(X1:S,X2:S)) -> first(active(X1:S),X2:S) active(first(X1:S,X2:S)) -> first(X1:S,active(X2:S)) active(from(X:S)) -> from(active(X:S)) active(from(X:S)) -> mark(cons(X:S,from(s(X:S)))) active(s(X:S)) -> s(active(X:S)) cons(mark(X1:S),X2:S) -> mark(cons(X1:S,X2:S)) cons(ok(X1:S),ok(X2:S)) -> ok(cons(X1:S,X2:S)) first(mark(X1:S),X2:S) -> mark(first(X1:S,X2:S)) first(ok(X1:S),ok(X2:S)) -> ok(first(X1:S,X2:S)) first(X1:S,mark(X2:S)) -> mark(first(X1:S,X2:S)) from(mark(X:S)) -> mark(from(X:S)) from(ok(X:S)) -> ok(from(X:S)) proper(cons(X1:S,X2:S)) -> cons(proper(X1:S),proper(X2:S)) proper(first(X1:S,X2:S)) -> first(proper(X1:S),proper(X2:S)) proper(from(X:S)) -> from(proper(X:S)) proper(s(X:S)) -> s(proper(X:S)) proper(0) -> ok(0) proper(nil) -> ok(nil) s(mark(X:S)) -> mark(s(X:S)) s(ok(X:S)) -> ok(s(X:S)) top(mark(X:S)) -> top(proper(X:S)) top(ok(X:S)) -> top(active(X:S)) ->Projection: pi(CONS) = 1 Problem 1.4: SCC Processor: -> Pairs: Empty -> Rules: active(cons(X1:S,X2:S)) -> cons(active(X1:S),X2:S) active(first(s(X:S),cons(Y:S,Z:S))) -> mark(cons(Y:S,first(X:S,Z:S))) active(first(0,X:S)) -> mark(nil) active(first(X1:S,X2:S)) -> first(active(X1:S),X2:S) active(first(X1:S,X2:S)) -> first(X1:S,active(X2:S)) active(from(X:S)) -> from(active(X:S)) active(from(X:S)) -> mark(cons(X:S,from(s(X:S)))) active(s(X:S)) -> s(active(X:S)) cons(mark(X1:S),X2:S) -> mark(cons(X1:S,X2:S)) cons(ok(X1:S),ok(X2:S)) -> ok(cons(X1:S,X2:S)) first(mark(X1:S),X2:S) -> mark(first(X1:S,X2:S)) first(ok(X1:S),ok(X2:S)) -> ok(first(X1:S,X2:S)) first(X1:S,mark(X2:S)) -> mark(first(X1:S,X2:S)) from(mark(X:S)) -> mark(from(X:S)) from(ok(X:S)) -> ok(from(X:S)) proper(cons(X1:S,X2:S)) -> cons(proper(X1:S),proper(X2:S)) proper(first(X1:S,X2:S)) -> first(proper(X1:S),proper(X2:S)) proper(from(X:S)) -> from(proper(X:S)) proper(s(X:S)) -> s(proper(X:S)) proper(0) -> ok(0) proper(nil) -> ok(nil) s(mark(X:S)) -> mark(s(X:S)) s(ok(X:S)) -> ok(s(X:S)) top(mark(X:S)) -> top(proper(X:S)) top(ok(X:S)) -> top(active(X:S)) ->Strongly Connected Components: There is no strongly connected component The problem is finite. Problem 1.5: Subterm Processor: -> Pairs: PROPER(cons(X1:S,X2:S)) -> PROPER(X1:S) PROPER(cons(X1:S,X2:S)) -> PROPER(X2:S) PROPER(first(X1:S,X2:S)) -> PROPER(X1:S) PROPER(first(X1:S,X2:S)) -> PROPER(X2:S) PROPER(from(X:S)) -> PROPER(X:S) PROPER(s(X:S)) -> PROPER(X:S) -> Rules: active(cons(X1:S,X2:S)) -> cons(active(X1:S),X2:S) active(first(s(X:S),cons(Y:S,Z:S))) -> mark(cons(Y:S,first(X:S,Z:S))) active(first(0,X:S)) -> mark(nil) active(first(X1:S,X2:S)) -> first(active(X1:S),X2:S) active(first(X1:S,X2:S)) -> first(X1:S,active(X2:S)) active(from(X:S)) -> from(active(X:S)) active(from(X:S)) -> mark(cons(X:S,from(s(X:S)))) active(s(X:S)) -> s(active(X:S)) cons(mark(X1:S),X2:S) -> mark(cons(X1:S,X2:S)) cons(ok(X1:S),ok(X2:S)) -> ok(cons(X1:S,X2:S)) first(mark(X1:S),X2:S) -> mark(first(X1:S,X2:S)) first(ok(X1:S),ok(X2:S)) -> ok(first(X1:S,X2:S)) first(X1:S,mark(X2:S)) -> mark(first(X1:S,X2:S)) from(mark(X:S)) -> mark(from(X:S)) from(ok(X:S)) -> ok(from(X:S)) proper(cons(X1:S,X2:S)) -> cons(proper(X1:S),proper(X2:S)) proper(first(X1:S,X2:S)) -> first(proper(X1:S),proper(X2:S)) proper(from(X:S)) -> from(proper(X:S)) proper(s(X:S)) -> s(proper(X:S)) proper(0) -> ok(0) proper(nil) -> ok(nil) s(mark(X:S)) -> mark(s(X:S)) s(ok(X:S)) -> ok(s(X:S)) top(mark(X:S)) -> top(proper(X:S)) top(ok(X:S)) -> top(active(X:S)) ->Projection: pi(PROPER) = 1 Problem 1.5: SCC Processor: -> Pairs: Empty -> Rules: active(cons(X1:S,X2:S)) -> cons(active(X1:S),X2:S) active(first(s(X:S),cons(Y:S,Z:S))) -> mark(cons(Y:S,first(X:S,Z:S))) active(first(0,X:S)) -> mark(nil) active(first(X1:S,X2:S)) -> first(active(X1:S),X2:S) active(first(X1:S,X2:S)) -> first(X1:S,active(X2:S)) active(from(X:S)) -> from(active(X:S)) active(from(X:S)) -> mark(cons(X:S,from(s(X:S)))) active(s(X:S)) -> s(active(X:S)) cons(mark(X1:S),X2:S) -> mark(cons(X1:S,X2:S)) cons(ok(X1:S),ok(X2:S)) -> ok(cons(X1:S,X2:S)) first(mark(X1:S),X2:S) -> mark(first(X1:S,X2:S)) first(ok(X1:S),ok(X2:S)) -> ok(first(X1:S,X2:S)) first(X1:S,mark(X2:S)) -> mark(first(X1:S,X2:S)) from(mark(X:S)) -> mark(from(X:S)) from(ok(X:S)) -> ok(from(X:S)) proper(cons(X1:S,X2:S)) -> cons(proper(X1:S),proper(X2:S)) proper(first(X1:S,X2:S)) -> first(proper(X1:S),proper(X2:S)) proper(from(X:S)) -> from(proper(X:S)) proper(s(X:S)) -> s(proper(X:S)) proper(0) -> ok(0) proper(nil) -> ok(nil) s(mark(X:S)) -> mark(s(X:S)) s(ok(X:S)) -> ok(s(X:S)) top(mark(X:S)) -> top(proper(X:S)) top(ok(X:S)) -> top(active(X:S)) ->Strongly Connected Components: There is no strongly connected component The problem is finite. Problem 1.6: Subterm Processor: -> Pairs: ACTIVE(cons(X1:S,X2:S)) -> ACTIVE(X1:S) ACTIVE(first(X1:S,X2:S)) -> ACTIVE(X1:S) ACTIVE(first(X1:S,X2:S)) -> ACTIVE(X2:S) ACTIVE(from(X:S)) -> ACTIVE(X:S) ACTIVE(s(X:S)) -> ACTIVE(X:S) -> Rules: active(cons(X1:S,X2:S)) -> cons(active(X1:S),X2:S) active(first(s(X:S),cons(Y:S,Z:S))) -> mark(cons(Y:S,first(X:S,Z:S))) active(first(0,X:S)) -> mark(nil) active(first(X1:S,X2:S)) -> first(active(X1:S),X2:S) active(first(X1:S,X2:S)) -> first(X1:S,active(X2:S)) active(from(X:S)) -> from(active(X:S)) active(from(X:S)) -> mark(cons(X:S,from(s(X:S)))) active(s(X:S)) -> s(active(X:S)) cons(mark(X1:S),X2:S) -> mark(cons(X1:S,X2:S)) cons(ok(X1:S),ok(X2:S)) -> ok(cons(X1:S,X2:S)) first(mark(X1:S),X2:S) -> mark(first(X1:S,X2:S)) first(ok(X1:S),ok(X2:S)) -> ok(first(X1:S,X2:S)) first(X1:S,mark(X2:S)) -> mark(first(X1:S,X2:S)) from(mark(X:S)) -> mark(from(X:S)) from(ok(X:S)) -> ok(from(X:S)) proper(cons(X1:S,X2:S)) -> cons(proper(X1:S),proper(X2:S)) proper(first(X1:S,X2:S)) -> first(proper(X1:S),proper(X2:S)) proper(from(X:S)) -> from(proper(X:S)) proper(s(X:S)) -> s(proper(X:S)) proper(0) -> ok(0) proper(nil) -> ok(nil) s(mark(X:S)) -> mark(s(X:S)) s(ok(X:S)) -> ok(s(X:S)) top(mark(X:S)) -> top(proper(X:S)) top(ok(X:S)) -> top(active(X:S)) ->Projection: pi(ACTIVE) = 1 Problem 1.6: SCC Processor: -> Pairs: Empty -> Rules: active(cons(X1:S,X2:S)) -> cons(active(X1:S),X2:S) active(first(s(X:S),cons(Y:S,Z:S))) -> mark(cons(Y:S,first(X:S,Z:S))) active(first(0,X:S)) -> mark(nil) active(first(X1:S,X2:S)) -> first(active(X1:S),X2:S) active(first(X1:S,X2:S)) -> first(X1:S,active(X2:S)) active(from(X:S)) -> from(active(X:S)) active(from(X:S)) -> mark(cons(X:S,from(s(X:S)))) active(s(X:S)) -> s(active(X:S)) cons(mark(X1:S),X2:S) -> mark(cons(X1:S,X2:S)) cons(ok(X1:S),ok(X2:S)) -> ok(cons(X1:S,X2:S)) first(mark(X1:S),X2:S) -> mark(first(X1:S,X2:S)) first(ok(X1:S),ok(X2:S)) -> ok(first(X1:S,X2:S)) first(X1:S,mark(X2:S)) -> mark(first(X1:S,X2:S)) from(mark(X:S)) -> mark(from(X:S)) from(ok(X:S)) -> ok(from(X:S)) proper(cons(X1:S,X2:S)) -> cons(proper(X1:S),proper(X2:S)) proper(first(X1:S,X2:S)) -> first(proper(X1:S),proper(X2:S)) proper(from(X:S)) -> from(proper(X:S)) proper(s(X:S)) -> s(proper(X:S)) proper(0) -> ok(0) proper(nil) -> ok(nil) s(mark(X:S)) -> mark(s(X:S)) s(ok(X:S)) -> ok(s(X:S)) top(mark(X:S)) -> top(proper(X:S)) top(ok(X:S)) -> top(active(X:S)) ->Strongly Connected Components: There is no strongly connected component The problem is finite. Problem 1.7: Reduction Pairs Processor: -> Pairs: TOP(mark(X:S)) -> TOP(proper(X:S)) TOP(ok(X:S)) -> TOP(active(X:S)) -> Rules: active(cons(X1:S,X2:S)) -> cons(active(X1:S),X2:S) active(first(s(X:S),cons(Y:S,Z:S))) -> mark(cons(Y:S,first(X:S,Z:S))) active(first(0,X:S)) -> mark(nil) active(first(X1:S,X2:S)) -> first(active(X1:S),X2:S) active(first(X1:S,X2:S)) -> first(X1:S,active(X2:S)) active(from(X:S)) -> from(active(X:S)) active(from(X:S)) -> mark(cons(X:S,from(s(X:S)))) active(s(X:S)) -> s(active(X:S)) cons(mark(X1:S),X2:S) -> mark(cons(X1:S,X2:S)) cons(ok(X1:S),ok(X2:S)) -> ok(cons(X1:S,X2:S)) first(mark(X1:S),X2:S) -> mark(first(X1:S,X2:S)) first(ok(X1:S),ok(X2:S)) -> ok(first(X1:S,X2:S)) first(X1:S,mark(X2:S)) -> mark(first(X1:S,X2:S)) from(mark(X:S)) -> mark(from(X:S)) from(ok(X:S)) -> ok(from(X:S)) proper(cons(X1:S,X2:S)) -> cons(proper(X1:S),proper(X2:S)) proper(first(X1:S,X2:S)) -> first(proper(X1:S),proper(X2:S)) proper(from(X:S)) -> from(proper(X:S)) proper(s(X:S)) -> s(proper(X:S)) proper(0) -> ok(0) proper(nil) -> ok(nil) s(mark(X:S)) -> mark(s(X:S)) s(ok(X:S)) -> ok(s(X:S)) top(mark(X:S)) -> top(proper(X:S)) top(ok(X:S)) -> top(active(X:S)) -> Usable rules: active(cons(X1:S,X2:S)) -> cons(active(X1:S),X2:S) active(first(s(X:S),cons(Y:S,Z:S))) -> mark(cons(Y:S,first(X:S,Z:S))) active(first(0,X:S)) -> mark(nil) active(first(X1:S,X2:S)) -> first(active(X1:S),X2:S) active(first(X1:S,X2:S)) -> first(X1:S,active(X2:S)) active(from(X:S)) -> from(active(X:S)) active(from(X:S)) -> mark(cons(X:S,from(s(X:S)))) active(s(X:S)) -> s(active(X:S)) cons(mark(X1:S),X2:S) -> mark(cons(X1:S,X2:S)) cons(ok(X1:S),ok(X2:S)) -> ok(cons(X1:S,X2:S)) first(mark(X1:S),X2:S) -> mark(first(X1:S,X2:S)) first(ok(X1:S),ok(X2:S)) -> ok(first(X1:S,X2:S)) first(X1:S,mark(X2:S)) -> mark(first(X1:S,X2:S)) from(mark(X:S)) -> mark(from(X:S)) from(ok(X:S)) -> ok(from(X:S)) proper(cons(X1:S,X2:S)) -> cons(proper(X1:S),proper(X2:S)) proper(first(X1:S,X2:S)) -> first(proper(X1:S),proper(X2:S)) proper(from(X:S)) -> from(proper(X:S)) proper(s(X:S)) -> s(proper(X:S)) proper(0) -> ok(0) proper(nil) -> ok(nil) s(mark(X:S)) -> mark(s(X:S)) s(ok(X:S)) -> ok(s(X:S)) ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [active](X) = X [cons](X1,X2) = 2.X1 [first](X1,X2) = 2.X1 + 2.X2 + 2 [from](X) = 2.X + 2 [proper](X) = X [s](X) = X + 2 [top](X) = 0 [0] = 2 [fSNonEmpty] = 0 [mark](X) = X + 2 [nil] = 2 [ok](X) = X [ACTIVE](X) = 0 [CONS](X1,X2) = 0 [FIRST](X1,X2) = 0 [FROM](X) = 0 [PROPER](X) = 0 [S](X) = 0 [TOP](X) = X Problem 1.7: SCC Processor: -> Pairs: TOP(ok(X:S)) -> TOP(active(X:S)) -> Rules: active(cons(X1:S,X2:S)) -> cons(active(X1:S),X2:S) active(first(s(X:S),cons(Y:S,Z:S))) -> mark(cons(Y:S,first(X:S,Z:S))) active(first(0,X:S)) -> mark(nil) active(first(X1:S,X2:S)) -> first(active(X1:S),X2:S) active(first(X1:S,X2:S)) -> first(X1:S,active(X2:S)) active(from(X:S)) -> from(active(X:S)) active(from(X:S)) -> mark(cons(X:S,from(s(X:S)))) active(s(X:S)) -> s(active(X:S)) cons(mark(X1:S),X2:S) -> mark(cons(X1:S,X2:S)) cons(ok(X1:S),ok(X2:S)) -> ok(cons(X1:S,X2:S)) first(mark(X1:S),X2:S) -> mark(first(X1:S,X2:S)) first(ok(X1:S),ok(X2:S)) -> ok(first(X1:S,X2:S)) first(X1:S,mark(X2:S)) -> mark(first(X1:S,X2:S)) from(mark(X:S)) -> mark(from(X:S)) from(ok(X:S)) -> ok(from(X:S)) proper(cons(X1:S,X2:S)) -> cons(proper(X1:S),proper(X2:S)) proper(first(X1:S,X2:S)) -> first(proper(X1:S),proper(X2:S)) proper(from(X:S)) -> from(proper(X:S)) proper(s(X:S)) -> s(proper(X:S)) proper(0) -> ok(0) proper(nil) -> ok(nil) s(mark(X:S)) -> mark(s(X:S)) s(ok(X:S)) -> ok(s(X:S)) top(mark(X:S)) -> top(proper(X:S)) top(ok(X:S)) -> top(active(X:S)) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: TOP(ok(X:S)) -> TOP(active(X:S)) ->->-> Rules: active(cons(X1:S,X2:S)) -> cons(active(X1:S),X2:S) active(first(s(X:S),cons(Y:S,Z:S))) -> mark(cons(Y:S,first(X:S,Z:S))) active(first(0,X:S)) -> mark(nil) active(first(X1:S,X2:S)) -> first(active(X1:S),X2:S) active(first(X1:S,X2:S)) -> first(X1:S,active(X2:S)) active(from(X:S)) -> from(active(X:S)) active(from(X:S)) -> mark(cons(X:S,from(s(X:S)))) active(s(X:S)) -> s(active(X:S)) cons(mark(X1:S),X2:S) -> mark(cons(X1:S,X2:S)) cons(ok(X1:S),ok(X2:S)) -> ok(cons(X1:S,X2:S)) first(mark(X1:S),X2:S) -> mark(first(X1:S,X2:S)) first(ok(X1:S),ok(X2:S)) -> ok(first(X1:S,X2:S)) first(X1:S,mark(X2:S)) -> mark(first(X1:S,X2:S)) from(mark(X:S)) -> mark(from(X:S)) from(ok(X:S)) -> ok(from(X:S)) proper(cons(X1:S,X2:S)) -> cons(proper(X1:S),proper(X2:S)) proper(first(X1:S,X2:S)) -> first(proper(X1:S),proper(X2:S)) proper(from(X:S)) -> from(proper(X:S)) proper(s(X:S)) -> s(proper(X:S)) proper(0) -> ok(0) proper(nil) -> ok(nil) s(mark(X:S)) -> mark(s(X:S)) s(ok(X:S)) -> ok(s(X:S)) top(mark(X:S)) -> top(proper(X:S)) top(ok(X:S)) -> top(active(X:S)) Problem 1.7: Reduction Pairs Processor: -> Pairs: TOP(ok(X:S)) -> TOP(active(X:S)) -> Rules: active(cons(X1:S,X2:S)) -> cons(active(X1:S),X2:S) active(first(s(X:S),cons(Y:S,Z:S))) -> mark(cons(Y:S,first(X:S,Z:S))) active(first(0,X:S)) -> mark(nil) active(first(X1:S,X2:S)) -> first(active(X1:S),X2:S) active(first(X1:S,X2:S)) -> first(X1:S,active(X2:S)) active(from(X:S)) -> from(active(X:S)) active(from(X:S)) -> mark(cons(X:S,from(s(X:S)))) active(s(X:S)) -> s(active(X:S)) cons(mark(X1:S),X2:S) -> mark(cons(X1:S,X2:S)) cons(ok(X1:S),ok(X2:S)) -> ok(cons(X1:S,X2:S)) first(mark(X1:S),X2:S) -> mark(first(X1:S,X2:S)) first(ok(X1:S),ok(X2:S)) -> ok(first(X1:S,X2:S)) first(X1:S,mark(X2:S)) -> mark(first(X1:S,X2:S)) from(mark(X:S)) -> mark(from(X:S)) from(ok(X:S)) -> ok(from(X:S)) proper(cons(X1:S,X2:S)) -> cons(proper(X1:S),proper(X2:S)) proper(first(X1:S,X2:S)) -> first(proper(X1:S),proper(X2:S)) proper(from(X:S)) -> from(proper(X:S)) proper(s(X:S)) -> s(proper(X:S)) proper(0) -> ok(0) proper(nil) -> ok(nil) s(mark(X:S)) -> mark(s(X:S)) s(ok(X:S)) -> ok(s(X:S)) top(mark(X:S)) -> top(proper(X:S)) top(ok(X:S)) -> top(active(X:S)) -> Usable rules: active(cons(X1:S,X2:S)) -> cons(active(X1:S),X2:S) active(first(s(X:S),cons(Y:S,Z:S))) -> mark(cons(Y:S,first(X:S,Z:S))) active(first(0,X:S)) -> mark(nil) active(first(X1:S,X2:S)) -> first(active(X1:S),X2:S) active(first(X1:S,X2:S)) -> first(X1:S,active(X2:S)) active(from(X:S)) -> from(active(X:S)) active(from(X:S)) -> mark(cons(X:S,from(s(X:S)))) active(s(X:S)) -> s(active(X:S)) cons(mark(X1:S),X2:S) -> mark(cons(X1:S,X2:S)) cons(ok(X1:S),ok(X2:S)) -> ok(cons(X1:S,X2:S)) first(mark(X1:S),X2:S) -> mark(first(X1:S,X2:S)) first(ok(X1:S),ok(X2:S)) -> ok(first(X1:S,X2:S)) first(X1:S,mark(X2:S)) -> mark(first(X1:S,X2:S)) from(mark(X:S)) -> mark(from(X:S)) from(ok(X:S)) -> ok(from(X:S)) s(mark(X:S)) -> mark(s(X:S)) s(ok(X:S)) -> ok(s(X:S)) ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [active](X) = 2.X + 1 [cons](X1,X2) = 2.X1 + 2 [first](X1,X2) = X1 + X2 [from](X) = 2.X + 2 [proper](X) = 0 [s](X) = 2.X + 2 [top](X) = 0 [0] = 2 [fSNonEmpty] = 0 [mark](X) = X + 2 [nil] = 1 [ok](X) = 2.X + 2 [ACTIVE](X) = 0 [CONS](X1,X2) = 0 [FIRST](X1,X2) = 0 [FROM](X) = 0 [PROPER](X) = 0 [S](X) = 0 [TOP](X) = 2.X Problem 1.7: SCC Processor: -> Pairs: Empty -> Rules: active(cons(X1:S,X2:S)) -> cons(active(X1:S),X2:S) active(first(s(X:S),cons(Y:S,Z:S))) -> mark(cons(Y:S,first(X:S,Z:S))) active(first(0,X:S)) -> mark(nil) active(first(X1:S,X2:S)) -> first(active(X1:S),X2:S) active(first(X1:S,X2:S)) -> first(X1:S,active(X2:S)) active(from(X:S)) -> from(active(X:S)) active(from(X:S)) -> mark(cons(X:S,from(s(X:S)))) active(s(X:S)) -> s(active(X:S)) cons(mark(X1:S),X2:S) -> mark(cons(X1:S,X2:S)) cons(ok(X1:S),ok(X2:S)) -> ok(cons(X1:S,X2:S)) first(mark(X1:S),X2:S) -> mark(first(X1:S,X2:S)) first(ok(X1:S),ok(X2:S)) -> ok(first(X1:S,X2:S)) first(X1:S,mark(X2:S)) -> mark(first(X1:S,X2:S)) from(mark(X:S)) -> mark(from(X:S)) from(ok(X:S)) -> ok(from(X:S)) proper(cons(X1:S,X2:S)) -> cons(proper(X1:S),proper(X2:S)) proper(first(X1:S,X2:S)) -> first(proper(X1:S),proper(X2:S)) proper(from(X:S)) -> from(proper(X:S)) proper(s(X:S)) -> s(proper(X:S)) proper(0) -> ok(0) proper(nil) -> ok(nil) s(mark(X:S)) -> mark(s(X:S)) s(ok(X:S)) -> ok(s(X:S)) top(mark(X:S)) -> top(proper(X:S)) top(ok(X:S)) -> top(active(X:S)) ->Strongly Connected Components: There is no strongly connected component The problem is finite.