YES Problem 1: (VAR v_NonEmpty:S M:S N:S V1:S V2:S X:S X1:S X2:S X3:S) (RULES a__U11(tt,N:S) -> mark(N:S) a__U11(X1:S,X2:S) -> U11(X1:S,X2:S) a__U21(tt,M:S,N:S) -> s(a__plus(mark(N:S),mark(M:S))) a__U21(X1:S,X2:S,X3:S) -> U21(X1:S,X2:S,X3:S) a__and(tt,X:S) -> mark(X:S) a__and(X1:S,X2:S) -> and(X1:S,X2:S) a__isNat(0) -> tt a__isNat(plus(V1:S,V2:S)) -> a__and(a__isNat(V1:S),isNat(V2:S)) a__isNat(s(V1:S)) -> a__isNat(V1:S) a__isNat(X:S) -> isNat(X:S) a__plus(N:S,0) -> a__U11(a__isNat(N:S),N:S) a__plus(N:S,s(M:S)) -> a__U21(a__and(a__isNat(M:S),isNat(N:S)),M:S,N:S) a__plus(X1:S,X2:S) -> plus(X1:S,X2:S) mark(0) -> 0 mark(U11(X1:S,X2:S)) -> a__U11(mark(X1:S),X2:S) mark(U21(X1:S,X2:S,X3:S)) -> a__U21(mark(X1:S),X2:S,X3:S) mark(and(X1:S,X2:S)) -> a__and(mark(X1:S),X2:S) mark(isNat(X:S)) -> a__isNat(X:S) mark(plus(X1:S,X2:S)) -> a__plus(mark(X1:S),mark(X2:S)) mark(s(X:S)) -> s(mark(X:S)) mark(tt) -> tt ) (STRATEGY INNERMOST) Problem 1: Dependency Pairs Processor: -> Pairs: A__U11(tt,N:S) -> MARK(N:S) A__U21(tt,M:S,N:S) -> A__PLUS(mark(N:S),mark(M:S)) A__U21(tt,M:S,N:S) -> MARK(M:S) A__U21(tt,M:S,N:S) -> MARK(N:S) A__AND(tt,X:S) -> MARK(X:S) A__ISNAT(plus(V1:S,V2:S)) -> A__AND(a__isNat(V1:S),isNat(V2:S)) A__ISNAT(plus(V1:S,V2:S)) -> A__ISNAT(V1:S) A__ISNAT(s(V1:S)) -> A__ISNAT(V1:S) A__PLUS(N:S,0) -> A__U11(a__isNat(N:S),N:S) A__PLUS(N:S,0) -> A__ISNAT(N:S) A__PLUS(N:S,s(M:S)) -> A__U21(a__and(a__isNat(M:S),isNat(N:S)),M:S,N:S) A__PLUS(N:S,s(M:S)) -> A__AND(a__isNat(M:S),isNat(N:S)) A__PLUS(N:S,s(M:S)) -> A__ISNAT(M:S) MARK(U11(X1:S,X2:S)) -> A__U11(mark(X1:S),X2:S) MARK(U11(X1:S,X2:S)) -> MARK(X1:S) MARK(U21(X1:S,X2:S,X3:S)) -> A__U21(mark(X1:S),X2:S,X3:S) MARK(U21(X1:S,X2:S,X3:S)) -> MARK(X1:S) MARK(and(X1:S,X2:S)) -> A__AND(mark(X1:S),X2:S) MARK(and(X1:S,X2:S)) -> MARK(X1:S) MARK(isNat(X:S)) -> A__ISNAT(X:S) MARK(plus(X1:S,X2:S)) -> A__PLUS(mark(X1:S),mark(X2:S)) MARK(plus(X1:S,X2:S)) -> MARK(X1:S) MARK(plus(X1:S,X2:S)) -> MARK(X2:S) MARK(s(X:S)) -> MARK(X:S) -> Rules: a__U11(tt,N:S) -> mark(N:S) a__U11(X1:S,X2:S) -> U11(X1:S,X2:S) a__U21(tt,M:S,N:S) -> s(a__plus(mark(N:S),mark(M:S))) a__U21(X1:S,X2:S,X3:S) -> U21(X1:S,X2:S,X3:S) a__and(tt,X:S) -> mark(X:S) a__and(X1:S,X2:S) -> and(X1:S,X2:S) a__isNat(0) -> tt a__isNat(plus(V1:S,V2:S)) -> a__and(a__isNat(V1:S),isNat(V2:S)) a__isNat(s(V1:S)) -> a__isNat(V1:S) a__isNat(X:S) -> isNat(X:S) a__plus(N:S,0) -> a__U11(a__isNat(N:S),N:S) a__plus(N:S,s(M:S)) -> a__U21(a__and(a__isNat(M:S),isNat(N:S)),M:S,N:S) a__plus(X1:S,X2:S) -> plus(X1:S,X2:S) mark(0) -> 0 mark(U11(X1:S,X2:S)) -> a__U11(mark(X1:S),X2:S) mark(U21(X1:S,X2:S,X3:S)) -> a__U21(mark(X1:S),X2:S,X3:S) mark(and(X1:S,X2:S)) -> a__and(mark(X1:S),X2:S) mark(isNat(X:S)) -> a__isNat(X:S) mark(plus(X1:S,X2:S)) -> a__plus(mark(X1:S),mark(X2:S)) mark(s(X:S)) -> s(mark(X:S)) mark(tt) -> tt Problem 1: SCC Processor: -> Pairs: A__U11(tt,N:S) -> MARK(N:S) A__U21(tt,M:S,N:S) -> A__PLUS(mark(N:S),mark(M:S)) A__U21(tt,M:S,N:S) -> MARK(M:S) A__U21(tt,M:S,N:S) -> MARK(N:S) A__AND(tt,X:S) -> MARK(X:S) A__ISNAT(plus(V1:S,V2:S)) -> A__AND(a__isNat(V1:S),isNat(V2:S)) A__ISNAT(plus(V1:S,V2:S)) -> A__ISNAT(V1:S) A__ISNAT(s(V1:S)) -> A__ISNAT(V1:S) A__PLUS(N:S,0) -> A__U11(a__isNat(N:S),N:S) A__PLUS(N:S,0) -> A__ISNAT(N:S) A__PLUS(N:S,s(M:S)) -> A__U21(a__and(a__isNat(M:S),isNat(N:S)),M:S,N:S) A__PLUS(N:S,s(M:S)) -> A__AND(a__isNat(M:S),isNat(N:S)) A__PLUS(N:S,s(M:S)) -> A__ISNAT(M:S) MARK(U11(X1:S,X2:S)) -> A__U11(mark(X1:S),X2:S) MARK(U11(X1:S,X2:S)) -> MARK(X1:S) MARK(U21(X1:S,X2:S,X3:S)) -> A__U21(mark(X1:S),X2:S,X3:S) MARK(U21(X1:S,X2:S,X3:S)) -> MARK(X1:S) MARK(and(X1:S,X2:S)) -> A__AND(mark(X1:S),X2:S) MARK(and(X1:S,X2:S)) -> MARK(X1:S) MARK(isNat(X:S)) -> A__ISNAT(X:S) MARK(plus(X1:S,X2:S)) -> A__PLUS(mark(X1:S),mark(X2:S)) MARK(plus(X1:S,X2:S)) -> MARK(X1:S) MARK(plus(X1:S,X2:S)) -> MARK(X2:S) MARK(s(X:S)) -> MARK(X:S) -> Rules: a__U11(tt,N:S) -> mark(N:S) a__U11(X1:S,X2:S) -> U11(X1:S,X2:S) a__U21(tt,M:S,N:S) -> s(a__plus(mark(N:S),mark(M:S))) a__U21(X1:S,X2:S,X3:S) -> U21(X1:S,X2:S,X3:S) a__and(tt,X:S) -> mark(X:S) a__and(X1:S,X2:S) -> and(X1:S,X2:S) a__isNat(0) -> tt a__isNat(plus(V1:S,V2:S)) -> a__and(a__isNat(V1:S),isNat(V2:S)) a__isNat(s(V1:S)) -> a__isNat(V1:S) a__isNat(X:S) -> isNat(X:S) a__plus(N:S,0) -> a__U11(a__isNat(N:S),N:S) a__plus(N:S,s(M:S)) -> a__U21(a__and(a__isNat(M:S),isNat(N:S)),M:S,N:S) a__plus(X1:S,X2:S) -> plus(X1:S,X2:S) mark(0) -> 0 mark(U11(X1:S,X2:S)) -> a__U11(mark(X1:S),X2:S) mark(U21(X1:S,X2:S,X3:S)) -> a__U21(mark(X1:S),X2:S,X3:S) mark(and(X1:S,X2:S)) -> a__and(mark(X1:S),X2:S) mark(isNat(X:S)) -> a__isNat(X:S) mark(plus(X1:S,X2:S)) -> a__plus(mark(X1:S),mark(X2:S)) mark(s(X:S)) -> s(mark(X:S)) mark(tt) -> tt ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: A__U11(tt,N:S) -> MARK(N:S) A__U21(tt,M:S,N:S) -> A__PLUS(mark(N:S),mark(M:S)) A__U21(tt,M:S,N:S) -> MARK(M:S) A__U21(tt,M:S,N:S) -> MARK(N:S) A__AND(tt,X:S) -> MARK(X:S) A__ISNAT(plus(V1:S,V2:S)) -> A__AND(a__isNat(V1:S),isNat(V2:S)) A__ISNAT(plus(V1:S,V2:S)) -> A__ISNAT(V1:S) A__ISNAT(s(V1:S)) -> A__ISNAT(V1:S) A__PLUS(N:S,0) -> A__U11(a__isNat(N:S),N:S) A__PLUS(N:S,0) -> A__ISNAT(N:S) A__PLUS(N:S,s(M:S)) -> A__U21(a__and(a__isNat(M:S),isNat(N:S)),M:S,N:S) A__PLUS(N:S,s(M:S)) -> A__AND(a__isNat(M:S),isNat(N:S)) A__PLUS(N:S,s(M:S)) -> A__ISNAT(M:S) MARK(U11(X1:S,X2:S)) -> A__U11(mark(X1:S),X2:S) MARK(U11(X1:S,X2:S)) -> MARK(X1:S) MARK(U21(X1:S,X2:S,X3:S)) -> A__U21(mark(X1:S),X2:S,X3:S) MARK(U21(X1:S,X2:S,X3:S)) -> MARK(X1:S) MARK(and(X1:S,X2:S)) -> A__AND(mark(X1:S),X2:S) MARK(and(X1:S,X2:S)) -> MARK(X1:S) MARK(isNat(X:S)) -> A__ISNAT(X:S) MARK(plus(X1:S,X2:S)) -> A__PLUS(mark(X1:S),mark(X2:S)) MARK(plus(X1:S,X2:S)) -> MARK(X1:S) MARK(plus(X1:S,X2:S)) -> MARK(X2:S) MARK(s(X:S)) -> MARK(X:S) ->->-> Rules: a__U11(tt,N:S) -> mark(N:S) a__U11(X1:S,X2:S) -> U11(X1:S,X2:S) a__U21(tt,M:S,N:S) -> s(a__plus(mark(N:S),mark(M:S))) a__U21(X1:S,X2:S,X3:S) -> U21(X1:S,X2:S,X3:S) a__and(tt,X:S) -> mark(X:S) a__and(X1:S,X2:S) -> and(X1:S,X2:S) a__isNat(0) -> tt a__isNat(plus(V1:S,V2:S)) -> a__and(a__isNat(V1:S),isNat(V2:S)) a__isNat(s(V1:S)) -> a__isNat(V1:S) a__isNat(X:S) -> isNat(X:S) a__plus(N:S,0) -> a__U11(a__isNat(N:S),N:S) a__plus(N:S,s(M:S)) -> a__U21(a__and(a__isNat(M:S),isNat(N:S)),M:S,N:S) a__plus(X1:S,X2:S) -> plus(X1:S,X2:S) mark(0) -> 0 mark(U11(X1:S,X2:S)) -> a__U11(mark(X1:S),X2:S) mark(U21(X1:S,X2:S,X3:S)) -> a__U21(mark(X1:S),X2:S,X3:S) mark(and(X1:S,X2:S)) -> a__and(mark(X1:S),X2:S) mark(isNat(X:S)) -> a__isNat(X:S) mark(plus(X1:S,X2:S)) -> a__plus(mark(X1:S),mark(X2:S)) mark(s(X:S)) -> s(mark(X:S)) mark(tt) -> tt Problem 1: Reduction Pairs Processor: -> Pairs: A__U11(tt,N:S) -> MARK(N:S) A__U21(tt,M:S,N:S) -> A__PLUS(mark(N:S),mark(M:S)) A__U21(tt,M:S,N:S) -> MARK(M:S) A__U21(tt,M:S,N:S) -> MARK(N:S) A__AND(tt,X:S) -> MARK(X:S) A__ISNAT(plus(V1:S,V2:S)) -> A__AND(a__isNat(V1:S),isNat(V2:S)) A__ISNAT(plus(V1:S,V2:S)) -> A__ISNAT(V1:S) A__ISNAT(s(V1:S)) -> A__ISNAT(V1:S) A__PLUS(N:S,0) -> A__U11(a__isNat(N:S),N:S) A__PLUS(N:S,0) -> A__ISNAT(N:S) A__PLUS(N:S,s(M:S)) -> A__U21(a__and(a__isNat(M:S),isNat(N:S)),M:S,N:S) A__PLUS(N:S,s(M:S)) -> A__AND(a__isNat(M:S),isNat(N:S)) A__PLUS(N:S,s(M:S)) -> A__ISNAT(M:S) MARK(U11(X1:S,X2:S)) -> A__U11(mark(X1:S),X2:S) MARK(U11(X1:S,X2:S)) -> MARK(X1:S) MARK(U21(X1:S,X2:S,X3:S)) -> A__U21(mark(X1:S),X2:S,X3:S) MARK(U21(X1:S,X2:S,X3:S)) -> MARK(X1:S) MARK(and(X1:S,X2:S)) -> A__AND(mark(X1:S),X2:S) MARK(and(X1:S,X2:S)) -> MARK(X1:S) MARK(isNat(X:S)) -> A__ISNAT(X:S) MARK(plus(X1:S,X2:S)) -> A__PLUS(mark(X1:S),mark(X2:S)) MARK(plus(X1:S,X2:S)) -> MARK(X1:S) MARK(plus(X1:S,X2:S)) -> MARK(X2:S) MARK(s(X:S)) -> MARK(X:S) -> Rules: a__U11(tt,N:S) -> mark(N:S) a__U11(X1:S,X2:S) -> U11(X1:S,X2:S) a__U21(tt,M:S,N:S) -> s(a__plus(mark(N:S),mark(M:S))) a__U21(X1:S,X2:S,X3:S) -> U21(X1:S,X2:S,X3:S) a__and(tt,X:S) -> mark(X:S) a__and(X1:S,X2:S) -> and(X1:S,X2:S) a__isNat(0) -> tt a__isNat(plus(V1:S,V2:S)) -> a__and(a__isNat(V1:S),isNat(V2:S)) a__isNat(s(V1:S)) -> a__isNat(V1:S) a__isNat(X:S) -> isNat(X:S) a__plus(N:S,0) -> a__U11(a__isNat(N:S),N:S) a__plus(N:S,s(M:S)) -> a__U21(a__and(a__isNat(M:S),isNat(N:S)),M:S,N:S) a__plus(X1:S,X2:S) -> plus(X1:S,X2:S) mark(0) -> 0 mark(U11(X1:S,X2:S)) -> a__U11(mark(X1:S),X2:S) mark(U21(X1:S,X2:S,X3:S)) -> a__U21(mark(X1:S),X2:S,X3:S) mark(and(X1:S,X2:S)) -> a__and(mark(X1:S),X2:S) mark(isNat(X:S)) -> a__isNat(X:S) mark(plus(X1:S,X2:S)) -> a__plus(mark(X1:S),mark(X2:S)) mark(s(X:S)) -> s(mark(X:S)) mark(tt) -> tt -> Usable rules: a__U11(tt,N:S) -> mark(N:S) a__U11(X1:S,X2:S) -> U11(X1:S,X2:S) a__U21(tt,M:S,N:S) -> s(a__plus(mark(N:S),mark(M:S))) a__U21(X1:S,X2:S,X3:S) -> U21(X1:S,X2:S,X3:S) a__and(tt,X:S) -> mark(X:S) a__and(X1:S,X2:S) -> and(X1:S,X2:S) a__isNat(0) -> tt a__isNat(plus(V1:S,V2:S)) -> a__and(a__isNat(V1:S),isNat(V2:S)) a__isNat(s(V1:S)) -> a__isNat(V1:S) a__isNat(X:S) -> isNat(X:S) a__plus(N:S,0) -> a__U11(a__isNat(N:S),N:S) a__plus(N:S,s(M:S)) -> a__U21(a__and(a__isNat(M:S),isNat(N:S)),M:S,N:S) a__plus(X1:S,X2:S) -> plus(X1:S,X2:S) mark(0) -> 0 mark(U11(X1:S,X2:S)) -> a__U11(mark(X1:S),X2:S) mark(U21(X1:S,X2:S,X3:S)) -> a__U21(mark(X1:S),X2:S,X3:S) mark(and(X1:S,X2:S)) -> a__and(mark(X1:S),X2:S) mark(isNat(X:S)) -> a__isNat(X:S) mark(plus(X1:S,X2:S)) -> a__plus(mark(X1:S),mark(X2:S)) mark(s(X:S)) -> s(mark(X:S)) mark(tt) -> tt ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [a__U11](X1,X2) = 2.X1 + 2.X2 + 2 [a__U21](X1,X2,X3) = 2.X1 + 2.X2 + 2.X3 + 2 [a__and](X1,X2) = 2.X1 + 2.X2 [a__isNat](X) = 0 [a__plus](X1,X2) = 2.X1 + 2.X2 + 2 [mark](X) = X [0] = 0 [U11](X1,X2) = 2.X1 + 2.X2 + 2 [U21](X1,X2,X3) = 2.X1 + 2.X2 + 2.X3 + 2 [and](X1,X2) = 2.X1 + 2.X2 [fSNonEmpty] = 0 [isNat](X) = 0 [plus](X1,X2) = 2.X1 + 2.X2 + 2 [s](X) = X [tt] = 0 [A__U11](X1,X2) = 2.X2 + 1 [A__U21](X1,X2,X3) = X1 + 2.X2 + 2.X3 + 2 [A__AND](X1,X2) = 2.X1 + 2.X2 [A__ISNAT](X) = 0 [A__PLUS](X1,X2) = 2.X1 + 2.X2 + 2 [MARK](X) = 2.X Problem 1: SCC Processor: -> Pairs: A__U21(tt,M:S,N:S) -> A__PLUS(mark(N:S),mark(M:S)) A__U21(tt,M:S,N:S) -> MARK(M:S) A__U21(tt,M:S,N:S) -> MARK(N:S) A__AND(tt,X:S) -> MARK(X:S) A__ISNAT(plus(V1:S,V2:S)) -> A__AND(a__isNat(V1:S),isNat(V2:S)) A__ISNAT(plus(V1:S,V2:S)) -> A__ISNAT(V1:S) A__ISNAT(s(V1:S)) -> A__ISNAT(V1:S) A__PLUS(N:S,0) -> A__U11(a__isNat(N:S),N:S) A__PLUS(N:S,0) -> A__ISNAT(N:S) A__PLUS(N:S,s(M:S)) -> A__U21(a__and(a__isNat(M:S),isNat(N:S)),M:S,N:S) A__PLUS(N:S,s(M:S)) -> A__AND(a__isNat(M:S),isNat(N:S)) A__PLUS(N:S,s(M:S)) -> A__ISNAT(M:S) MARK(U11(X1:S,X2:S)) -> A__U11(mark(X1:S),X2:S) MARK(U11(X1:S,X2:S)) -> MARK(X1:S) MARK(U21(X1:S,X2:S,X3:S)) -> A__U21(mark(X1:S),X2:S,X3:S) MARK(U21(X1:S,X2:S,X3:S)) -> MARK(X1:S) MARK(and(X1:S,X2:S)) -> A__AND(mark(X1:S),X2:S) MARK(and(X1:S,X2:S)) -> MARK(X1:S) MARK(isNat(X:S)) -> A__ISNAT(X:S) MARK(plus(X1:S,X2:S)) -> A__PLUS(mark(X1:S),mark(X2:S)) MARK(plus(X1:S,X2:S)) -> MARK(X1:S) MARK(plus(X1:S,X2:S)) -> MARK(X2:S) MARK(s(X:S)) -> MARK(X:S) -> Rules: a__U11(tt,N:S) -> mark(N:S) a__U11(X1:S,X2:S) -> U11(X1:S,X2:S) a__U21(tt,M:S,N:S) -> s(a__plus(mark(N:S),mark(M:S))) a__U21(X1:S,X2:S,X3:S) -> U21(X1:S,X2:S,X3:S) a__and(tt,X:S) -> mark(X:S) a__and(X1:S,X2:S) -> and(X1:S,X2:S) a__isNat(0) -> tt a__isNat(plus(V1:S,V2:S)) -> a__and(a__isNat(V1:S),isNat(V2:S)) a__isNat(s(V1:S)) -> a__isNat(V1:S) a__isNat(X:S) -> isNat(X:S) a__plus(N:S,0) -> a__U11(a__isNat(N:S),N:S) a__plus(N:S,s(M:S)) -> a__U21(a__and(a__isNat(M:S),isNat(N:S)),M:S,N:S) a__plus(X1:S,X2:S) -> plus(X1:S,X2:S) mark(0) -> 0 mark(U11(X1:S,X2:S)) -> a__U11(mark(X1:S),X2:S) mark(U21(X1:S,X2:S,X3:S)) -> a__U21(mark(X1:S),X2:S,X3:S) mark(and(X1:S,X2:S)) -> a__and(mark(X1:S),X2:S) mark(isNat(X:S)) -> a__isNat(X:S) mark(plus(X1:S,X2:S)) -> a__plus(mark(X1:S),mark(X2:S)) mark(s(X:S)) -> s(mark(X:S)) mark(tt) -> tt ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: A__U21(tt,M:S,N:S) -> A__PLUS(mark(N:S),mark(M:S)) A__U21(tt,M:S,N:S) -> MARK(M:S) A__U21(tt,M:S,N:S) -> MARK(N:S) A__AND(tt,X:S) -> MARK(X:S) A__ISNAT(plus(V1:S,V2:S)) -> A__AND(a__isNat(V1:S),isNat(V2:S)) A__ISNAT(plus(V1:S,V2:S)) -> A__ISNAT(V1:S) A__ISNAT(s(V1:S)) -> A__ISNAT(V1:S) A__PLUS(N:S,0) -> A__ISNAT(N:S) A__PLUS(N:S,s(M:S)) -> A__U21(a__and(a__isNat(M:S),isNat(N:S)),M:S,N:S) A__PLUS(N:S,s(M:S)) -> A__AND(a__isNat(M:S),isNat(N:S)) A__PLUS(N:S,s(M:S)) -> A__ISNAT(M:S) MARK(U11(X1:S,X2:S)) -> MARK(X1:S) MARK(U21(X1:S,X2:S,X3:S)) -> A__U21(mark(X1:S),X2:S,X3:S) MARK(U21(X1:S,X2:S,X3:S)) -> MARK(X1:S) MARK(and(X1:S,X2:S)) -> A__AND(mark(X1:S),X2:S) MARK(and(X1:S,X2:S)) -> MARK(X1:S) MARK(isNat(X:S)) -> A__ISNAT(X:S) MARK(plus(X1:S,X2:S)) -> A__PLUS(mark(X1:S),mark(X2:S)) MARK(plus(X1:S,X2:S)) -> MARK(X1:S) MARK(plus(X1:S,X2:S)) -> MARK(X2:S) MARK(s(X:S)) -> MARK(X:S) ->->-> Rules: a__U11(tt,N:S) -> mark(N:S) a__U11(X1:S,X2:S) -> U11(X1:S,X2:S) a__U21(tt,M:S,N:S) -> s(a__plus(mark(N:S),mark(M:S))) a__U21(X1:S,X2:S,X3:S) -> U21(X1:S,X2:S,X3:S) a__and(tt,X:S) -> mark(X:S) a__and(X1:S,X2:S) -> and(X1:S,X2:S) a__isNat(0) -> tt a__isNat(plus(V1:S,V2:S)) -> a__and(a__isNat(V1:S),isNat(V2:S)) a__isNat(s(V1:S)) -> a__isNat(V1:S) a__isNat(X:S) -> isNat(X:S) a__plus(N:S,0) -> a__U11(a__isNat(N:S),N:S) a__plus(N:S,s(M:S)) -> a__U21(a__and(a__isNat(M:S),isNat(N:S)),M:S,N:S) a__plus(X1:S,X2:S) -> plus(X1:S,X2:S) mark(0) -> 0 mark(U11(X1:S,X2:S)) -> a__U11(mark(X1:S),X2:S) mark(U21(X1:S,X2:S,X3:S)) -> a__U21(mark(X1:S),X2:S,X3:S) mark(and(X1:S,X2:S)) -> a__and(mark(X1:S),X2:S) mark(isNat(X:S)) -> a__isNat(X:S) mark(plus(X1:S,X2:S)) -> a__plus(mark(X1:S),mark(X2:S)) mark(s(X:S)) -> s(mark(X:S)) mark(tt) -> tt Problem 1: Reduction Pairs Processor: -> Pairs: A__U21(tt,M:S,N:S) -> A__PLUS(mark(N:S),mark(M:S)) A__U21(tt,M:S,N:S) -> MARK(M:S) A__U21(tt,M:S,N:S) -> MARK(N:S) A__AND(tt,X:S) -> MARK(X:S) A__ISNAT(plus(V1:S,V2:S)) -> A__AND(a__isNat(V1:S),isNat(V2:S)) A__ISNAT(plus(V1:S,V2:S)) -> A__ISNAT(V1:S) A__ISNAT(s(V1:S)) -> A__ISNAT(V1:S) A__PLUS(N:S,0) -> A__ISNAT(N:S) A__PLUS(N:S,s(M:S)) -> A__U21(a__and(a__isNat(M:S),isNat(N:S)),M:S,N:S) A__PLUS(N:S,s(M:S)) -> A__AND(a__isNat(M:S),isNat(N:S)) A__PLUS(N:S,s(M:S)) -> A__ISNAT(M:S) MARK(U11(X1:S,X2:S)) -> MARK(X1:S) MARK(U21(X1:S,X2:S,X3:S)) -> A__U21(mark(X1:S),X2:S,X3:S) MARK(U21(X1:S,X2:S,X3:S)) -> MARK(X1:S) MARK(and(X1:S,X2:S)) -> A__AND(mark(X1:S),X2:S) MARK(and(X1:S,X2:S)) -> MARK(X1:S) MARK(isNat(X:S)) -> A__ISNAT(X:S) MARK(plus(X1:S,X2:S)) -> A__PLUS(mark(X1:S),mark(X2:S)) MARK(plus(X1:S,X2:S)) -> MARK(X1:S) MARK(plus(X1:S,X2:S)) -> MARK(X2:S) MARK(s(X:S)) -> MARK(X:S) -> Rules: a__U11(tt,N:S) -> mark(N:S) a__U11(X1:S,X2:S) -> U11(X1:S,X2:S) a__U21(tt,M:S,N:S) -> s(a__plus(mark(N:S),mark(M:S))) a__U21(X1:S,X2:S,X3:S) -> U21(X1:S,X2:S,X3:S) a__and(tt,X:S) -> mark(X:S) a__and(X1:S,X2:S) -> and(X1:S,X2:S) a__isNat(0) -> tt a__isNat(plus(V1:S,V2:S)) -> a__and(a__isNat(V1:S),isNat(V2:S)) a__isNat(s(V1:S)) -> a__isNat(V1:S) a__isNat(X:S) -> isNat(X:S) a__plus(N:S,0) -> a__U11(a__isNat(N:S),N:S) a__plus(N:S,s(M:S)) -> a__U21(a__and(a__isNat(M:S),isNat(N:S)),M:S,N:S) a__plus(X1:S,X2:S) -> plus(X1:S,X2:S) mark(0) -> 0 mark(U11(X1:S,X2:S)) -> a__U11(mark(X1:S),X2:S) mark(U21(X1:S,X2:S,X3:S)) -> a__U21(mark(X1:S),X2:S,X3:S) mark(and(X1:S,X2:S)) -> a__and(mark(X1:S),X2:S) mark(isNat(X:S)) -> a__isNat(X:S) mark(plus(X1:S,X2:S)) -> a__plus(mark(X1:S),mark(X2:S)) mark(s(X:S)) -> s(mark(X:S)) mark(tt) -> tt -> Usable rules: a__U11(tt,N:S) -> mark(N:S) a__U11(X1:S,X2:S) -> U11(X1:S,X2:S) a__U21(tt,M:S,N:S) -> s(a__plus(mark(N:S),mark(M:S))) a__U21(X1:S,X2:S,X3:S) -> U21(X1:S,X2:S,X3:S) a__and(tt,X:S) -> mark(X:S) a__and(X1:S,X2:S) -> and(X1:S,X2:S) a__isNat(0) -> tt a__isNat(plus(V1:S,V2:S)) -> a__and(a__isNat(V1:S),isNat(V2:S)) a__isNat(s(V1:S)) -> a__isNat(V1:S) a__isNat(X:S) -> isNat(X:S) a__plus(N:S,0) -> a__U11(a__isNat(N:S),N:S) a__plus(N:S,s(M:S)) -> a__U21(a__and(a__isNat(M:S),isNat(N:S)),M:S,N:S) a__plus(X1:S,X2:S) -> plus(X1:S,X2:S) mark(0) -> 0 mark(U11(X1:S,X2:S)) -> a__U11(mark(X1:S),X2:S) mark(U21(X1:S,X2:S,X3:S)) -> a__U21(mark(X1:S),X2:S,X3:S) mark(and(X1:S,X2:S)) -> a__and(mark(X1:S),X2:S) mark(isNat(X:S)) -> a__isNat(X:S) mark(plus(X1:S,X2:S)) -> a__plus(mark(X1:S),mark(X2:S)) mark(s(X:S)) -> s(mark(X:S)) mark(tt) -> tt ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [a__U11](X1,X2) = 2.X1 + 2.X2 + 2 [a__U21](X1,X2,X3) = 2.X1 + 2.X2 + 2.X3 + 2 [a__and](X1,X2) = 2.X1 + 2.X2 [a__isNat](X) = 0 [a__plus](X1,X2) = 2.X1 + 2.X2 + 1 [mark](X) = X [0] = 1 [U11](X1,X2) = 2.X1 + 2.X2 + 2 [U21](X1,X2,X3) = 2.X1 + 2.X2 + 2.X3 + 2 [and](X1,X2) = 2.X1 + 2.X2 [fSNonEmpty] = 0 [isNat](X) = 0 [plus](X1,X2) = 2.X1 + 2.X2 + 1 [s](X) = X + 1 [tt] = 0 [A__U11](X1,X2) = 0 [A__U21](X1,X2,X3) = 2.X2 + 2.X3 + 2 [A__AND](X1,X2) = 2.X1 + 2.X2 + 2 [A__ISNAT](X) = 2 [A__PLUS](X1,X2) = 2.X1 + 2.X2 + 1 [MARK](X) = 2.X + 2 Problem 1: SCC Processor: -> Pairs: A__U21(tt,M:S,N:S) -> MARK(M:S) A__U21(tt,M:S,N:S) -> MARK(N:S) A__AND(tt,X:S) -> MARK(X:S) A__ISNAT(plus(V1:S,V2:S)) -> A__AND(a__isNat(V1:S),isNat(V2:S)) A__ISNAT(plus(V1:S,V2:S)) -> A__ISNAT(V1:S) A__ISNAT(s(V1:S)) -> A__ISNAT(V1:S) A__PLUS(N:S,0) -> A__ISNAT(N:S) A__PLUS(N:S,s(M:S)) -> A__U21(a__and(a__isNat(M:S),isNat(N:S)),M:S,N:S) A__PLUS(N:S,s(M:S)) -> A__AND(a__isNat(M:S),isNat(N:S)) A__PLUS(N:S,s(M:S)) -> A__ISNAT(M:S) MARK(U11(X1:S,X2:S)) -> MARK(X1:S) MARK(U21(X1:S,X2:S,X3:S)) -> A__U21(mark(X1:S),X2:S,X3:S) MARK(U21(X1:S,X2:S,X3:S)) -> MARK(X1:S) MARK(and(X1:S,X2:S)) -> A__AND(mark(X1:S),X2:S) MARK(and(X1:S,X2:S)) -> MARK(X1:S) MARK(isNat(X:S)) -> A__ISNAT(X:S) MARK(plus(X1:S,X2:S)) -> A__PLUS(mark(X1:S),mark(X2:S)) MARK(plus(X1:S,X2:S)) -> MARK(X1:S) MARK(plus(X1:S,X2:S)) -> MARK(X2:S) MARK(s(X:S)) -> MARK(X:S) -> Rules: a__U11(tt,N:S) -> mark(N:S) a__U11(X1:S,X2:S) -> U11(X1:S,X2:S) a__U21(tt,M:S,N:S) -> s(a__plus(mark(N:S),mark(M:S))) a__U21(X1:S,X2:S,X3:S) -> U21(X1:S,X2:S,X3:S) a__and(tt,X:S) -> mark(X:S) a__and(X1:S,X2:S) -> and(X1:S,X2:S) a__isNat(0) -> tt a__isNat(plus(V1:S,V2:S)) -> a__and(a__isNat(V1:S),isNat(V2:S)) a__isNat(s(V1:S)) -> a__isNat(V1:S) a__isNat(X:S) -> isNat(X:S) a__plus(N:S,0) -> a__U11(a__isNat(N:S),N:S) a__plus(N:S,s(M:S)) -> a__U21(a__and(a__isNat(M:S),isNat(N:S)),M:S,N:S) a__plus(X1:S,X2:S) -> plus(X1:S,X2:S) mark(0) -> 0 mark(U11(X1:S,X2:S)) -> a__U11(mark(X1:S),X2:S) mark(U21(X1:S,X2:S,X3:S)) -> a__U21(mark(X1:S),X2:S,X3:S) mark(and(X1:S,X2:S)) -> a__and(mark(X1:S),X2:S) mark(isNat(X:S)) -> a__isNat(X:S) mark(plus(X1:S,X2:S)) -> a__plus(mark(X1:S),mark(X2:S)) mark(s(X:S)) -> s(mark(X:S)) mark(tt) -> tt ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: A__U21(tt,M:S,N:S) -> MARK(M:S) A__U21(tt,M:S,N:S) -> MARK(N:S) A__AND(tt,X:S) -> MARK(X:S) A__ISNAT(plus(V1:S,V2:S)) -> A__AND(a__isNat(V1:S),isNat(V2:S)) A__ISNAT(plus(V1:S,V2:S)) -> A__ISNAT(V1:S) A__ISNAT(s(V1:S)) -> A__ISNAT(V1:S) A__PLUS(N:S,0) -> A__ISNAT(N:S) A__PLUS(N:S,s(M:S)) -> A__U21(a__and(a__isNat(M:S),isNat(N:S)),M:S,N:S) A__PLUS(N:S,s(M:S)) -> A__AND(a__isNat(M:S),isNat(N:S)) A__PLUS(N:S,s(M:S)) -> A__ISNAT(M:S) MARK(U11(X1:S,X2:S)) -> MARK(X1:S) MARK(U21(X1:S,X2:S,X3:S)) -> A__U21(mark(X1:S),X2:S,X3:S) MARK(U21(X1:S,X2:S,X3:S)) -> MARK(X1:S) MARK(and(X1:S,X2:S)) -> A__AND(mark(X1:S),X2:S) MARK(and(X1:S,X2:S)) -> MARK(X1:S) MARK(isNat(X:S)) -> A__ISNAT(X:S) MARK(plus(X1:S,X2:S)) -> A__PLUS(mark(X1:S),mark(X2:S)) MARK(plus(X1:S,X2:S)) -> MARK(X1:S) MARK(plus(X1:S,X2:S)) -> MARK(X2:S) MARK(s(X:S)) -> MARK(X:S) ->->-> Rules: a__U11(tt,N:S) -> mark(N:S) a__U11(X1:S,X2:S) -> U11(X1:S,X2:S) a__U21(tt,M:S,N:S) -> s(a__plus(mark(N:S),mark(M:S))) a__U21(X1:S,X2:S,X3:S) -> U21(X1:S,X2:S,X3:S) a__and(tt,X:S) -> mark(X:S) a__and(X1:S,X2:S) -> and(X1:S,X2:S) a__isNat(0) -> tt a__isNat(plus(V1:S,V2:S)) -> a__and(a__isNat(V1:S),isNat(V2:S)) a__isNat(s(V1:S)) -> a__isNat(V1:S) a__isNat(X:S) -> isNat(X:S) a__plus(N:S,0) -> a__U11(a__isNat(N:S),N:S) a__plus(N:S,s(M:S)) -> a__U21(a__and(a__isNat(M:S),isNat(N:S)),M:S,N:S) a__plus(X1:S,X2:S) -> plus(X1:S,X2:S) mark(0) -> 0 mark(U11(X1:S,X2:S)) -> a__U11(mark(X1:S),X2:S) mark(U21(X1:S,X2:S,X3:S)) -> a__U21(mark(X1:S),X2:S,X3:S) mark(and(X1:S,X2:S)) -> a__and(mark(X1:S),X2:S) mark(isNat(X:S)) -> a__isNat(X:S) mark(plus(X1:S,X2:S)) -> a__plus(mark(X1:S),mark(X2:S)) mark(s(X:S)) -> s(mark(X:S)) mark(tt) -> tt Problem 1: Reduction Pairs Processor: -> Pairs: A__U21(tt,M:S,N:S) -> MARK(M:S) A__U21(tt,M:S,N:S) -> MARK(N:S) A__AND(tt,X:S) -> MARK(X:S) A__ISNAT(plus(V1:S,V2:S)) -> A__AND(a__isNat(V1:S),isNat(V2:S)) A__ISNAT(plus(V1:S,V2:S)) -> A__ISNAT(V1:S) A__ISNAT(s(V1:S)) -> A__ISNAT(V1:S) A__PLUS(N:S,0) -> A__ISNAT(N:S) A__PLUS(N:S,s(M:S)) -> A__U21(a__and(a__isNat(M:S),isNat(N:S)),M:S,N:S) A__PLUS(N:S,s(M:S)) -> A__AND(a__isNat(M:S),isNat(N:S)) A__PLUS(N:S,s(M:S)) -> A__ISNAT(M:S) MARK(U11(X1:S,X2:S)) -> MARK(X1:S) MARK(U21(X1:S,X2:S,X3:S)) -> A__U21(mark(X1:S),X2:S,X3:S) MARK(U21(X1:S,X2:S,X3:S)) -> MARK(X1:S) MARK(and(X1:S,X2:S)) -> A__AND(mark(X1:S),X2:S) MARK(and(X1:S,X2:S)) -> MARK(X1:S) MARK(isNat(X:S)) -> A__ISNAT(X:S) MARK(plus(X1:S,X2:S)) -> A__PLUS(mark(X1:S),mark(X2:S)) MARK(plus(X1:S,X2:S)) -> MARK(X1:S) MARK(plus(X1:S,X2:S)) -> MARK(X2:S) MARK(s(X:S)) -> MARK(X:S) -> Rules: a__U11(tt,N:S) -> mark(N:S) a__U11(X1:S,X2:S) -> U11(X1:S,X2:S) a__U21(tt,M:S,N:S) -> s(a__plus(mark(N:S),mark(M:S))) a__U21(X1:S,X2:S,X3:S) -> U21(X1:S,X2:S,X3:S) a__and(tt,X:S) -> mark(X:S) a__and(X1:S,X2:S) -> and(X1:S,X2:S) a__isNat(0) -> tt a__isNat(plus(V1:S,V2:S)) -> a__and(a__isNat(V1:S),isNat(V2:S)) a__isNat(s(V1:S)) -> a__isNat(V1:S) a__isNat(X:S) -> isNat(X:S) a__plus(N:S,0) -> a__U11(a__isNat(N:S),N:S) a__plus(N:S,s(M:S)) -> a__U21(a__and(a__isNat(M:S),isNat(N:S)),M:S,N:S) a__plus(X1:S,X2:S) -> plus(X1:S,X2:S) mark(0) -> 0 mark(U11(X1:S,X2:S)) -> a__U11(mark(X1:S),X2:S) mark(U21(X1:S,X2:S,X3:S)) -> a__U21(mark(X1:S),X2:S,X3:S) mark(and(X1:S,X2:S)) -> a__and(mark(X1:S),X2:S) mark(isNat(X:S)) -> a__isNat(X:S) mark(plus(X1:S,X2:S)) -> a__plus(mark(X1:S),mark(X2:S)) mark(s(X:S)) -> s(mark(X:S)) mark(tt) -> tt -> Usable rules: a__U11(tt,N:S) -> mark(N:S) a__U11(X1:S,X2:S) -> U11(X1:S,X2:S) a__U21(tt,M:S,N:S) -> s(a__plus(mark(N:S),mark(M:S))) a__U21(X1:S,X2:S,X3:S) -> U21(X1:S,X2:S,X3:S) a__and(tt,X:S) -> mark(X:S) a__and(X1:S,X2:S) -> and(X1:S,X2:S) a__isNat(0) -> tt a__isNat(plus(V1:S,V2:S)) -> a__and(a__isNat(V1:S),isNat(V2:S)) a__isNat(s(V1:S)) -> a__isNat(V1:S) a__isNat(X:S) -> isNat(X:S) a__plus(N:S,0) -> a__U11(a__isNat(N:S),N:S) a__plus(N:S,s(M:S)) -> a__U21(a__and(a__isNat(M:S),isNat(N:S)),M:S,N:S) a__plus(X1:S,X2:S) -> plus(X1:S,X2:S) mark(0) -> 0 mark(U11(X1:S,X2:S)) -> a__U11(mark(X1:S),X2:S) mark(U21(X1:S,X2:S,X3:S)) -> a__U21(mark(X1:S),X2:S,X3:S) mark(and(X1:S,X2:S)) -> a__and(mark(X1:S),X2:S) mark(isNat(X:S)) -> a__isNat(X:S) mark(plus(X1:S,X2:S)) -> a__plus(mark(X1:S),mark(X2:S)) mark(s(X:S)) -> s(mark(X:S)) mark(tt) -> tt ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [a__U11](X1,X2) = 2.X1 + X2 + 1 [a__U21](X1,X2,X3) = 2.X1 + 2.X2 + 2.X3 + 1 [a__and](X1,X2) = 2.X1 + 2.X2 [a__isNat](X) = 0 [a__plus](X1,X2) = 2.X1 + 2.X2 [mark](X) = X [0] = 2 [U11](X1,X2) = 2.X1 + X2 + 1 [U21](X1,X2,X3) = 2.X1 + 2.X2 + 2.X3 + 1 [and](X1,X2) = 2.X1 + 2.X2 [fSNonEmpty] = 0 [isNat](X) = 0 [plus](X1,X2) = 2.X1 + 2.X2 [s](X) = X + 1 [tt] = 0 [A__U11](X1,X2) = 0 [A__U21](X1,X2,X3) = 2.X2 + 2.X3 + 2 [A__AND](X1,X2) = 2.X1 + 2.X2 + 1 [A__ISNAT](X) = 1 [A__PLUS](X1,X2) = 2.X1 + 2.X2 + 1 [MARK](X) = 2.X + 1 Problem 1: SCC Processor: -> Pairs: A__U21(tt,M:S,N:S) -> MARK(N:S) A__AND(tt,X:S) -> MARK(X:S) A__ISNAT(plus(V1:S,V2:S)) -> A__AND(a__isNat(V1:S),isNat(V2:S)) A__ISNAT(plus(V1:S,V2:S)) -> A__ISNAT(V1:S) A__ISNAT(s(V1:S)) -> A__ISNAT(V1:S) A__PLUS(N:S,0) -> A__ISNAT(N:S) A__PLUS(N:S,s(M:S)) -> A__U21(a__and(a__isNat(M:S),isNat(N:S)),M:S,N:S) A__PLUS(N:S,s(M:S)) -> A__AND(a__isNat(M:S),isNat(N:S)) A__PLUS(N:S,s(M:S)) -> A__ISNAT(M:S) MARK(U11(X1:S,X2:S)) -> MARK(X1:S) MARK(U21(X1:S,X2:S,X3:S)) -> A__U21(mark(X1:S),X2:S,X3:S) MARK(U21(X1:S,X2:S,X3:S)) -> MARK(X1:S) MARK(and(X1:S,X2:S)) -> A__AND(mark(X1:S),X2:S) MARK(and(X1:S,X2:S)) -> MARK(X1:S) MARK(isNat(X:S)) -> A__ISNAT(X:S) MARK(plus(X1:S,X2:S)) -> A__PLUS(mark(X1:S),mark(X2:S)) MARK(plus(X1:S,X2:S)) -> MARK(X1:S) MARK(plus(X1:S,X2:S)) -> MARK(X2:S) MARK(s(X:S)) -> MARK(X:S) -> Rules: a__U11(tt,N:S) -> mark(N:S) a__U11(X1:S,X2:S) -> U11(X1:S,X2:S) a__U21(tt,M:S,N:S) -> s(a__plus(mark(N:S),mark(M:S))) a__U21(X1:S,X2:S,X3:S) -> U21(X1:S,X2:S,X3:S) a__and(tt,X:S) -> mark(X:S) a__and(X1:S,X2:S) -> and(X1:S,X2:S) a__isNat(0) -> tt a__isNat(plus(V1:S,V2:S)) -> a__and(a__isNat(V1:S),isNat(V2:S)) a__isNat(s(V1:S)) -> a__isNat(V1:S) a__isNat(X:S) -> isNat(X:S) a__plus(N:S,0) -> a__U11(a__isNat(N:S),N:S) a__plus(N:S,s(M:S)) -> a__U21(a__and(a__isNat(M:S),isNat(N:S)),M:S,N:S) a__plus(X1:S,X2:S) -> plus(X1:S,X2:S) mark(0) -> 0 mark(U11(X1:S,X2:S)) -> a__U11(mark(X1:S),X2:S) mark(U21(X1:S,X2:S,X3:S)) -> a__U21(mark(X1:S),X2:S,X3:S) mark(and(X1:S,X2:S)) -> a__and(mark(X1:S),X2:S) mark(isNat(X:S)) -> a__isNat(X:S) mark(plus(X1:S,X2:S)) -> a__plus(mark(X1:S),mark(X2:S)) mark(s(X:S)) -> s(mark(X:S)) mark(tt) -> tt ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: A__U21(tt,M:S,N:S) -> MARK(N:S) A__AND(tt,X:S) -> MARK(X:S) A__ISNAT(plus(V1:S,V2:S)) -> A__AND(a__isNat(V1:S),isNat(V2:S)) A__ISNAT(plus(V1:S,V2:S)) -> A__ISNAT(V1:S) A__ISNAT(s(V1:S)) -> A__ISNAT(V1:S) A__PLUS(N:S,0) -> A__ISNAT(N:S) A__PLUS(N:S,s(M:S)) -> A__U21(a__and(a__isNat(M:S),isNat(N:S)),M:S,N:S) A__PLUS(N:S,s(M:S)) -> A__AND(a__isNat(M:S),isNat(N:S)) A__PLUS(N:S,s(M:S)) -> A__ISNAT(M:S) MARK(U11(X1:S,X2:S)) -> MARK(X1:S) MARK(U21(X1:S,X2:S,X3:S)) -> A__U21(mark(X1:S),X2:S,X3:S) MARK(U21(X1:S,X2:S,X3:S)) -> MARK(X1:S) MARK(and(X1:S,X2:S)) -> A__AND(mark(X1:S),X2:S) MARK(and(X1:S,X2:S)) -> MARK(X1:S) MARK(isNat(X:S)) -> A__ISNAT(X:S) MARK(plus(X1:S,X2:S)) -> A__PLUS(mark(X1:S),mark(X2:S)) MARK(plus(X1:S,X2:S)) -> MARK(X1:S) MARK(plus(X1:S,X2:S)) -> MARK(X2:S) MARK(s(X:S)) -> MARK(X:S) ->->-> Rules: a__U11(tt,N:S) -> mark(N:S) a__U11(X1:S,X2:S) -> U11(X1:S,X2:S) a__U21(tt,M:S,N:S) -> s(a__plus(mark(N:S),mark(M:S))) a__U21(X1:S,X2:S,X3:S) -> U21(X1:S,X2:S,X3:S) a__and(tt,X:S) -> mark(X:S) a__and(X1:S,X2:S) -> and(X1:S,X2:S) a__isNat(0) -> tt a__isNat(plus(V1:S,V2:S)) -> a__and(a__isNat(V1:S),isNat(V2:S)) a__isNat(s(V1:S)) -> a__isNat(V1:S) a__isNat(X:S) -> isNat(X:S) a__plus(N:S,0) -> a__U11(a__isNat(N:S),N:S) a__plus(N:S,s(M:S)) -> a__U21(a__and(a__isNat(M:S),isNat(N:S)),M:S,N:S) a__plus(X1:S,X2:S) -> plus(X1:S,X2:S) mark(0) -> 0 mark(U11(X1:S,X2:S)) -> a__U11(mark(X1:S),X2:S) mark(U21(X1:S,X2:S,X3:S)) -> a__U21(mark(X1:S),X2:S,X3:S) mark(and(X1:S,X2:S)) -> a__and(mark(X1:S),X2:S) mark(isNat(X:S)) -> a__isNat(X:S) mark(plus(X1:S,X2:S)) -> a__plus(mark(X1:S),mark(X2:S)) mark(s(X:S)) -> s(mark(X:S)) mark(tt) -> tt Problem 1: Reduction Pairs Processor: -> Pairs: A__U21(tt,M:S,N:S) -> MARK(N:S) A__AND(tt,X:S) -> MARK(X:S) A__ISNAT(plus(V1:S,V2:S)) -> A__AND(a__isNat(V1:S),isNat(V2:S)) A__ISNAT(plus(V1:S,V2:S)) -> A__ISNAT(V1:S) A__ISNAT(s(V1:S)) -> A__ISNAT(V1:S) A__PLUS(N:S,0) -> A__ISNAT(N:S) A__PLUS(N:S,s(M:S)) -> A__U21(a__and(a__isNat(M:S),isNat(N:S)),M:S,N:S) A__PLUS(N:S,s(M:S)) -> A__AND(a__isNat(M:S),isNat(N:S)) A__PLUS(N:S,s(M:S)) -> A__ISNAT(M:S) MARK(U11(X1:S,X2:S)) -> MARK(X1:S) MARK(U21(X1:S,X2:S,X3:S)) -> A__U21(mark(X1:S),X2:S,X3:S) MARK(U21(X1:S,X2:S,X3:S)) -> MARK(X1:S) MARK(and(X1:S,X2:S)) -> A__AND(mark(X1:S),X2:S) MARK(and(X1:S,X2:S)) -> MARK(X1:S) MARK(isNat(X:S)) -> A__ISNAT(X:S) MARK(plus(X1:S,X2:S)) -> A__PLUS(mark(X1:S),mark(X2:S)) MARK(plus(X1:S,X2:S)) -> MARK(X1:S) MARK(plus(X1:S,X2:S)) -> MARK(X2:S) MARK(s(X:S)) -> MARK(X:S) -> Rules: a__U11(tt,N:S) -> mark(N:S) a__U11(X1:S,X2:S) -> U11(X1:S,X2:S) a__U21(tt,M:S,N:S) -> s(a__plus(mark(N:S),mark(M:S))) a__U21(X1:S,X2:S,X3:S) -> U21(X1:S,X2:S,X3:S) a__and(tt,X:S) -> mark(X:S) a__and(X1:S,X2:S) -> and(X1:S,X2:S) a__isNat(0) -> tt a__isNat(plus(V1:S,V2:S)) -> a__and(a__isNat(V1:S),isNat(V2:S)) a__isNat(s(V1:S)) -> a__isNat(V1:S) a__isNat(X:S) -> isNat(X:S) a__plus(N:S,0) -> a__U11(a__isNat(N:S),N:S) a__plus(N:S,s(M:S)) -> a__U21(a__and(a__isNat(M:S),isNat(N:S)),M:S,N:S) a__plus(X1:S,X2:S) -> plus(X1:S,X2:S) mark(0) -> 0 mark(U11(X1:S,X2:S)) -> a__U11(mark(X1:S),X2:S) mark(U21(X1:S,X2:S,X3:S)) -> a__U21(mark(X1:S),X2:S,X3:S) mark(and(X1:S,X2:S)) -> a__and(mark(X1:S),X2:S) mark(isNat(X:S)) -> a__isNat(X:S) mark(plus(X1:S,X2:S)) -> a__plus(mark(X1:S),mark(X2:S)) mark(s(X:S)) -> s(mark(X:S)) mark(tt) -> tt -> Usable rules: a__U11(tt,N:S) -> mark(N:S) a__U11(X1:S,X2:S) -> U11(X1:S,X2:S) a__U21(tt,M:S,N:S) -> s(a__plus(mark(N:S),mark(M:S))) a__U21(X1:S,X2:S,X3:S) -> U21(X1:S,X2:S,X3:S) a__and(tt,X:S) -> mark(X:S) a__and(X1:S,X2:S) -> and(X1:S,X2:S) a__isNat(0) -> tt a__isNat(plus(V1:S,V2:S)) -> a__and(a__isNat(V1:S),isNat(V2:S)) a__isNat(s(V1:S)) -> a__isNat(V1:S) a__isNat(X:S) -> isNat(X:S) a__plus(N:S,0) -> a__U11(a__isNat(N:S),N:S) a__plus(N:S,s(M:S)) -> a__U21(a__and(a__isNat(M:S),isNat(N:S)),M:S,N:S) a__plus(X1:S,X2:S) -> plus(X1:S,X2:S) mark(0) -> 0 mark(U11(X1:S,X2:S)) -> a__U11(mark(X1:S),X2:S) mark(U21(X1:S,X2:S,X3:S)) -> a__U21(mark(X1:S),X2:S,X3:S) mark(and(X1:S,X2:S)) -> a__and(mark(X1:S),X2:S) mark(isNat(X:S)) -> a__isNat(X:S) mark(plus(X1:S,X2:S)) -> a__plus(mark(X1:S),mark(X2:S)) mark(s(X:S)) -> s(mark(X:S)) mark(tt) -> tt ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [a__U11](X1,X2) = 2.X1 + 2.X2 + 1 [a__U21](X1,X2,X3) = 2.X1 + 2.X2 + 2.X3 + 2 [a__and](X1,X2) = 2.X1 + 2.X2 [a__isNat](X) = 0 [a__plus](X1,X2) = 2.X1 + 2.X2 [mark](X) = X [0] = 1 [U11](X1,X2) = 2.X1 + 2.X2 + 1 [U21](X1,X2,X3) = 2.X1 + 2.X2 + 2.X3 + 2 [and](X1,X2) = 2.X1 + 2.X2 [fSNonEmpty] = 0 [isNat](X) = 0 [plus](X1,X2) = 2.X1 + 2.X2 [s](X) = X + 2 [tt] = 0 [A__U11](X1,X2) = 0 [A__U21](X1,X2,X3) = 2.X3 + 2 [A__AND](X1,X2) = 2.X2 + 1 [A__ISNAT](X) = 1 [A__PLUS](X1,X2) = 2.X1 + 2.X2 [MARK](X) = 2.X + 1 Problem 1: SCC Processor: -> Pairs: A__AND(tt,X:S) -> MARK(X:S) A__ISNAT(plus(V1:S,V2:S)) -> A__AND(a__isNat(V1:S),isNat(V2:S)) A__ISNAT(plus(V1:S,V2:S)) -> A__ISNAT(V1:S) A__ISNAT(s(V1:S)) -> A__ISNAT(V1:S) A__PLUS(N:S,0) -> A__ISNAT(N:S) A__PLUS(N:S,s(M:S)) -> A__U21(a__and(a__isNat(M:S),isNat(N:S)),M:S,N:S) A__PLUS(N:S,s(M:S)) -> A__AND(a__isNat(M:S),isNat(N:S)) A__PLUS(N:S,s(M:S)) -> A__ISNAT(M:S) MARK(U11(X1:S,X2:S)) -> MARK(X1:S) MARK(U21(X1:S,X2:S,X3:S)) -> A__U21(mark(X1:S),X2:S,X3:S) MARK(U21(X1:S,X2:S,X3:S)) -> MARK(X1:S) MARK(and(X1:S,X2:S)) -> A__AND(mark(X1:S),X2:S) MARK(and(X1:S,X2:S)) -> MARK(X1:S) MARK(isNat(X:S)) -> A__ISNAT(X:S) MARK(plus(X1:S,X2:S)) -> A__PLUS(mark(X1:S),mark(X2:S)) MARK(plus(X1:S,X2:S)) -> MARK(X1:S) MARK(plus(X1:S,X2:S)) -> MARK(X2:S) MARK(s(X:S)) -> MARK(X:S) -> Rules: a__U11(tt,N:S) -> mark(N:S) a__U11(X1:S,X2:S) -> U11(X1:S,X2:S) a__U21(tt,M:S,N:S) -> s(a__plus(mark(N:S),mark(M:S))) a__U21(X1:S,X2:S,X3:S) -> U21(X1:S,X2:S,X3:S) a__and(tt,X:S) -> mark(X:S) a__and(X1:S,X2:S) -> and(X1:S,X2:S) a__isNat(0) -> tt a__isNat(plus(V1:S,V2:S)) -> a__and(a__isNat(V1:S),isNat(V2:S)) a__isNat(s(V1:S)) -> a__isNat(V1:S) a__isNat(X:S) -> isNat(X:S) a__plus(N:S,0) -> a__U11(a__isNat(N:S),N:S) a__plus(N:S,s(M:S)) -> a__U21(a__and(a__isNat(M:S),isNat(N:S)),M:S,N:S) a__plus(X1:S,X2:S) -> plus(X1:S,X2:S) mark(0) -> 0 mark(U11(X1:S,X2:S)) -> a__U11(mark(X1:S),X2:S) mark(U21(X1:S,X2:S,X3:S)) -> a__U21(mark(X1:S),X2:S,X3:S) mark(and(X1:S,X2:S)) -> a__and(mark(X1:S),X2:S) mark(isNat(X:S)) -> a__isNat(X:S) mark(plus(X1:S,X2:S)) -> a__plus(mark(X1:S),mark(X2:S)) mark(s(X:S)) -> s(mark(X:S)) mark(tt) -> tt ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: A__AND(tt,X:S) -> MARK(X:S) A__ISNAT(plus(V1:S,V2:S)) -> A__AND(a__isNat(V1:S),isNat(V2:S)) A__ISNAT(plus(V1:S,V2:S)) -> A__ISNAT(V1:S) A__ISNAT(s(V1:S)) -> A__ISNAT(V1:S) A__PLUS(N:S,0) -> A__ISNAT(N:S) A__PLUS(N:S,s(M:S)) -> A__AND(a__isNat(M:S),isNat(N:S)) A__PLUS(N:S,s(M:S)) -> A__ISNAT(M:S) MARK(U11(X1:S,X2:S)) -> MARK(X1:S) MARK(U21(X1:S,X2:S,X3:S)) -> MARK(X1:S) MARK(and(X1:S,X2:S)) -> A__AND(mark(X1:S),X2:S) MARK(and(X1:S,X2:S)) -> MARK(X1:S) MARK(isNat(X:S)) -> A__ISNAT(X:S) MARK(plus(X1:S,X2:S)) -> A__PLUS(mark(X1:S),mark(X2:S)) MARK(plus(X1:S,X2:S)) -> MARK(X1:S) MARK(plus(X1:S,X2:S)) -> MARK(X2:S) MARK(s(X:S)) -> MARK(X:S) ->->-> Rules: a__U11(tt,N:S) -> mark(N:S) a__U11(X1:S,X2:S) -> U11(X1:S,X2:S) a__U21(tt,M:S,N:S) -> s(a__plus(mark(N:S),mark(M:S))) a__U21(X1:S,X2:S,X3:S) -> U21(X1:S,X2:S,X3:S) a__and(tt,X:S) -> mark(X:S) a__and(X1:S,X2:S) -> and(X1:S,X2:S) a__isNat(0) -> tt a__isNat(plus(V1:S,V2:S)) -> a__and(a__isNat(V1:S),isNat(V2:S)) a__isNat(s(V1:S)) -> a__isNat(V1:S) a__isNat(X:S) -> isNat(X:S) a__plus(N:S,0) -> a__U11(a__isNat(N:S),N:S) a__plus(N:S,s(M:S)) -> a__U21(a__and(a__isNat(M:S),isNat(N:S)),M:S,N:S) a__plus(X1:S,X2:S) -> plus(X1:S,X2:S) mark(0) -> 0 mark(U11(X1:S,X2:S)) -> a__U11(mark(X1:S),X2:S) mark(U21(X1:S,X2:S,X3:S)) -> a__U21(mark(X1:S),X2:S,X3:S) mark(and(X1:S,X2:S)) -> a__and(mark(X1:S),X2:S) mark(isNat(X:S)) -> a__isNat(X:S) mark(plus(X1:S,X2:S)) -> a__plus(mark(X1:S),mark(X2:S)) mark(s(X:S)) -> s(mark(X:S)) mark(tt) -> tt Problem 1: Reduction Pairs Processor: -> Pairs: A__AND(tt,X:S) -> MARK(X:S) A__ISNAT(plus(V1:S,V2:S)) -> A__AND(a__isNat(V1:S),isNat(V2:S)) A__ISNAT(plus(V1:S,V2:S)) -> A__ISNAT(V1:S) A__ISNAT(s(V1:S)) -> A__ISNAT(V1:S) A__PLUS(N:S,0) -> A__ISNAT(N:S) A__PLUS(N:S,s(M:S)) -> A__AND(a__isNat(M:S),isNat(N:S)) A__PLUS(N:S,s(M:S)) -> A__ISNAT(M:S) MARK(U11(X1:S,X2:S)) -> MARK(X1:S) MARK(U21(X1:S,X2:S,X3:S)) -> MARK(X1:S) MARK(and(X1:S,X2:S)) -> A__AND(mark(X1:S),X2:S) MARK(and(X1:S,X2:S)) -> MARK(X1:S) MARK(isNat(X:S)) -> A__ISNAT(X:S) MARK(plus(X1:S,X2:S)) -> A__PLUS(mark(X1:S),mark(X2:S)) MARK(plus(X1:S,X2:S)) -> MARK(X1:S) MARK(plus(X1:S,X2:S)) -> MARK(X2:S) MARK(s(X:S)) -> MARK(X:S) -> Rules: a__U11(tt,N:S) -> mark(N:S) a__U11(X1:S,X2:S) -> U11(X1:S,X2:S) a__U21(tt,M:S,N:S) -> s(a__plus(mark(N:S),mark(M:S))) a__U21(X1:S,X2:S,X3:S) -> U21(X1:S,X2:S,X3:S) a__and(tt,X:S) -> mark(X:S) a__and(X1:S,X2:S) -> and(X1:S,X2:S) a__isNat(0) -> tt a__isNat(plus(V1:S,V2:S)) -> a__and(a__isNat(V1:S),isNat(V2:S)) a__isNat(s(V1:S)) -> a__isNat(V1:S) a__isNat(X:S) -> isNat(X:S) a__plus(N:S,0) -> a__U11(a__isNat(N:S),N:S) a__plus(N:S,s(M:S)) -> a__U21(a__and(a__isNat(M:S),isNat(N:S)),M:S,N:S) a__plus(X1:S,X2:S) -> plus(X1:S,X2:S) mark(0) -> 0 mark(U11(X1:S,X2:S)) -> a__U11(mark(X1:S),X2:S) mark(U21(X1:S,X2:S,X3:S)) -> a__U21(mark(X1:S),X2:S,X3:S) mark(and(X1:S,X2:S)) -> a__and(mark(X1:S),X2:S) mark(isNat(X:S)) -> a__isNat(X:S) mark(plus(X1:S,X2:S)) -> a__plus(mark(X1:S),mark(X2:S)) mark(s(X:S)) -> s(mark(X:S)) mark(tt) -> tt -> Usable rules: a__U11(tt,N:S) -> mark(N:S) a__U11(X1:S,X2:S) -> U11(X1:S,X2:S) a__U21(tt,M:S,N:S) -> s(a__plus(mark(N:S),mark(M:S))) a__U21(X1:S,X2:S,X3:S) -> U21(X1:S,X2:S,X3:S) a__and(tt,X:S) -> mark(X:S) a__and(X1:S,X2:S) -> and(X1:S,X2:S) a__isNat(0) -> tt a__isNat(plus(V1:S,V2:S)) -> a__and(a__isNat(V1:S),isNat(V2:S)) a__isNat(s(V1:S)) -> a__isNat(V1:S) a__isNat(X:S) -> isNat(X:S) a__plus(N:S,0) -> a__U11(a__isNat(N:S),N:S) a__plus(N:S,s(M:S)) -> a__U21(a__and(a__isNat(M:S),isNat(N:S)),M:S,N:S) a__plus(X1:S,X2:S) -> plus(X1:S,X2:S) mark(0) -> 0 mark(U11(X1:S,X2:S)) -> a__U11(mark(X1:S),X2:S) mark(U21(X1:S,X2:S,X3:S)) -> a__U21(mark(X1:S),X2:S,X3:S) mark(and(X1:S,X2:S)) -> a__and(mark(X1:S),X2:S) mark(isNat(X:S)) -> a__isNat(X:S) mark(plus(X1:S,X2:S)) -> a__plus(mark(X1:S),mark(X2:S)) mark(s(X:S)) -> s(mark(X:S)) mark(tt) -> tt ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [a__U11](X1,X2) = X1 + 2.X2 + 1 [a__U21](X1,X2,X3) = 2.X1 + 2.X2 + 2.X3 + 2 [a__and](X1,X2) = 2.X1 + X2 [a__isNat](X) = 0 [a__plus](X1,X2) = 2.X1 + 2.X2 + 2 [mark](X) = X [0] = 2 [U11](X1,X2) = X1 + 2.X2 + 1 [U21](X1,X2,X3) = 2.X1 + 2.X2 + 2.X3 + 2 [and](X1,X2) = 2.X1 + X2 [fSNonEmpty] = 0 [isNat](X) = 0 [plus](X1,X2) = 2.X1 + 2.X2 + 2 [s](X) = X [tt] = 0 [A__U11](X1,X2) = 0 [A__U21](X1,X2,X3) = 0 [A__AND](X1,X2) = 2.X1 + 2.X2 + 2 [A__ISNAT](X) = 2 [A__PLUS](X1,X2) = 2.X1 + X2 + 2 [MARK](X) = 2.X + 2 Problem 1: SCC Processor: -> Pairs: A__AND(tt,X:S) -> MARK(X:S) A__ISNAT(plus(V1:S,V2:S)) -> A__AND(a__isNat(V1:S),isNat(V2:S)) A__ISNAT(plus(V1:S,V2:S)) -> A__ISNAT(V1:S) A__ISNAT(s(V1:S)) -> A__ISNAT(V1:S) A__PLUS(N:S,s(M:S)) -> A__AND(a__isNat(M:S),isNat(N:S)) A__PLUS(N:S,s(M:S)) -> A__ISNAT(M:S) MARK(U11(X1:S,X2:S)) -> MARK(X1:S) MARK(U21(X1:S,X2:S,X3:S)) -> MARK(X1:S) MARK(and(X1:S,X2:S)) -> A__AND(mark(X1:S),X2:S) MARK(and(X1:S,X2:S)) -> MARK(X1:S) MARK(isNat(X:S)) -> A__ISNAT(X:S) MARK(plus(X1:S,X2:S)) -> A__PLUS(mark(X1:S),mark(X2:S)) MARK(plus(X1:S,X2:S)) -> MARK(X1:S) MARK(plus(X1:S,X2:S)) -> MARK(X2:S) MARK(s(X:S)) -> MARK(X:S) -> Rules: a__U11(tt,N:S) -> mark(N:S) a__U11(X1:S,X2:S) -> U11(X1:S,X2:S) a__U21(tt,M:S,N:S) -> s(a__plus(mark(N:S),mark(M:S))) a__U21(X1:S,X2:S,X3:S) -> U21(X1:S,X2:S,X3:S) a__and(tt,X:S) -> mark(X:S) a__and(X1:S,X2:S) -> and(X1:S,X2:S) a__isNat(0) -> tt a__isNat(plus(V1:S,V2:S)) -> a__and(a__isNat(V1:S),isNat(V2:S)) a__isNat(s(V1:S)) -> a__isNat(V1:S) a__isNat(X:S) -> isNat(X:S) a__plus(N:S,0) -> a__U11(a__isNat(N:S),N:S) a__plus(N:S,s(M:S)) -> a__U21(a__and(a__isNat(M:S),isNat(N:S)),M:S,N:S) a__plus(X1:S,X2:S) -> plus(X1:S,X2:S) mark(0) -> 0 mark(U11(X1:S,X2:S)) -> a__U11(mark(X1:S),X2:S) mark(U21(X1:S,X2:S,X3:S)) -> a__U21(mark(X1:S),X2:S,X3:S) mark(and(X1:S,X2:S)) -> a__and(mark(X1:S),X2:S) mark(isNat(X:S)) -> a__isNat(X:S) mark(plus(X1:S,X2:S)) -> a__plus(mark(X1:S),mark(X2:S)) mark(s(X:S)) -> s(mark(X:S)) mark(tt) -> tt ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: A__AND(tt,X:S) -> MARK(X:S) A__ISNAT(plus(V1:S,V2:S)) -> A__AND(a__isNat(V1:S),isNat(V2:S)) A__ISNAT(plus(V1:S,V2:S)) -> A__ISNAT(V1:S) A__ISNAT(s(V1:S)) -> A__ISNAT(V1:S) A__PLUS(N:S,s(M:S)) -> A__AND(a__isNat(M:S),isNat(N:S)) A__PLUS(N:S,s(M:S)) -> A__ISNAT(M:S) MARK(U11(X1:S,X2:S)) -> MARK(X1:S) MARK(U21(X1:S,X2:S,X3:S)) -> MARK(X1:S) MARK(and(X1:S,X2:S)) -> A__AND(mark(X1:S),X2:S) MARK(and(X1:S,X2:S)) -> MARK(X1:S) MARK(isNat(X:S)) -> A__ISNAT(X:S) MARK(plus(X1:S,X2:S)) -> A__PLUS(mark(X1:S),mark(X2:S)) MARK(plus(X1:S,X2:S)) -> MARK(X1:S) MARK(plus(X1:S,X2:S)) -> MARK(X2:S) MARK(s(X:S)) -> MARK(X:S) ->->-> Rules: a__U11(tt,N:S) -> mark(N:S) a__U11(X1:S,X2:S) -> U11(X1:S,X2:S) a__U21(tt,M:S,N:S) -> s(a__plus(mark(N:S),mark(M:S))) a__U21(X1:S,X2:S,X3:S) -> U21(X1:S,X2:S,X3:S) a__and(tt,X:S) -> mark(X:S) a__and(X1:S,X2:S) -> and(X1:S,X2:S) a__isNat(0) -> tt a__isNat(plus(V1:S,V2:S)) -> a__and(a__isNat(V1:S),isNat(V2:S)) a__isNat(s(V1:S)) -> a__isNat(V1:S) a__isNat(X:S) -> isNat(X:S) a__plus(N:S,0) -> a__U11(a__isNat(N:S),N:S) a__plus(N:S,s(M:S)) -> a__U21(a__and(a__isNat(M:S),isNat(N:S)),M:S,N:S) a__plus(X1:S,X2:S) -> plus(X1:S,X2:S) mark(0) -> 0 mark(U11(X1:S,X2:S)) -> a__U11(mark(X1:S),X2:S) mark(U21(X1:S,X2:S,X3:S)) -> a__U21(mark(X1:S),X2:S,X3:S) mark(and(X1:S,X2:S)) -> a__and(mark(X1:S),X2:S) mark(isNat(X:S)) -> a__isNat(X:S) mark(plus(X1:S,X2:S)) -> a__plus(mark(X1:S),mark(X2:S)) mark(s(X:S)) -> s(mark(X:S)) mark(tt) -> tt Problem 1: Reduction Pairs Processor: -> Pairs: A__AND(tt,X:S) -> MARK(X:S) A__ISNAT(plus(V1:S,V2:S)) -> A__AND(a__isNat(V1:S),isNat(V2:S)) A__ISNAT(plus(V1:S,V2:S)) -> A__ISNAT(V1:S) A__ISNAT(s(V1:S)) -> A__ISNAT(V1:S) A__PLUS(N:S,s(M:S)) -> A__AND(a__isNat(M:S),isNat(N:S)) A__PLUS(N:S,s(M:S)) -> A__ISNAT(M:S) MARK(U11(X1:S,X2:S)) -> MARK(X1:S) MARK(U21(X1:S,X2:S,X3:S)) -> MARK(X1:S) MARK(and(X1:S,X2:S)) -> A__AND(mark(X1:S),X2:S) MARK(and(X1:S,X2:S)) -> MARK(X1:S) MARK(isNat(X:S)) -> A__ISNAT(X:S) MARK(plus(X1:S,X2:S)) -> A__PLUS(mark(X1:S),mark(X2:S)) MARK(plus(X1:S,X2:S)) -> MARK(X1:S) MARK(plus(X1:S,X2:S)) -> MARK(X2:S) MARK(s(X:S)) -> MARK(X:S) -> Rules: a__U11(tt,N:S) -> mark(N:S) a__U11(X1:S,X2:S) -> U11(X1:S,X2:S) a__U21(tt,M:S,N:S) -> s(a__plus(mark(N:S),mark(M:S))) a__U21(X1:S,X2:S,X3:S) -> U21(X1:S,X2:S,X3:S) a__and(tt,X:S) -> mark(X:S) a__and(X1:S,X2:S) -> and(X1:S,X2:S) a__isNat(0) -> tt a__isNat(plus(V1:S,V2:S)) -> a__and(a__isNat(V1:S),isNat(V2:S)) a__isNat(s(V1:S)) -> a__isNat(V1:S) a__isNat(X:S) -> isNat(X:S) a__plus(N:S,0) -> a__U11(a__isNat(N:S),N:S) a__plus(N:S,s(M:S)) -> a__U21(a__and(a__isNat(M:S),isNat(N:S)),M:S,N:S) a__plus(X1:S,X2:S) -> plus(X1:S,X2:S) mark(0) -> 0 mark(U11(X1:S,X2:S)) -> a__U11(mark(X1:S),X2:S) mark(U21(X1:S,X2:S,X3:S)) -> a__U21(mark(X1:S),X2:S,X3:S) mark(and(X1:S,X2:S)) -> a__and(mark(X1:S),X2:S) mark(isNat(X:S)) -> a__isNat(X:S) mark(plus(X1:S,X2:S)) -> a__plus(mark(X1:S),mark(X2:S)) mark(s(X:S)) -> s(mark(X:S)) mark(tt) -> tt -> Usable rules: a__U11(tt,N:S) -> mark(N:S) a__U11(X1:S,X2:S) -> U11(X1:S,X2:S) a__U21(tt,M:S,N:S) -> s(a__plus(mark(N:S),mark(M:S))) a__U21(X1:S,X2:S,X3:S) -> U21(X1:S,X2:S,X3:S) a__and(tt,X:S) -> mark(X:S) a__and(X1:S,X2:S) -> and(X1:S,X2:S) a__isNat(0) -> tt a__isNat(plus(V1:S,V2:S)) -> a__and(a__isNat(V1:S),isNat(V2:S)) a__isNat(s(V1:S)) -> a__isNat(V1:S) a__isNat(X:S) -> isNat(X:S) a__plus(N:S,0) -> a__U11(a__isNat(N:S),N:S) a__plus(N:S,s(M:S)) -> a__U21(a__and(a__isNat(M:S),isNat(N:S)),M:S,N:S) a__plus(X1:S,X2:S) -> plus(X1:S,X2:S) mark(0) -> 0 mark(U11(X1:S,X2:S)) -> a__U11(mark(X1:S),X2:S) mark(U21(X1:S,X2:S,X3:S)) -> a__U21(mark(X1:S),X2:S,X3:S) mark(and(X1:S,X2:S)) -> a__and(mark(X1:S),X2:S) mark(isNat(X:S)) -> a__isNat(X:S) mark(plus(X1:S,X2:S)) -> a__plus(mark(X1:S),mark(X2:S)) mark(s(X:S)) -> s(mark(X:S)) mark(tt) -> tt ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [a__U11](X1,X2) = 2.X1 + 2.X2 + 2 [a__U21](X1,X2,X3) = 2.X1 + 2.X2 + 2.X3 + 2 [a__and](X1,X2) = X1 + 2.X2 [a__isNat](X) = 0 [a__plus](X1,X2) = 2.X1 + 2.X2 + 1 [mark](X) = X [0] = 1 [U11](X1,X2) = 2.X1 + 2.X2 + 2 [U21](X1,X2,X3) = 2.X1 + 2.X2 + 2.X3 + 2 [and](X1,X2) = X1 + 2.X2 [fSNonEmpty] = 0 [isNat](X) = 0 [plus](X1,X2) = 2.X1 + 2.X2 + 1 [s](X) = X + 1 [tt] = 0 [A__U11](X1,X2) = 0 [A__U21](X1,X2,X3) = 0 [A__AND](X1,X2) = X1 + 2.X2 + 2 [A__ISNAT](X) = 2 [A__PLUS](X1,X2) = X2 + 2 [MARK](X) = 2.X + 2 Problem 1: SCC Processor: -> Pairs: A__AND(tt,X:S) -> MARK(X:S) A__ISNAT(plus(V1:S,V2:S)) -> A__AND(a__isNat(V1:S),isNat(V2:S)) A__ISNAT(plus(V1:S,V2:S)) -> A__ISNAT(V1:S) A__ISNAT(s(V1:S)) -> A__ISNAT(V1:S) A__PLUS(N:S,s(M:S)) -> A__ISNAT(M:S) MARK(U11(X1:S,X2:S)) -> MARK(X1:S) MARK(U21(X1:S,X2:S,X3:S)) -> MARK(X1:S) MARK(and(X1:S,X2:S)) -> A__AND(mark(X1:S),X2:S) MARK(and(X1:S,X2:S)) -> MARK(X1:S) MARK(isNat(X:S)) -> A__ISNAT(X:S) MARK(plus(X1:S,X2:S)) -> A__PLUS(mark(X1:S),mark(X2:S)) MARK(plus(X1:S,X2:S)) -> MARK(X1:S) MARK(plus(X1:S,X2:S)) -> MARK(X2:S) MARK(s(X:S)) -> MARK(X:S) -> Rules: a__U11(tt,N:S) -> mark(N:S) a__U11(X1:S,X2:S) -> U11(X1:S,X2:S) a__U21(tt,M:S,N:S) -> s(a__plus(mark(N:S),mark(M:S))) a__U21(X1:S,X2:S,X3:S) -> U21(X1:S,X2:S,X3:S) a__and(tt,X:S) -> mark(X:S) a__and(X1:S,X2:S) -> and(X1:S,X2:S) a__isNat(0) -> tt a__isNat(plus(V1:S,V2:S)) -> a__and(a__isNat(V1:S),isNat(V2:S)) a__isNat(s(V1:S)) -> a__isNat(V1:S) a__isNat(X:S) -> isNat(X:S) a__plus(N:S,0) -> a__U11(a__isNat(N:S),N:S) a__plus(N:S,s(M:S)) -> a__U21(a__and(a__isNat(M:S),isNat(N:S)),M:S,N:S) a__plus(X1:S,X2:S) -> plus(X1:S,X2:S) mark(0) -> 0 mark(U11(X1:S,X2:S)) -> a__U11(mark(X1:S),X2:S) mark(U21(X1:S,X2:S,X3:S)) -> a__U21(mark(X1:S),X2:S,X3:S) mark(and(X1:S,X2:S)) -> a__and(mark(X1:S),X2:S) mark(isNat(X:S)) -> a__isNat(X:S) mark(plus(X1:S,X2:S)) -> a__plus(mark(X1:S),mark(X2:S)) mark(s(X:S)) -> s(mark(X:S)) mark(tt) -> tt ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: A__AND(tt,X:S) -> MARK(X:S) A__ISNAT(plus(V1:S,V2:S)) -> A__AND(a__isNat(V1:S),isNat(V2:S)) A__ISNAT(plus(V1:S,V2:S)) -> A__ISNAT(V1:S) A__ISNAT(s(V1:S)) -> A__ISNAT(V1:S) A__PLUS(N:S,s(M:S)) -> A__ISNAT(M:S) MARK(U11(X1:S,X2:S)) -> MARK(X1:S) MARK(U21(X1:S,X2:S,X3:S)) -> MARK(X1:S) MARK(and(X1:S,X2:S)) -> A__AND(mark(X1:S),X2:S) MARK(and(X1:S,X2:S)) -> MARK(X1:S) MARK(isNat(X:S)) -> A__ISNAT(X:S) MARK(plus(X1:S,X2:S)) -> A__PLUS(mark(X1:S),mark(X2:S)) MARK(plus(X1:S,X2:S)) -> MARK(X1:S) MARK(plus(X1:S,X2:S)) -> MARK(X2:S) MARK(s(X:S)) -> MARK(X:S) ->->-> Rules: a__U11(tt,N:S) -> mark(N:S) a__U11(X1:S,X2:S) -> U11(X1:S,X2:S) a__U21(tt,M:S,N:S) -> s(a__plus(mark(N:S),mark(M:S))) a__U21(X1:S,X2:S,X3:S) -> U21(X1:S,X2:S,X3:S) a__and(tt,X:S) -> mark(X:S) a__and(X1:S,X2:S) -> and(X1:S,X2:S) a__isNat(0) -> tt a__isNat(plus(V1:S,V2:S)) -> a__and(a__isNat(V1:S),isNat(V2:S)) a__isNat(s(V1:S)) -> a__isNat(V1:S) a__isNat(X:S) -> isNat(X:S) a__plus(N:S,0) -> a__U11(a__isNat(N:S),N:S) a__plus(N:S,s(M:S)) -> a__U21(a__and(a__isNat(M:S),isNat(N:S)),M:S,N:S) a__plus(X1:S,X2:S) -> plus(X1:S,X2:S) mark(0) -> 0 mark(U11(X1:S,X2:S)) -> a__U11(mark(X1:S),X2:S) mark(U21(X1:S,X2:S,X3:S)) -> a__U21(mark(X1:S),X2:S,X3:S) mark(and(X1:S,X2:S)) -> a__and(mark(X1:S),X2:S) mark(isNat(X:S)) -> a__isNat(X:S) mark(plus(X1:S,X2:S)) -> a__plus(mark(X1:S),mark(X2:S)) mark(s(X:S)) -> s(mark(X:S)) mark(tt) -> tt Problem 1: Reduction Pairs Processor: -> Pairs: A__AND(tt,X:S) -> MARK(X:S) A__ISNAT(plus(V1:S,V2:S)) -> A__AND(a__isNat(V1:S),isNat(V2:S)) A__ISNAT(plus(V1:S,V2:S)) -> A__ISNAT(V1:S) A__ISNAT(s(V1:S)) -> A__ISNAT(V1:S) A__PLUS(N:S,s(M:S)) -> A__ISNAT(M:S) MARK(U11(X1:S,X2:S)) -> MARK(X1:S) MARK(U21(X1:S,X2:S,X3:S)) -> MARK(X1:S) MARK(and(X1:S,X2:S)) -> A__AND(mark(X1:S),X2:S) MARK(and(X1:S,X2:S)) -> MARK(X1:S) MARK(isNat(X:S)) -> A__ISNAT(X:S) MARK(plus(X1:S,X2:S)) -> A__PLUS(mark(X1:S),mark(X2:S)) MARK(plus(X1:S,X2:S)) -> MARK(X1:S) MARK(plus(X1:S,X2:S)) -> MARK(X2:S) MARK(s(X:S)) -> MARK(X:S) -> Rules: a__U11(tt,N:S) -> mark(N:S) a__U11(X1:S,X2:S) -> U11(X1:S,X2:S) a__U21(tt,M:S,N:S) -> s(a__plus(mark(N:S),mark(M:S))) a__U21(X1:S,X2:S,X3:S) -> U21(X1:S,X2:S,X3:S) a__and(tt,X:S) -> mark(X:S) a__and(X1:S,X2:S) -> and(X1:S,X2:S) a__isNat(0) -> tt a__isNat(plus(V1:S,V2:S)) -> a__and(a__isNat(V1:S),isNat(V2:S)) a__isNat(s(V1:S)) -> a__isNat(V1:S) a__isNat(X:S) -> isNat(X:S) a__plus(N:S,0) -> a__U11(a__isNat(N:S),N:S) a__plus(N:S,s(M:S)) -> a__U21(a__and(a__isNat(M:S),isNat(N:S)),M:S,N:S) a__plus(X1:S,X2:S) -> plus(X1:S,X2:S) mark(0) -> 0 mark(U11(X1:S,X2:S)) -> a__U11(mark(X1:S),X2:S) mark(U21(X1:S,X2:S,X3:S)) -> a__U21(mark(X1:S),X2:S,X3:S) mark(and(X1:S,X2:S)) -> a__and(mark(X1:S),X2:S) mark(isNat(X:S)) -> a__isNat(X:S) mark(plus(X1:S,X2:S)) -> a__plus(mark(X1:S),mark(X2:S)) mark(s(X:S)) -> s(mark(X:S)) mark(tt) -> tt -> Usable rules: a__U11(tt,N:S) -> mark(N:S) a__U11(X1:S,X2:S) -> U11(X1:S,X2:S) a__U21(tt,M:S,N:S) -> s(a__plus(mark(N:S),mark(M:S))) a__U21(X1:S,X2:S,X3:S) -> U21(X1:S,X2:S,X3:S) a__and(tt,X:S) -> mark(X:S) a__and(X1:S,X2:S) -> and(X1:S,X2:S) a__isNat(0) -> tt a__isNat(plus(V1:S,V2:S)) -> a__and(a__isNat(V1:S),isNat(V2:S)) a__isNat(s(V1:S)) -> a__isNat(V1:S) a__isNat(X:S) -> isNat(X:S) a__plus(N:S,0) -> a__U11(a__isNat(N:S),N:S) a__plus(N:S,s(M:S)) -> a__U21(a__and(a__isNat(M:S),isNat(N:S)),M:S,N:S) a__plus(X1:S,X2:S) -> plus(X1:S,X2:S) mark(0) -> 0 mark(U11(X1:S,X2:S)) -> a__U11(mark(X1:S),X2:S) mark(U21(X1:S,X2:S,X3:S)) -> a__U21(mark(X1:S),X2:S,X3:S) mark(and(X1:S,X2:S)) -> a__and(mark(X1:S),X2:S) mark(isNat(X:S)) -> a__isNat(X:S) mark(plus(X1:S,X2:S)) -> a__plus(mark(X1:S),mark(X2:S)) mark(s(X:S)) -> s(mark(X:S)) mark(tt) -> tt ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [a__U11](X1,X2) = X1 + 2.X2 + 1 [a__U21](X1,X2,X3) = 2.X1 + 2.X2 + 2.X3 + 2 [a__and](X1,X2) = X1 + X2 [a__isNat](X) = 0 [a__plus](X1,X2) = 2.X1 + 2.X2 + 1 [mark](X) = X [0] = 2 [U11](X1,X2) = X1 + 2.X2 + 1 [U21](X1,X2,X3) = 2.X1 + 2.X2 + 2.X3 + 2 [and](X1,X2) = X1 + X2 [fSNonEmpty] = 0 [isNat](X) = 0 [plus](X1,X2) = 2.X1 + 2.X2 + 1 [s](X) = X + 1 [tt] = 0 [A__U11](X1,X2) = 0 [A__U21](X1,X2,X3) = 0 [A__AND](X1,X2) = 2.X2 [A__ISNAT](X) = 0 [A__PLUS](X1,X2) = 2.X2 + 2 [MARK](X) = 2.X Problem 1: SCC Processor: -> Pairs: A__AND(tt,X:S) -> MARK(X:S) A__ISNAT(plus(V1:S,V2:S)) -> A__AND(a__isNat(V1:S),isNat(V2:S)) A__ISNAT(plus(V1:S,V2:S)) -> A__ISNAT(V1:S) A__ISNAT(s(V1:S)) -> A__ISNAT(V1:S) MARK(U11(X1:S,X2:S)) -> MARK(X1:S) MARK(U21(X1:S,X2:S,X3:S)) -> MARK(X1:S) MARK(and(X1:S,X2:S)) -> A__AND(mark(X1:S),X2:S) MARK(and(X1:S,X2:S)) -> MARK(X1:S) MARK(isNat(X:S)) -> A__ISNAT(X:S) MARK(plus(X1:S,X2:S)) -> A__PLUS(mark(X1:S),mark(X2:S)) MARK(plus(X1:S,X2:S)) -> MARK(X1:S) MARK(plus(X1:S,X2:S)) -> MARK(X2:S) MARK(s(X:S)) -> MARK(X:S) -> Rules: a__U11(tt,N:S) -> mark(N:S) a__U11(X1:S,X2:S) -> U11(X1:S,X2:S) a__U21(tt,M:S,N:S) -> s(a__plus(mark(N:S),mark(M:S))) a__U21(X1:S,X2:S,X3:S) -> U21(X1:S,X2:S,X3:S) a__and(tt,X:S) -> mark(X:S) a__and(X1:S,X2:S) -> and(X1:S,X2:S) a__isNat(0) -> tt a__isNat(plus(V1:S,V2:S)) -> a__and(a__isNat(V1:S),isNat(V2:S)) a__isNat(s(V1:S)) -> a__isNat(V1:S) a__isNat(X:S) -> isNat(X:S) a__plus(N:S,0) -> a__U11(a__isNat(N:S),N:S) a__plus(N:S,s(M:S)) -> a__U21(a__and(a__isNat(M:S),isNat(N:S)),M:S,N:S) a__plus(X1:S,X2:S) -> plus(X1:S,X2:S) mark(0) -> 0 mark(U11(X1:S,X2:S)) -> a__U11(mark(X1:S),X2:S) mark(U21(X1:S,X2:S,X3:S)) -> a__U21(mark(X1:S),X2:S,X3:S) mark(and(X1:S,X2:S)) -> a__and(mark(X1:S),X2:S) mark(isNat(X:S)) -> a__isNat(X:S) mark(plus(X1:S,X2:S)) -> a__plus(mark(X1:S),mark(X2:S)) mark(s(X:S)) -> s(mark(X:S)) mark(tt) -> tt ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: A__AND(tt,X:S) -> MARK(X:S) A__ISNAT(plus(V1:S,V2:S)) -> A__AND(a__isNat(V1:S),isNat(V2:S)) A__ISNAT(plus(V1:S,V2:S)) -> A__ISNAT(V1:S) A__ISNAT(s(V1:S)) -> A__ISNAT(V1:S) MARK(U11(X1:S,X2:S)) -> MARK(X1:S) MARK(U21(X1:S,X2:S,X3:S)) -> MARK(X1:S) MARK(and(X1:S,X2:S)) -> A__AND(mark(X1:S),X2:S) MARK(and(X1:S,X2:S)) -> MARK(X1:S) MARK(isNat(X:S)) -> A__ISNAT(X:S) MARK(plus(X1:S,X2:S)) -> MARK(X1:S) MARK(plus(X1:S,X2:S)) -> MARK(X2:S) MARK(s(X:S)) -> MARK(X:S) ->->-> Rules: a__U11(tt,N:S) -> mark(N:S) a__U11(X1:S,X2:S) -> U11(X1:S,X2:S) a__U21(tt,M:S,N:S) -> s(a__plus(mark(N:S),mark(M:S))) a__U21(X1:S,X2:S,X3:S) -> U21(X1:S,X2:S,X3:S) a__and(tt,X:S) -> mark(X:S) a__and(X1:S,X2:S) -> and(X1:S,X2:S) a__isNat(0) -> tt a__isNat(plus(V1:S,V2:S)) -> a__and(a__isNat(V1:S),isNat(V2:S)) a__isNat(s(V1:S)) -> a__isNat(V1:S) a__isNat(X:S) -> isNat(X:S) a__plus(N:S,0) -> a__U11(a__isNat(N:S),N:S) a__plus(N:S,s(M:S)) -> a__U21(a__and(a__isNat(M:S),isNat(N:S)),M:S,N:S) a__plus(X1:S,X2:S) -> plus(X1:S,X2:S) mark(0) -> 0 mark(U11(X1:S,X2:S)) -> a__U11(mark(X1:S),X2:S) mark(U21(X1:S,X2:S,X3:S)) -> a__U21(mark(X1:S),X2:S,X3:S) mark(and(X1:S,X2:S)) -> a__and(mark(X1:S),X2:S) mark(isNat(X:S)) -> a__isNat(X:S) mark(plus(X1:S,X2:S)) -> a__plus(mark(X1:S),mark(X2:S)) mark(s(X:S)) -> s(mark(X:S)) mark(tt) -> tt Problem 1: Reduction Pairs Processor: -> Pairs: A__AND(tt,X:S) -> MARK(X:S) A__ISNAT(plus(V1:S,V2:S)) -> A__AND(a__isNat(V1:S),isNat(V2:S)) A__ISNAT(plus(V1:S,V2:S)) -> A__ISNAT(V1:S) A__ISNAT(s(V1:S)) -> A__ISNAT(V1:S) MARK(U11(X1:S,X2:S)) -> MARK(X1:S) MARK(U21(X1:S,X2:S,X3:S)) -> MARK(X1:S) MARK(and(X1:S,X2:S)) -> A__AND(mark(X1:S),X2:S) MARK(and(X1:S,X2:S)) -> MARK(X1:S) MARK(isNat(X:S)) -> A__ISNAT(X:S) MARK(plus(X1:S,X2:S)) -> MARK(X1:S) MARK(plus(X1:S,X2:S)) -> MARK(X2:S) MARK(s(X:S)) -> MARK(X:S) -> Rules: a__U11(tt,N:S) -> mark(N:S) a__U11(X1:S,X2:S) -> U11(X1:S,X2:S) a__U21(tt,M:S,N:S) -> s(a__plus(mark(N:S),mark(M:S))) a__U21(X1:S,X2:S,X3:S) -> U21(X1:S,X2:S,X3:S) a__and(tt,X:S) -> mark(X:S) a__and(X1:S,X2:S) -> and(X1:S,X2:S) a__isNat(0) -> tt a__isNat(plus(V1:S,V2:S)) -> a__and(a__isNat(V1:S),isNat(V2:S)) a__isNat(s(V1:S)) -> a__isNat(V1:S) a__isNat(X:S) -> isNat(X:S) a__plus(N:S,0) -> a__U11(a__isNat(N:S),N:S) a__plus(N:S,s(M:S)) -> a__U21(a__and(a__isNat(M:S),isNat(N:S)),M:S,N:S) a__plus(X1:S,X2:S) -> plus(X1:S,X2:S) mark(0) -> 0 mark(U11(X1:S,X2:S)) -> a__U11(mark(X1:S),X2:S) mark(U21(X1:S,X2:S,X3:S)) -> a__U21(mark(X1:S),X2:S,X3:S) mark(and(X1:S,X2:S)) -> a__and(mark(X1:S),X2:S) mark(isNat(X:S)) -> a__isNat(X:S) mark(plus(X1:S,X2:S)) -> a__plus(mark(X1:S),mark(X2:S)) mark(s(X:S)) -> s(mark(X:S)) mark(tt) -> tt -> Usable rules: a__U11(tt,N:S) -> mark(N:S) a__U11(X1:S,X2:S) -> U11(X1:S,X2:S) a__U21(tt,M:S,N:S) -> s(a__plus(mark(N:S),mark(M:S))) a__U21(X1:S,X2:S,X3:S) -> U21(X1:S,X2:S,X3:S) a__and(tt,X:S) -> mark(X:S) a__and(X1:S,X2:S) -> and(X1:S,X2:S) a__isNat(0) -> tt a__isNat(plus(V1:S,V2:S)) -> a__and(a__isNat(V1:S),isNat(V2:S)) a__isNat(s(V1:S)) -> a__isNat(V1:S) a__isNat(X:S) -> isNat(X:S) a__plus(N:S,0) -> a__U11(a__isNat(N:S),N:S) a__plus(N:S,s(M:S)) -> a__U21(a__and(a__isNat(M:S),isNat(N:S)),M:S,N:S) a__plus(X1:S,X2:S) -> plus(X1:S,X2:S) mark(0) -> 0 mark(U11(X1:S,X2:S)) -> a__U11(mark(X1:S),X2:S) mark(U21(X1:S,X2:S,X3:S)) -> a__U21(mark(X1:S),X2:S,X3:S) mark(and(X1:S,X2:S)) -> a__and(mark(X1:S),X2:S) mark(isNat(X:S)) -> a__isNat(X:S) mark(plus(X1:S,X2:S)) -> a__plus(mark(X1:S),mark(X2:S)) mark(s(X:S)) -> s(mark(X:S)) mark(tt) -> tt ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [a__U11](X1,X2) = 2.X1 + X2 + 2 [a__U21](X1,X2,X3) = 2.X1 + 2.X2 + 2.X3 + 2 [a__and](X1,X2) = X1 + 2.X2 [a__isNat](X) = 0 [a__plus](X1,X2) = 2.X1 + 2.X2 + 2 [mark](X) = X [0] = 2 [U11](X1,X2) = 2.X1 + X2 + 2 [U21](X1,X2,X3) = 2.X1 + 2.X2 + 2.X3 + 2 [and](X1,X2) = X1 + 2.X2 [fSNonEmpty] = 0 [isNat](X) = 0 [plus](X1,X2) = 2.X1 + 2.X2 + 2 [s](X) = X [tt] = 0 [A__U11](X1,X2) = 0 [A__U21](X1,X2,X3) = 0 [A__AND](X1,X2) = 2.X1 + 2.X2 + 2 [A__ISNAT](X) = 2 [A__PLUS](X1,X2) = 0 [MARK](X) = 2.X + 2 Problem 1: SCC Processor: -> Pairs: A__AND(tt,X:S) -> MARK(X:S) A__ISNAT(plus(V1:S,V2:S)) -> A__AND(a__isNat(V1:S),isNat(V2:S)) A__ISNAT(plus(V1:S,V2:S)) -> A__ISNAT(V1:S) A__ISNAT(s(V1:S)) -> A__ISNAT(V1:S) MARK(U21(X1:S,X2:S,X3:S)) -> MARK(X1:S) MARK(and(X1:S,X2:S)) -> A__AND(mark(X1:S),X2:S) MARK(and(X1:S,X2:S)) -> MARK(X1:S) MARK(isNat(X:S)) -> A__ISNAT(X:S) MARK(plus(X1:S,X2:S)) -> MARK(X1:S) MARK(plus(X1:S,X2:S)) -> MARK(X2:S) MARK(s(X:S)) -> MARK(X:S) -> Rules: a__U11(tt,N:S) -> mark(N:S) a__U11(X1:S,X2:S) -> U11(X1:S,X2:S) a__U21(tt,M:S,N:S) -> s(a__plus(mark(N:S),mark(M:S))) a__U21(X1:S,X2:S,X3:S) -> U21(X1:S,X2:S,X3:S) a__and(tt,X:S) -> mark(X:S) a__and(X1:S,X2:S) -> and(X1:S,X2:S) a__isNat(0) -> tt a__isNat(plus(V1:S,V2:S)) -> a__and(a__isNat(V1:S),isNat(V2:S)) a__isNat(s(V1:S)) -> a__isNat(V1:S) a__isNat(X:S) -> isNat(X:S) a__plus(N:S,0) -> a__U11(a__isNat(N:S),N:S) a__plus(N:S,s(M:S)) -> a__U21(a__and(a__isNat(M:S),isNat(N:S)),M:S,N:S) a__plus(X1:S,X2:S) -> plus(X1:S,X2:S) mark(0) -> 0 mark(U11(X1:S,X2:S)) -> a__U11(mark(X1:S),X2:S) mark(U21(X1:S,X2:S,X3:S)) -> a__U21(mark(X1:S),X2:S,X3:S) mark(and(X1:S,X2:S)) -> a__and(mark(X1:S),X2:S) mark(isNat(X:S)) -> a__isNat(X:S) mark(plus(X1:S,X2:S)) -> a__plus(mark(X1:S),mark(X2:S)) mark(s(X:S)) -> s(mark(X:S)) mark(tt) -> tt ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: A__AND(tt,X:S) -> MARK(X:S) A__ISNAT(plus(V1:S,V2:S)) -> A__AND(a__isNat(V1:S),isNat(V2:S)) A__ISNAT(plus(V1:S,V2:S)) -> A__ISNAT(V1:S) A__ISNAT(s(V1:S)) -> A__ISNAT(V1:S) MARK(U21(X1:S,X2:S,X3:S)) -> MARK(X1:S) MARK(and(X1:S,X2:S)) -> A__AND(mark(X1:S),X2:S) MARK(and(X1:S,X2:S)) -> MARK(X1:S) MARK(isNat(X:S)) -> A__ISNAT(X:S) MARK(plus(X1:S,X2:S)) -> MARK(X1:S) MARK(plus(X1:S,X2:S)) -> MARK(X2:S) MARK(s(X:S)) -> MARK(X:S) ->->-> Rules: a__U11(tt,N:S) -> mark(N:S) a__U11(X1:S,X2:S) -> U11(X1:S,X2:S) a__U21(tt,M:S,N:S) -> s(a__plus(mark(N:S),mark(M:S))) a__U21(X1:S,X2:S,X3:S) -> U21(X1:S,X2:S,X3:S) a__and(tt,X:S) -> mark(X:S) a__and(X1:S,X2:S) -> and(X1:S,X2:S) a__isNat(0) -> tt a__isNat(plus(V1:S,V2:S)) -> a__and(a__isNat(V1:S),isNat(V2:S)) a__isNat(s(V1:S)) -> a__isNat(V1:S) a__isNat(X:S) -> isNat(X:S) a__plus(N:S,0) -> a__U11(a__isNat(N:S),N:S) a__plus(N:S,s(M:S)) -> a__U21(a__and(a__isNat(M:S),isNat(N:S)),M:S,N:S) a__plus(X1:S,X2:S) -> plus(X1:S,X2:S) mark(0) -> 0 mark(U11(X1:S,X2:S)) -> a__U11(mark(X1:S),X2:S) mark(U21(X1:S,X2:S,X3:S)) -> a__U21(mark(X1:S),X2:S,X3:S) mark(and(X1:S,X2:S)) -> a__and(mark(X1:S),X2:S) mark(isNat(X:S)) -> a__isNat(X:S) mark(plus(X1:S,X2:S)) -> a__plus(mark(X1:S),mark(X2:S)) mark(s(X:S)) -> s(mark(X:S)) mark(tt) -> tt Problem 1: Reduction Pairs Processor: -> Pairs: A__AND(tt,X:S) -> MARK(X:S) A__ISNAT(plus(V1:S,V2:S)) -> A__AND(a__isNat(V1:S),isNat(V2:S)) A__ISNAT(plus(V1:S,V2:S)) -> A__ISNAT(V1:S) A__ISNAT(s(V1:S)) -> A__ISNAT(V1:S) MARK(U21(X1:S,X2:S,X3:S)) -> MARK(X1:S) MARK(and(X1:S,X2:S)) -> A__AND(mark(X1:S),X2:S) MARK(and(X1:S,X2:S)) -> MARK(X1:S) MARK(isNat(X:S)) -> A__ISNAT(X:S) MARK(plus(X1:S,X2:S)) -> MARK(X1:S) MARK(plus(X1:S,X2:S)) -> MARK(X2:S) MARK(s(X:S)) -> MARK(X:S) -> Rules: a__U11(tt,N:S) -> mark(N:S) a__U11(X1:S,X2:S) -> U11(X1:S,X2:S) a__U21(tt,M:S,N:S) -> s(a__plus(mark(N:S),mark(M:S))) a__U21(X1:S,X2:S,X3:S) -> U21(X1:S,X2:S,X3:S) a__and(tt,X:S) -> mark(X:S) a__and(X1:S,X2:S) -> and(X1:S,X2:S) a__isNat(0) -> tt a__isNat(plus(V1:S,V2:S)) -> a__and(a__isNat(V1:S),isNat(V2:S)) a__isNat(s(V1:S)) -> a__isNat(V1:S) a__isNat(X:S) -> isNat(X:S) a__plus(N:S,0) -> a__U11(a__isNat(N:S),N:S) a__plus(N:S,s(M:S)) -> a__U21(a__and(a__isNat(M:S),isNat(N:S)),M:S,N:S) a__plus(X1:S,X2:S) -> plus(X1:S,X2:S) mark(0) -> 0 mark(U11(X1:S,X2:S)) -> a__U11(mark(X1:S),X2:S) mark(U21(X1:S,X2:S,X3:S)) -> a__U21(mark(X1:S),X2:S,X3:S) mark(and(X1:S,X2:S)) -> a__and(mark(X1:S),X2:S) mark(isNat(X:S)) -> a__isNat(X:S) mark(plus(X1:S,X2:S)) -> a__plus(mark(X1:S),mark(X2:S)) mark(s(X:S)) -> s(mark(X:S)) mark(tt) -> tt -> Usable rules: a__U11(tt,N:S) -> mark(N:S) a__U11(X1:S,X2:S) -> U11(X1:S,X2:S) a__U21(tt,M:S,N:S) -> s(a__plus(mark(N:S),mark(M:S))) a__U21(X1:S,X2:S,X3:S) -> U21(X1:S,X2:S,X3:S) a__and(tt,X:S) -> mark(X:S) a__and(X1:S,X2:S) -> and(X1:S,X2:S) a__isNat(0) -> tt a__isNat(plus(V1:S,V2:S)) -> a__and(a__isNat(V1:S),isNat(V2:S)) a__isNat(s(V1:S)) -> a__isNat(V1:S) a__isNat(X:S) -> isNat(X:S) a__plus(N:S,0) -> a__U11(a__isNat(N:S),N:S) a__plus(N:S,s(M:S)) -> a__U21(a__and(a__isNat(M:S),isNat(N:S)),M:S,N:S) a__plus(X1:S,X2:S) -> plus(X1:S,X2:S) mark(0) -> 0 mark(U11(X1:S,X2:S)) -> a__U11(mark(X1:S),X2:S) mark(U21(X1:S,X2:S,X3:S)) -> a__U21(mark(X1:S),X2:S,X3:S) mark(and(X1:S,X2:S)) -> a__and(mark(X1:S),X2:S) mark(isNat(X:S)) -> a__isNat(X:S) mark(plus(X1:S,X2:S)) -> a__plus(mark(X1:S),mark(X2:S)) mark(s(X:S)) -> s(mark(X:S)) mark(tt) -> tt ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [a__U11](X1,X2) = 2.X1 + X2 [a__U21](X1,X2,X3) = 2.X1 + 2.X2 + 2.X3 + 2 [a__and](X1,X2) = 2.X1 + 2.X2 [a__isNat](X) = 0 [a__plus](X1,X2) = 2.X1 + 2.X2 [mark](X) = X [0] = 2 [U11](X1,X2) = 2.X1 + X2 [U21](X1,X2,X3) = 2.X1 + 2.X2 + 2.X3 + 2 [and](X1,X2) = 2.X1 + 2.X2 [fSNonEmpty] = 0 [isNat](X) = 0 [plus](X1,X2) = 2.X1 + 2.X2 [s](X) = X + 2 [tt] = 0 [A__U11](X1,X2) = 0 [A__U21](X1,X2,X3) = 0 [A__AND](X1,X2) = 2.X2 [A__ISNAT](X) = 0 [A__PLUS](X1,X2) = 0 [MARK](X) = 2.X Problem 1: SCC Processor: -> Pairs: A__AND(tt,X:S) -> MARK(X:S) A__ISNAT(plus(V1:S,V2:S)) -> A__AND(a__isNat(V1:S),isNat(V2:S)) A__ISNAT(plus(V1:S,V2:S)) -> A__ISNAT(V1:S) A__ISNAT(s(V1:S)) -> A__ISNAT(V1:S) MARK(and(X1:S,X2:S)) -> A__AND(mark(X1:S),X2:S) MARK(and(X1:S,X2:S)) -> MARK(X1:S) MARK(isNat(X:S)) -> A__ISNAT(X:S) MARK(plus(X1:S,X2:S)) -> MARK(X1:S) MARK(plus(X1:S,X2:S)) -> MARK(X2:S) MARK(s(X:S)) -> MARK(X:S) -> Rules: a__U11(tt,N:S) -> mark(N:S) a__U11(X1:S,X2:S) -> U11(X1:S,X2:S) a__U21(tt,M:S,N:S) -> s(a__plus(mark(N:S),mark(M:S))) a__U21(X1:S,X2:S,X3:S) -> U21(X1:S,X2:S,X3:S) a__and(tt,X:S) -> mark(X:S) a__and(X1:S,X2:S) -> and(X1:S,X2:S) a__isNat(0) -> tt a__isNat(plus(V1:S,V2:S)) -> a__and(a__isNat(V1:S),isNat(V2:S)) a__isNat(s(V1:S)) -> a__isNat(V1:S) a__isNat(X:S) -> isNat(X:S) a__plus(N:S,0) -> a__U11(a__isNat(N:S),N:S) a__plus(N:S,s(M:S)) -> a__U21(a__and(a__isNat(M:S),isNat(N:S)),M:S,N:S) a__plus(X1:S,X2:S) -> plus(X1:S,X2:S) mark(0) -> 0 mark(U11(X1:S,X2:S)) -> a__U11(mark(X1:S),X2:S) mark(U21(X1:S,X2:S,X3:S)) -> a__U21(mark(X1:S),X2:S,X3:S) mark(and(X1:S,X2:S)) -> a__and(mark(X1:S),X2:S) mark(isNat(X:S)) -> a__isNat(X:S) mark(plus(X1:S,X2:S)) -> a__plus(mark(X1:S),mark(X2:S)) mark(s(X:S)) -> s(mark(X:S)) mark(tt) -> tt ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: A__AND(tt,X:S) -> MARK(X:S) A__ISNAT(plus(V1:S,V2:S)) -> A__AND(a__isNat(V1:S),isNat(V2:S)) A__ISNAT(plus(V1:S,V2:S)) -> A__ISNAT(V1:S) A__ISNAT(s(V1:S)) -> A__ISNAT(V1:S) MARK(and(X1:S,X2:S)) -> A__AND(mark(X1:S),X2:S) MARK(and(X1:S,X2:S)) -> MARK(X1:S) MARK(isNat(X:S)) -> A__ISNAT(X:S) MARK(plus(X1:S,X2:S)) -> MARK(X1:S) MARK(plus(X1:S,X2:S)) -> MARK(X2:S) MARK(s(X:S)) -> MARK(X:S) ->->-> Rules: a__U11(tt,N:S) -> mark(N:S) a__U11(X1:S,X2:S) -> U11(X1:S,X2:S) a__U21(tt,M:S,N:S) -> s(a__plus(mark(N:S),mark(M:S))) a__U21(X1:S,X2:S,X3:S) -> U21(X1:S,X2:S,X3:S) a__and(tt,X:S) -> mark(X:S) a__and(X1:S,X2:S) -> and(X1:S,X2:S) a__isNat(0) -> tt a__isNat(plus(V1:S,V2:S)) -> a__and(a__isNat(V1:S),isNat(V2:S)) a__isNat(s(V1:S)) -> a__isNat(V1:S) a__isNat(X:S) -> isNat(X:S) a__plus(N:S,0) -> a__U11(a__isNat(N:S),N:S) a__plus(N:S,s(M:S)) -> a__U21(a__and(a__isNat(M:S),isNat(N:S)),M:S,N:S) a__plus(X1:S,X2:S) -> plus(X1:S,X2:S) mark(0) -> 0 mark(U11(X1:S,X2:S)) -> a__U11(mark(X1:S),X2:S) mark(U21(X1:S,X2:S,X3:S)) -> a__U21(mark(X1:S),X2:S,X3:S) mark(and(X1:S,X2:S)) -> a__and(mark(X1:S),X2:S) mark(isNat(X:S)) -> a__isNat(X:S) mark(plus(X1:S,X2:S)) -> a__plus(mark(X1:S),mark(X2:S)) mark(s(X:S)) -> s(mark(X:S)) mark(tt) -> tt Problem 1: Reduction Pairs Processor: -> Pairs: A__AND(tt,X:S) -> MARK(X:S) A__ISNAT(plus(V1:S,V2:S)) -> A__AND(a__isNat(V1:S),isNat(V2:S)) A__ISNAT(plus(V1:S,V2:S)) -> A__ISNAT(V1:S) A__ISNAT(s(V1:S)) -> A__ISNAT(V1:S) MARK(and(X1:S,X2:S)) -> A__AND(mark(X1:S),X2:S) MARK(and(X1:S,X2:S)) -> MARK(X1:S) MARK(isNat(X:S)) -> A__ISNAT(X:S) MARK(plus(X1:S,X2:S)) -> MARK(X1:S) MARK(plus(X1:S,X2:S)) -> MARK(X2:S) MARK(s(X:S)) -> MARK(X:S) -> Rules: a__U11(tt,N:S) -> mark(N:S) a__U11(X1:S,X2:S) -> U11(X1:S,X2:S) a__U21(tt,M:S,N:S) -> s(a__plus(mark(N:S),mark(M:S))) a__U21(X1:S,X2:S,X3:S) -> U21(X1:S,X2:S,X3:S) a__and(tt,X:S) -> mark(X:S) a__and(X1:S,X2:S) -> and(X1:S,X2:S) a__isNat(0) -> tt a__isNat(plus(V1:S,V2:S)) -> a__and(a__isNat(V1:S),isNat(V2:S)) a__isNat(s(V1:S)) -> a__isNat(V1:S) a__isNat(X:S) -> isNat(X:S) a__plus(N:S,0) -> a__U11(a__isNat(N:S),N:S) a__plus(N:S,s(M:S)) -> a__U21(a__and(a__isNat(M:S),isNat(N:S)),M:S,N:S) a__plus(X1:S,X2:S) -> plus(X1:S,X2:S) mark(0) -> 0 mark(U11(X1:S,X2:S)) -> a__U11(mark(X1:S),X2:S) mark(U21(X1:S,X2:S,X3:S)) -> a__U21(mark(X1:S),X2:S,X3:S) mark(and(X1:S,X2:S)) -> a__and(mark(X1:S),X2:S) mark(isNat(X:S)) -> a__isNat(X:S) mark(plus(X1:S,X2:S)) -> a__plus(mark(X1:S),mark(X2:S)) mark(s(X:S)) -> s(mark(X:S)) mark(tt) -> tt -> Usable rules: a__U11(tt,N:S) -> mark(N:S) a__U11(X1:S,X2:S) -> U11(X1:S,X2:S) a__U21(tt,M:S,N:S) -> s(a__plus(mark(N:S),mark(M:S))) a__U21(X1:S,X2:S,X3:S) -> U21(X1:S,X2:S,X3:S) a__and(tt,X:S) -> mark(X:S) a__and(X1:S,X2:S) -> and(X1:S,X2:S) a__isNat(0) -> tt a__isNat(plus(V1:S,V2:S)) -> a__and(a__isNat(V1:S),isNat(V2:S)) a__isNat(s(V1:S)) -> a__isNat(V1:S) a__isNat(X:S) -> isNat(X:S) a__plus(N:S,0) -> a__U11(a__isNat(N:S),N:S) a__plus(N:S,s(M:S)) -> a__U21(a__and(a__isNat(M:S),isNat(N:S)),M:S,N:S) a__plus(X1:S,X2:S) -> plus(X1:S,X2:S) mark(0) -> 0 mark(U11(X1:S,X2:S)) -> a__U11(mark(X1:S),X2:S) mark(U21(X1:S,X2:S,X3:S)) -> a__U21(mark(X1:S),X2:S,X3:S) mark(and(X1:S,X2:S)) -> a__and(mark(X1:S),X2:S) mark(isNat(X:S)) -> a__isNat(X:S) mark(plus(X1:S,X2:S)) -> a__plus(mark(X1:S),mark(X2:S)) mark(s(X:S)) -> s(mark(X:S)) mark(tt) -> tt ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [a__U11](X1,X2) = X2 + 2 [a__U21](X1,X2,X3) = 2.X2 + 2.X3 + 2 [a__and](X1,X2) = 2.X1 + 2.X2 + 1 [a__isNat](X) = 2.X + 1 [a__plus](X1,X2) = 2.X1 + 2.X2 + 2 [mark](X) = X [0] = 2 [U11](X1,X2) = X2 + 2 [U21](X1,X2,X3) = 2.X2 + 2.X3 + 2 [and](X1,X2) = 2.X1 + 2.X2 + 1 [fSNonEmpty] = 0 [isNat](X) = 2.X + 1 [plus](X1,X2) = 2.X1 + 2.X2 + 2 [s](X) = X [tt] = 2 [A__U11](X1,X2) = 0 [A__U21](X1,X2,X3) = 0 [A__AND](X1,X2) = 2.X1 + 2.X2 + 2 [A__ISNAT](X) = 2.X + 2 [A__PLUS](X1,X2) = 0 [MARK](X) = 2.X + 2 Problem 1: SCC Processor: -> Pairs: A__ISNAT(plus(V1:S,V2:S)) -> A__AND(a__isNat(V1:S),isNat(V2:S)) A__ISNAT(plus(V1:S,V2:S)) -> A__ISNAT(V1:S) A__ISNAT(s(V1:S)) -> A__ISNAT(V1:S) MARK(and(X1:S,X2:S)) -> A__AND(mark(X1:S),X2:S) MARK(and(X1:S,X2:S)) -> MARK(X1:S) MARK(isNat(X:S)) -> A__ISNAT(X:S) MARK(plus(X1:S,X2:S)) -> MARK(X1:S) MARK(plus(X1:S,X2:S)) -> MARK(X2:S) MARK(s(X:S)) -> MARK(X:S) -> Rules: a__U11(tt,N:S) -> mark(N:S) a__U11(X1:S,X2:S) -> U11(X1:S,X2:S) a__U21(tt,M:S,N:S) -> s(a__plus(mark(N:S),mark(M:S))) a__U21(X1:S,X2:S,X3:S) -> U21(X1:S,X2:S,X3:S) a__and(tt,X:S) -> mark(X:S) a__and(X1:S,X2:S) -> and(X1:S,X2:S) a__isNat(0) -> tt a__isNat(plus(V1:S,V2:S)) -> a__and(a__isNat(V1:S),isNat(V2:S)) a__isNat(s(V1:S)) -> a__isNat(V1:S) a__isNat(X:S) -> isNat(X:S) a__plus(N:S,0) -> a__U11(a__isNat(N:S),N:S) a__plus(N:S,s(M:S)) -> a__U21(a__and(a__isNat(M:S),isNat(N:S)),M:S,N:S) a__plus(X1:S,X2:S) -> plus(X1:S,X2:S) mark(0) -> 0 mark(U11(X1:S,X2:S)) -> a__U11(mark(X1:S),X2:S) mark(U21(X1:S,X2:S,X3:S)) -> a__U21(mark(X1:S),X2:S,X3:S) mark(and(X1:S,X2:S)) -> a__and(mark(X1:S),X2:S) mark(isNat(X:S)) -> a__isNat(X:S) mark(plus(X1:S,X2:S)) -> a__plus(mark(X1:S),mark(X2:S)) mark(s(X:S)) -> s(mark(X:S)) mark(tt) -> tt ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: A__ISNAT(plus(V1:S,V2:S)) -> A__ISNAT(V1:S) A__ISNAT(s(V1:S)) -> A__ISNAT(V1:S) ->->-> Rules: a__U11(tt,N:S) -> mark(N:S) a__U11(X1:S,X2:S) -> U11(X1:S,X2:S) a__U21(tt,M:S,N:S) -> s(a__plus(mark(N:S),mark(M:S))) a__U21(X1:S,X2:S,X3:S) -> U21(X1:S,X2:S,X3:S) a__and(tt,X:S) -> mark(X:S) a__and(X1:S,X2:S) -> and(X1:S,X2:S) a__isNat(0) -> tt a__isNat(plus(V1:S,V2:S)) -> a__and(a__isNat(V1:S),isNat(V2:S)) a__isNat(s(V1:S)) -> a__isNat(V1:S) a__isNat(X:S) -> isNat(X:S) a__plus(N:S,0) -> a__U11(a__isNat(N:S),N:S) a__plus(N:S,s(M:S)) -> a__U21(a__and(a__isNat(M:S),isNat(N:S)),M:S,N:S) a__plus(X1:S,X2:S) -> plus(X1:S,X2:S) mark(0) -> 0 mark(U11(X1:S,X2:S)) -> a__U11(mark(X1:S),X2:S) mark(U21(X1:S,X2:S,X3:S)) -> a__U21(mark(X1:S),X2:S,X3:S) mark(and(X1:S,X2:S)) -> a__and(mark(X1:S),X2:S) mark(isNat(X:S)) -> a__isNat(X:S) mark(plus(X1:S,X2:S)) -> a__plus(mark(X1:S),mark(X2:S)) mark(s(X:S)) -> s(mark(X:S)) mark(tt) -> tt ->->Cycle: ->->-> Pairs: MARK(and(X1:S,X2:S)) -> MARK(X1:S) MARK(plus(X1:S,X2:S)) -> MARK(X1:S) MARK(plus(X1:S,X2:S)) -> MARK(X2:S) MARK(s(X:S)) -> MARK(X:S) ->->-> Rules: a__U11(tt,N:S) -> mark(N:S) a__U11(X1:S,X2:S) -> U11(X1:S,X2:S) a__U21(tt,M:S,N:S) -> s(a__plus(mark(N:S),mark(M:S))) a__U21(X1:S,X2:S,X3:S) -> U21(X1:S,X2:S,X3:S) a__and(tt,X:S) -> mark(X:S) a__and(X1:S,X2:S) -> and(X1:S,X2:S) a__isNat(0) -> tt a__isNat(plus(V1:S,V2:S)) -> a__and(a__isNat(V1:S),isNat(V2:S)) a__isNat(s(V1:S)) -> a__isNat(V1:S) a__isNat(X:S) -> isNat(X:S) a__plus(N:S,0) -> a__U11(a__isNat(N:S),N:S) a__plus(N:S,s(M:S)) -> a__U21(a__and(a__isNat(M:S),isNat(N:S)),M:S,N:S) a__plus(X1:S,X2:S) -> plus(X1:S,X2:S) mark(0) -> 0 mark(U11(X1:S,X2:S)) -> a__U11(mark(X1:S),X2:S) mark(U21(X1:S,X2:S,X3:S)) -> a__U21(mark(X1:S),X2:S,X3:S) mark(and(X1:S,X2:S)) -> a__and(mark(X1:S),X2:S) mark(isNat(X:S)) -> a__isNat(X:S) mark(plus(X1:S,X2:S)) -> a__plus(mark(X1:S),mark(X2:S)) mark(s(X:S)) -> s(mark(X:S)) mark(tt) -> tt The problem is decomposed in 2 subproblems. Problem 1.1: Subterm Processor: -> Pairs: A__ISNAT(plus(V1:S,V2:S)) -> A__ISNAT(V1:S) A__ISNAT(s(V1:S)) -> A__ISNAT(V1:S) -> Rules: a__U11(tt,N:S) -> mark(N:S) a__U11(X1:S,X2:S) -> U11(X1:S,X2:S) a__U21(tt,M:S,N:S) -> s(a__plus(mark(N:S),mark(M:S))) a__U21(X1:S,X2:S,X3:S) -> U21(X1:S,X2:S,X3:S) a__and(tt,X:S) -> mark(X:S) a__and(X1:S,X2:S) -> and(X1:S,X2:S) a__isNat(0) -> tt a__isNat(plus(V1:S,V2:S)) -> a__and(a__isNat(V1:S),isNat(V2:S)) a__isNat(s(V1:S)) -> a__isNat(V1:S) a__isNat(X:S) -> isNat(X:S) a__plus(N:S,0) -> a__U11(a__isNat(N:S),N:S) a__plus(N:S,s(M:S)) -> a__U21(a__and(a__isNat(M:S),isNat(N:S)),M:S,N:S) a__plus(X1:S,X2:S) -> plus(X1:S,X2:S) mark(0) -> 0 mark(U11(X1:S,X2:S)) -> a__U11(mark(X1:S),X2:S) mark(U21(X1:S,X2:S,X3:S)) -> a__U21(mark(X1:S),X2:S,X3:S) mark(and(X1:S,X2:S)) -> a__and(mark(X1:S),X2:S) mark(isNat(X:S)) -> a__isNat(X:S) mark(plus(X1:S,X2:S)) -> a__plus(mark(X1:S),mark(X2:S)) mark(s(X:S)) -> s(mark(X:S)) mark(tt) -> tt ->Projection: pi(A__ISNAT) = 1 Problem 1.1: SCC Processor: -> Pairs: Empty -> Rules: a__U11(tt,N:S) -> mark(N:S) a__U11(X1:S,X2:S) -> U11(X1:S,X2:S) a__U21(tt,M:S,N:S) -> s(a__plus(mark(N:S),mark(M:S))) a__U21(X1:S,X2:S,X3:S) -> U21(X1:S,X2:S,X3:S) a__and(tt,X:S) -> mark(X:S) a__and(X1:S,X2:S) -> and(X1:S,X2:S) a__isNat(0) -> tt a__isNat(plus(V1:S,V2:S)) -> a__and(a__isNat(V1:S),isNat(V2:S)) a__isNat(s(V1:S)) -> a__isNat(V1:S) a__isNat(X:S) -> isNat(X:S) a__plus(N:S,0) -> a__U11(a__isNat(N:S),N:S) a__plus(N:S,s(M:S)) -> a__U21(a__and(a__isNat(M:S),isNat(N:S)),M:S,N:S) a__plus(X1:S,X2:S) -> plus(X1:S,X2:S) mark(0) -> 0 mark(U11(X1:S,X2:S)) -> a__U11(mark(X1:S),X2:S) mark(U21(X1:S,X2:S,X3:S)) -> a__U21(mark(X1:S),X2:S,X3:S) mark(and(X1:S,X2:S)) -> a__and(mark(X1:S),X2:S) mark(isNat(X:S)) -> a__isNat(X:S) mark(plus(X1:S,X2:S)) -> a__plus(mark(X1:S),mark(X2:S)) mark(s(X:S)) -> s(mark(X:S)) mark(tt) -> tt ->Strongly Connected Components: There is no strongly connected component The problem is finite. Problem 1.2: Subterm Processor: -> Pairs: MARK(and(X1:S,X2:S)) -> MARK(X1:S) MARK(plus(X1:S,X2:S)) -> MARK(X1:S) MARK(plus(X1:S,X2:S)) -> MARK(X2:S) MARK(s(X:S)) -> MARK(X:S) -> Rules: a__U11(tt,N:S) -> mark(N:S) a__U11(X1:S,X2:S) -> U11(X1:S,X2:S) a__U21(tt,M:S,N:S) -> s(a__plus(mark(N:S),mark(M:S))) a__U21(X1:S,X2:S,X3:S) -> U21(X1:S,X2:S,X3:S) a__and(tt,X:S) -> mark(X:S) a__and(X1:S,X2:S) -> and(X1:S,X2:S) a__isNat(0) -> tt a__isNat(plus(V1:S,V2:S)) -> a__and(a__isNat(V1:S),isNat(V2:S)) a__isNat(s(V1:S)) -> a__isNat(V1:S) a__isNat(X:S) -> isNat(X:S) a__plus(N:S,0) -> a__U11(a__isNat(N:S),N:S) a__plus(N:S,s(M:S)) -> a__U21(a__and(a__isNat(M:S),isNat(N:S)),M:S,N:S) a__plus(X1:S,X2:S) -> plus(X1:S,X2:S) mark(0) -> 0 mark(U11(X1:S,X2:S)) -> a__U11(mark(X1:S),X2:S) mark(U21(X1:S,X2:S,X3:S)) -> a__U21(mark(X1:S),X2:S,X3:S) mark(and(X1:S,X2:S)) -> a__and(mark(X1:S),X2:S) mark(isNat(X:S)) -> a__isNat(X:S) mark(plus(X1:S,X2:S)) -> a__plus(mark(X1:S),mark(X2:S)) mark(s(X:S)) -> s(mark(X:S)) mark(tt) -> tt ->Projection: pi(MARK) = 1 Problem 1.2: SCC Processor: -> Pairs: Empty -> Rules: a__U11(tt,N:S) -> mark(N:S) a__U11(X1:S,X2:S) -> U11(X1:S,X2:S) a__U21(tt,M:S,N:S) -> s(a__plus(mark(N:S),mark(M:S))) a__U21(X1:S,X2:S,X3:S) -> U21(X1:S,X2:S,X3:S) a__and(tt,X:S) -> mark(X:S) a__and(X1:S,X2:S) -> and(X1:S,X2:S) a__isNat(0) -> tt a__isNat(plus(V1:S,V2:S)) -> a__and(a__isNat(V1:S),isNat(V2:S)) a__isNat(s(V1:S)) -> a__isNat(V1:S) a__isNat(X:S) -> isNat(X:S) a__plus(N:S,0) -> a__U11(a__isNat(N:S),N:S) a__plus(N:S,s(M:S)) -> a__U21(a__and(a__isNat(M:S),isNat(N:S)),M:S,N:S) a__plus(X1:S,X2:S) -> plus(X1:S,X2:S) mark(0) -> 0 mark(U11(X1:S,X2:S)) -> a__U11(mark(X1:S),X2:S) mark(U21(X1:S,X2:S,X3:S)) -> a__U21(mark(X1:S),X2:S,X3:S) mark(and(X1:S,X2:S)) -> a__and(mark(X1:S),X2:S) mark(isNat(X:S)) -> a__isNat(X:S) mark(plus(X1:S,X2:S)) -> a__plus(mark(X1:S),mark(X2:S)) mark(s(X:S)) -> s(mark(X:S)) mark(tt) -> tt ->Strongly Connected Components: There is no strongly connected component The problem is finite.