YES Problem 1: (VAR v_NonEmpty:S M:S N:S X:S X1:S X2:S) (RULES active(and(tt,X:S)) -> mark(X:S) active(and(X1:S,X2:S)) -> and(active(X1:S),X2:S) active(plus(N:S,s(M:S))) -> mark(s(plus(N:S,M:S))) active(plus(N:S,0)) -> mark(N:S) active(plus(X1:S,X2:S)) -> plus(active(X1:S),X2:S) active(plus(X1:S,X2:S)) -> plus(X1:S,active(X2:S)) active(s(X:S)) -> s(active(X:S)) and(mark(X1:S),X2:S) -> mark(and(X1:S,X2:S)) and(ok(X1:S),ok(X2:S)) -> ok(and(X1:S,X2:S)) plus(mark(X1:S),X2:S) -> mark(plus(X1:S,X2:S)) plus(ok(X1:S),ok(X2:S)) -> ok(plus(X1:S,X2:S)) plus(X1:S,mark(X2:S)) -> mark(plus(X1:S,X2:S)) proper(and(X1:S,X2:S)) -> and(proper(X1:S),proper(X2:S)) proper(plus(X1:S,X2:S)) -> plus(proper(X1:S),proper(X2:S)) proper(s(X:S)) -> s(proper(X:S)) proper(0) -> ok(0) proper(tt) -> ok(tt) 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(and(X1:S,X2:S)) -> ACTIVE(X1:S) ACTIVE(and(X1:S,X2:S)) -> AND(active(X1:S),X2:S) ACTIVE(plus(N:S,s(M:S))) -> PLUS(N:S,M:S) ACTIVE(plus(N:S,s(M:S))) -> S(plus(N:S,M:S)) ACTIVE(plus(X1:S,X2:S)) -> ACTIVE(X1:S) ACTIVE(plus(X1:S,X2:S)) -> ACTIVE(X2:S) ACTIVE(plus(X1:S,X2:S)) -> PLUS(active(X1:S),X2:S) ACTIVE(plus(X1:S,X2:S)) -> PLUS(X1:S,active(X2:S)) ACTIVE(s(X:S)) -> ACTIVE(X:S) ACTIVE(s(X:S)) -> S(active(X:S)) AND(mark(X1:S),X2:S) -> AND(X1:S,X2:S) AND(ok(X1:S),ok(X2:S)) -> AND(X1:S,X2:S) PLUS(mark(X1:S),X2:S) -> PLUS(X1:S,X2:S) PLUS(ok(X1:S),ok(X2:S)) -> PLUS(X1:S,X2:S) PLUS(X1:S,mark(X2:S)) -> PLUS(X1:S,X2:S) PROPER(and(X1:S,X2:S)) -> AND(proper(X1:S),proper(X2:S)) PROPER(and(X1:S,X2:S)) -> PROPER(X1:S) PROPER(and(X1:S,X2:S)) -> PROPER(X2:S) PROPER(plus(X1:S,X2:S)) -> PLUS(proper(X1:S),proper(X2:S)) PROPER(plus(X1:S,X2:S)) -> PROPER(X1:S) PROPER(plus(X1:S,X2:S)) -> PROPER(X2: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(and(tt,X:S)) -> mark(X:S) active(and(X1:S,X2:S)) -> and(active(X1:S),X2:S) active(plus(N:S,s(M:S))) -> mark(s(plus(N:S,M:S))) active(plus(N:S,0)) -> mark(N:S) active(plus(X1:S,X2:S)) -> plus(active(X1:S),X2:S) active(plus(X1:S,X2:S)) -> plus(X1:S,active(X2:S)) active(s(X:S)) -> s(active(X:S)) and(mark(X1:S),X2:S) -> mark(and(X1:S,X2:S)) and(ok(X1:S),ok(X2:S)) -> ok(and(X1:S,X2:S)) plus(mark(X1:S),X2:S) -> mark(plus(X1:S,X2:S)) plus(ok(X1:S),ok(X2:S)) -> ok(plus(X1:S,X2:S)) plus(X1:S,mark(X2:S)) -> mark(plus(X1:S,X2:S)) proper(and(X1:S,X2:S)) -> and(proper(X1:S),proper(X2:S)) proper(plus(X1:S,X2:S)) -> plus(proper(X1:S),proper(X2:S)) proper(s(X:S)) -> s(proper(X:S)) proper(0) -> ok(0) proper(tt) -> ok(tt) 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(and(X1:S,X2:S)) -> ACTIVE(X1:S) ACTIVE(and(X1:S,X2:S)) -> AND(active(X1:S),X2:S) ACTIVE(plus(N:S,s(M:S))) -> PLUS(N:S,M:S) ACTIVE(plus(N:S,s(M:S))) -> S(plus(N:S,M:S)) ACTIVE(plus(X1:S,X2:S)) -> ACTIVE(X1:S) ACTIVE(plus(X1:S,X2:S)) -> ACTIVE(X2:S) ACTIVE(plus(X1:S,X2:S)) -> PLUS(active(X1:S),X2:S) ACTIVE(plus(X1:S,X2:S)) -> PLUS(X1:S,active(X2:S)) ACTIVE(s(X:S)) -> ACTIVE(X:S) ACTIVE(s(X:S)) -> S(active(X:S)) AND(mark(X1:S),X2:S) -> AND(X1:S,X2:S) AND(ok(X1:S),ok(X2:S)) -> AND(X1:S,X2:S) PLUS(mark(X1:S),X2:S) -> PLUS(X1:S,X2:S) PLUS(ok(X1:S),ok(X2:S)) -> PLUS(X1:S,X2:S) PLUS(X1:S,mark(X2:S)) -> PLUS(X1:S,X2:S) PROPER(and(X1:S,X2:S)) -> AND(proper(X1:S),proper(X2:S)) PROPER(and(X1:S,X2:S)) -> PROPER(X1:S) PROPER(and(X1:S,X2:S)) -> PROPER(X2:S) PROPER(plus(X1:S,X2:S)) -> PLUS(proper(X1:S),proper(X2:S)) PROPER(plus(X1:S,X2:S)) -> PROPER(X1:S) PROPER(plus(X1:S,X2:S)) -> PROPER(X2: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(and(tt,X:S)) -> mark(X:S) active(and(X1:S,X2:S)) -> and(active(X1:S),X2:S) active(plus(N:S,s(M:S))) -> mark(s(plus(N:S,M:S))) active(plus(N:S,0)) -> mark(N:S) active(plus(X1:S,X2:S)) -> plus(active(X1:S),X2:S) active(plus(X1:S,X2:S)) -> plus(X1:S,active(X2:S)) active(s(X:S)) -> s(active(X:S)) and(mark(X1:S),X2:S) -> mark(and(X1:S,X2:S)) and(ok(X1:S),ok(X2:S)) -> ok(and(X1:S,X2:S)) plus(mark(X1:S),X2:S) -> mark(plus(X1:S,X2:S)) plus(ok(X1:S),ok(X2:S)) -> ok(plus(X1:S,X2:S)) plus(X1:S,mark(X2:S)) -> mark(plus(X1:S,X2:S)) proper(and(X1:S,X2:S)) -> and(proper(X1:S),proper(X2:S)) proper(plus(X1:S,X2:S)) -> plus(proper(X1:S),proper(X2:S)) proper(s(X:S)) -> s(proper(X:S)) proper(0) -> ok(0) proper(tt) -> ok(tt) 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(and(tt,X:S)) -> mark(X:S) active(and(X1:S,X2:S)) -> and(active(X1:S),X2:S) active(plus(N:S,s(M:S))) -> mark(s(plus(N:S,M:S))) active(plus(N:S,0)) -> mark(N:S) active(plus(X1:S,X2:S)) -> plus(active(X1:S),X2:S) active(plus(X1:S,X2:S)) -> plus(X1:S,active(X2:S)) active(s(X:S)) -> s(active(X:S)) and(mark(X1:S),X2:S) -> mark(and(X1:S,X2:S)) and(ok(X1:S),ok(X2:S)) -> ok(and(X1:S,X2:S)) plus(mark(X1:S),X2:S) -> mark(plus(X1:S,X2:S)) plus(ok(X1:S),ok(X2:S)) -> ok(plus(X1:S,X2:S)) plus(X1:S,mark(X2:S)) -> mark(plus(X1:S,X2:S)) proper(and(X1:S,X2:S)) -> and(proper(X1:S),proper(X2:S)) proper(plus(X1:S,X2:S)) -> plus(proper(X1:S),proper(X2:S)) proper(s(X:S)) -> s(proper(X:S)) proper(0) -> ok(0) proper(tt) -> ok(tt) 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: PLUS(mark(X1:S),X2:S) -> PLUS(X1:S,X2:S) PLUS(ok(X1:S),ok(X2:S)) -> PLUS(X1:S,X2:S) PLUS(X1:S,mark(X2:S)) -> PLUS(X1:S,X2:S) ->->-> Rules: active(and(tt,X:S)) -> mark(X:S) active(and(X1:S,X2:S)) -> and(active(X1:S),X2:S) active(plus(N:S,s(M:S))) -> mark(s(plus(N:S,M:S))) active(plus(N:S,0)) -> mark(N:S) active(plus(X1:S,X2:S)) -> plus(active(X1:S),X2:S) active(plus(X1:S,X2:S)) -> plus(X1:S,active(X2:S)) active(s(X:S)) -> s(active(X:S)) and(mark(X1:S),X2:S) -> mark(and(X1:S,X2:S)) and(ok(X1:S),ok(X2:S)) -> ok(and(X1:S,X2:S)) plus(mark(X1:S),X2:S) -> mark(plus(X1:S,X2:S)) plus(ok(X1:S),ok(X2:S)) -> ok(plus(X1:S,X2:S)) plus(X1:S,mark(X2:S)) -> mark(plus(X1:S,X2:S)) proper(and(X1:S,X2:S)) -> and(proper(X1:S),proper(X2:S)) proper(plus(X1:S,X2:S)) -> plus(proper(X1:S),proper(X2:S)) proper(s(X:S)) -> s(proper(X:S)) proper(0) -> ok(0) proper(tt) -> ok(tt) 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: AND(mark(X1:S),X2:S) -> AND(X1:S,X2:S) AND(ok(X1:S),ok(X2:S)) -> AND(X1:S,X2:S) ->->-> Rules: active(and(tt,X:S)) -> mark(X:S) active(and(X1:S,X2:S)) -> and(active(X1:S),X2:S) active(plus(N:S,s(M:S))) -> mark(s(plus(N:S,M:S))) active(plus(N:S,0)) -> mark(N:S) active(plus(X1:S,X2:S)) -> plus(active(X1:S),X2:S) active(plus(X1:S,X2:S)) -> plus(X1:S,active(X2:S)) active(s(X:S)) -> s(active(X:S)) and(mark(X1:S),X2:S) -> mark(and(X1:S,X2:S)) and(ok(X1:S),ok(X2:S)) -> ok(and(X1:S,X2:S)) plus(mark(X1:S),X2:S) -> mark(plus(X1:S,X2:S)) plus(ok(X1:S),ok(X2:S)) -> ok(plus(X1:S,X2:S)) plus(X1:S,mark(X2:S)) -> mark(plus(X1:S,X2:S)) proper(and(X1:S,X2:S)) -> and(proper(X1:S),proper(X2:S)) proper(plus(X1:S,X2:S)) -> plus(proper(X1:S),proper(X2:S)) proper(s(X:S)) -> s(proper(X:S)) proper(0) -> ok(0) proper(tt) -> ok(tt) 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(and(X1:S,X2:S)) -> PROPER(X1:S) PROPER(and(X1:S,X2:S)) -> PROPER(X2:S) PROPER(plus(X1:S,X2:S)) -> PROPER(X1:S) PROPER(plus(X1:S,X2:S)) -> PROPER(X2:S) PROPER(s(X:S)) -> PROPER(X:S) ->->-> Rules: active(and(tt,X:S)) -> mark(X:S) active(and(X1:S,X2:S)) -> and(active(X1:S),X2:S) active(plus(N:S,s(M:S))) -> mark(s(plus(N:S,M:S))) active(plus(N:S,0)) -> mark(N:S) active(plus(X1:S,X2:S)) -> plus(active(X1:S),X2:S) active(plus(X1:S,X2:S)) -> plus(X1:S,active(X2:S)) active(s(X:S)) -> s(active(X:S)) and(mark(X1:S),X2:S) -> mark(and(X1:S,X2:S)) and(ok(X1:S),ok(X2:S)) -> ok(and(X1:S,X2:S)) plus(mark(X1:S),X2:S) -> mark(plus(X1:S,X2:S)) plus(ok(X1:S),ok(X2:S)) -> ok(plus(X1:S,X2:S)) plus(X1:S,mark(X2:S)) -> mark(plus(X1:S,X2:S)) proper(and(X1:S,X2:S)) -> and(proper(X1:S),proper(X2:S)) proper(plus(X1:S,X2:S)) -> plus(proper(X1:S),proper(X2:S)) proper(s(X:S)) -> s(proper(X:S)) proper(0) -> ok(0) proper(tt) -> ok(tt) 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(and(X1:S,X2:S)) -> ACTIVE(X1:S) ACTIVE(plus(X1:S,X2:S)) -> ACTIVE(X1:S) ACTIVE(plus(X1:S,X2:S)) -> ACTIVE(X2:S) ACTIVE(s(X:S)) -> ACTIVE(X:S) ->->-> Rules: active(and(tt,X:S)) -> mark(X:S) active(and(X1:S,X2:S)) -> and(active(X1:S),X2:S) active(plus(N:S,s(M:S))) -> mark(s(plus(N:S,M:S))) active(plus(N:S,0)) -> mark(N:S) active(plus(X1:S,X2:S)) -> plus(active(X1:S),X2:S) active(plus(X1:S,X2:S)) -> plus(X1:S,active(X2:S)) active(s(X:S)) -> s(active(X:S)) and(mark(X1:S),X2:S) -> mark(and(X1:S,X2:S)) and(ok(X1:S),ok(X2:S)) -> ok(and(X1:S,X2:S)) plus(mark(X1:S),X2:S) -> mark(plus(X1:S,X2:S)) plus(ok(X1:S),ok(X2:S)) -> ok(plus(X1:S,X2:S)) plus(X1:S,mark(X2:S)) -> mark(plus(X1:S,X2:S)) proper(and(X1:S,X2:S)) -> and(proper(X1:S),proper(X2:S)) proper(plus(X1:S,X2:S)) -> plus(proper(X1:S),proper(X2:S)) proper(s(X:S)) -> s(proper(X:S)) proper(0) -> ok(0) proper(tt) -> ok(tt) 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(and(tt,X:S)) -> mark(X:S) active(and(X1:S,X2:S)) -> and(active(X1:S),X2:S) active(plus(N:S,s(M:S))) -> mark(s(plus(N:S,M:S))) active(plus(N:S,0)) -> mark(N:S) active(plus(X1:S,X2:S)) -> plus(active(X1:S),X2:S) active(plus(X1:S,X2:S)) -> plus(X1:S,active(X2:S)) active(s(X:S)) -> s(active(X:S)) and(mark(X1:S),X2:S) -> mark(and(X1:S,X2:S)) and(ok(X1:S),ok(X2:S)) -> ok(and(X1:S,X2:S)) plus(mark(X1:S),X2:S) -> mark(plus(X1:S,X2:S)) plus(ok(X1:S),ok(X2:S)) -> ok(plus(X1:S,X2:S)) plus(X1:S,mark(X2:S)) -> mark(plus(X1:S,X2:S)) proper(and(X1:S,X2:S)) -> and(proper(X1:S),proper(X2:S)) proper(plus(X1:S,X2:S)) -> plus(proper(X1:S),proper(X2:S)) proper(s(X:S)) -> s(proper(X:S)) proper(0) -> ok(0) proper(tt) -> ok(tt) 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 6 subproblems. Problem 1.1: Subterm Processor: -> Pairs: S(mark(X:S)) -> S(X:S) S(ok(X:S)) -> S(X:S) -> Rules: active(and(tt,X:S)) -> mark(X:S) active(and(X1:S,X2:S)) -> and(active(X1:S),X2:S) active(plus(N:S,s(M:S))) -> mark(s(plus(N:S,M:S))) active(plus(N:S,0)) -> mark(N:S) active(plus(X1:S,X2:S)) -> plus(active(X1:S),X2:S) active(plus(X1:S,X2:S)) -> plus(X1:S,active(X2:S)) active(s(X:S)) -> s(active(X:S)) and(mark(X1:S),X2:S) -> mark(and(X1:S,X2:S)) and(ok(X1:S),ok(X2:S)) -> ok(and(X1:S,X2:S)) plus(mark(X1:S),X2:S) -> mark(plus(X1:S,X2:S)) plus(ok(X1:S),ok(X2:S)) -> ok(plus(X1:S,X2:S)) plus(X1:S,mark(X2:S)) -> mark(plus(X1:S,X2:S)) proper(and(X1:S,X2:S)) -> and(proper(X1:S),proper(X2:S)) proper(plus(X1:S,X2:S)) -> plus(proper(X1:S),proper(X2:S)) proper(s(X:S)) -> s(proper(X:S)) proper(0) -> ok(0) proper(tt) -> ok(tt) 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(and(tt,X:S)) -> mark(X:S) active(and(X1:S,X2:S)) -> and(active(X1:S),X2:S) active(plus(N:S,s(M:S))) -> mark(s(plus(N:S,M:S))) active(plus(N:S,0)) -> mark(N:S) active(plus(X1:S,X2:S)) -> plus(active(X1:S),X2:S) active(plus(X1:S,X2:S)) -> plus(X1:S,active(X2:S)) active(s(X:S)) -> s(active(X:S)) and(mark(X1:S),X2:S) -> mark(and(X1:S,X2:S)) and(ok(X1:S),ok(X2:S)) -> ok(and(X1:S,X2:S)) plus(mark(X1:S),X2:S) -> mark(plus(X1:S,X2:S)) plus(ok(X1:S),ok(X2:S)) -> ok(plus(X1:S,X2:S)) plus(X1:S,mark(X2:S)) -> mark(plus(X1:S,X2:S)) proper(and(X1:S,X2:S)) -> and(proper(X1:S),proper(X2:S)) proper(plus(X1:S,X2:S)) -> plus(proper(X1:S),proper(X2:S)) proper(s(X:S)) -> s(proper(X:S)) proper(0) -> ok(0) proper(tt) -> ok(tt) 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: PLUS(mark(X1:S),X2:S) -> PLUS(X1:S,X2:S) PLUS(ok(X1:S),ok(X2:S)) -> PLUS(X1:S,X2:S) PLUS(X1:S,mark(X2:S)) -> PLUS(X1:S,X2:S) -> Rules: active(and(tt,X:S)) -> mark(X:S) active(and(X1:S,X2:S)) -> and(active(X1:S),X2:S) active(plus(N:S,s(M:S))) -> mark(s(plus(N:S,M:S))) active(plus(N:S,0)) -> mark(N:S) active(plus(X1:S,X2:S)) -> plus(active(X1:S),X2:S) active(plus(X1:S,X2:S)) -> plus(X1:S,active(X2:S)) active(s(X:S)) -> s(active(X:S)) and(mark(X1:S),X2:S) -> mark(and(X1:S,X2:S)) and(ok(X1:S),ok(X2:S)) -> ok(and(X1:S,X2:S)) plus(mark(X1:S),X2:S) -> mark(plus(X1:S,X2:S)) plus(ok(X1:S),ok(X2:S)) -> ok(plus(X1:S,X2:S)) plus(X1:S,mark(X2:S)) -> mark(plus(X1:S,X2:S)) proper(and(X1:S,X2:S)) -> and(proper(X1:S),proper(X2:S)) proper(plus(X1:S,X2:S)) -> plus(proper(X1:S),proper(X2:S)) proper(s(X:S)) -> s(proper(X:S)) proper(0) -> ok(0) proper(tt) -> ok(tt) 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(PLUS) = 1 Problem 1.2: SCC Processor: -> Pairs: PLUS(X1:S,mark(X2:S)) -> PLUS(X1:S,X2:S) -> Rules: active(and(tt,X:S)) -> mark(X:S) active(and(X1:S,X2:S)) -> and(active(X1:S),X2:S) active(plus(N:S,s(M:S))) -> mark(s(plus(N:S,M:S))) active(plus(N:S,0)) -> mark(N:S) active(plus(X1:S,X2:S)) -> plus(active(X1:S),X2:S) active(plus(X1:S,X2:S)) -> plus(X1:S,active(X2:S)) active(s(X:S)) -> s(active(X:S)) and(mark(X1:S),X2:S) -> mark(and(X1:S,X2:S)) and(ok(X1:S),ok(X2:S)) -> ok(and(X1:S,X2:S)) plus(mark(X1:S),X2:S) -> mark(plus(X1:S,X2:S)) plus(ok(X1:S),ok(X2:S)) -> ok(plus(X1:S,X2:S)) plus(X1:S,mark(X2:S)) -> mark(plus(X1:S,X2:S)) proper(and(X1:S,X2:S)) -> and(proper(X1:S),proper(X2:S)) proper(plus(X1:S,X2:S)) -> plus(proper(X1:S),proper(X2:S)) proper(s(X:S)) -> s(proper(X:S)) proper(0) -> ok(0) proper(tt) -> ok(tt) 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: PLUS(X1:S,mark(X2:S)) -> PLUS(X1:S,X2:S) ->->-> Rules: active(and(tt,X:S)) -> mark(X:S) active(and(X1:S,X2:S)) -> and(active(X1:S),X2:S) active(plus(N:S,s(M:S))) -> mark(s(plus(N:S,M:S))) active(plus(N:S,0)) -> mark(N:S) active(plus(X1:S,X2:S)) -> plus(active(X1:S),X2:S) active(plus(X1:S,X2:S)) -> plus(X1:S,active(X2:S)) active(s(X:S)) -> s(active(X:S)) and(mark(X1:S),X2:S) -> mark(and(X1:S,X2:S)) and(ok(X1:S),ok(X2:S)) -> ok(and(X1:S,X2:S)) plus(mark(X1:S),X2:S) -> mark(plus(X1:S,X2:S)) plus(ok(X1:S),ok(X2:S)) -> ok(plus(X1:S,X2:S)) plus(X1:S,mark(X2:S)) -> mark(plus(X1:S,X2:S)) proper(and(X1:S,X2:S)) -> and(proper(X1:S),proper(X2:S)) proper(plus(X1:S,X2:S)) -> plus(proper(X1:S),proper(X2:S)) proper(s(X:S)) -> s(proper(X:S)) proper(0) -> ok(0) proper(tt) -> ok(tt) 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.2: Subterm Processor: -> Pairs: PLUS(X1:S,mark(X2:S)) -> PLUS(X1:S,X2:S) -> Rules: active(and(tt,X:S)) -> mark(X:S) active(and(X1:S,X2:S)) -> and(active(X1:S),X2:S) active(plus(N:S,s(M:S))) -> mark(s(plus(N:S,M:S))) active(plus(N:S,0)) -> mark(N:S) active(plus(X1:S,X2:S)) -> plus(active(X1:S),X2:S) active(plus(X1:S,X2:S)) -> plus(X1:S,active(X2:S)) active(s(X:S)) -> s(active(X:S)) and(mark(X1:S),X2:S) -> mark(and(X1:S,X2:S)) and(ok(X1:S),ok(X2:S)) -> ok(and(X1:S,X2:S)) plus(mark(X1:S),X2:S) -> mark(plus(X1:S,X2:S)) plus(ok(X1:S),ok(X2:S)) -> ok(plus(X1:S,X2:S)) plus(X1:S,mark(X2:S)) -> mark(plus(X1:S,X2:S)) proper(and(X1:S,X2:S)) -> and(proper(X1:S),proper(X2:S)) proper(plus(X1:S,X2:S)) -> plus(proper(X1:S),proper(X2:S)) proper(s(X:S)) -> s(proper(X:S)) proper(0) -> ok(0) proper(tt) -> ok(tt) 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(PLUS) = 2 Problem 1.2: SCC Processor: -> Pairs: Empty -> Rules: active(and(tt,X:S)) -> mark(X:S) active(and(X1:S,X2:S)) -> and(active(X1:S),X2:S) active(plus(N:S,s(M:S))) -> mark(s(plus(N:S,M:S))) active(plus(N:S,0)) -> mark(N:S) active(plus(X1:S,X2:S)) -> plus(active(X1:S),X2:S) active(plus(X1:S,X2:S)) -> plus(X1:S,active(X2:S)) active(s(X:S)) -> s(active(X:S)) and(mark(X1:S),X2:S) -> mark(and(X1:S,X2:S)) and(ok(X1:S),ok(X2:S)) -> ok(and(X1:S,X2:S)) plus(mark(X1:S),X2:S) -> mark(plus(X1:S,X2:S)) plus(ok(X1:S),ok(X2:S)) -> ok(plus(X1:S,X2:S)) plus(X1:S,mark(X2:S)) -> mark(plus(X1:S,X2:S)) proper(and(X1:S,X2:S)) -> and(proper(X1:S),proper(X2:S)) proper(plus(X1:S,X2:S)) -> plus(proper(X1:S),proper(X2:S)) proper(s(X:S)) -> s(proper(X:S)) proper(0) -> ok(0) proper(tt) -> ok(tt) 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: AND(mark(X1:S),X2:S) -> AND(X1:S,X2:S) AND(ok(X1:S),ok(X2:S)) -> AND(X1:S,X2:S) -> Rules: active(and(tt,X:S)) -> mark(X:S) active(and(X1:S,X2:S)) -> and(active(X1:S),X2:S) active(plus(N:S,s(M:S))) -> mark(s(plus(N:S,M:S))) active(plus(N:S,0)) -> mark(N:S) active(plus(X1:S,X2:S)) -> plus(active(X1:S),X2:S) active(plus(X1:S,X2:S)) -> plus(X1:S,active(X2:S)) active(s(X:S)) -> s(active(X:S)) and(mark(X1:S),X2:S) -> mark(and(X1:S,X2:S)) and(ok(X1:S),ok(X2:S)) -> ok(and(X1:S,X2:S)) plus(mark(X1:S),X2:S) -> mark(plus(X1:S,X2:S)) plus(ok(X1:S),ok(X2:S)) -> ok(plus(X1:S,X2:S)) plus(X1:S,mark(X2:S)) -> mark(plus(X1:S,X2:S)) proper(and(X1:S,X2:S)) -> and(proper(X1:S),proper(X2:S)) proper(plus(X1:S,X2:S)) -> plus(proper(X1:S),proper(X2:S)) proper(s(X:S)) -> s(proper(X:S)) proper(0) -> ok(0) proper(tt) -> ok(tt) 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(AND) = 1 Problem 1.3: SCC Processor: -> Pairs: Empty -> Rules: active(and(tt,X:S)) -> mark(X:S) active(and(X1:S,X2:S)) -> and(active(X1:S),X2:S) active(plus(N:S,s(M:S))) -> mark(s(plus(N:S,M:S))) active(plus(N:S,0)) -> mark(N:S) active(plus(X1:S,X2:S)) -> plus(active(X1:S),X2:S) active(plus(X1:S,X2:S)) -> plus(X1:S,active(X2:S)) active(s(X:S)) -> s(active(X:S)) and(mark(X1:S),X2:S) -> mark(and(X1:S,X2:S)) and(ok(X1:S),ok(X2:S)) -> ok(and(X1:S,X2:S)) plus(mark(X1:S),X2:S) -> mark(plus(X1:S,X2:S)) plus(ok(X1:S),ok(X2:S)) -> ok(plus(X1:S,X2:S)) plus(X1:S,mark(X2:S)) -> mark(plus(X1:S,X2:S)) proper(and(X1:S,X2:S)) -> and(proper(X1:S),proper(X2:S)) proper(plus(X1:S,X2:S)) -> plus(proper(X1:S),proper(X2:S)) proper(s(X:S)) -> s(proper(X:S)) proper(0) -> ok(0) proper(tt) -> ok(tt) 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: PROPER(and(X1:S,X2:S)) -> PROPER(X1:S) PROPER(and(X1:S,X2:S)) -> PROPER(X2:S) PROPER(plus(X1:S,X2:S)) -> PROPER(X1:S) PROPER(plus(X1:S,X2:S)) -> PROPER(X2:S) PROPER(s(X:S)) -> PROPER(X:S) -> Rules: active(and(tt,X:S)) -> mark(X:S) active(and(X1:S,X2:S)) -> and(active(X1:S),X2:S) active(plus(N:S,s(M:S))) -> mark(s(plus(N:S,M:S))) active(plus(N:S,0)) -> mark(N:S) active(plus(X1:S,X2:S)) -> plus(active(X1:S),X2:S) active(plus(X1:S,X2:S)) -> plus(X1:S,active(X2:S)) active(s(X:S)) -> s(active(X:S)) and(mark(X1:S),X2:S) -> mark(and(X1:S,X2:S)) and(ok(X1:S),ok(X2:S)) -> ok(and(X1:S,X2:S)) plus(mark(X1:S),X2:S) -> mark(plus(X1:S,X2:S)) plus(ok(X1:S),ok(X2:S)) -> ok(plus(X1:S,X2:S)) plus(X1:S,mark(X2:S)) -> mark(plus(X1:S,X2:S)) proper(and(X1:S,X2:S)) -> and(proper(X1:S),proper(X2:S)) proper(plus(X1:S,X2:S)) -> plus(proper(X1:S),proper(X2:S)) proper(s(X:S)) -> s(proper(X:S)) proper(0) -> ok(0) proper(tt) -> ok(tt) 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.4: SCC Processor: -> Pairs: Empty -> Rules: active(and(tt,X:S)) -> mark(X:S) active(and(X1:S,X2:S)) -> and(active(X1:S),X2:S) active(plus(N:S,s(M:S))) -> mark(s(plus(N:S,M:S))) active(plus(N:S,0)) -> mark(N:S) active(plus(X1:S,X2:S)) -> plus(active(X1:S),X2:S) active(plus(X1:S,X2:S)) -> plus(X1:S,active(X2:S)) active(s(X:S)) -> s(active(X:S)) and(mark(X1:S),X2:S) -> mark(and(X1:S,X2:S)) and(ok(X1:S),ok(X2:S)) -> ok(and(X1:S,X2:S)) plus(mark(X1:S),X2:S) -> mark(plus(X1:S,X2:S)) plus(ok(X1:S),ok(X2:S)) -> ok(plus(X1:S,X2:S)) plus(X1:S,mark(X2:S)) -> mark(plus(X1:S,X2:S)) proper(and(X1:S,X2:S)) -> and(proper(X1:S),proper(X2:S)) proper(plus(X1:S,X2:S)) -> plus(proper(X1:S),proper(X2:S)) proper(s(X:S)) -> s(proper(X:S)) proper(0) -> ok(0) proper(tt) -> ok(tt) 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: ACTIVE(and(X1:S,X2:S)) -> ACTIVE(X1:S) ACTIVE(plus(X1:S,X2:S)) -> ACTIVE(X1:S) ACTIVE(plus(X1:S,X2:S)) -> ACTIVE(X2:S) ACTIVE(s(X:S)) -> ACTIVE(X:S) -> Rules: active(and(tt,X:S)) -> mark(X:S) active(and(X1:S,X2:S)) -> and(active(X1:S),X2:S) active(plus(N:S,s(M:S))) -> mark(s(plus(N:S,M:S))) active(plus(N:S,0)) -> mark(N:S) active(plus(X1:S,X2:S)) -> plus(active(X1:S),X2:S) active(plus(X1:S,X2:S)) -> plus(X1:S,active(X2:S)) active(s(X:S)) -> s(active(X:S)) and(mark(X1:S),X2:S) -> mark(and(X1:S,X2:S)) and(ok(X1:S),ok(X2:S)) -> ok(and(X1:S,X2:S)) plus(mark(X1:S),X2:S) -> mark(plus(X1:S,X2:S)) plus(ok(X1:S),ok(X2:S)) -> ok(plus(X1:S,X2:S)) plus(X1:S,mark(X2:S)) -> mark(plus(X1:S,X2:S)) proper(and(X1:S,X2:S)) -> and(proper(X1:S),proper(X2:S)) proper(plus(X1:S,X2:S)) -> plus(proper(X1:S),proper(X2:S)) proper(s(X:S)) -> s(proper(X:S)) proper(0) -> ok(0) proper(tt) -> ok(tt) 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.5: SCC Processor: -> Pairs: Empty -> Rules: active(and(tt,X:S)) -> mark(X:S) active(and(X1:S,X2:S)) -> and(active(X1:S),X2:S) active(plus(N:S,s(M:S))) -> mark(s(plus(N:S,M:S))) active(plus(N:S,0)) -> mark(N:S) active(plus(X1:S,X2:S)) -> plus(active(X1:S),X2:S) active(plus(X1:S,X2:S)) -> plus(X1:S,active(X2:S)) active(s(X:S)) -> s(active(X:S)) and(mark(X1:S),X2:S) -> mark(and(X1:S,X2:S)) and(ok(X1:S),ok(X2:S)) -> ok(and(X1:S,X2:S)) plus(mark(X1:S),X2:S) -> mark(plus(X1:S,X2:S)) plus(ok(X1:S),ok(X2:S)) -> ok(plus(X1:S,X2:S)) plus(X1:S,mark(X2:S)) -> mark(plus(X1:S,X2:S)) proper(and(X1:S,X2:S)) -> and(proper(X1:S),proper(X2:S)) proper(plus(X1:S,X2:S)) -> plus(proper(X1:S),proper(X2:S)) proper(s(X:S)) -> s(proper(X:S)) proper(0) -> ok(0) proper(tt) -> ok(tt) 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: Reduction Pairs Processor: -> Pairs: TOP(mark(X:S)) -> TOP(proper(X:S)) TOP(ok(X:S)) -> TOP(active(X:S)) -> Rules: active(and(tt,X:S)) -> mark(X:S) active(and(X1:S,X2:S)) -> and(active(X1:S),X2:S) active(plus(N:S,s(M:S))) -> mark(s(plus(N:S,M:S))) active(plus(N:S,0)) -> mark(N:S) active(plus(X1:S,X2:S)) -> plus(active(X1:S),X2:S) active(plus(X1:S,X2:S)) -> plus(X1:S,active(X2:S)) active(s(X:S)) -> s(active(X:S)) and(mark(X1:S),X2:S) -> mark(and(X1:S,X2:S)) and(ok(X1:S),ok(X2:S)) -> ok(and(X1:S,X2:S)) plus(mark(X1:S),X2:S) -> mark(plus(X1:S,X2:S)) plus(ok(X1:S),ok(X2:S)) -> ok(plus(X1:S,X2:S)) plus(X1:S,mark(X2:S)) -> mark(plus(X1:S,X2:S)) proper(and(X1:S,X2:S)) -> and(proper(X1:S),proper(X2:S)) proper(plus(X1:S,X2:S)) -> plus(proper(X1:S),proper(X2:S)) proper(s(X:S)) -> s(proper(X:S)) proper(0) -> ok(0) proper(tt) -> ok(tt) 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(and(tt,X:S)) -> mark(X:S) active(and(X1:S,X2:S)) -> and(active(X1:S),X2:S) active(plus(N:S,s(M:S))) -> mark(s(plus(N:S,M:S))) active(plus(N:S,0)) -> mark(N:S) active(plus(X1:S,X2:S)) -> plus(active(X1:S),X2:S) active(plus(X1:S,X2:S)) -> plus(X1:S,active(X2:S)) active(s(X:S)) -> s(active(X:S)) and(mark(X1:S),X2:S) -> mark(and(X1:S,X2:S)) and(ok(X1:S),ok(X2:S)) -> ok(and(X1:S,X2:S)) plus(mark(X1:S),X2:S) -> mark(plus(X1:S,X2:S)) plus(ok(X1:S),ok(X2:S)) -> ok(plus(X1:S,X2:S)) plus(X1:S,mark(X2:S)) -> mark(plus(X1:S,X2:S)) proper(and(X1:S,X2:S)) -> and(proper(X1:S),proper(X2:S)) proper(plus(X1:S,X2:S)) -> plus(proper(X1:S),proper(X2:S)) proper(s(X:S)) -> s(proper(X:S)) proper(0) -> ok(0) proper(tt) -> ok(tt) 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 [and](X1,X2) = 2.X1 + X2 + 2 [plus](X1,X2) = 2.X1 + 2.X2 + 2 [proper](X) = X [s](X) = X + 2 [top](X) = 0 [0] = 1 [fSNonEmpty] = 0 [mark](X) = X + 2 [ok](X) = X [tt] = 2 [ACTIVE](X) = 0 [AND](X1,X2) = 0 [PLUS](X1,X2) = 0 [PROPER](X) = 0 [S](X) = 0 [TOP](X) = 2.X Problem 1.6: SCC Processor: -> Pairs: TOP(ok(X:S)) -> TOP(active(X:S)) -> Rules: active(and(tt,X:S)) -> mark(X:S) active(and(X1:S,X2:S)) -> and(active(X1:S),X2:S) active(plus(N:S,s(M:S))) -> mark(s(plus(N:S,M:S))) active(plus(N:S,0)) -> mark(N:S) active(plus(X1:S,X2:S)) -> plus(active(X1:S),X2:S) active(plus(X1:S,X2:S)) -> plus(X1:S,active(X2:S)) active(s(X:S)) -> s(active(X:S)) and(mark(X1:S),X2:S) -> mark(and(X1:S,X2:S)) and(ok(X1:S),ok(X2:S)) -> ok(and(X1:S,X2:S)) plus(mark(X1:S),X2:S) -> mark(plus(X1:S,X2:S)) plus(ok(X1:S),ok(X2:S)) -> ok(plus(X1:S,X2:S)) plus(X1:S,mark(X2:S)) -> mark(plus(X1:S,X2:S)) proper(and(X1:S,X2:S)) -> and(proper(X1:S),proper(X2:S)) proper(plus(X1:S,X2:S)) -> plus(proper(X1:S),proper(X2:S)) proper(s(X:S)) -> s(proper(X:S)) proper(0) -> ok(0) proper(tt) -> ok(tt) 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(and(tt,X:S)) -> mark(X:S) active(and(X1:S,X2:S)) -> and(active(X1:S),X2:S) active(plus(N:S,s(M:S))) -> mark(s(plus(N:S,M:S))) active(plus(N:S,0)) -> mark(N:S) active(plus(X1:S,X2:S)) -> plus(active(X1:S),X2:S) active(plus(X1:S,X2:S)) -> plus(X1:S,active(X2:S)) active(s(X:S)) -> s(active(X:S)) and(mark(X1:S),X2:S) -> mark(and(X1:S,X2:S)) and(ok(X1:S),ok(X2:S)) -> ok(and(X1:S,X2:S)) plus(mark(X1:S),X2:S) -> mark(plus(X1:S,X2:S)) plus(ok(X1:S),ok(X2:S)) -> ok(plus(X1:S,X2:S)) plus(X1:S,mark(X2:S)) -> mark(plus(X1:S,X2:S)) proper(and(X1:S,X2:S)) -> and(proper(X1:S),proper(X2:S)) proper(plus(X1:S,X2:S)) -> plus(proper(X1:S),proper(X2:S)) proper(s(X:S)) -> s(proper(X:S)) proper(0) -> ok(0) proper(tt) -> ok(tt) 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.6: Reduction Pairs Processor: -> Pairs: TOP(ok(X:S)) -> TOP(active(X:S)) -> Rules: active(and(tt,X:S)) -> mark(X:S) active(and(X1:S,X2:S)) -> and(active(X1:S),X2:S) active(plus(N:S,s(M:S))) -> mark(s(plus(N:S,M:S))) active(plus(N:S,0)) -> mark(N:S) active(plus(X1:S,X2:S)) -> plus(active(X1:S),X2:S) active(plus(X1:S,X2:S)) -> plus(X1:S,active(X2:S)) active(s(X:S)) -> s(active(X:S)) and(mark(X1:S),X2:S) -> mark(and(X1:S,X2:S)) and(ok(X1:S),ok(X2:S)) -> ok(and(X1:S,X2:S)) plus(mark(X1:S),X2:S) -> mark(plus(X1:S,X2:S)) plus(ok(X1:S),ok(X2:S)) -> ok(plus(X1:S,X2:S)) plus(X1:S,mark(X2:S)) -> mark(plus(X1:S,X2:S)) proper(and(X1:S,X2:S)) -> and(proper(X1:S),proper(X2:S)) proper(plus(X1:S,X2:S)) -> plus(proper(X1:S),proper(X2:S)) proper(s(X:S)) -> s(proper(X:S)) proper(0) -> ok(0) proper(tt) -> ok(tt) 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(and(tt,X:S)) -> mark(X:S) active(and(X1:S,X2:S)) -> and(active(X1:S),X2:S) active(plus(N:S,s(M:S))) -> mark(s(plus(N:S,M:S))) active(plus(N:S,0)) -> mark(N:S) active(plus(X1:S,X2:S)) -> plus(active(X1:S),X2:S) active(plus(X1:S,X2:S)) -> plus(X1:S,active(X2:S)) active(s(X:S)) -> s(active(X:S)) and(mark(X1:S),X2:S) -> mark(and(X1:S,X2:S)) and(ok(X1:S),ok(X2:S)) -> ok(and(X1:S,X2:S)) plus(mark(X1:S),X2:S) -> mark(plus(X1:S,X2:S)) plus(ok(X1:S),ok(X2:S)) -> ok(plus(X1:S,X2:S)) plus(X1:S,mark(X2:S)) -> mark(plus(X1:S,X2: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 [and](X1,X2) = 2.X2 + 1 [plus](X1,X2) = 2.X1 + 2.X2 + 1 [proper](X) = 0 [s](X) = 2.X [top](X) = 0 [0] = 1 [fSNonEmpty] = 0 [mark](X) = X [ok](X) = 2.X + 2 [tt] = 2 [ACTIVE](X) = 0 [AND](X1,X2) = 0 [PLUS](X1,X2) = 0 [PROPER](X) = 0 [S](X) = 0 [TOP](X) = 2.X Problem 1.6: SCC Processor: -> Pairs: Empty -> Rules: active(and(tt,X:S)) -> mark(X:S) active(and(X1:S,X2:S)) -> and(active(X1:S),X2:S) active(plus(N:S,s(M:S))) -> mark(s(plus(N:S,M:S))) active(plus(N:S,0)) -> mark(N:S) active(plus(X1:S,X2:S)) -> plus(active(X1:S),X2:S) active(plus(X1:S,X2:S)) -> plus(X1:S,active(X2:S)) active(s(X:S)) -> s(active(X:S)) and(mark(X1:S),X2:S) -> mark(and(X1:S,X2:S)) and(ok(X1:S),ok(X2:S)) -> ok(and(X1:S,X2:S)) plus(mark(X1:S),X2:S) -> mark(plus(X1:S,X2:S)) plus(ok(X1:S),ok(X2:S)) -> ok(plus(X1:S,X2:S)) plus(X1:S,mark(X2:S)) -> mark(plus(X1:S,X2:S)) proper(and(X1:S,X2:S)) -> and(proper(X1:S),proper(X2:S)) proper(plus(X1:S,X2:S)) -> plus(proper(X1:S),proper(X2:S)) proper(s(X:S)) -> s(proper(X:S)) proper(0) -> ok(0) proper(tt) -> ok(tt) 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.