/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES Problem 1: (VAR M N V1 V2 X X1 X2 X3) (RULES U11(active(X1),X2) -> U11(X1,X2) U11(mark(X1),X2) -> U11(X1,X2) U11(X1,active(X2)) -> U11(X1,X2) U11(X1,mark(X2)) -> U11(X1,X2) U21(active(X1),X2,X3) -> U21(X1,X2,X3) U21(mark(X1),X2,X3) -> U21(X1,X2,X3) U21(X1,active(X2),X3) -> U21(X1,X2,X3) U21(X1,mark(X2),X3) -> U21(X1,X2,X3) U21(X1,X2,active(X3)) -> U21(X1,X2,X3) U21(X1,X2,mark(X3)) -> U21(X1,X2,X3) active(U11(tt,N)) -> mark(N) active(U21(tt,M,N)) -> mark(s(plus(N,M))) active(and(tt,X)) -> mark(X) active(isNat(plus(V1,V2))) -> mark(and(isNat(V1),isNat(V2))) active(isNat(s(V1))) -> mark(isNat(V1)) active(isNat(0)) -> mark(tt) active(plus(N,s(M))) -> mark(U21(and(isNat(M),isNat(N)),M,N)) active(plus(N,0)) -> mark(U11(isNat(N),N)) and(active(X1),X2) -> and(X1,X2) and(mark(X1),X2) -> and(X1,X2) and(X1,active(X2)) -> and(X1,X2) and(X1,mark(X2)) -> and(X1,X2) isNat(active(X)) -> isNat(X) isNat(mark(X)) -> isNat(X) mark(U11(X1,X2)) -> active(U11(mark(X1),X2)) mark(U21(X1,X2,X3)) -> active(U21(mark(X1),X2,X3)) mark(and(X1,X2)) -> active(and(mark(X1),X2)) mark(isNat(X)) -> active(isNat(X)) mark(plus(X1,X2)) -> active(plus(mark(X1),mark(X2))) mark(s(X)) -> active(s(mark(X))) mark(0) -> active(0) mark(tt) -> active(tt) plus(active(X1),X2) -> plus(X1,X2) plus(mark(X1),X2) -> plus(X1,X2) plus(X1,active(X2)) -> plus(X1,X2) plus(X1,mark(X2)) -> plus(X1,X2) s(active(X)) -> s(X) s(mark(X)) -> s(X) ) Problem 1: Dependency Pairs Processor: -> Pairs: U11#(active(X1),X2) -> U11#(X1,X2) U11#(mark(X1),X2) -> U11#(X1,X2) U11#(X1,active(X2)) -> U11#(X1,X2) U11#(X1,mark(X2)) -> U11#(X1,X2) U21#(active(X1),X2,X3) -> U21#(X1,X2,X3) U21#(mark(X1),X2,X3) -> U21#(X1,X2,X3) U21#(X1,active(X2),X3) -> U21#(X1,X2,X3) U21#(X1,mark(X2),X3) -> U21#(X1,X2,X3) U21#(X1,X2,active(X3)) -> U21#(X1,X2,X3) U21#(X1,X2,mark(X3)) -> U21#(X1,X2,X3) ACTIVE(U11(tt,N)) -> MARK(N) ACTIVE(U21(tt,M,N)) -> MARK(s(plus(N,M))) ACTIVE(U21(tt,M,N)) -> PLUS(N,M) ACTIVE(U21(tt,M,N)) -> S(plus(N,M)) ACTIVE(and(tt,X)) -> MARK(X) ACTIVE(isNat(plus(V1,V2))) -> AND(isNat(V1),isNat(V2)) ACTIVE(isNat(plus(V1,V2))) -> ISNAT(V1) ACTIVE(isNat(plus(V1,V2))) -> ISNAT(V2) ACTIVE(isNat(plus(V1,V2))) -> MARK(and(isNat(V1),isNat(V2))) ACTIVE(isNat(s(V1))) -> ISNAT(V1) ACTIVE(isNat(s(V1))) -> MARK(isNat(V1)) ACTIVE(isNat(0)) -> MARK(tt) ACTIVE(plus(N,s(M))) -> U21#(and(isNat(M),isNat(N)),M,N) ACTIVE(plus(N,s(M))) -> AND(isNat(M),isNat(N)) ACTIVE(plus(N,s(M))) -> ISNAT(M) ACTIVE(plus(N,s(M))) -> ISNAT(N) ACTIVE(plus(N,s(M))) -> MARK(U21(and(isNat(M),isNat(N)),M,N)) ACTIVE(plus(N,0)) -> U11#(isNat(N),N) ACTIVE(plus(N,0)) -> ISNAT(N) ACTIVE(plus(N,0)) -> MARK(U11(isNat(N),N)) AND(active(X1),X2) -> AND(X1,X2) AND(mark(X1),X2) -> AND(X1,X2) AND(X1,active(X2)) -> AND(X1,X2) AND(X1,mark(X2)) -> AND(X1,X2) ISNAT(active(X)) -> ISNAT(X) ISNAT(mark(X)) -> ISNAT(X) MARK(U11(X1,X2)) -> U11#(mark(X1),X2) MARK(U11(X1,X2)) -> ACTIVE(U11(mark(X1),X2)) MARK(U11(X1,X2)) -> MARK(X1) MARK(U21(X1,X2,X3)) -> U21#(mark(X1),X2,X3) MARK(U21(X1,X2,X3)) -> ACTIVE(U21(mark(X1),X2,X3)) MARK(U21(X1,X2,X3)) -> MARK(X1) MARK(and(X1,X2)) -> ACTIVE(and(mark(X1),X2)) MARK(and(X1,X2)) -> AND(mark(X1),X2) MARK(and(X1,X2)) -> MARK(X1) MARK(isNat(X)) -> ACTIVE(isNat(X)) MARK(plus(X1,X2)) -> ACTIVE(plus(mark(X1),mark(X2))) MARK(plus(X1,X2)) -> MARK(X1) MARK(plus(X1,X2)) -> MARK(X2) MARK(plus(X1,X2)) -> PLUS(mark(X1),mark(X2)) MARK(s(X)) -> ACTIVE(s(mark(X))) MARK(s(X)) -> MARK(X) MARK(s(X)) -> S(mark(X)) PLUS(active(X1),X2) -> PLUS(X1,X2) PLUS(mark(X1),X2) -> PLUS(X1,X2) PLUS(X1,active(X2)) -> PLUS(X1,X2) PLUS(X1,mark(X2)) -> PLUS(X1,X2) S(active(X)) -> S(X) S(mark(X)) -> S(X) -> Rules: U11(active(X1),X2) -> U11(X1,X2) U11(mark(X1),X2) -> U11(X1,X2) U11(X1,active(X2)) -> U11(X1,X2) U11(X1,mark(X2)) -> U11(X1,X2) U21(active(X1),X2,X3) -> U21(X1,X2,X3) U21(mark(X1),X2,X3) -> U21(X1,X2,X3) U21(X1,active(X2),X3) -> U21(X1,X2,X3) U21(X1,mark(X2),X3) -> U21(X1,X2,X3) U21(X1,X2,active(X3)) -> U21(X1,X2,X3) U21(X1,X2,mark(X3)) -> U21(X1,X2,X3) active(U11(tt,N)) -> mark(N) active(U21(tt,M,N)) -> mark(s(plus(N,M))) active(and(tt,X)) -> mark(X) active(isNat(plus(V1,V2))) -> mark(and(isNat(V1),isNat(V2))) active(isNat(s(V1))) -> mark(isNat(V1)) active(isNat(0)) -> mark(tt) active(plus(N,s(M))) -> mark(U21(and(isNat(M),isNat(N)),M,N)) active(plus(N,0)) -> mark(U11(isNat(N),N)) and(active(X1),X2) -> and(X1,X2) and(mark(X1),X2) -> and(X1,X2) and(X1,active(X2)) -> and(X1,X2) and(X1,mark(X2)) -> and(X1,X2) isNat(active(X)) -> isNat(X) isNat(mark(X)) -> isNat(X) mark(U11(X1,X2)) -> active(U11(mark(X1),X2)) mark(U21(X1,X2,X3)) -> active(U21(mark(X1),X2,X3)) mark(and(X1,X2)) -> active(and(mark(X1),X2)) mark(isNat(X)) -> active(isNat(X)) mark(plus(X1,X2)) -> active(plus(mark(X1),mark(X2))) mark(s(X)) -> active(s(mark(X))) mark(0) -> active(0) mark(tt) -> active(tt) plus(active(X1),X2) -> plus(X1,X2) plus(mark(X1),X2) -> plus(X1,X2) plus(X1,active(X2)) -> plus(X1,X2) plus(X1,mark(X2)) -> plus(X1,X2) s(active(X)) -> s(X) s(mark(X)) -> s(X) Problem 1: SCC Processor: -> Pairs: U11#(active(X1),X2) -> U11#(X1,X2) U11#(mark(X1),X2) -> U11#(X1,X2) U11#(X1,active(X2)) -> U11#(X1,X2) U11#(X1,mark(X2)) -> U11#(X1,X2) U21#(active(X1),X2,X3) -> U21#(X1,X2,X3) U21#(mark(X1),X2,X3) -> U21#(X1,X2,X3) U21#(X1,active(X2),X3) -> U21#(X1,X2,X3) U21#(X1,mark(X2),X3) -> U21#(X1,X2,X3) U21#(X1,X2,active(X3)) -> U21#(X1,X2,X3) U21#(X1,X2,mark(X3)) -> U21#(X1,X2,X3) ACTIVE(U11(tt,N)) -> MARK(N) ACTIVE(U21(tt,M,N)) -> MARK(s(plus(N,M))) ACTIVE(U21(tt,M,N)) -> PLUS(N,M) ACTIVE(U21(tt,M,N)) -> S(plus(N,M)) ACTIVE(and(tt,X)) -> MARK(X) ACTIVE(isNat(plus(V1,V2))) -> AND(isNat(V1),isNat(V2)) ACTIVE(isNat(plus(V1,V2))) -> ISNAT(V1) ACTIVE(isNat(plus(V1,V2))) -> ISNAT(V2) ACTIVE(isNat(plus(V1,V2))) -> MARK(and(isNat(V1),isNat(V2))) ACTIVE(isNat(s(V1))) -> ISNAT(V1) ACTIVE(isNat(s(V1))) -> MARK(isNat(V1)) ACTIVE(isNat(0)) -> MARK(tt) ACTIVE(plus(N,s(M))) -> U21#(and(isNat(M),isNat(N)),M,N) ACTIVE(plus(N,s(M))) -> AND(isNat(M),isNat(N)) ACTIVE(plus(N,s(M))) -> ISNAT(M) ACTIVE(plus(N,s(M))) -> ISNAT(N) ACTIVE(plus(N,s(M))) -> MARK(U21(and(isNat(M),isNat(N)),M,N)) ACTIVE(plus(N,0)) -> U11#(isNat(N),N) ACTIVE(plus(N,0)) -> ISNAT(N) ACTIVE(plus(N,0)) -> MARK(U11(isNat(N),N)) AND(active(X1),X2) -> AND(X1,X2) AND(mark(X1),X2) -> AND(X1,X2) AND(X1,active(X2)) -> AND(X1,X2) AND(X1,mark(X2)) -> AND(X1,X2) ISNAT(active(X)) -> ISNAT(X) ISNAT(mark(X)) -> ISNAT(X) MARK(U11(X1,X2)) -> U11#(mark(X1),X2) MARK(U11(X1,X2)) -> ACTIVE(U11(mark(X1),X2)) MARK(U11(X1,X2)) -> MARK(X1) MARK(U21(X1,X2,X3)) -> U21#(mark(X1),X2,X3) MARK(U21(X1,X2,X3)) -> ACTIVE(U21(mark(X1),X2,X3)) MARK(U21(X1,X2,X3)) -> MARK(X1) MARK(and(X1,X2)) -> ACTIVE(and(mark(X1),X2)) MARK(and(X1,X2)) -> AND(mark(X1),X2) MARK(and(X1,X2)) -> MARK(X1) MARK(isNat(X)) -> ACTIVE(isNat(X)) MARK(plus(X1,X2)) -> ACTIVE(plus(mark(X1),mark(X2))) MARK(plus(X1,X2)) -> MARK(X1) MARK(plus(X1,X2)) -> MARK(X2) MARK(plus(X1,X2)) -> PLUS(mark(X1),mark(X2)) MARK(s(X)) -> ACTIVE(s(mark(X))) MARK(s(X)) -> MARK(X) MARK(s(X)) -> S(mark(X)) PLUS(active(X1),X2) -> PLUS(X1,X2) PLUS(mark(X1),X2) -> PLUS(X1,X2) PLUS(X1,active(X2)) -> PLUS(X1,X2) PLUS(X1,mark(X2)) -> PLUS(X1,X2) S(active(X)) -> S(X) S(mark(X)) -> S(X) -> Rules: U11(active(X1),X2) -> U11(X1,X2) U11(mark(X1),X2) -> U11(X1,X2) U11(X1,active(X2)) -> U11(X1,X2) U11(X1,mark(X2)) -> U11(X1,X2) U21(active(X1),X2,X3) -> U21(X1,X2,X3) U21(mark(X1),X2,X3) -> U21(X1,X2,X3) U21(X1,active(X2),X3) -> U21(X1,X2,X3) U21(X1,mark(X2),X3) -> U21(X1,X2,X3) U21(X1,X2,active(X3)) -> U21(X1,X2,X3) U21(X1,X2,mark(X3)) -> U21(X1,X2,X3) active(U11(tt,N)) -> mark(N) active(U21(tt,M,N)) -> mark(s(plus(N,M))) active(and(tt,X)) -> mark(X) active(isNat(plus(V1,V2))) -> mark(and(isNat(V1),isNat(V2))) active(isNat(s(V1))) -> mark(isNat(V1)) active(isNat(0)) -> mark(tt) active(plus(N,s(M))) -> mark(U21(and(isNat(M),isNat(N)),M,N)) active(plus(N,0)) -> mark(U11(isNat(N),N)) and(active(X1),X2) -> and(X1,X2) and(mark(X1),X2) -> and(X1,X2) and(X1,active(X2)) -> and(X1,X2) and(X1,mark(X2)) -> and(X1,X2) isNat(active(X)) -> isNat(X) isNat(mark(X)) -> isNat(X) mark(U11(X1,X2)) -> active(U11(mark(X1),X2)) mark(U21(X1,X2,X3)) -> active(U21(mark(X1),X2,X3)) mark(and(X1,X2)) -> active(and(mark(X1),X2)) mark(isNat(X)) -> active(isNat(X)) mark(plus(X1,X2)) -> active(plus(mark(X1),mark(X2))) mark(s(X)) -> active(s(mark(X))) mark(0) -> active(0) mark(tt) -> active(tt) plus(active(X1),X2) -> plus(X1,X2) plus(mark(X1),X2) -> plus(X1,X2) plus(X1,active(X2)) -> plus(X1,X2) plus(X1,mark(X2)) -> plus(X1,X2) s(active(X)) -> s(X) s(mark(X)) -> s(X) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: S(active(X)) -> S(X) S(mark(X)) -> S(X) ->->-> Rules: U11(active(X1),X2) -> U11(X1,X2) U11(mark(X1),X2) -> U11(X1,X2) U11(X1,active(X2)) -> U11(X1,X2) U11(X1,mark(X2)) -> U11(X1,X2) U21(active(X1),X2,X3) -> U21(X1,X2,X3) U21(mark(X1),X2,X3) -> U21(X1,X2,X3) U21(X1,active(X2),X3) -> U21(X1,X2,X3) U21(X1,mark(X2),X3) -> U21(X1,X2,X3) U21(X1,X2,active(X3)) -> U21(X1,X2,X3) U21(X1,X2,mark(X3)) -> U21(X1,X2,X3) active(U11(tt,N)) -> mark(N) active(U21(tt,M,N)) -> mark(s(plus(N,M))) active(and(tt,X)) -> mark(X) active(isNat(plus(V1,V2))) -> mark(and(isNat(V1),isNat(V2))) active(isNat(s(V1))) -> mark(isNat(V1)) active(isNat(0)) -> mark(tt) active(plus(N,s(M))) -> mark(U21(and(isNat(M),isNat(N)),M,N)) active(plus(N,0)) -> mark(U11(isNat(N),N)) and(active(X1),X2) -> and(X1,X2) and(mark(X1),X2) -> and(X1,X2) and(X1,active(X2)) -> and(X1,X2) and(X1,mark(X2)) -> and(X1,X2) isNat(active(X)) -> isNat(X) isNat(mark(X)) -> isNat(X) mark(U11(X1,X2)) -> active(U11(mark(X1),X2)) mark(U21(X1,X2,X3)) -> active(U21(mark(X1),X2,X3)) mark(and(X1,X2)) -> active(and(mark(X1),X2)) mark(isNat(X)) -> active(isNat(X)) mark(plus(X1,X2)) -> active(plus(mark(X1),mark(X2))) mark(s(X)) -> active(s(mark(X))) mark(0) -> active(0) mark(tt) -> active(tt) plus(active(X1),X2) -> plus(X1,X2) plus(mark(X1),X2) -> plus(X1,X2) plus(X1,active(X2)) -> plus(X1,X2) plus(X1,mark(X2)) -> plus(X1,X2) s(active(X)) -> s(X) s(mark(X)) -> s(X) ->->Cycle: ->->-> Pairs: PLUS(active(X1),X2) -> PLUS(X1,X2) PLUS(mark(X1),X2) -> PLUS(X1,X2) PLUS(X1,active(X2)) -> PLUS(X1,X2) PLUS(X1,mark(X2)) -> PLUS(X1,X2) ->->-> Rules: U11(active(X1),X2) -> U11(X1,X2) U11(mark(X1),X2) -> U11(X1,X2) U11(X1,active(X2)) -> U11(X1,X2) U11(X1,mark(X2)) -> U11(X1,X2) U21(active(X1),X2,X3) -> U21(X1,X2,X3) U21(mark(X1),X2,X3) -> U21(X1,X2,X3) U21(X1,active(X2),X3) -> U21(X1,X2,X3) U21(X1,mark(X2),X3) -> U21(X1,X2,X3) U21(X1,X2,active(X3)) -> U21(X1,X2,X3) U21(X1,X2,mark(X3)) -> U21(X1,X2,X3) active(U11(tt,N)) -> mark(N) active(U21(tt,M,N)) -> mark(s(plus(N,M))) active(and(tt,X)) -> mark(X) active(isNat(plus(V1,V2))) -> mark(and(isNat(V1),isNat(V2))) active(isNat(s(V1))) -> mark(isNat(V1)) active(isNat(0)) -> mark(tt) active(plus(N,s(M))) -> mark(U21(and(isNat(M),isNat(N)),M,N)) active(plus(N,0)) -> mark(U11(isNat(N),N)) and(active(X1),X2) -> and(X1,X2) and(mark(X1),X2) -> and(X1,X2) and(X1,active(X2)) -> and(X1,X2) and(X1,mark(X2)) -> and(X1,X2) isNat(active(X)) -> isNat(X) isNat(mark(X)) -> isNat(X) mark(U11(X1,X2)) -> active(U11(mark(X1),X2)) mark(U21(X1,X2,X3)) -> active(U21(mark(X1),X2,X3)) mark(and(X1,X2)) -> active(and(mark(X1),X2)) mark(isNat(X)) -> active(isNat(X)) mark(plus(X1,X2)) -> active(plus(mark(X1),mark(X2))) mark(s(X)) -> active(s(mark(X))) mark(0) -> active(0) mark(tt) -> active(tt) plus(active(X1),X2) -> plus(X1,X2) plus(mark(X1),X2) -> plus(X1,X2) plus(X1,active(X2)) -> plus(X1,X2) plus(X1,mark(X2)) -> plus(X1,X2) s(active(X)) -> s(X) s(mark(X)) -> s(X) ->->Cycle: ->->-> Pairs: ISNAT(active(X)) -> ISNAT(X) ISNAT(mark(X)) -> ISNAT(X) ->->-> Rules: U11(active(X1),X2) -> U11(X1,X2) U11(mark(X1),X2) -> U11(X1,X2) U11(X1,active(X2)) -> U11(X1,X2) U11(X1,mark(X2)) -> U11(X1,X2) U21(active(X1),X2,X3) -> U21(X1,X2,X3) U21(mark(X1),X2,X3) -> U21(X1,X2,X3) U21(X1,active(X2),X3) -> U21(X1,X2,X3) U21(X1,mark(X2),X3) -> U21(X1,X2,X3) U21(X1,X2,active(X3)) -> U21(X1,X2,X3) U21(X1,X2,mark(X3)) -> U21(X1,X2,X3) active(U11(tt,N)) -> mark(N) active(U21(tt,M,N)) -> mark(s(plus(N,M))) active(and(tt,X)) -> mark(X) active(isNat(plus(V1,V2))) -> mark(and(isNat(V1),isNat(V2))) active(isNat(s(V1))) -> mark(isNat(V1)) active(isNat(0)) -> mark(tt) active(plus(N,s(M))) -> mark(U21(and(isNat(M),isNat(N)),M,N)) active(plus(N,0)) -> mark(U11(isNat(N),N)) and(active(X1),X2) -> and(X1,X2) and(mark(X1),X2) -> and(X1,X2) and(X1,active(X2)) -> and(X1,X2) and(X1,mark(X2)) -> and(X1,X2) isNat(active(X)) -> isNat(X) isNat(mark(X)) -> isNat(X) mark(U11(X1,X2)) -> active(U11(mark(X1),X2)) mark(U21(X1,X2,X3)) -> active(U21(mark(X1),X2,X3)) mark(and(X1,X2)) -> active(and(mark(X1),X2)) mark(isNat(X)) -> active(isNat(X)) mark(plus(X1,X2)) -> active(plus(mark(X1),mark(X2))) mark(s(X)) -> active(s(mark(X))) mark(0) -> active(0) mark(tt) -> active(tt) plus(active(X1),X2) -> plus(X1,X2) plus(mark(X1),X2) -> plus(X1,X2) plus(X1,active(X2)) -> plus(X1,X2) plus(X1,mark(X2)) -> plus(X1,X2) s(active(X)) -> s(X) s(mark(X)) -> s(X) ->->Cycle: ->->-> Pairs: AND(active(X1),X2) -> AND(X1,X2) AND(mark(X1),X2) -> AND(X1,X2) AND(X1,active(X2)) -> AND(X1,X2) AND(X1,mark(X2)) -> AND(X1,X2) ->->-> Rules: U11(active(X1),X2) -> U11(X1,X2) U11(mark(X1),X2) -> U11(X1,X2) U11(X1,active(X2)) -> U11(X1,X2) U11(X1,mark(X2)) -> U11(X1,X2) U21(active(X1),X2,X3) -> U21(X1,X2,X3) U21(mark(X1),X2,X3) -> U21(X1,X2,X3) U21(X1,active(X2),X3) -> U21(X1,X2,X3) U21(X1,mark(X2),X3) -> U21(X1,X2,X3) U21(X1,X2,active(X3)) -> U21(X1,X2,X3) U21(X1,X2,mark(X3)) -> U21(X1,X2,X3) active(U11(tt,N)) -> mark(N) active(U21(tt,M,N)) -> mark(s(plus(N,M))) active(and(tt,X)) -> mark(X) active(isNat(plus(V1,V2))) -> mark(and(isNat(V1),isNat(V2))) active(isNat(s(V1))) -> mark(isNat(V1)) active(isNat(0)) -> mark(tt) active(plus(N,s(M))) -> mark(U21(and(isNat(M),isNat(N)),M,N)) active(plus(N,0)) -> mark(U11(isNat(N),N)) and(active(X1),X2) -> and(X1,X2) and(mark(X1),X2) -> and(X1,X2) and(X1,active(X2)) -> and(X1,X2) and(X1,mark(X2)) -> and(X1,X2) isNat(active(X)) -> isNat(X) isNat(mark(X)) -> isNat(X) mark(U11(X1,X2)) -> active(U11(mark(X1),X2)) mark(U21(X1,X2,X3)) -> active(U21(mark(X1),X2,X3)) mark(and(X1,X2)) -> active(and(mark(X1),X2)) mark(isNat(X)) -> active(isNat(X)) mark(plus(X1,X2)) -> active(plus(mark(X1),mark(X2))) mark(s(X)) -> active(s(mark(X))) mark(0) -> active(0) mark(tt) -> active(tt) plus(active(X1),X2) -> plus(X1,X2) plus(mark(X1),X2) -> plus(X1,X2) plus(X1,active(X2)) -> plus(X1,X2) plus(X1,mark(X2)) -> plus(X1,X2) s(active(X)) -> s(X) s(mark(X)) -> s(X) ->->Cycle: ->->-> Pairs: U21#(active(X1),X2,X3) -> U21#(X1,X2,X3) U21#(mark(X1),X2,X3) -> U21#(X1,X2,X3) U21#(X1,active(X2),X3) -> U21#(X1,X2,X3) U21#(X1,mark(X2),X3) -> U21#(X1,X2,X3) U21#(X1,X2,active(X3)) -> U21#(X1,X2,X3) U21#(X1,X2,mark(X3)) -> U21#(X1,X2,X3) ->->-> Rules: U11(active(X1),X2) -> U11(X1,X2) U11(mark(X1),X2) -> U11(X1,X2) U11(X1,active(X2)) -> U11(X1,X2) U11(X1,mark(X2)) -> U11(X1,X2) U21(active(X1),X2,X3) -> U21(X1,X2,X3) U21(mark(X1),X2,X3) -> U21(X1,X2,X3) U21(X1,active(X2),X3) -> U21(X1,X2,X3) U21(X1,mark(X2),X3) -> U21(X1,X2,X3) U21(X1,X2,active(X3)) -> U21(X1,X2,X3) U21(X1,X2,mark(X3)) -> U21(X1,X2,X3) active(U11(tt,N)) -> mark(N) active(U21(tt,M,N)) -> mark(s(plus(N,M))) active(and(tt,X)) -> mark(X) active(isNat(plus(V1,V2))) -> mark(and(isNat(V1),isNat(V2))) active(isNat(s(V1))) -> mark(isNat(V1)) active(isNat(0)) -> mark(tt) active(plus(N,s(M))) -> mark(U21(and(isNat(M),isNat(N)),M,N)) active(plus(N,0)) -> mark(U11(isNat(N),N)) and(active(X1),X2) -> and(X1,X2) and(mark(X1),X2) -> and(X1,X2) and(X1,active(X2)) -> and(X1,X2) and(X1,mark(X2)) -> and(X1,X2) isNat(active(X)) -> isNat(X) isNat(mark(X)) -> isNat(X) mark(U11(X1,X2)) -> active(U11(mark(X1),X2)) mark(U21(X1,X2,X3)) -> active(U21(mark(X1),X2,X3)) mark(and(X1,X2)) -> active(and(mark(X1),X2)) mark(isNat(X)) -> active(isNat(X)) mark(plus(X1,X2)) -> active(plus(mark(X1),mark(X2))) mark(s(X)) -> active(s(mark(X))) mark(0) -> active(0) mark(tt) -> active(tt) plus(active(X1),X2) -> plus(X1,X2) plus(mark(X1),X2) -> plus(X1,X2) plus(X1,active(X2)) -> plus(X1,X2) plus(X1,mark(X2)) -> plus(X1,X2) s(active(X)) -> s(X) s(mark(X)) -> s(X) ->->Cycle: ->->-> Pairs: U11#(active(X1),X2) -> U11#(X1,X2) U11#(mark(X1),X2) -> U11#(X1,X2) U11#(X1,active(X2)) -> U11#(X1,X2) U11#(X1,mark(X2)) -> U11#(X1,X2) ->->-> Rules: U11(active(X1),X2) -> U11(X1,X2) U11(mark(X1),X2) -> U11(X1,X2) U11(X1,active(X2)) -> U11(X1,X2) U11(X1,mark(X2)) -> U11(X1,X2) U21(active(X1),X2,X3) -> U21(X1,X2,X3) U21(mark(X1),X2,X3) -> U21(X1,X2,X3) U21(X1,active(X2),X3) -> U21(X1,X2,X3) U21(X1,mark(X2),X3) -> U21(X1,X2,X3) U21(X1,X2,active(X3)) -> U21(X1,X2,X3) U21(X1,X2,mark(X3)) -> U21(X1,X2,X3) active(U11(tt,N)) -> mark(N) active(U21(tt,M,N)) -> mark(s(plus(N,M))) active(and(tt,X)) -> mark(X) active(isNat(plus(V1,V2))) -> mark(and(isNat(V1),isNat(V2))) active(isNat(s(V1))) -> mark(isNat(V1)) active(isNat(0)) -> mark(tt) active(plus(N,s(M))) -> mark(U21(and(isNat(M),isNat(N)),M,N)) active(plus(N,0)) -> mark(U11(isNat(N),N)) and(active(X1),X2) -> and(X1,X2) and(mark(X1),X2) -> and(X1,X2) and(X1,active(X2)) -> and(X1,X2) and(X1,mark(X2)) -> and(X1,X2) isNat(active(X)) -> isNat(X) isNat(mark(X)) -> isNat(X) mark(U11(X1,X2)) -> active(U11(mark(X1),X2)) mark(U21(X1,X2,X3)) -> active(U21(mark(X1),X2,X3)) mark(and(X1,X2)) -> active(and(mark(X1),X2)) mark(isNat(X)) -> active(isNat(X)) mark(plus(X1,X2)) -> active(plus(mark(X1),mark(X2))) mark(s(X)) -> active(s(mark(X))) mark(0) -> active(0) mark(tt) -> active(tt) plus(active(X1),X2) -> plus(X1,X2) plus(mark(X1),X2) -> plus(X1,X2) plus(X1,active(X2)) -> plus(X1,X2) plus(X1,mark(X2)) -> plus(X1,X2) s(active(X)) -> s(X) s(mark(X)) -> s(X) ->->Cycle: ->->-> Pairs: ACTIVE(U11(tt,N)) -> MARK(N) ACTIVE(U21(tt,M,N)) -> MARK(s(plus(N,M))) ACTIVE(and(tt,X)) -> MARK(X) ACTIVE(isNat(plus(V1,V2))) -> MARK(and(isNat(V1),isNat(V2))) ACTIVE(isNat(s(V1))) -> MARK(isNat(V1)) ACTIVE(plus(N,s(M))) -> MARK(U21(and(isNat(M),isNat(N)),M,N)) ACTIVE(plus(N,0)) -> MARK(U11(isNat(N),N)) MARK(U11(X1,X2)) -> ACTIVE(U11(mark(X1),X2)) MARK(U11(X1,X2)) -> MARK(X1) MARK(U21(X1,X2,X3)) -> ACTIVE(U21(mark(X1),X2,X3)) MARK(U21(X1,X2,X3)) -> MARK(X1) MARK(and(X1,X2)) -> ACTIVE(and(mark(X1),X2)) MARK(and(X1,X2)) -> MARK(X1) MARK(isNat(X)) -> ACTIVE(isNat(X)) MARK(plus(X1,X2)) -> ACTIVE(plus(mark(X1),mark(X2))) MARK(plus(X1,X2)) -> MARK(X1) MARK(plus(X1,X2)) -> MARK(X2) MARK(s(X)) -> ACTIVE(s(mark(X))) MARK(s(X)) -> MARK(X) ->->-> Rules: U11(active(X1),X2) -> U11(X1,X2) U11(mark(X1),X2) -> U11(X1,X2) U11(X1,active(X2)) -> U11(X1,X2) U11(X1,mark(X2)) -> U11(X1,X2) U21(active(X1),X2,X3) -> U21(X1,X2,X3) U21(mark(X1),X2,X3) -> U21(X1,X2,X3) U21(X1,active(X2),X3) -> U21(X1,X2,X3) U21(X1,mark(X2),X3) -> U21(X1,X2,X3) U21(X1,X2,active(X3)) -> U21(X1,X2,X3) U21(X1,X2,mark(X3)) -> U21(X1,X2,X3) active(U11(tt,N)) -> mark(N) active(U21(tt,M,N)) -> mark(s(plus(N,M))) active(and(tt,X)) -> mark(X) active(isNat(plus(V1,V2))) -> mark(and(isNat(V1),isNat(V2))) active(isNat(s(V1))) -> mark(isNat(V1)) active(isNat(0)) -> mark(tt) active(plus(N,s(M))) -> mark(U21(and(isNat(M),isNat(N)),M,N)) active(plus(N,0)) -> mark(U11(isNat(N),N)) and(active(X1),X2) -> and(X1,X2) and(mark(X1),X2) -> and(X1,X2) and(X1,active(X2)) -> and(X1,X2) and(X1,mark(X2)) -> and(X1,X2) isNat(active(X)) -> isNat(X) isNat(mark(X)) -> isNat(X) mark(U11(X1,X2)) -> active(U11(mark(X1),X2)) mark(U21(X1,X2,X3)) -> active(U21(mark(X1),X2,X3)) mark(and(X1,X2)) -> active(and(mark(X1),X2)) mark(isNat(X)) -> active(isNat(X)) mark(plus(X1,X2)) -> active(plus(mark(X1),mark(X2))) mark(s(X)) -> active(s(mark(X))) mark(0) -> active(0) mark(tt) -> active(tt) plus(active(X1),X2) -> plus(X1,X2) plus(mark(X1),X2) -> plus(X1,X2) plus(X1,active(X2)) -> plus(X1,X2) plus(X1,mark(X2)) -> plus(X1,X2) s(active(X)) -> s(X) s(mark(X)) -> s(X) The problem is decomposed in 7 subproblems. Problem 1.1: Subterm Processor: -> Pairs: S(active(X)) -> S(X) S(mark(X)) -> S(X) -> Rules: U11(active(X1),X2) -> U11(X1,X2) U11(mark(X1),X2) -> U11(X1,X2) U11(X1,active(X2)) -> U11(X1,X2) U11(X1,mark(X2)) -> U11(X1,X2) U21(active(X1),X2,X3) -> U21(X1,X2,X3) U21(mark(X1),X2,X3) -> U21(X1,X2,X3) U21(X1,active(X2),X3) -> U21(X1,X2,X3) U21(X1,mark(X2),X3) -> U21(X1,X2,X3) U21(X1,X2,active(X3)) -> U21(X1,X2,X3) U21(X1,X2,mark(X3)) -> U21(X1,X2,X3) active(U11(tt,N)) -> mark(N) active(U21(tt,M,N)) -> mark(s(plus(N,M))) active(and(tt,X)) -> mark(X) active(isNat(plus(V1,V2))) -> mark(and(isNat(V1),isNat(V2))) active(isNat(s(V1))) -> mark(isNat(V1)) active(isNat(0)) -> mark(tt) active(plus(N,s(M))) -> mark(U21(and(isNat(M),isNat(N)),M,N)) active(plus(N,0)) -> mark(U11(isNat(N),N)) and(active(X1),X2) -> and(X1,X2) and(mark(X1),X2) -> and(X1,X2) and(X1,active(X2)) -> and(X1,X2) and(X1,mark(X2)) -> and(X1,X2) isNat(active(X)) -> isNat(X) isNat(mark(X)) -> isNat(X) mark(U11(X1,X2)) -> active(U11(mark(X1),X2)) mark(U21(X1,X2,X3)) -> active(U21(mark(X1),X2,X3)) mark(and(X1,X2)) -> active(and(mark(X1),X2)) mark(isNat(X)) -> active(isNat(X)) mark(plus(X1,X2)) -> active(plus(mark(X1),mark(X2))) mark(s(X)) -> active(s(mark(X))) mark(0) -> active(0) mark(tt) -> active(tt) plus(active(X1),X2) -> plus(X1,X2) plus(mark(X1),X2) -> plus(X1,X2) plus(X1,active(X2)) -> plus(X1,X2) plus(X1,mark(X2)) -> plus(X1,X2) s(active(X)) -> s(X) s(mark(X)) -> s(X) ->Projection: pi(S) = 1 Problem 1.1: SCC Processor: -> Pairs: Empty -> Rules: U11(active(X1),X2) -> U11(X1,X2) U11(mark(X1),X2) -> U11(X1,X2) U11(X1,active(X2)) -> U11(X1,X2) U11(X1,mark(X2)) -> U11(X1,X2) U21(active(X1),X2,X3) -> U21(X1,X2,X3) U21(mark(X1),X2,X3) -> U21(X1,X2,X3) U21(X1,active(X2),X3) -> U21(X1,X2,X3) U21(X1,mark(X2),X3) -> U21(X1,X2,X3) U21(X1,X2,active(X3)) -> U21(X1,X2,X3) U21(X1,X2,mark(X3)) -> U21(X1,X2,X3) active(U11(tt,N)) -> mark(N) active(U21(tt,M,N)) -> mark(s(plus(N,M))) active(and(tt,X)) -> mark(X) active(isNat(plus(V1,V2))) -> mark(and(isNat(V1),isNat(V2))) active(isNat(s(V1))) -> mark(isNat(V1)) active(isNat(0)) -> mark(tt) active(plus(N,s(M))) -> mark(U21(and(isNat(M),isNat(N)),M,N)) active(plus(N,0)) -> mark(U11(isNat(N),N)) and(active(X1),X2) -> and(X1,X2) and(mark(X1),X2) -> and(X1,X2) and(X1,active(X2)) -> and(X1,X2) and(X1,mark(X2)) -> and(X1,X2) isNat(active(X)) -> isNat(X) isNat(mark(X)) -> isNat(X) mark(U11(X1,X2)) -> active(U11(mark(X1),X2)) mark(U21(X1,X2,X3)) -> active(U21(mark(X1),X2,X3)) mark(and(X1,X2)) -> active(and(mark(X1),X2)) mark(isNat(X)) -> active(isNat(X)) mark(plus(X1,X2)) -> active(plus(mark(X1),mark(X2))) mark(s(X)) -> active(s(mark(X))) mark(0) -> active(0) mark(tt) -> active(tt) plus(active(X1),X2) -> plus(X1,X2) plus(mark(X1),X2) -> plus(X1,X2) plus(X1,active(X2)) -> plus(X1,X2) plus(X1,mark(X2)) -> plus(X1,X2) s(active(X)) -> s(X) s(mark(X)) -> s(X) ->Strongly Connected Components: There is no strongly connected component The problem is finite. Problem 1.2: Subterm Processor: -> Pairs: PLUS(active(X1),X2) -> PLUS(X1,X2) PLUS(mark(X1),X2) -> PLUS(X1,X2) PLUS(X1,active(X2)) -> PLUS(X1,X2) PLUS(X1,mark(X2)) -> PLUS(X1,X2) -> Rules: U11(active(X1),X2) -> U11(X1,X2) U11(mark(X1),X2) -> U11(X1,X2) U11(X1,active(X2)) -> U11(X1,X2) U11(X1,mark(X2)) -> U11(X1,X2) U21(active(X1),X2,X3) -> U21(X1,X2,X3) U21(mark(X1),X2,X3) -> U21(X1,X2,X3) U21(X1,active(X2),X3) -> U21(X1,X2,X3) U21(X1,mark(X2),X3) -> U21(X1,X2,X3) U21(X1,X2,active(X3)) -> U21(X1,X2,X3) U21(X1,X2,mark(X3)) -> U21(X1,X2,X3) active(U11(tt,N)) -> mark(N) active(U21(tt,M,N)) -> mark(s(plus(N,M))) active(and(tt,X)) -> mark(X) active(isNat(plus(V1,V2))) -> mark(and(isNat(V1),isNat(V2))) active(isNat(s(V1))) -> mark(isNat(V1)) active(isNat(0)) -> mark(tt) active(plus(N,s(M))) -> mark(U21(and(isNat(M),isNat(N)),M,N)) active(plus(N,0)) -> mark(U11(isNat(N),N)) and(active(X1),X2) -> and(X1,X2) and(mark(X1),X2) -> and(X1,X2) and(X1,active(X2)) -> and(X1,X2) and(X1,mark(X2)) -> and(X1,X2) isNat(active(X)) -> isNat(X) isNat(mark(X)) -> isNat(X) mark(U11(X1,X2)) -> active(U11(mark(X1),X2)) mark(U21(X1,X2,X3)) -> active(U21(mark(X1),X2,X3)) mark(and(X1,X2)) -> active(and(mark(X1),X2)) mark(isNat(X)) -> active(isNat(X)) mark(plus(X1,X2)) -> active(plus(mark(X1),mark(X2))) mark(s(X)) -> active(s(mark(X))) mark(0) -> active(0) mark(tt) -> active(tt) plus(active(X1),X2) -> plus(X1,X2) plus(mark(X1),X2) -> plus(X1,X2) plus(X1,active(X2)) -> plus(X1,X2) plus(X1,mark(X2)) -> plus(X1,X2) s(active(X)) -> s(X) s(mark(X)) -> s(X) ->Projection: pi(PLUS) = 1 Problem 1.2: SCC Processor: -> Pairs: PLUS(X1,active(X2)) -> PLUS(X1,X2) PLUS(X1,mark(X2)) -> PLUS(X1,X2) -> Rules: U11(active(X1),X2) -> U11(X1,X2) U11(mark(X1),X2) -> U11(X1,X2) U11(X1,active(X2)) -> U11(X1,X2) U11(X1,mark(X2)) -> U11(X1,X2) U21(active(X1),X2,X3) -> U21(X1,X2,X3) U21(mark(X1),X2,X3) -> U21(X1,X2,X3) U21(X1,active(X2),X3) -> U21(X1,X2,X3) U21(X1,mark(X2),X3) -> U21(X1,X2,X3) U21(X1,X2,active(X3)) -> U21(X1,X2,X3) U21(X1,X2,mark(X3)) -> U21(X1,X2,X3) active(U11(tt,N)) -> mark(N) active(U21(tt,M,N)) -> mark(s(plus(N,M))) active(and(tt,X)) -> mark(X) active(isNat(plus(V1,V2))) -> mark(and(isNat(V1),isNat(V2))) active(isNat(s(V1))) -> mark(isNat(V1)) active(isNat(0)) -> mark(tt) active(plus(N,s(M))) -> mark(U21(and(isNat(M),isNat(N)),M,N)) active(plus(N,0)) -> mark(U11(isNat(N),N)) and(active(X1),X2) -> and(X1,X2) and(mark(X1),X2) -> and(X1,X2) and(X1,active(X2)) -> and(X1,X2) and(X1,mark(X2)) -> and(X1,X2) isNat(active(X)) -> isNat(X) isNat(mark(X)) -> isNat(X) mark(U11(X1,X2)) -> active(U11(mark(X1),X2)) mark(U21(X1,X2,X3)) -> active(U21(mark(X1),X2,X3)) mark(and(X1,X2)) -> active(and(mark(X1),X2)) mark(isNat(X)) -> active(isNat(X)) mark(plus(X1,X2)) -> active(plus(mark(X1),mark(X2))) mark(s(X)) -> active(s(mark(X))) mark(0) -> active(0) mark(tt) -> active(tt) plus(active(X1),X2) -> plus(X1,X2) plus(mark(X1),X2) -> plus(X1,X2) plus(X1,active(X2)) -> plus(X1,X2) plus(X1,mark(X2)) -> plus(X1,X2) s(active(X)) -> s(X) s(mark(X)) -> s(X) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: PLUS(X1,active(X2)) -> PLUS(X1,X2) PLUS(X1,mark(X2)) -> PLUS(X1,X2) ->->-> Rules: U11(active(X1),X2) -> U11(X1,X2) U11(mark(X1),X2) -> U11(X1,X2) U11(X1,active(X2)) -> U11(X1,X2) U11(X1,mark(X2)) -> U11(X1,X2) U21(active(X1),X2,X3) -> U21(X1,X2,X3) U21(mark(X1),X2,X3) -> U21(X1,X2,X3) U21(X1,active(X2),X3) -> U21(X1,X2,X3) U21(X1,mark(X2),X3) -> U21(X1,X2,X3) U21(X1,X2,active(X3)) -> U21(X1,X2,X3) U21(X1,X2,mark(X3)) -> U21(X1,X2,X3) active(U11(tt,N)) -> mark(N) active(U21(tt,M,N)) -> mark(s(plus(N,M))) active(and(tt,X)) -> mark(X) active(isNat(plus(V1,V2))) -> mark(and(isNat(V1),isNat(V2))) active(isNat(s(V1))) -> mark(isNat(V1)) active(isNat(0)) -> mark(tt) active(plus(N,s(M))) -> mark(U21(and(isNat(M),isNat(N)),M,N)) active(plus(N,0)) -> mark(U11(isNat(N),N)) and(active(X1),X2) -> and(X1,X2) and(mark(X1),X2) -> and(X1,X2) and(X1,active(X2)) -> and(X1,X2) and(X1,mark(X2)) -> and(X1,X2) isNat(active(X)) -> isNat(X) isNat(mark(X)) -> isNat(X) mark(U11(X1,X2)) -> active(U11(mark(X1),X2)) mark(U21(X1,X2,X3)) -> active(U21(mark(X1),X2,X3)) mark(and(X1,X2)) -> active(and(mark(X1),X2)) mark(isNat(X)) -> active(isNat(X)) mark(plus(X1,X2)) -> active(plus(mark(X1),mark(X2))) mark(s(X)) -> active(s(mark(X))) mark(0) -> active(0) mark(tt) -> active(tt) plus(active(X1),X2) -> plus(X1,X2) plus(mark(X1),X2) -> plus(X1,X2) plus(X1,active(X2)) -> plus(X1,X2) plus(X1,mark(X2)) -> plus(X1,X2) s(active(X)) -> s(X) s(mark(X)) -> s(X) Problem 1.2: Subterm Processor: -> Pairs: PLUS(X1,active(X2)) -> PLUS(X1,X2) PLUS(X1,mark(X2)) -> PLUS(X1,X2) -> Rules: U11(active(X1),X2) -> U11(X1,X2) U11(mark(X1),X2) -> U11(X1,X2) U11(X1,active(X2)) -> U11(X1,X2) U11(X1,mark(X2)) -> U11(X1,X2) U21(active(X1),X2,X3) -> U21(X1,X2,X3) U21(mark(X1),X2,X3) -> U21(X1,X2,X3) U21(X1,active(X2),X3) -> U21(X1,X2,X3) U21(X1,mark(X2),X3) -> U21(X1,X2,X3) U21(X1,X2,active(X3)) -> U21(X1,X2,X3) U21(X1,X2,mark(X3)) -> U21(X1,X2,X3) active(U11(tt,N)) -> mark(N) active(U21(tt,M,N)) -> mark(s(plus(N,M))) active(and(tt,X)) -> mark(X) active(isNat(plus(V1,V2))) -> mark(and(isNat(V1),isNat(V2))) active(isNat(s(V1))) -> mark(isNat(V1)) active(isNat(0)) -> mark(tt) active(plus(N,s(M))) -> mark(U21(and(isNat(M),isNat(N)),M,N)) active(plus(N,0)) -> mark(U11(isNat(N),N)) and(active(X1),X2) -> and(X1,X2) and(mark(X1),X2) -> and(X1,X2) and(X1,active(X2)) -> and(X1,X2) and(X1,mark(X2)) -> and(X1,X2) isNat(active(X)) -> isNat(X) isNat(mark(X)) -> isNat(X) mark(U11(X1,X2)) -> active(U11(mark(X1),X2)) mark(U21(X1,X2,X3)) -> active(U21(mark(X1),X2,X3)) mark(and(X1,X2)) -> active(and(mark(X1),X2)) mark(isNat(X)) -> active(isNat(X)) mark(plus(X1,X2)) -> active(plus(mark(X1),mark(X2))) mark(s(X)) -> active(s(mark(X))) mark(0) -> active(0) mark(tt) -> active(tt) plus(active(X1),X2) -> plus(X1,X2) plus(mark(X1),X2) -> plus(X1,X2) plus(X1,active(X2)) -> plus(X1,X2) plus(X1,mark(X2)) -> plus(X1,X2) s(active(X)) -> s(X) s(mark(X)) -> s(X) ->Projection: pi(PLUS) = 2 Problem 1.2: SCC Processor: -> Pairs: Empty -> Rules: U11(active(X1),X2) -> U11(X1,X2) U11(mark(X1),X2) -> U11(X1,X2) U11(X1,active(X2)) -> U11(X1,X2) U11(X1,mark(X2)) -> U11(X1,X2) U21(active(X1),X2,X3) -> U21(X1,X2,X3) U21(mark(X1),X2,X3) -> U21(X1,X2,X3) U21(X1,active(X2),X3) -> U21(X1,X2,X3) U21(X1,mark(X2),X3) -> U21(X1,X2,X3) U21(X1,X2,active(X3)) -> U21(X1,X2,X3) U21(X1,X2,mark(X3)) -> U21(X1,X2,X3) active(U11(tt,N)) -> mark(N) active(U21(tt,M,N)) -> mark(s(plus(N,M))) active(and(tt,X)) -> mark(X) active(isNat(plus(V1,V2))) -> mark(and(isNat(V1),isNat(V2))) active(isNat(s(V1))) -> mark(isNat(V1)) active(isNat(0)) -> mark(tt) active(plus(N,s(M))) -> mark(U21(and(isNat(M),isNat(N)),M,N)) active(plus(N,0)) -> mark(U11(isNat(N),N)) and(active(X1),X2) -> and(X1,X2) and(mark(X1),X2) -> and(X1,X2) and(X1,active(X2)) -> and(X1,X2) and(X1,mark(X2)) -> and(X1,X2) isNat(active(X)) -> isNat(X) isNat(mark(X)) -> isNat(X) mark(U11(X1,X2)) -> active(U11(mark(X1),X2)) mark(U21(X1,X2,X3)) -> active(U21(mark(X1),X2,X3)) mark(and(X1,X2)) -> active(and(mark(X1),X2)) mark(isNat(X)) -> active(isNat(X)) mark(plus(X1,X2)) -> active(plus(mark(X1),mark(X2))) mark(s(X)) -> active(s(mark(X))) mark(0) -> active(0) mark(tt) -> active(tt) plus(active(X1),X2) -> plus(X1,X2) plus(mark(X1),X2) -> plus(X1,X2) plus(X1,active(X2)) -> plus(X1,X2) plus(X1,mark(X2)) -> plus(X1,X2) s(active(X)) -> s(X) s(mark(X)) -> s(X) ->Strongly Connected Components: There is no strongly connected component The problem is finite. Problem 1.3: Subterm Processor: -> Pairs: ISNAT(active(X)) -> ISNAT(X) ISNAT(mark(X)) -> ISNAT(X) -> Rules: U11(active(X1),X2) -> U11(X1,X2) U11(mark(X1),X2) -> U11(X1,X2) U11(X1,active(X2)) -> U11(X1,X2) U11(X1,mark(X2)) -> U11(X1,X2) U21(active(X1),X2,X3) -> U21(X1,X2,X3) U21(mark(X1),X2,X3) -> U21(X1,X2,X3) U21(X1,active(X2),X3) -> U21(X1,X2,X3) U21(X1,mark(X2),X3) -> U21(X1,X2,X3) U21(X1,X2,active(X3)) -> U21(X1,X2,X3) U21(X1,X2,mark(X3)) -> U21(X1,X2,X3) active(U11(tt,N)) -> mark(N) active(U21(tt,M,N)) -> mark(s(plus(N,M))) active(and(tt,X)) -> mark(X) active(isNat(plus(V1,V2))) -> mark(and(isNat(V1),isNat(V2))) active(isNat(s(V1))) -> mark(isNat(V1)) active(isNat(0)) -> mark(tt) active(plus(N,s(M))) -> mark(U21(and(isNat(M),isNat(N)),M,N)) active(plus(N,0)) -> mark(U11(isNat(N),N)) and(active(X1),X2) -> and(X1,X2) and(mark(X1),X2) -> and(X1,X2) and(X1,active(X2)) -> and(X1,X2) and(X1,mark(X2)) -> and(X1,X2) isNat(active(X)) -> isNat(X) isNat(mark(X)) -> isNat(X) mark(U11(X1,X2)) -> active(U11(mark(X1),X2)) mark(U21(X1,X2,X3)) -> active(U21(mark(X1),X2,X3)) mark(and(X1,X2)) -> active(and(mark(X1),X2)) mark(isNat(X)) -> active(isNat(X)) mark(plus(X1,X2)) -> active(plus(mark(X1),mark(X2))) mark(s(X)) -> active(s(mark(X))) mark(0) -> active(0) mark(tt) -> active(tt) plus(active(X1),X2) -> plus(X1,X2) plus(mark(X1),X2) -> plus(X1,X2) plus(X1,active(X2)) -> plus(X1,X2) plus(X1,mark(X2)) -> plus(X1,X2) s(active(X)) -> s(X) s(mark(X)) -> s(X) ->Projection: pi(ISNAT) = 1 Problem 1.3: SCC Processor: -> Pairs: Empty -> Rules: U11(active(X1),X2) -> U11(X1,X2) U11(mark(X1),X2) -> U11(X1,X2) U11(X1,active(X2)) -> U11(X1,X2) U11(X1,mark(X2)) -> U11(X1,X2) U21(active(X1),X2,X3) -> U21(X1,X2,X3) U21(mark(X1),X2,X3) -> U21(X1,X2,X3) U21(X1,active(X2),X3) -> U21(X1,X2,X3) U21(X1,mark(X2),X3) -> U21(X1,X2,X3) U21(X1,X2,active(X3)) -> U21(X1,X2,X3) U21(X1,X2,mark(X3)) -> U21(X1,X2,X3) active(U11(tt,N)) -> mark(N) active(U21(tt,M,N)) -> mark(s(plus(N,M))) active(and(tt,X)) -> mark(X) active(isNat(plus(V1,V2))) -> mark(and(isNat(V1),isNat(V2))) active(isNat(s(V1))) -> mark(isNat(V1)) active(isNat(0)) -> mark(tt) active(plus(N,s(M))) -> mark(U21(and(isNat(M),isNat(N)),M,N)) active(plus(N,0)) -> mark(U11(isNat(N),N)) and(active(X1),X2) -> and(X1,X2) and(mark(X1),X2) -> and(X1,X2) and(X1,active(X2)) -> and(X1,X2) and(X1,mark(X2)) -> and(X1,X2) isNat(active(X)) -> isNat(X) isNat(mark(X)) -> isNat(X) mark(U11(X1,X2)) -> active(U11(mark(X1),X2)) mark(U21(X1,X2,X3)) -> active(U21(mark(X1),X2,X3)) mark(and(X1,X2)) -> active(and(mark(X1),X2)) mark(isNat(X)) -> active(isNat(X)) mark(plus(X1,X2)) -> active(plus(mark(X1),mark(X2))) mark(s(X)) -> active(s(mark(X))) mark(0) -> active(0) mark(tt) -> active(tt) plus(active(X1),X2) -> plus(X1,X2) plus(mark(X1),X2) -> plus(X1,X2) plus(X1,active(X2)) -> plus(X1,X2) plus(X1,mark(X2)) -> plus(X1,X2) s(active(X)) -> s(X) s(mark(X)) -> s(X) ->Strongly Connected Components: There is no strongly connected component The problem is finite. Problem 1.4: Subterm Processor: -> Pairs: AND(active(X1),X2) -> AND(X1,X2) AND(mark(X1),X2) -> AND(X1,X2) AND(X1,active(X2)) -> AND(X1,X2) AND(X1,mark(X2)) -> AND(X1,X2) -> Rules: U11(active(X1),X2) -> U11(X1,X2) U11(mark(X1),X2) -> U11(X1,X2) U11(X1,active(X2)) -> U11(X1,X2) U11(X1,mark(X2)) -> U11(X1,X2) U21(active(X1),X2,X3) -> U21(X1,X2,X3) U21(mark(X1),X2,X3) -> U21(X1,X2,X3) U21(X1,active(X2),X3) -> U21(X1,X2,X3) U21(X1,mark(X2),X3) -> U21(X1,X2,X3) U21(X1,X2,active(X3)) -> U21(X1,X2,X3) U21(X1,X2,mark(X3)) -> U21(X1,X2,X3) active(U11(tt,N)) -> mark(N) active(U21(tt,M,N)) -> mark(s(plus(N,M))) active(and(tt,X)) -> mark(X) active(isNat(plus(V1,V2))) -> mark(and(isNat(V1),isNat(V2))) active(isNat(s(V1))) -> mark(isNat(V1)) active(isNat(0)) -> mark(tt) active(plus(N,s(M))) -> mark(U21(and(isNat(M),isNat(N)),M,N)) active(plus(N,0)) -> mark(U11(isNat(N),N)) and(active(X1),X2) -> and(X1,X2) and(mark(X1),X2) -> and(X1,X2) and(X1,active(X2)) -> and(X1,X2) and(X1,mark(X2)) -> and(X1,X2) isNat(active(X)) -> isNat(X) isNat(mark(X)) -> isNat(X) mark(U11(X1,X2)) -> active(U11(mark(X1),X2)) mark(U21(X1,X2,X3)) -> active(U21(mark(X1),X2,X3)) mark(and(X1,X2)) -> active(and(mark(X1),X2)) mark(isNat(X)) -> active(isNat(X)) mark(plus(X1,X2)) -> active(plus(mark(X1),mark(X2))) mark(s(X)) -> active(s(mark(X))) mark(0) -> active(0) mark(tt) -> active(tt) plus(active(X1),X2) -> plus(X1,X2) plus(mark(X1),X2) -> plus(X1,X2) plus(X1,active(X2)) -> plus(X1,X2) plus(X1,mark(X2)) -> plus(X1,X2) s(active(X)) -> s(X) s(mark(X)) -> s(X) ->Projection: pi(AND) = 1 Problem 1.4: SCC Processor: -> Pairs: AND(X1,active(X2)) -> AND(X1,X2) AND(X1,mark(X2)) -> AND(X1,X2) -> Rules: U11(active(X1),X2) -> U11(X1,X2) U11(mark(X1),X2) -> U11(X1,X2) U11(X1,active(X2)) -> U11(X1,X2) U11(X1,mark(X2)) -> U11(X1,X2) U21(active(X1),X2,X3) -> U21(X1,X2,X3) U21(mark(X1),X2,X3) -> U21(X1,X2,X3) U21(X1,active(X2),X3) -> U21(X1,X2,X3) U21(X1,mark(X2),X3) -> U21(X1,X2,X3) U21(X1,X2,active(X3)) -> U21(X1,X2,X3) U21(X1,X2,mark(X3)) -> U21(X1,X2,X3) active(U11(tt,N)) -> mark(N) active(U21(tt,M,N)) -> mark(s(plus(N,M))) active(and(tt,X)) -> mark(X) active(isNat(plus(V1,V2))) -> mark(and(isNat(V1),isNat(V2))) active(isNat(s(V1))) -> mark(isNat(V1)) active(isNat(0)) -> mark(tt) active(plus(N,s(M))) -> mark(U21(and(isNat(M),isNat(N)),M,N)) active(plus(N,0)) -> mark(U11(isNat(N),N)) and(active(X1),X2) -> and(X1,X2) and(mark(X1),X2) -> and(X1,X2) and(X1,active(X2)) -> and(X1,X2) and(X1,mark(X2)) -> and(X1,X2) isNat(active(X)) -> isNat(X) isNat(mark(X)) -> isNat(X) mark(U11(X1,X2)) -> active(U11(mark(X1),X2)) mark(U21(X1,X2,X3)) -> active(U21(mark(X1),X2,X3)) mark(and(X1,X2)) -> active(and(mark(X1),X2)) mark(isNat(X)) -> active(isNat(X)) mark(plus(X1,X2)) -> active(plus(mark(X1),mark(X2))) mark(s(X)) -> active(s(mark(X))) mark(0) -> active(0) mark(tt) -> active(tt) plus(active(X1),X2) -> plus(X1,X2) plus(mark(X1),X2) -> plus(X1,X2) plus(X1,active(X2)) -> plus(X1,X2) plus(X1,mark(X2)) -> plus(X1,X2) s(active(X)) -> s(X) s(mark(X)) -> s(X) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: AND(X1,active(X2)) -> AND(X1,X2) AND(X1,mark(X2)) -> AND(X1,X2) ->->-> Rules: U11(active(X1),X2) -> U11(X1,X2) U11(mark(X1),X2) -> U11(X1,X2) U11(X1,active(X2)) -> U11(X1,X2) U11(X1,mark(X2)) -> U11(X1,X2) U21(active(X1),X2,X3) -> U21(X1,X2,X3) U21(mark(X1),X2,X3) -> U21(X1,X2,X3) U21(X1,active(X2),X3) -> U21(X1,X2,X3) U21(X1,mark(X2),X3) -> U21(X1,X2,X3) U21(X1,X2,active(X3)) -> U21(X1,X2,X3) U21(X1,X2,mark(X3)) -> U21(X1,X2,X3) active(U11(tt,N)) -> mark(N) active(U21(tt,M,N)) -> mark(s(plus(N,M))) active(and(tt,X)) -> mark(X) active(isNat(plus(V1,V2))) -> mark(and(isNat(V1),isNat(V2))) active(isNat(s(V1))) -> mark(isNat(V1)) active(isNat(0)) -> mark(tt) active(plus(N,s(M))) -> mark(U21(and(isNat(M),isNat(N)),M,N)) active(plus(N,0)) -> mark(U11(isNat(N),N)) and(active(X1),X2) -> and(X1,X2) and(mark(X1),X2) -> and(X1,X2) and(X1,active(X2)) -> and(X1,X2) and(X1,mark(X2)) -> and(X1,X2) isNat(active(X)) -> isNat(X) isNat(mark(X)) -> isNat(X) mark(U11(X1,X2)) -> active(U11(mark(X1),X2)) mark(U21(X1,X2,X3)) -> active(U21(mark(X1),X2,X3)) mark(and(X1,X2)) -> active(and(mark(X1),X2)) mark(isNat(X)) -> active(isNat(X)) mark(plus(X1,X2)) -> active(plus(mark(X1),mark(X2))) mark(s(X)) -> active(s(mark(X))) mark(0) -> active(0) mark(tt) -> active(tt) plus(active(X1),X2) -> plus(X1,X2) plus(mark(X1),X2) -> plus(X1,X2) plus(X1,active(X2)) -> plus(X1,X2) plus(X1,mark(X2)) -> plus(X1,X2) s(active(X)) -> s(X) s(mark(X)) -> s(X) Problem 1.4: Subterm Processor: -> Pairs: AND(X1,active(X2)) -> AND(X1,X2) AND(X1,mark(X2)) -> AND(X1,X2) -> Rules: U11(active(X1),X2) -> U11(X1,X2) U11(mark(X1),X2) -> U11(X1,X2) U11(X1,active(X2)) -> U11(X1,X2) U11(X1,mark(X2)) -> U11(X1,X2) U21(active(X1),X2,X3) -> U21(X1,X2,X3) U21(mark(X1),X2,X3) -> U21(X1,X2,X3) U21(X1,active(X2),X3) -> U21(X1,X2,X3) U21(X1,mark(X2),X3) -> U21(X1,X2,X3) U21(X1,X2,active(X3)) -> U21(X1,X2,X3) U21(X1,X2,mark(X3)) -> U21(X1,X2,X3) active(U11(tt,N)) -> mark(N) active(U21(tt,M,N)) -> mark(s(plus(N,M))) active(and(tt,X)) -> mark(X) active(isNat(plus(V1,V2))) -> mark(and(isNat(V1),isNat(V2))) active(isNat(s(V1))) -> mark(isNat(V1)) active(isNat(0)) -> mark(tt) active(plus(N,s(M))) -> mark(U21(and(isNat(M),isNat(N)),M,N)) active(plus(N,0)) -> mark(U11(isNat(N),N)) and(active(X1),X2) -> and(X1,X2) and(mark(X1),X2) -> and(X1,X2) and(X1,active(X2)) -> and(X1,X2) and(X1,mark(X2)) -> and(X1,X2) isNat(active(X)) -> isNat(X) isNat(mark(X)) -> isNat(X) mark(U11(X1,X2)) -> active(U11(mark(X1),X2)) mark(U21(X1,X2,X3)) -> active(U21(mark(X1),X2,X3)) mark(and(X1,X2)) -> active(and(mark(X1),X2)) mark(isNat(X)) -> active(isNat(X)) mark(plus(X1,X2)) -> active(plus(mark(X1),mark(X2))) mark(s(X)) -> active(s(mark(X))) mark(0) -> active(0) mark(tt) -> active(tt) plus(active(X1),X2) -> plus(X1,X2) plus(mark(X1),X2) -> plus(X1,X2) plus(X1,active(X2)) -> plus(X1,X2) plus(X1,mark(X2)) -> plus(X1,X2) s(active(X)) -> s(X) s(mark(X)) -> s(X) ->Projection: pi(AND) = 2 Problem 1.4: SCC Processor: -> Pairs: Empty -> Rules: U11(active(X1),X2) -> U11(X1,X2) U11(mark(X1),X2) -> U11(X1,X2) U11(X1,active(X2)) -> U11(X1,X2) U11(X1,mark(X2)) -> U11(X1,X2) U21(active(X1),X2,X3) -> U21(X1,X2,X3) U21(mark(X1),X2,X3) -> U21(X1,X2,X3) U21(X1,active(X2),X3) -> U21(X1,X2,X3) U21(X1,mark(X2),X3) -> U21(X1,X2,X3) U21(X1,X2,active(X3)) -> U21(X1,X2,X3) U21(X1,X2,mark(X3)) -> U21(X1,X2,X3) active(U11(tt,N)) -> mark(N) active(U21(tt,M,N)) -> mark(s(plus(N,M))) active(and(tt,X)) -> mark(X) active(isNat(plus(V1,V2))) -> mark(and(isNat(V1),isNat(V2))) active(isNat(s(V1))) -> mark(isNat(V1)) active(isNat(0)) -> mark(tt) active(plus(N,s(M))) -> mark(U21(and(isNat(M),isNat(N)),M,N)) active(plus(N,0)) -> mark(U11(isNat(N),N)) and(active(X1),X2) -> and(X1,X2) and(mark(X1),X2) -> and(X1,X2) and(X1,active(X2)) -> and(X1,X2) and(X1,mark(X2)) -> and(X1,X2) isNat(active(X)) -> isNat(X) isNat(mark(X)) -> isNat(X) mark(U11(X1,X2)) -> active(U11(mark(X1),X2)) mark(U21(X1,X2,X3)) -> active(U21(mark(X1),X2,X3)) mark(and(X1,X2)) -> active(and(mark(X1),X2)) mark(isNat(X)) -> active(isNat(X)) mark(plus(X1,X2)) -> active(plus(mark(X1),mark(X2))) mark(s(X)) -> active(s(mark(X))) mark(0) -> active(0) mark(tt) -> active(tt) plus(active(X1),X2) -> plus(X1,X2) plus(mark(X1),X2) -> plus(X1,X2) plus(X1,active(X2)) -> plus(X1,X2) plus(X1,mark(X2)) -> plus(X1,X2) s(active(X)) -> s(X) s(mark(X)) -> s(X) ->Strongly Connected Components: There is no strongly connected component The problem is finite. Problem 1.5: Subterm Processor: -> Pairs: U21#(active(X1),X2,X3) -> U21#(X1,X2,X3) U21#(mark(X1),X2,X3) -> U21#(X1,X2,X3) U21#(X1,active(X2),X3) -> U21#(X1,X2,X3) U21#(X1,mark(X2),X3) -> U21#(X1,X2,X3) U21#(X1,X2,active(X3)) -> U21#(X1,X2,X3) U21#(X1,X2,mark(X3)) -> U21#(X1,X2,X3) -> Rules: U11(active(X1),X2) -> U11(X1,X2) U11(mark(X1),X2) -> U11(X1,X2) U11(X1,active(X2)) -> U11(X1,X2) U11(X1,mark(X2)) -> U11(X1,X2) U21(active(X1),X2,X3) -> U21(X1,X2,X3) U21(mark(X1),X2,X3) -> U21(X1,X2,X3) U21(X1,active(X2),X3) -> U21(X1,X2,X3) U21(X1,mark(X2),X3) -> U21(X1,X2,X3) U21(X1,X2,active(X3)) -> U21(X1,X2,X3) U21(X1,X2,mark(X3)) -> U21(X1,X2,X3) active(U11(tt,N)) -> mark(N) active(U21(tt,M,N)) -> mark(s(plus(N,M))) active(and(tt,X)) -> mark(X) active(isNat(plus(V1,V2))) -> mark(and(isNat(V1),isNat(V2))) active(isNat(s(V1))) -> mark(isNat(V1)) active(isNat(0)) -> mark(tt) active(plus(N,s(M))) -> mark(U21(and(isNat(M),isNat(N)),M,N)) active(plus(N,0)) -> mark(U11(isNat(N),N)) and(active(X1),X2) -> and(X1,X2) and(mark(X1),X2) -> and(X1,X2) and(X1,active(X2)) -> and(X1,X2) and(X1,mark(X2)) -> and(X1,X2) isNat(active(X)) -> isNat(X) isNat(mark(X)) -> isNat(X) mark(U11(X1,X2)) -> active(U11(mark(X1),X2)) mark(U21(X1,X2,X3)) -> active(U21(mark(X1),X2,X3)) mark(and(X1,X2)) -> active(and(mark(X1),X2)) mark(isNat(X)) -> active(isNat(X)) mark(plus(X1,X2)) -> active(plus(mark(X1),mark(X2))) mark(s(X)) -> active(s(mark(X))) mark(0) -> active(0) mark(tt) -> active(tt) plus(active(X1),X2) -> plus(X1,X2) plus(mark(X1),X2) -> plus(X1,X2) plus(X1,active(X2)) -> plus(X1,X2) plus(X1,mark(X2)) -> plus(X1,X2) s(active(X)) -> s(X) s(mark(X)) -> s(X) ->Projection: pi(U21#) = 1 Problem 1.5: SCC Processor: -> Pairs: U21#(X1,active(X2),X3) -> U21#(X1,X2,X3) U21#(X1,mark(X2),X3) -> U21#(X1,X2,X3) U21#(X1,X2,active(X3)) -> U21#(X1,X2,X3) U21#(X1,X2,mark(X3)) -> U21#(X1,X2,X3) -> Rules: U11(active(X1),X2) -> U11(X1,X2) U11(mark(X1),X2) -> U11(X1,X2) U11(X1,active(X2)) -> U11(X1,X2) U11(X1,mark(X2)) -> U11(X1,X2) U21(active(X1),X2,X3) -> U21(X1,X2,X3) U21(mark(X1),X2,X3) -> U21(X1,X2,X3) U21(X1,active(X2),X3) -> U21(X1,X2,X3) U21(X1,mark(X2),X3) -> U21(X1,X2,X3) U21(X1,X2,active(X3)) -> U21(X1,X2,X3) U21(X1,X2,mark(X3)) -> U21(X1,X2,X3) active(U11(tt,N)) -> mark(N) active(U21(tt,M,N)) -> mark(s(plus(N,M))) active(and(tt,X)) -> mark(X) active(isNat(plus(V1,V2))) -> mark(and(isNat(V1),isNat(V2))) active(isNat(s(V1))) -> mark(isNat(V1)) active(isNat(0)) -> mark(tt) active(plus(N,s(M))) -> mark(U21(and(isNat(M),isNat(N)),M,N)) active(plus(N,0)) -> mark(U11(isNat(N),N)) and(active(X1),X2) -> and(X1,X2) and(mark(X1),X2) -> and(X1,X2) and(X1,active(X2)) -> and(X1,X2) and(X1,mark(X2)) -> and(X1,X2) isNat(active(X)) -> isNat(X) isNat(mark(X)) -> isNat(X) mark(U11(X1,X2)) -> active(U11(mark(X1),X2)) mark(U21(X1,X2,X3)) -> active(U21(mark(X1),X2,X3)) mark(and(X1,X2)) -> active(and(mark(X1),X2)) mark(isNat(X)) -> active(isNat(X)) mark(plus(X1,X2)) -> active(plus(mark(X1),mark(X2))) mark(s(X)) -> active(s(mark(X))) mark(0) -> active(0) mark(tt) -> active(tt) plus(active(X1),X2) -> plus(X1,X2) plus(mark(X1),X2) -> plus(X1,X2) plus(X1,active(X2)) -> plus(X1,X2) plus(X1,mark(X2)) -> plus(X1,X2) s(active(X)) -> s(X) s(mark(X)) -> s(X) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: U21#(X1,active(X2),X3) -> U21#(X1,X2,X3) U21#(X1,mark(X2),X3) -> U21#(X1,X2,X3) U21#(X1,X2,active(X3)) -> U21#(X1,X2,X3) U21#(X1,X2,mark(X3)) -> U21#(X1,X2,X3) ->->-> Rules: U11(active(X1),X2) -> U11(X1,X2) U11(mark(X1),X2) -> U11(X1,X2) U11(X1,active(X2)) -> U11(X1,X2) U11(X1,mark(X2)) -> U11(X1,X2) U21(active(X1),X2,X3) -> U21(X1,X2,X3) U21(mark(X1),X2,X3) -> U21(X1,X2,X3) U21(X1,active(X2),X3) -> U21(X1,X2,X3) U21(X1,mark(X2),X3) -> U21(X1,X2,X3) U21(X1,X2,active(X3)) -> U21(X1,X2,X3) U21(X1,X2,mark(X3)) -> U21(X1,X2,X3) active(U11(tt,N)) -> mark(N) active(U21(tt,M,N)) -> mark(s(plus(N,M))) active(and(tt,X)) -> mark(X) active(isNat(plus(V1,V2))) -> mark(and(isNat(V1),isNat(V2))) active(isNat(s(V1))) -> mark(isNat(V1)) active(isNat(0)) -> mark(tt) active(plus(N,s(M))) -> mark(U21(and(isNat(M),isNat(N)),M,N)) active(plus(N,0)) -> mark(U11(isNat(N),N)) and(active(X1),X2) -> and(X1,X2) and(mark(X1),X2) -> and(X1,X2) and(X1,active(X2)) -> and(X1,X2) and(X1,mark(X2)) -> and(X1,X2) isNat(active(X)) -> isNat(X) isNat(mark(X)) -> isNat(X) mark(U11(X1,X2)) -> active(U11(mark(X1),X2)) mark(U21(X1,X2,X3)) -> active(U21(mark(X1),X2,X3)) mark(and(X1,X2)) -> active(and(mark(X1),X2)) mark(isNat(X)) -> active(isNat(X)) mark(plus(X1,X2)) -> active(plus(mark(X1),mark(X2))) mark(s(X)) -> active(s(mark(X))) mark(0) -> active(0) mark(tt) -> active(tt) plus(active(X1),X2) -> plus(X1,X2) plus(mark(X1),X2) -> plus(X1,X2) plus(X1,active(X2)) -> plus(X1,X2) plus(X1,mark(X2)) -> plus(X1,X2) s(active(X)) -> s(X) s(mark(X)) -> s(X) Problem 1.5: Subterm Processor: -> Pairs: U21#(X1,active(X2),X3) -> U21#(X1,X2,X3) U21#(X1,mark(X2),X3) -> U21#(X1,X2,X3) U21#(X1,X2,active(X3)) -> U21#(X1,X2,X3) U21#(X1,X2,mark(X3)) -> U21#(X1,X2,X3) -> Rules: U11(active(X1),X2) -> U11(X1,X2) U11(mark(X1),X2) -> U11(X1,X2) U11(X1,active(X2)) -> U11(X1,X2) U11(X1,mark(X2)) -> U11(X1,X2) U21(active(X1),X2,X3) -> U21(X1,X2,X3) U21(mark(X1),X2,X3) -> U21(X1,X2,X3) U21(X1,active(X2),X3) -> U21(X1,X2,X3) U21(X1,mark(X2),X3) -> U21(X1,X2,X3) U21(X1,X2,active(X3)) -> U21(X1,X2,X3) U21(X1,X2,mark(X3)) -> U21(X1,X2,X3) active(U11(tt,N)) -> mark(N) active(U21(tt,M,N)) -> mark(s(plus(N,M))) active(and(tt,X)) -> mark(X) active(isNat(plus(V1,V2))) -> mark(and(isNat(V1),isNat(V2))) active(isNat(s(V1))) -> mark(isNat(V1)) active(isNat(0)) -> mark(tt) active(plus(N,s(M))) -> mark(U21(and(isNat(M),isNat(N)),M,N)) active(plus(N,0)) -> mark(U11(isNat(N),N)) and(active(X1),X2) -> and(X1,X2) and(mark(X1),X2) -> and(X1,X2) and(X1,active(X2)) -> and(X1,X2) and(X1,mark(X2)) -> and(X1,X2) isNat(active(X)) -> isNat(X) isNat(mark(X)) -> isNat(X) mark(U11(X1,X2)) -> active(U11(mark(X1),X2)) mark(U21(X1,X2,X3)) -> active(U21(mark(X1),X2,X3)) mark(and(X1,X2)) -> active(and(mark(X1),X2)) mark(isNat(X)) -> active(isNat(X)) mark(plus(X1,X2)) -> active(plus(mark(X1),mark(X2))) mark(s(X)) -> active(s(mark(X))) mark(0) -> active(0) mark(tt) -> active(tt) plus(active(X1),X2) -> plus(X1,X2) plus(mark(X1),X2) -> plus(X1,X2) plus(X1,active(X2)) -> plus(X1,X2) plus(X1,mark(X2)) -> plus(X1,X2) s(active(X)) -> s(X) s(mark(X)) -> s(X) ->Projection: pi(U21#) = 2 Problem 1.5: SCC Processor: -> Pairs: U21#(X1,X2,active(X3)) -> U21#(X1,X2,X3) U21#(X1,X2,mark(X3)) -> U21#(X1,X2,X3) -> Rules: U11(active(X1),X2) -> U11(X1,X2) U11(mark(X1),X2) -> U11(X1,X2) U11(X1,active(X2)) -> U11(X1,X2) U11(X1,mark(X2)) -> U11(X1,X2) U21(active(X1),X2,X3) -> U21(X1,X2,X3) U21(mark(X1),X2,X3) -> U21(X1,X2,X3) U21(X1,active(X2),X3) -> U21(X1,X2,X3) U21(X1,mark(X2),X3) -> U21(X1,X2,X3) U21(X1,X2,active(X3)) -> U21(X1,X2,X3) U21(X1,X2,mark(X3)) -> U21(X1,X2,X3) active(U11(tt,N)) -> mark(N) active(U21(tt,M,N)) -> mark(s(plus(N,M))) active(and(tt,X)) -> mark(X) active(isNat(plus(V1,V2))) -> mark(and(isNat(V1),isNat(V2))) active(isNat(s(V1))) -> mark(isNat(V1)) active(isNat(0)) -> mark(tt) active(plus(N,s(M))) -> mark(U21(and(isNat(M),isNat(N)),M,N)) active(plus(N,0)) -> mark(U11(isNat(N),N)) and(active(X1),X2) -> and(X1,X2) and(mark(X1),X2) -> and(X1,X2) and(X1,active(X2)) -> and(X1,X2) and(X1,mark(X2)) -> and(X1,X2) isNat(active(X)) -> isNat(X) isNat(mark(X)) -> isNat(X) mark(U11(X1,X2)) -> active(U11(mark(X1),X2)) mark(U21(X1,X2,X3)) -> active(U21(mark(X1),X2,X3)) mark(and(X1,X2)) -> active(and(mark(X1),X2)) mark(isNat(X)) -> active(isNat(X)) mark(plus(X1,X2)) -> active(plus(mark(X1),mark(X2))) mark(s(X)) -> active(s(mark(X))) mark(0) -> active(0) mark(tt) -> active(tt) plus(active(X1),X2) -> plus(X1,X2) plus(mark(X1),X2) -> plus(X1,X2) plus(X1,active(X2)) -> plus(X1,X2) plus(X1,mark(X2)) -> plus(X1,X2) s(active(X)) -> s(X) s(mark(X)) -> s(X) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: U21#(X1,X2,active(X3)) -> U21#(X1,X2,X3) U21#(X1,X2,mark(X3)) -> U21#(X1,X2,X3) ->->-> Rules: U11(active(X1),X2) -> U11(X1,X2) U11(mark(X1),X2) -> U11(X1,X2) U11(X1,active(X2)) -> U11(X1,X2) U11(X1,mark(X2)) -> U11(X1,X2) U21(active(X1),X2,X3) -> U21(X1,X2,X3) U21(mark(X1),X2,X3) -> U21(X1,X2,X3) U21(X1,active(X2),X3) -> U21(X1,X2,X3) U21(X1,mark(X2),X3) -> U21(X1,X2,X3) U21(X1,X2,active(X3)) -> U21(X1,X2,X3) U21(X1,X2,mark(X3)) -> U21(X1,X2,X3) active(U11(tt,N)) -> mark(N) active(U21(tt,M,N)) -> mark(s(plus(N,M))) active(and(tt,X)) -> mark(X) active(isNat(plus(V1,V2))) -> mark(and(isNat(V1),isNat(V2))) active(isNat(s(V1))) -> mark(isNat(V1)) active(isNat(0)) -> mark(tt) active(plus(N,s(M))) -> mark(U21(and(isNat(M),isNat(N)),M,N)) active(plus(N,0)) -> mark(U11(isNat(N),N)) and(active(X1),X2) -> and(X1,X2) and(mark(X1),X2) -> and(X1,X2) and(X1,active(X2)) -> and(X1,X2) and(X1,mark(X2)) -> and(X1,X2) isNat(active(X)) -> isNat(X) isNat(mark(X)) -> isNat(X) mark(U11(X1,X2)) -> active(U11(mark(X1),X2)) mark(U21(X1,X2,X3)) -> active(U21(mark(X1),X2,X3)) mark(and(X1,X2)) -> active(and(mark(X1),X2)) mark(isNat(X)) -> active(isNat(X)) mark(plus(X1,X2)) -> active(plus(mark(X1),mark(X2))) mark(s(X)) -> active(s(mark(X))) mark(0) -> active(0) mark(tt) -> active(tt) plus(active(X1),X2) -> plus(X1,X2) plus(mark(X1),X2) -> plus(X1,X2) plus(X1,active(X2)) -> plus(X1,X2) plus(X1,mark(X2)) -> plus(X1,X2) s(active(X)) -> s(X) s(mark(X)) -> s(X) Problem 1.5: Subterm Processor: -> Pairs: U21#(X1,X2,active(X3)) -> U21#(X1,X2,X3) U21#(X1,X2,mark(X3)) -> U21#(X1,X2,X3) -> Rules: U11(active(X1),X2) -> U11(X1,X2) U11(mark(X1),X2) -> U11(X1,X2) U11(X1,active(X2)) -> U11(X1,X2) U11(X1,mark(X2)) -> U11(X1,X2) U21(active(X1),X2,X3) -> U21(X1,X2,X3) U21(mark(X1),X2,X3) -> U21(X1,X2,X3) U21(X1,active(X2),X3) -> U21(X1,X2,X3) U21(X1,mark(X2),X3) -> U21(X1,X2,X3) U21(X1,X2,active(X3)) -> U21(X1,X2,X3) U21(X1,X2,mark(X3)) -> U21(X1,X2,X3) active(U11(tt,N)) -> mark(N) active(U21(tt,M,N)) -> mark(s(plus(N,M))) active(and(tt,X)) -> mark(X) active(isNat(plus(V1,V2))) -> mark(and(isNat(V1),isNat(V2))) active(isNat(s(V1))) -> mark(isNat(V1)) active(isNat(0)) -> mark(tt) active(plus(N,s(M))) -> mark(U21(and(isNat(M),isNat(N)),M,N)) active(plus(N,0)) -> mark(U11(isNat(N),N)) and(active(X1),X2) -> and(X1,X2) and(mark(X1),X2) -> and(X1,X2) and(X1,active(X2)) -> and(X1,X2) and(X1,mark(X2)) -> and(X1,X2) isNat(active(X)) -> isNat(X) isNat(mark(X)) -> isNat(X) mark(U11(X1,X2)) -> active(U11(mark(X1),X2)) mark(U21(X1,X2,X3)) -> active(U21(mark(X1),X2,X3)) mark(and(X1,X2)) -> active(and(mark(X1),X2)) mark(isNat(X)) -> active(isNat(X)) mark(plus(X1,X2)) -> active(plus(mark(X1),mark(X2))) mark(s(X)) -> active(s(mark(X))) mark(0) -> active(0) mark(tt) -> active(tt) plus(active(X1),X2) -> plus(X1,X2) plus(mark(X1),X2) -> plus(X1,X2) plus(X1,active(X2)) -> plus(X1,X2) plus(X1,mark(X2)) -> plus(X1,X2) s(active(X)) -> s(X) s(mark(X)) -> s(X) ->Projection: pi(U21#) = 3 Problem 1.5: SCC Processor: -> Pairs: Empty -> Rules: U11(active(X1),X2) -> U11(X1,X2) U11(mark(X1),X2) -> U11(X1,X2) U11(X1,active(X2)) -> U11(X1,X2) U11(X1,mark(X2)) -> U11(X1,X2) U21(active(X1),X2,X3) -> U21(X1,X2,X3) U21(mark(X1),X2,X3) -> U21(X1,X2,X3) U21(X1,active(X2),X3) -> U21(X1,X2,X3) U21(X1,mark(X2),X3) -> U21(X1,X2,X3) U21(X1,X2,active(X3)) -> U21(X1,X2,X3) U21(X1,X2,mark(X3)) -> U21(X1,X2,X3) active(U11(tt,N)) -> mark(N) active(U21(tt,M,N)) -> mark(s(plus(N,M))) active(and(tt,X)) -> mark(X) active(isNat(plus(V1,V2))) -> mark(and(isNat(V1),isNat(V2))) active(isNat(s(V1))) -> mark(isNat(V1)) active(isNat(0)) -> mark(tt) active(plus(N,s(M))) -> mark(U21(and(isNat(M),isNat(N)),M,N)) active(plus(N,0)) -> mark(U11(isNat(N),N)) and(active(X1),X2) -> and(X1,X2) and(mark(X1),X2) -> and(X1,X2) and(X1,active(X2)) -> and(X1,X2) and(X1,mark(X2)) -> and(X1,X2) isNat(active(X)) -> isNat(X) isNat(mark(X)) -> isNat(X) mark(U11(X1,X2)) -> active(U11(mark(X1),X2)) mark(U21(X1,X2,X3)) -> active(U21(mark(X1),X2,X3)) mark(and(X1,X2)) -> active(and(mark(X1),X2)) mark(isNat(X)) -> active(isNat(X)) mark(plus(X1,X2)) -> active(plus(mark(X1),mark(X2))) mark(s(X)) -> active(s(mark(X))) mark(0) -> active(0) mark(tt) -> active(tt) plus(active(X1),X2) -> plus(X1,X2) plus(mark(X1),X2) -> plus(X1,X2) plus(X1,active(X2)) -> plus(X1,X2) plus(X1,mark(X2)) -> plus(X1,X2) s(active(X)) -> s(X) s(mark(X)) -> s(X) ->Strongly Connected Components: There is no strongly connected component The problem is finite. Problem 1.6: Subterm Processor: -> Pairs: U11#(active(X1),X2) -> U11#(X1,X2) U11#(mark(X1),X2) -> U11#(X1,X2) U11#(X1,active(X2)) -> U11#(X1,X2) U11#(X1,mark(X2)) -> U11#(X1,X2) -> Rules: U11(active(X1),X2) -> U11(X1,X2) U11(mark(X1),X2) -> U11(X1,X2) U11(X1,active(X2)) -> U11(X1,X2) U11(X1,mark(X2)) -> U11(X1,X2) U21(active(X1),X2,X3) -> U21(X1,X2,X3) U21(mark(X1),X2,X3) -> U21(X1,X2,X3) U21(X1,active(X2),X3) -> U21(X1,X2,X3) U21(X1,mark(X2),X3) -> U21(X1,X2,X3) U21(X1,X2,active(X3)) -> U21(X1,X2,X3) U21(X1,X2,mark(X3)) -> U21(X1,X2,X3) active(U11(tt,N)) -> mark(N) active(U21(tt,M,N)) -> mark(s(plus(N,M))) active(and(tt,X)) -> mark(X) active(isNat(plus(V1,V2))) -> mark(and(isNat(V1),isNat(V2))) active(isNat(s(V1))) -> mark(isNat(V1)) active(isNat(0)) -> mark(tt) active(plus(N,s(M))) -> mark(U21(and(isNat(M),isNat(N)),M,N)) active(plus(N,0)) -> mark(U11(isNat(N),N)) and(active(X1),X2) -> and(X1,X2) and(mark(X1),X2) -> and(X1,X2) and(X1,active(X2)) -> and(X1,X2) and(X1,mark(X2)) -> and(X1,X2) isNat(active(X)) -> isNat(X) isNat(mark(X)) -> isNat(X) mark(U11(X1,X2)) -> active(U11(mark(X1),X2)) mark(U21(X1,X2,X3)) -> active(U21(mark(X1),X2,X3)) mark(and(X1,X2)) -> active(and(mark(X1),X2)) mark(isNat(X)) -> active(isNat(X)) mark(plus(X1,X2)) -> active(plus(mark(X1),mark(X2))) mark(s(X)) -> active(s(mark(X))) mark(0) -> active(0) mark(tt) -> active(tt) plus(active(X1),X2) -> plus(X1,X2) plus(mark(X1),X2) -> plus(X1,X2) plus(X1,active(X2)) -> plus(X1,X2) plus(X1,mark(X2)) -> plus(X1,X2) s(active(X)) -> s(X) s(mark(X)) -> s(X) ->Projection: pi(U11#) = 1 Problem 1.6: SCC Processor: -> Pairs: U11#(X1,active(X2)) -> U11#(X1,X2) U11#(X1,mark(X2)) -> U11#(X1,X2) -> Rules: U11(active(X1),X2) -> U11(X1,X2) U11(mark(X1),X2) -> U11(X1,X2) U11(X1,active(X2)) -> U11(X1,X2) U11(X1,mark(X2)) -> U11(X1,X2) U21(active(X1),X2,X3) -> U21(X1,X2,X3) U21(mark(X1),X2,X3) -> U21(X1,X2,X3) U21(X1,active(X2),X3) -> U21(X1,X2,X3) U21(X1,mark(X2),X3) -> U21(X1,X2,X3) U21(X1,X2,active(X3)) -> U21(X1,X2,X3) U21(X1,X2,mark(X3)) -> U21(X1,X2,X3) active(U11(tt,N)) -> mark(N) active(U21(tt,M,N)) -> mark(s(plus(N,M))) active(and(tt,X)) -> mark(X) active(isNat(plus(V1,V2))) -> mark(and(isNat(V1),isNat(V2))) active(isNat(s(V1))) -> mark(isNat(V1)) active(isNat(0)) -> mark(tt) active(plus(N,s(M))) -> mark(U21(and(isNat(M),isNat(N)),M,N)) active(plus(N,0)) -> mark(U11(isNat(N),N)) and(active(X1),X2) -> and(X1,X2) and(mark(X1),X2) -> and(X1,X2) and(X1,active(X2)) -> and(X1,X2) and(X1,mark(X2)) -> and(X1,X2) isNat(active(X)) -> isNat(X) isNat(mark(X)) -> isNat(X) mark(U11(X1,X2)) -> active(U11(mark(X1),X2)) mark(U21(X1,X2,X3)) -> active(U21(mark(X1),X2,X3)) mark(and(X1,X2)) -> active(and(mark(X1),X2)) mark(isNat(X)) -> active(isNat(X)) mark(plus(X1,X2)) -> active(plus(mark(X1),mark(X2))) mark(s(X)) -> active(s(mark(X))) mark(0) -> active(0) mark(tt) -> active(tt) plus(active(X1),X2) -> plus(X1,X2) plus(mark(X1),X2) -> plus(X1,X2) plus(X1,active(X2)) -> plus(X1,X2) plus(X1,mark(X2)) -> plus(X1,X2) s(active(X)) -> s(X) s(mark(X)) -> s(X) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: U11#(X1,active(X2)) -> U11#(X1,X2) U11#(X1,mark(X2)) -> U11#(X1,X2) ->->-> Rules: U11(active(X1),X2) -> U11(X1,X2) U11(mark(X1),X2) -> U11(X1,X2) U11(X1,active(X2)) -> U11(X1,X2) U11(X1,mark(X2)) -> U11(X1,X2) U21(active(X1),X2,X3) -> U21(X1,X2,X3) U21(mark(X1),X2,X3) -> U21(X1,X2,X3) U21(X1,active(X2),X3) -> U21(X1,X2,X3) U21(X1,mark(X2),X3) -> U21(X1,X2,X3) U21(X1,X2,active(X3)) -> U21(X1,X2,X3) U21(X1,X2,mark(X3)) -> U21(X1,X2,X3) active(U11(tt,N)) -> mark(N) active(U21(tt,M,N)) -> mark(s(plus(N,M))) active(and(tt,X)) -> mark(X) active(isNat(plus(V1,V2))) -> mark(and(isNat(V1),isNat(V2))) active(isNat(s(V1))) -> mark(isNat(V1)) active(isNat(0)) -> mark(tt) active(plus(N,s(M))) -> mark(U21(and(isNat(M),isNat(N)),M,N)) active(plus(N,0)) -> mark(U11(isNat(N),N)) and(active(X1),X2) -> and(X1,X2) and(mark(X1),X2) -> and(X1,X2) and(X1,active(X2)) -> and(X1,X2) and(X1,mark(X2)) -> and(X1,X2) isNat(active(X)) -> isNat(X) isNat(mark(X)) -> isNat(X) mark(U11(X1,X2)) -> active(U11(mark(X1),X2)) mark(U21(X1,X2,X3)) -> active(U21(mark(X1),X2,X3)) mark(and(X1,X2)) -> active(and(mark(X1),X2)) mark(isNat(X)) -> active(isNat(X)) mark(plus(X1,X2)) -> active(plus(mark(X1),mark(X2))) mark(s(X)) -> active(s(mark(X))) mark(0) -> active(0) mark(tt) -> active(tt) plus(active(X1),X2) -> plus(X1,X2) plus(mark(X1),X2) -> plus(X1,X2) plus(X1,active(X2)) -> plus(X1,X2) plus(X1,mark(X2)) -> plus(X1,X2) s(active(X)) -> s(X) s(mark(X)) -> s(X) Problem 1.6: Subterm Processor: -> Pairs: U11#(X1,active(X2)) -> U11#(X1,X2) U11#(X1,mark(X2)) -> U11#(X1,X2) -> Rules: U11(active(X1),X2) -> U11(X1,X2) U11(mark(X1),X2) -> U11(X1,X2) U11(X1,active(X2)) -> U11(X1,X2) U11(X1,mark(X2)) -> U11(X1,X2) U21(active(X1),X2,X3) -> U21(X1,X2,X3) U21(mark(X1),X2,X3) -> U21(X1,X2,X3) U21(X1,active(X2),X3) -> U21(X1,X2,X3) U21(X1,mark(X2),X3) -> U21(X1,X2,X3) U21(X1,X2,active(X3)) -> U21(X1,X2,X3) U21(X1,X2,mark(X3)) -> U21(X1,X2,X3) active(U11(tt,N)) -> mark(N) active(U21(tt,M,N)) -> mark(s(plus(N,M))) active(and(tt,X)) -> mark(X) active(isNat(plus(V1,V2))) -> mark(and(isNat(V1),isNat(V2))) active(isNat(s(V1))) -> mark(isNat(V1)) active(isNat(0)) -> mark(tt) active(plus(N,s(M))) -> mark(U21(and(isNat(M),isNat(N)),M,N)) active(plus(N,0)) -> mark(U11(isNat(N),N)) and(active(X1),X2) -> and(X1,X2) and(mark(X1),X2) -> and(X1,X2) and(X1,active(X2)) -> and(X1,X2) and(X1,mark(X2)) -> and(X1,X2) isNat(active(X)) -> isNat(X) isNat(mark(X)) -> isNat(X) mark(U11(X1,X2)) -> active(U11(mark(X1),X2)) mark(U21(X1,X2,X3)) -> active(U21(mark(X1),X2,X3)) mark(and(X1,X2)) -> active(and(mark(X1),X2)) mark(isNat(X)) -> active(isNat(X)) mark(plus(X1,X2)) -> active(plus(mark(X1),mark(X2))) mark(s(X)) -> active(s(mark(X))) mark(0) -> active(0) mark(tt) -> active(tt) plus(active(X1),X2) -> plus(X1,X2) plus(mark(X1),X2) -> plus(X1,X2) plus(X1,active(X2)) -> plus(X1,X2) plus(X1,mark(X2)) -> plus(X1,X2) s(active(X)) -> s(X) s(mark(X)) -> s(X) ->Projection: pi(U11#) = 2 Problem 1.6: SCC Processor: -> Pairs: Empty -> Rules: U11(active(X1),X2) -> U11(X1,X2) U11(mark(X1),X2) -> U11(X1,X2) U11(X1,active(X2)) -> U11(X1,X2) U11(X1,mark(X2)) -> U11(X1,X2) U21(active(X1),X2,X3) -> U21(X1,X2,X3) U21(mark(X1),X2,X3) -> U21(X1,X2,X3) U21(X1,active(X2),X3) -> U21(X1,X2,X3) U21(X1,mark(X2),X3) -> U21(X1,X2,X3) U21(X1,X2,active(X3)) -> U21(X1,X2,X3) U21(X1,X2,mark(X3)) -> U21(X1,X2,X3) active(U11(tt,N)) -> mark(N) active(U21(tt,M,N)) -> mark(s(plus(N,M))) active(and(tt,X)) -> mark(X) active(isNat(plus(V1,V2))) -> mark(and(isNat(V1),isNat(V2))) active(isNat(s(V1))) -> mark(isNat(V1)) active(isNat(0)) -> mark(tt) active(plus(N,s(M))) -> mark(U21(and(isNat(M),isNat(N)),M,N)) active(plus(N,0)) -> mark(U11(isNat(N),N)) and(active(X1),X2) -> and(X1,X2) and(mark(X1),X2) -> and(X1,X2) and(X1,active(X2)) -> and(X1,X2) and(X1,mark(X2)) -> and(X1,X2) isNat(active(X)) -> isNat(X) isNat(mark(X)) -> isNat(X) mark(U11(X1,X2)) -> active(U11(mark(X1),X2)) mark(U21(X1,X2,X3)) -> active(U21(mark(X1),X2,X3)) mark(and(X1,X2)) -> active(and(mark(X1),X2)) mark(isNat(X)) -> active(isNat(X)) mark(plus(X1,X2)) -> active(plus(mark(X1),mark(X2))) mark(s(X)) -> active(s(mark(X))) mark(0) -> active(0) mark(tt) -> active(tt) plus(active(X1),X2) -> plus(X1,X2) plus(mark(X1),X2) -> plus(X1,X2) plus(X1,active(X2)) -> plus(X1,X2) plus(X1,mark(X2)) -> plus(X1,X2) s(active(X)) -> s(X) s(mark(X)) -> s(X) ->Strongly Connected Components: There is no strongly connected component The problem is finite. Problem 1.7: Reduction Pair Processor: -> Pairs: ACTIVE(U11(tt,N)) -> MARK(N) ACTIVE(U21(tt,M,N)) -> MARK(s(plus(N,M))) ACTIVE(and(tt,X)) -> MARK(X) ACTIVE(isNat(plus(V1,V2))) -> MARK(and(isNat(V1),isNat(V2))) ACTIVE(isNat(s(V1))) -> MARK(isNat(V1)) ACTIVE(plus(N,s(M))) -> MARK(U21(and(isNat(M),isNat(N)),M,N)) ACTIVE(plus(N,0)) -> MARK(U11(isNat(N),N)) MARK(U11(X1,X2)) -> ACTIVE(U11(mark(X1),X2)) MARK(U11(X1,X2)) -> MARK(X1) MARK(U21(X1,X2,X3)) -> ACTIVE(U21(mark(X1),X2,X3)) MARK(U21(X1,X2,X3)) -> MARK(X1) MARK(and(X1,X2)) -> ACTIVE(and(mark(X1),X2)) MARK(and(X1,X2)) -> MARK(X1) MARK(isNat(X)) -> ACTIVE(isNat(X)) MARK(plus(X1,X2)) -> ACTIVE(plus(mark(X1),mark(X2))) MARK(plus(X1,X2)) -> MARK(X1) MARK(plus(X1,X2)) -> MARK(X2) MARK(s(X)) -> ACTIVE(s(mark(X))) MARK(s(X)) -> MARK(X) -> Rules: U11(active(X1),X2) -> U11(X1,X2) U11(mark(X1),X2) -> U11(X1,X2) U11(X1,active(X2)) -> U11(X1,X2) U11(X1,mark(X2)) -> U11(X1,X2) U21(active(X1),X2,X3) -> U21(X1,X2,X3) U21(mark(X1),X2,X3) -> U21(X1,X2,X3) U21(X1,active(X2),X3) -> U21(X1,X2,X3) U21(X1,mark(X2),X3) -> U21(X1,X2,X3) U21(X1,X2,active(X3)) -> U21(X1,X2,X3) U21(X1,X2,mark(X3)) -> U21(X1,X2,X3) active(U11(tt,N)) -> mark(N) active(U21(tt,M,N)) -> mark(s(plus(N,M))) active(and(tt,X)) -> mark(X) active(isNat(plus(V1,V2))) -> mark(and(isNat(V1),isNat(V2))) active(isNat(s(V1))) -> mark(isNat(V1)) active(isNat(0)) -> mark(tt) active(plus(N,s(M))) -> mark(U21(and(isNat(M),isNat(N)),M,N)) active(plus(N,0)) -> mark(U11(isNat(N),N)) and(active(X1),X2) -> and(X1,X2) and(mark(X1),X2) -> and(X1,X2) and(X1,active(X2)) -> and(X1,X2) and(X1,mark(X2)) -> and(X1,X2) isNat(active(X)) -> isNat(X) isNat(mark(X)) -> isNat(X) mark(U11(X1,X2)) -> active(U11(mark(X1),X2)) mark(U21(X1,X2,X3)) -> active(U21(mark(X1),X2,X3)) mark(and(X1,X2)) -> active(and(mark(X1),X2)) mark(isNat(X)) -> active(isNat(X)) mark(plus(X1,X2)) -> active(plus(mark(X1),mark(X2))) mark(s(X)) -> active(s(mark(X))) mark(0) -> active(0) mark(tt) -> active(tt) plus(active(X1),X2) -> plus(X1,X2) plus(mark(X1),X2) -> plus(X1,X2) plus(X1,active(X2)) -> plus(X1,X2) plus(X1,mark(X2)) -> plus(X1,X2) s(active(X)) -> s(X) s(mark(X)) -> s(X) -> Usable rules: U11(active(X1),X2) -> U11(X1,X2) U11(mark(X1),X2) -> U11(X1,X2) U11(X1,active(X2)) -> U11(X1,X2) U11(X1,mark(X2)) -> U11(X1,X2) U21(active(X1),X2,X3) -> U21(X1,X2,X3) U21(mark(X1),X2,X3) -> U21(X1,X2,X3) U21(X1,active(X2),X3) -> U21(X1,X2,X3) U21(X1,mark(X2),X3) -> U21(X1,X2,X3) U21(X1,X2,active(X3)) -> U21(X1,X2,X3) U21(X1,X2,mark(X3)) -> U21(X1,X2,X3) active(U11(tt,N)) -> mark(N) active(U21(tt,M,N)) -> mark(s(plus(N,M))) active(and(tt,X)) -> mark(X) active(isNat(plus(V1,V2))) -> mark(and(isNat(V1),isNat(V2))) active(isNat(s(V1))) -> mark(isNat(V1)) active(isNat(0)) -> mark(tt) active(plus(N,s(M))) -> mark(U21(and(isNat(M),isNat(N)),M,N)) active(plus(N,0)) -> mark(U11(isNat(N),N)) and(active(X1),X2) -> and(X1,X2) and(mark(X1),X2) -> and(X1,X2) and(X1,active(X2)) -> and(X1,X2) and(X1,mark(X2)) -> and(X1,X2) isNat(active(X)) -> isNat(X) isNat(mark(X)) -> isNat(X) mark(U11(X1,X2)) -> active(U11(mark(X1),X2)) mark(U21(X1,X2,X3)) -> active(U21(mark(X1),X2,X3)) mark(and(X1,X2)) -> active(and(mark(X1),X2)) mark(isNat(X)) -> active(isNat(X)) mark(plus(X1,X2)) -> active(plus(mark(X1),mark(X2))) mark(s(X)) -> active(s(mark(X))) mark(0) -> active(0) mark(tt) -> active(tt) plus(active(X1),X2) -> plus(X1,X2) plus(mark(X1),X2) -> plus(X1,X2) plus(X1,active(X2)) -> plus(X1,X2) plus(X1,mark(X2)) -> plus(X1,X2) s(active(X)) -> s(X) s(mark(X)) -> s(X) ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [U11](X1,X2) = X1 + 2.X2 + 2 [U21](X1,X2,X3) = X1 + 2.X2 + 2.X3 + 2 [active](X) = X [and](X1,X2) = 2.X1 + 2.X2 [isNat](X) = 0 [mark](X) = X [plus](X1,X2) = 2.X1 + 2.X2 [s](X) = X + 2 [0] = 2 [tt] = 0 [ACTIVE](X) = 2.X [MARK](X) = 2.X Problem 1.7: SCC Processor: -> Pairs: ACTIVE(U21(tt,M,N)) -> MARK(s(plus(N,M))) ACTIVE(and(tt,X)) -> MARK(X) ACTIVE(isNat(plus(V1,V2))) -> MARK(and(isNat(V1),isNat(V2))) ACTIVE(isNat(s(V1))) -> MARK(isNat(V1)) ACTIVE(plus(N,s(M))) -> MARK(U21(and(isNat(M),isNat(N)),M,N)) ACTIVE(plus(N,0)) -> MARK(U11(isNat(N),N)) MARK(U11(X1,X2)) -> ACTIVE(U11(mark(X1),X2)) MARK(U11(X1,X2)) -> MARK(X1) MARK(U21(X1,X2,X3)) -> ACTIVE(U21(mark(X1),X2,X3)) MARK(U21(X1,X2,X3)) -> MARK(X1) MARK(and(X1,X2)) -> ACTIVE(and(mark(X1),X2)) MARK(and(X1,X2)) -> MARK(X1) MARK(isNat(X)) -> ACTIVE(isNat(X)) MARK(plus(X1,X2)) -> ACTIVE(plus(mark(X1),mark(X2))) MARK(plus(X1,X2)) -> MARK(X1) MARK(plus(X1,X2)) -> MARK(X2) MARK(s(X)) -> ACTIVE(s(mark(X))) MARK(s(X)) -> MARK(X) -> Rules: U11(active(X1),X2) -> U11(X1,X2) U11(mark(X1),X2) -> U11(X1,X2) U11(X1,active(X2)) -> U11(X1,X2) U11(X1,mark(X2)) -> U11(X1,X2) U21(active(X1),X2,X3) -> U21(X1,X2,X3) U21(mark(X1),X2,X3) -> U21(X1,X2,X3) U21(X1,active(X2),X3) -> U21(X1,X2,X3) U21(X1,mark(X2),X3) -> U21(X1,X2,X3) U21(X1,X2,active(X3)) -> U21(X1,X2,X3) U21(X1,X2,mark(X3)) -> U21(X1,X2,X3) active(U11(tt,N)) -> mark(N) active(U21(tt,M,N)) -> mark(s(plus(N,M))) active(and(tt,X)) -> mark(X) active(isNat(plus(V1,V2))) -> mark(and(isNat(V1),isNat(V2))) active(isNat(s(V1))) -> mark(isNat(V1)) active(isNat(0)) -> mark(tt) active(plus(N,s(M))) -> mark(U21(and(isNat(M),isNat(N)),M,N)) active(plus(N,0)) -> mark(U11(isNat(N),N)) and(active(X1),X2) -> and(X1,X2) and(mark(X1),X2) -> and(X1,X2) and(X1,active(X2)) -> and(X1,X2) and(X1,mark(X2)) -> and(X1,X2) isNat(active(X)) -> isNat(X) isNat(mark(X)) -> isNat(X) mark(U11(X1,X2)) -> active(U11(mark(X1),X2)) mark(U21(X1,X2,X3)) -> active(U21(mark(X1),X2,X3)) mark(and(X1,X2)) -> active(and(mark(X1),X2)) mark(isNat(X)) -> active(isNat(X)) mark(plus(X1,X2)) -> active(plus(mark(X1),mark(X2))) mark(s(X)) -> active(s(mark(X))) mark(0) -> active(0) mark(tt) -> active(tt) plus(active(X1),X2) -> plus(X1,X2) plus(mark(X1),X2) -> plus(X1,X2) plus(X1,active(X2)) -> plus(X1,X2) plus(X1,mark(X2)) -> plus(X1,X2) s(active(X)) -> s(X) s(mark(X)) -> s(X) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: ACTIVE(U21(tt,M,N)) -> MARK(s(plus(N,M))) ACTIVE(and(tt,X)) -> MARK(X) ACTIVE(isNat(plus(V1,V2))) -> MARK(and(isNat(V1),isNat(V2))) ACTIVE(isNat(s(V1))) -> MARK(isNat(V1)) ACTIVE(plus(N,s(M))) -> MARK(U21(and(isNat(M),isNat(N)),M,N)) ACTIVE(plus(N,0)) -> MARK(U11(isNat(N),N)) MARK(U11(X1,X2)) -> ACTIVE(U11(mark(X1),X2)) MARK(U11(X1,X2)) -> MARK(X1) MARK(U21(X1,X2,X3)) -> ACTIVE(U21(mark(X1),X2,X3)) MARK(U21(X1,X2,X3)) -> MARK(X1) MARK(and(X1,X2)) -> ACTIVE(and(mark(X1),X2)) MARK(and(X1,X2)) -> MARK(X1) MARK(isNat(X)) -> ACTIVE(isNat(X)) MARK(plus(X1,X2)) -> ACTIVE(plus(mark(X1),mark(X2))) MARK(plus(X1,X2)) -> MARK(X1) MARK(plus(X1,X2)) -> MARK(X2) MARK(s(X)) -> ACTIVE(s(mark(X))) MARK(s(X)) -> MARK(X) ->->-> Rules: U11(active(X1),X2) -> U11(X1,X2) U11(mark(X1),X2) -> U11(X1,X2) U11(X1,active(X2)) -> U11(X1,X2) U11(X1,mark(X2)) -> U11(X1,X2) U21(active(X1),X2,X3) -> U21(X1,X2,X3) U21(mark(X1),X2,X3) -> U21(X1,X2,X3) U21(X1,active(X2),X3) -> U21(X1,X2,X3) U21(X1,mark(X2),X3) -> U21(X1,X2,X3) U21(X1,X2,active(X3)) -> U21(X1,X2,X3) U21(X1,X2,mark(X3)) -> U21(X1,X2,X3) active(U11(tt,N)) -> mark(N) active(U21(tt,M,N)) -> mark(s(plus(N,M))) active(and(tt,X)) -> mark(X) active(isNat(plus(V1,V2))) -> mark(and(isNat(V1),isNat(V2))) active(isNat(s(V1))) -> mark(isNat(V1)) active(isNat(0)) -> mark(tt) active(plus(N,s(M))) -> mark(U21(and(isNat(M),isNat(N)),M,N)) active(plus(N,0)) -> mark(U11(isNat(N),N)) and(active(X1),X2) -> and(X1,X2) and(mark(X1),X2) -> and(X1,X2) and(X1,active(X2)) -> and(X1,X2) and(X1,mark(X2)) -> and(X1,X2) isNat(active(X)) -> isNat(X) isNat(mark(X)) -> isNat(X) mark(U11(X1,X2)) -> active(U11(mark(X1),X2)) mark(U21(X1,X2,X3)) -> active(U21(mark(X1),X2,X3)) mark(and(X1,X2)) -> active(and(mark(X1),X2)) mark(isNat(X)) -> active(isNat(X)) mark(plus(X1,X2)) -> active(plus(mark(X1),mark(X2))) mark(s(X)) -> active(s(mark(X))) mark(0) -> active(0) mark(tt) -> active(tt) plus(active(X1),X2) -> plus(X1,X2) plus(mark(X1),X2) -> plus(X1,X2) plus(X1,active(X2)) -> plus(X1,X2) plus(X1,mark(X2)) -> plus(X1,X2) s(active(X)) -> s(X) s(mark(X)) -> s(X) Problem 1.7: Reduction Pair Processor: -> Pairs: ACTIVE(U21(tt,M,N)) -> MARK(s(plus(N,M))) ACTIVE(and(tt,X)) -> MARK(X) ACTIVE(isNat(plus(V1,V2))) -> MARK(and(isNat(V1),isNat(V2))) ACTIVE(isNat(s(V1))) -> MARK(isNat(V1)) ACTIVE(plus(N,s(M))) -> MARK(U21(and(isNat(M),isNat(N)),M,N)) ACTIVE(plus(N,0)) -> MARK(U11(isNat(N),N)) MARK(U11(X1,X2)) -> ACTIVE(U11(mark(X1),X2)) MARK(U11(X1,X2)) -> MARK(X1) MARK(U21(X1,X2,X3)) -> ACTIVE(U21(mark(X1),X2,X3)) MARK(U21(X1,X2,X3)) -> MARK(X1) MARK(and(X1,X2)) -> ACTIVE(and(mark(X1),X2)) MARK(and(X1,X2)) -> MARK(X1) MARK(isNat(X)) -> ACTIVE(isNat(X)) MARK(plus(X1,X2)) -> ACTIVE(plus(mark(X1),mark(X2))) MARK(plus(X1,X2)) -> MARK(X1) MARK(plus(X1,X2)) -> MARK(X2) MARK(s(X)) -> ACTIVE(s(mark(X))) MARK(s(X)) -> MARK(X) -> Rules: U11(active(X1),X2) -> U11(X1,X2) U11(mark(X1),X2) -> U11(X1,X2) U11(X1,active(X2)) -> U11(X1,X2) U11(X1,mark(X2)) -> U11(X1,X2) U21(active(X1),X2,X3) -> U21(X1,X2,X3) U21(mark(X1),X2,X3) -> U21(X1,X2,X3) U21(X1,active(X2),X3) -> U21(X1,X2,X3) U21(X1,mark(X2),X3) -> U21(X1,X2,X3) U21(X1,X2,active(X3)) -> U21(X1,X2,X3) U21(X1,X2,mark(X3)) -> U21(X1,X2,X3) active(U11(tt,N)) -> mark(N) active(U21(tt,M,N)) -> mark(s(plus(N,M))) active(and(tt,X)) -> mark(X) active(isNat(plus(V1,V2))) -> mark(and(isNat(V1),isNat(V2))) active(isNat(s(V1))) -> mark(isNat(V1)) active(isNat(0)) -> mark(tt) active(plus(N,s(M))) -> mark(U21(and(isNat(M),isNat(N)),M,N)) active(plus(N,0)) -> mark(U11(isNat(N),N)) and(active(X1),X2) -> and(X1,X2) and(mark(X1),X2) -> and(X1,X2) and(X1,active(X2)) -> and(X1,X2) and(X1,mark(X2)) -> and(X1,X2) isNat(active(X)) -> isNat(X) isNat(mark(X)) -> isNat(X) mark(U11(X1,X2)) -> active(U11(mark(X1),X2)) mark(U21(X1,X2,X3)) -> active(U21(mark(X1),X2,X3)) mark(and(X1,X2)) -> active(and(mark(X1),X2)) mark(isNat(X)) -> active(isNat(X)) mark(plus(X1,X2)) -> active(plus(mark(X1),mark(X2))) mark(s(X)) -> active(s(mark(X))) mark(0) -> active(0) mark(tt) -> active(tt) plus(active(X1),X2) -> plus(X1,X2) plus(mark(X1),X2) -> plus(X1,X2) plus(X1,active(X2)) -> plus(X1,X2) plus(X1,mark(X2)) -> plus(X1,X2) s(active(X)) -> s(X) s(mark(X)) -> s(X) -> Usable rules: U11(active(X1),X2) -> U11(X1,X2) U11(mark(X1),X2) -> U11(X1,X2) U11(X1,active(X2)) -> U11(X1,X2) U11(X1,mark(X2)) -> U11(X1,X2) U21(active(X1),X2,X3) -> U21(X1,X2,X3) U21(mark(X1),X2,X3) -> U21(X1,X2,X3) U21(X1,active(X2),X3) -> U21(X1,X2,X3) U21(X1,mark(X2),X3) -> U21(X1,X2,X3) U21(X1,X2,active(X3)) -> U21(X1,X2,X3) U21(X1,X2,mark(X3)) -> U21(X1,X2,X3) active(U11(tt,N)) -> mark(N) active(U21(tt,M,N)) -> mark(s(plus(N,M))) active(and(tt,X)) -> mark(X) active(isNat(plus(V1,V2))) -> mark(and(isNat(V1),isNat(V2))) active(isNat(s(V1))) -> mark(isNat(V1)) active(isNat(0)) -> mark(tt) active(plus(N,s(M))) -> mark(U21(and(isNat(M),isNat(N)),M,N)) active(plus(N,0)) -> mark(U11(isNat(N),N)) and(active(X1),X2) -> and(X1,X2) and(mark(X1),X2) -> and(X1,X2) and(X1,active(X2)) -> and(X1,X2) and(X1,mark(X2)) -> and(X1,X2) isNat(active(X)) -> isNat(X) isNat(mark(X)) -> isNat(X) mark(U11(X1,X2)) -> active(U11(mark(X1),X2)) mark(U21(X1,X2,X3)) -> active(U21(mark(X1),X2,X3)) mark(and(X1,X2)) -> active(and(mark(X1),X2)) mark(isNat(X)) -> active(isNat(X)) mark(plus(X1,X2)) -> active(plus(mark(X1),mark(X2))) mark(s(X)) -> active(s(mark(X))) mark(0) -> active(0) mark(tt) -> active(tt) plus(active(X1),X2) -> plus(X1,X2) plus(mark(X1),X2) -> plus(X1,X2) plus(X1,active(X2)) -> plus(X1,X2) plus(X1,mark(X2)) -> plus(X1,X2) s(active(X)) -> s(X) s(mark(X)) -> s(X) ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [U11](X1,X2) = X1 + 2.X2 + 1 [U21](X1,X2,X3) = 2.X1 + 2.X2 + 2.X3 + 2 [active](X) = X [and](X1,X2) = 2.X1 + 2.X2 [isNat](X) = 0 [mark](X) = X [plus](X1,X2) = 2.X1 + 2.X2 [s](X) = X + 1 [0] = 2 [tt] = 0 [ACTIVE](X) = 2.X + 2 [MARK](X) = 2.X + 2 Problem 1.7: SCC Processor: -> Pairs: ACTIVE(and(tt,X)) -> MARK(X) ACTIVE(isNat(plus(V1,V2))) -> MARK(and(isNat(V1),isNat(V2))) ACTIVE(isNat(s(V1))) -> MARK(isNat(V1)) ACTIVE(plus(N,s(M))) -> MARK(U21(and(isNat(M),isNat(N)),M,N)) ACTIVE(plus(N,0)) -> MARK(U11(isNat(N),N)) MARK(U11(X1,X2)) -> ACTIVE(U11(mark(X1),X2)) MARK(U11(X1,X2)) -> MARK(X1) MARK(U21(X1,X2,X3)) -> ACTIVE(U21(mark(X1),X2,X3)) MARK(U21(X1,X2,X3)) -> MARK(X1) MARK(and(X1,X2)) -> ACTIVE(and(mark(X1),X2)) MARK(and(X1,X2)) -> MARK(X1) MARK(isNat(X)) -> ACTIVE(isNat(X)) MARK(plus(X1,X2)) -> ACTIVE(plus(mark(X1),mark(X2))) MARK(plus(X1,X2)) -> MARK(X1) MARK(plus(X1,X2)) -> MARK(X2) MARK(s(X)) -> ACTIVE(s(mark(X))) MARK(s(X)) -> MARK(X) -> Rules: U11(active(X1),X2) -> U11(X1,X2) U11(mark(X1),X2) -> U11(X1,X2) U11(X1,active(X2)) -> U11(X1,X2) U11(X1,mark(X2)) -> U11(X1,X2) U21(active(X1),X2,X3) -> U21(X1,X2,X3) U21(mark(X1),X2,X3) -> U21(X1,X2,X3) U21(X1,active(X2),X3) -> U21(X1,X2,X3) U21(X1,mark(X2),X3) -> U21(X1,X2,X3) U21(X1,X2,active(X3)) -> U21(X1,X2,X3) U21(X1,X2,mark(X3)) -> U21(X1,X2,X3) active(U11(tt,N)) -> mark(N) active(U21(tt,M,N)) -> mark(s(plus(N,M))) active(and(tt,X)) -> mark(X) active(isNat(plus(V1,V2))) -> mark(and(isNat(V1),isNat(V2))) active(isNat(s(V1))) -> mark(isNat(V1)) active(isNat(0)) -> mark(tt) active(plus(N,s(M))) -> mark(U21(and(isNat(M),isNat(N)),M,N)) active(plus(N,0)) -> mark(U11(isNat(N),N)) and(active(X1),X2) -> and(X1,X2) and(mark(X1),X2) -> and(X1,X2) and(X1,active(X2)) -> and(X1,X2) and(X1,mark(X2)) -> and(X1,X2) isNat(active(X)) -> isNat(X) isNat(mark(X)) -> isNat(X) mark(U11(X1,X2)) -> active(U11(mark(X1),X2)) mark(U21(X1,X2,X3)) -> active(U21(mark(X1),X2,X3)) mark(and(X1,X2)) -> active(and(mark(X1),X2)) mark(isNat(X)) -> active(isNat(X)) mark(plus(X1,X2)) -> active(plus(mark(X1),mark(X2))) mark(s(X)) -> active(s(mark(X))) mark(0) -> active(0) mark(tt) -> active(tt) plus(active(X1),X2) -> plus(X1,X2) plus(mark(X1),X2) -> plus(X1,X2) plus(X1,active(X2)) -> plus(X1,X2) plus(X1,mark(X2)) -> plus(X1,X2) s(active(X)) -> s(X) s(mark(X)) -> s(X) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: ACTIVE(and(tt,X)) -> MARK(X) ACTIVE(isNat(plus(V1,V2))) -> MARK(and(isNat(V1),isNat(V2))) ACTIVE(isNat(s(V1))) -> MARK(isNat(V1)) ACTIVE(plus(N,s(M))) -> MARK(U21(and(isNat(M),isNat(N)),M,N)) ACTIVE(plus(N,0)) -> MARK(U11(isNat(N),N)) MARK(U11(X1,X2)) -> ACTIVE(U11(mark(X1),X2)) MARK(U11(X1,X2)) -> MARK(X1) MARK(U21(X1,X2,X3)) -> ACTIVE(U21(mark(X1),X2,X3)) MARK(U21(X1,X2,X3)) -> MARK(X1) MARK(and(X1,X2)) -> ACTIVE(and(mark(X1),X2)) MARK(and(X1,X2)) -> MARK(X1) MARK(isNat(X)) -> ACTIVE(isNat(X)) MARK(plus(X1,X2)) -> ACTIVE(plus(mark(X1),mark(X2))) MARK(plus(X1,X2)) -> MARK(X1) MARK(plus(X1,X2)) -> MARK(X2) MARK(s(X)) -> ACTIVE(s(mark(X))) MARK(s(X)) -> MARK(X) ->->-> Rules: U11(active(X1),X2) -> U11(X1,X2) U11(mark(X1),X2) -> U11(X1,X2) U11(X1,active(X2)) -> U11(X1,X2) U11(X1,mark(X2)) -> U11(X1,X2) U21(active(X1),X2,X3) -> U21(X1,X2,X3) U21(mark(X1),X2,X3) -> U21(X1,X2,X3) U21(X1,active(X2),X3) -> U21(X1,X2,X3) U21(X1,mark(X2),X3) -> U21(X1,X2,X3) U21(X1,X2,active(X3)) -> U21(X1,X2,X3) U21(X1,X2,mark(X3)) -> U21(X1,X2,X3) active(U11(tt,N)) -> mark(N) active(U21(tt,M,N)) -> mark(s(plus(N,M))) active(and(tt,X)) -> mark(X) active(isNat(plus(V1,V2))) -> mark(and(isNat(V1),isNat(V2))) active(isNat(s(V1))) -> mark(isNat(V1)) active(isNat(0)) -> mark(tt) active(plus(N,s(M))) -> mark(U21(and(isNat(M),isNat(N)),M,N)) active(plus(N,0)) -> mark(U11(isNat(N),N)) and(active(X1),X2) -> and(X1,X2) and(mark(X1),X2) -> and(X1,X2) and(X1,active(X2)) -> and(X1,X2) and(X1,mark(X2)) -> and(X1,X2) isNat(active(X)) -> isNat(X) isNat(mark(X)) -> isNat(X) mark(U11(X1,X2)) -> active(U11(mark(X1),X2)) mark(U21(X1,X2,X3)) -> active(U21(mark(X1),X2,X3)) mark(and(X1,X2)) -> active(and(mark(X1),X2)) mark(isNat(X)) -> active(isNat(X)) mark(plus(X1,X2)) -> active(plus(mark(X1),mark(X2))) mark(s(X)) -> active(s(mark(X))) mark(0) -> active(0) mark(tt) -> active(tt) plus(active(X1),X2) -> plus(X1,X2) plus(mark(X1),X2) -> plus(X1,X2) plus(X1,active(X2)) -> plus(X1,X2) plus(X1,mark(X2)) -> plus(X1,X2) s(active(X)) -> s(X) s(mark(X)) -> s(X) Problem 1.7: Reduction Pair Processor: -> Pairs: ACTIVE(and(tt,X)) -> MARK(X) ACTIVE(isNat(plus(V1,V2))) -> MARK(and(isNat(V1),isNat(V2))) ACTIVE(isNat(s(V1))) -> MARK(isNat(V1)) ACTIVE(plus(N,s(M))) -> MARK(U21(and(isNat(M),isNat(N)),M,N)) ACTIVE(plus(N,0)) -> MARK(U11(isNat(N),N)) MARK(U11(X1,X2)) -> ACTIVE(U11(mark(X1),X2)) MARK(U11(X1,X2)) -> MARK(X1) MARK(U21(X1,X2,X3)) -> ACTIVE(U21(mark(X1),X2,X3)) MARK(U21(X1,X2,X3)) -> MARK(X1) MARK(and(X1,X2)) -> ACTIVE(and(mark(X1),X2)) MARK(and(X1,X2)) -> MARK(X1) MARK(isNat(X)) -> ACTIVE(isNat(X)) MARK(plus(X1,X2)) -> ACTIVE(plus(mark(X1),mark(X2))) MARK(plus(X1,X2)) -> MARK(X1) MARK(plus(X1,X2)) -> MARK(X2) MARK(s(X)) -> ACTIVE(s(mark(X))) MARK(s(X)) -> MARK(X) -> Rules: U11(active(X1),X2) -> U11(X1,X2) U11(mark(X1),X2) -> U11(X1,X2) U11(X1,active(X2)) -> U11(X1,X2) U11(X1,mark(X2)) -> U11(X1,X2) U21(active(X1),X2,X3) -> U21(X1,X2,X3) U21(mark(X1),X2,X3) -> U21(X1,X2,X3) U21(X1,active(X2),X3) -> U21(X1,X2,X3) U21(X1,mark(X2),X3) -> U21(X1,X2,X3) U21(X1,X2,active(X3)) -> U21(X1,X2,X3) U21(X1,X2,mark(X3)) -> U21(X1,X2,X3) active(U11(tt,N)) -> mark(N) active(U21(tt,M,N)) -> mark(s(plus(N,M))) active(and(tt,X)) -> mark(X) active(isNat(plus(V1,V2))) -> mark(and(isNat(V1),isNat(V2))) active(isNat(s(V1))) -> mark(isNat(V1)) active(isNat(0)) -> mark(tt) active(plus(N,s(M))) -> mark(U21(and(isNat(M),isNat(N)),M,N)) active(plus(N,0)) -> mark(U11(isNat(N),N)) and(active(X1),X2) -> and(X1,X2) and(mark(X1),X2) -> and(X1,X2) and(X1,active(X2)) -> and(X1,X2) and(X1,mark(X2)) -> and(X1,X2) isNat(active(X)) -> isNat(X) isNat(mark(X)) -> isNat(X) mark(U11(X1,X2)) -> active(U11(mark(X1),X2)) mark(U21(X1,X2,X3)) -> active(U21(mark(X1),X2,X3)) mark(and(X1,X2)) -> active(and(mark(X1),X2)) mark(isNat(X)) -> active(isNat(X)) mark(plus(X1,X2)) -> active(plus(mark(X1),mark(X2))) mark(s(X)) -> active(s(mark(X))) mark(0) -> active(0) mark(tt) -> active(tt) plus(active(X1),X2) -> plus(X1,X2) plus(mark(X1),X2) -> plus(X1,X2) plus(X1,active(X2)) -> plus(X1,X2) plus(X1,mark(X2)) -> plus(X1,X2) s(active(X)) -> s(X) s(mark(X)) -> s(X) -> Usable rules: U11(active(X1),X2) -> U11(X1,X2) U11(mark(X1),X2) -> U11(X1,X2) U11(X1,active(X2)) -> U11(X1,X2) U11(X1,mark(X2)) -> U11(X1,X2) U21(active(X1),X2,X3) -> U21(X1,X2,X3) U21(mark(X1),X2,X3) -> U21(X1,X2,X3) U21(X1,active(X2),X3) -> U21(X1,X2,X3) U21(X1,mark(X2),X3) -> U21(X1,X2,X3) U21(X1,X2,active(X3)) -> U21(X1,X2,X3) U21(X1,X2,mark(X3)) -> U21(X1,X2,X3) active(U11(tt,N)) -> mark(N) active(U21(tt,M,N)) -> mark(s(plus(N,M))) active(and(tt,X)) -> mark(X) active(isNat(plus(V1,V2))) -> mark(and(isNat(V1),isNat(V2))) active(isNat(s(V1))) -> mark(isNat(V1)) active(isNat(0)) -> mark(tt) active(plus(N,s(M))) -> mark(U21(and(isNat(M),isNat(N)),M,N)) active(plus(N,0)) -> mark(U11(isNat(N),N)) and(active(X1),X2) -> and(X1,X2) and(mark(X1),X2) -> and(X1,X2) and(X1,active(X2)) -> and(X1,X2) and(X1,mark(X2)) -> and(X1,X2) isNat(active(X)) -> isNat(X) isNat(mark(X)) -> isNat(X) mark(U11(X1,X2)) -> active(U11(mark(X1),X2)) mark(U21(X1,X2,X3)) -> active(U21(mark(X1),X2,X3)) mark(and(X1,X2)) -> active(and(mark(X1),X2)) mark(isNat(X)) -> active(isNat(X)) mark(plus(X1,X2)) -> active(plus(mark(X1),mark(X2))) mark(s(X)) -> active(s(mark(X))) mark(0) -> active(0) mark(tt) -> active(tt) plus(active(X1),X2) -> plus(X1,X2) plus(mark(X1),X2) -> plus(X1,X2) plus(X1,active(X2)) -> plus(X1,X2) plus(X1,mark(X2)) -> plus(X1,X2) s(active(X)) -> s(X) s(mark(X)) -> s(X) ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [U11](X1,X2) = 2.X1 + 2.X2 + 2 [U21](X1,X2,X3) = 2.X1 + 2.X2 + 2.X3 + 2 [active](X) = X [and](X1,X2) = 2.X1 + X2 [isNat](X) = 0 [mark](X) = X [plus](X1,X2) = 2.X1 + 2.X2 + 1 [s](X) = X + 1 [0] = 2 [tt] = 0 [ACTIVE](X) = 2.X + 2 [MARK](X) = 2.X + 2 Problem 1.7: SCC Processor: -> Pairs: ACTIVE(and(tt,X)) -> MARK(X) ACTIVE(isNat(plus(V1,V2))) -> MARK(and(isNat(V1),isNat(V2))) ACTIVE(isNat(s(V1))) -> MARK(isNat(V1)) ACTIVE(plus(N,0)) -> MARK(U11(isNat(N),N)) MARK(U11(X1,X2)) -> ACTIVE(U11(mark(X1),X2)) MARK(U11(X1,X2)) -> MARK(X1) MARK(U21(X1,X2,X3)) -> ACTIVE(U21(mark(X1),X2,X3)) MARK(U21(X1,X2,X3)) -> MARK(X1) MARK(and(X1,X2)) -> ACTIVE(and(mark(X1),X2)) MARK(and(X1,X2)) -> MARK(X1) MARK(isNat(X)) -> ACTIVE(isNat(X)) MARK(plus(X1,X2)) -> ACTIVE(plus(mark(X1),mark(X2))) MARK(plus(X1,X2)) -> MARK(X1) MARK(plus(X1,X2)) -> MARK(X2) MARK(s(X)) -> ACTIVE(s(mark(X))) MARK(s(X)) -> MARK(X) -> Rules: U11(active(X1),X2) -> U11(X1,X2) U11(mark(X1),X2) -> U11(X1,X2) U11(X1,active(X2)) -> U11(X1,X2) U11(X1,mark(X2)) -> U11(X1,X2) U21(active(X1),X2,X3) -> U21(X1,X2,X3) U21(mark(X1),X2,X3) -> U21(X1,X2,X3) U21(X1,active(X2),X3) -> U21(X1,X2,X3) U21(X1,mark(X2),X3) -> U21(X1,X2,X3) U21(X1,X2,active(X3)) -> U21(X1,X2,X3) U21(X1,X2,mark(X3)) -> U21(X1,X2,X3) active(U11(tt,N)) -> mark(N) active(U21(tt,M,N)) -> mark(s(plus(N,M))) active(and(tt,X)) -> mark(X) active(isNat(plus(V1,V2))) -> mark(and(isNat(V1),isNat(V2))) active(isNat(s(V1))) -> mark(isNat(V1)) active(isNat(0)) -> mark(tt) active(plus(N,s(M))) -> mark(U21(and(isNat(M),isNat(N)),M,N)) active(plus(N,0)) -> mark(U11(isNat(N),N)) and(active(X1),X2) -> and(X1,X2) and(mark(X1),X2) -> and(X1,X2) and(X1,active(X2)) -> and(X1,X2) and(X1,mark(X2)) -> and(X1,X2) isNat(active(X)) -> isNat(X) isNat(mark(X)) -> isNat(X) mark(U11(X1,X2)) -> active(U11(mark(X1),X2)) mark(U21(X1,X2,X3)) -> active(U21(mark(X1),X2,X3)) mark(and(X1,X2)) -> active(and(mark(X1),X2)) mark(isNat(X)) -> active(isNat(X)) mark(plus(X1,X2)) -> active(plus(mark(X1),mark(X2))) mark(s(X)) -> active(s(mark(X))) mark(0) -> active(0) mark(tt) -> active(tt) plus(active(X1),X2) -> plus(X1,X2) plus(mark(X1),X2) -> plus(X1,X2) plus(X1,active(X2)) -> plus(X1,X2) plus(X1,mark(X2)) -> plus(X1,X2) s(active(X)) -> s(X) s(mark(X)) -> s(X) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: ACTIVE(and(tt,X)) -> MARK(X) ACTIVE(isNat(plus(V1,V2))) -> MARK(and(isNat(V1),isNat(V2))) ACTIVE(isNat(s(V1))) -> MARK(isNat(V1)) ACTIVE(plus(N,0)) -> MARK(U11(isNat(N),N)) MARK(U11(X1,X2)) -> ACTIVE(U11(mark(X1),X2)) MARK(U11(X1,X2)) -> MARK(X1) MARK(U21(X1,X2,X3)) -> ACTIVE(U21(mark(X1),X2,X3)) MARK(U21(X1,X2,X3)) -> MARK(X1) MARK(and(X1,X2)) -> ACTIVE(and(mark(X1),X2)) MARK(and(X1,X2)) -> MARK(X1) MARK(isNat(X)) -> ACTIVE(isNat(X)) MARK(plus(X1,X2)) -> ACTIVE(plus(mark(X1),mark(X2))) MARK(plus(X1,X2)) -> MARK(X1) MARK(plus(X1,X2)) -> MARK(X2) MARK(s(X)) -> ACTIVE(s(mark(X))) MARK(s(X)) -> MARK(X) ->->-> Rules: U11(active(X1),X2) -> U11(X1,X2) U11(mark(X1),X2) -> U11(X1,X2) U11(X1,active(X2)) -> U11(X1,X2) U11(X1,mark(X2)) -> U11(X1,X2) U21(active(X1),X2,X3) -> U21(X1,X2,X3) U21(mark(X1),X2,X3) -> U21(X1,X2,X3) U21(X1,active(X2),X3) -> U21(X1,X2,X3) U21(X1,mark(X2),X3) -> U21(X1,X2,X3) U21(X1,X2,active(X3)) -> U21(X1,X2,X3) U21(X1,X2,mark(X3)) -> U21(X1,X2,X3) active(U11(tt,N)) -> mark(N) active(U21(tt,M,N)) -> mark(s(plus(N,M))) active(and(tt,X)) -> mark(X) active(isNat(plus(V1,V2))) -> mark(and(isNat(V1),isNat(V2))) active(isNat(s(V1))) -> mark(isNat(V1)) active(isNat(0)) -> mark(tt) active(plus(N,s(M))) -> mark(U21(and(isNat(M),isNat(N)),M,N)) active(plus(N,0)) -> mark(U11(isNat(N),N)) and(active(X1),X2) -> and(X1,X2) and(mark(X1),X2) -> and(X1,X2) and(X1,active(X2)) -> and(X1,X2) and(X1,mark(X2)) -> and(X1,X2) isNat(active(X)) -> isNat(X) isNat(mark(X)) -> isNat(X) mark(U11(X1,X2)) -> active(U11(mark(X1),X2)) mark(U21(X1,X2,X3)) -> active(U21(mark(X1),X2,X3)) mark(and(X1,X2)) -> active(and(mark(X1),X2)) mark(isNat(X)) -> active(isNat(X)) mark(plus(X1,X2)) -> active(plus(mark(X1),mark(X2))) mark(s(X)) -> active(s(mark(X))) mark(0) -> active(0) mark(tt) -> active(tt) plus(active(X1),X2) -> plus(X1,X2) plus(mark(X1),X2) -> plus(X1,X2) plus(X1,active(X2)) -> plus(X1,X2) plus(X1,mark(X2)) -> plus(X1,X2) s(active(X)) -> s(X) s(mark(X)) -> s(X) Problem 1.7: Reduction Pair Processor: -> Pairs: ACTIVE(and(tt,X)) -> MARK(X) ACTIVE(isNat(plus(V1,V2))) -> MARK(and(isNat(V1),isNat(V2))) ACTIVE(isNat(s(V1))) -> MARK(isNat(V1)) ACTIVE(plus(N,0)) -> MARK(U11(isNat(N),N)) MARK(U11(X1,X2)) -> ACTIVE(U11(mark(X1),X2)) MARK(U11(X1,X2)) -> MARK(X1) MARK(U21(X1,X2,X3)) -> ACTIVE(U21(mark(X1),X2,X3)) MARK(U21(X1,X2,X3)) -> MARK(X1) MARK(and(X1,X2)) -> ACTIVE(and(mark(X1),X2)) MARK(and(X1,X2)) -> MARK(X1) MARK(isNat(X)) -> ACTIVE(isNat(X)) MARK(plus(X1,X2)) -> ACTIVE(plus(mark(X1),mark(X2))) MARK(plus(X1,X2)) -> MARK(X1) MARK(plus(X1,X2)) -> MARK(X2) MARK(s(X)) -> ACTIVE(s(mark(X))) MARK(s(X)) -> MARK(X) -> Rules: U11(active(X1),X2) -> U11(X1,X2) U11(mark(X1),X2) -> U11(X1,X2) U11(X1,active(X2)) -> U11(X1,X2) U11(X1,mark(X2)) -> U11(X1,X2) U21(active(X1),X2,X3) -> U21(X1,X2,X3) U21(mark(X1),X2,X3) -> U21(X1,X2,X3) U21(X1,active(X2),X3) -> U21(X1,X2,X3) U21(X1,mark(X2),X3) -> U21(X1,X2,X3) U21(X1,X2,active(X3)) -> U21(X1,X2,X3) U21(X1,X2,mark(X3)) -> U21(X1,X2,X3) active(U11(tt,N)) -> mark(N) active(U21(tt,M,N)) -> mark(s(plus(N,M))) active(and(tt,X)) -> mark(X) active(isNat(plus(V1,V2))) -> mark(and(isNat(V1),isNat(V2))) active(isNat(s(V1))) -> mark(isNat(V1)) active(isNat(0)) -> mark(tt) active(plus(N,s(M))) -> mark(U21(and(isNat(M),isNat(N)),M,N)) active(plus(N,0)) -> mark(U11(isNat(N),N)) and(active(X1),X2) -> and(X1,X2) and(mark(X1),X2) -> and(X1,X2) and(X1,active(X2)) -> and(X1,X2) and(X1,mark(X2)) -> and(X1,X2) isNat(active(X)) -> isNat(X) isNat(mark(X)) -> isNat(X) mark(U11(X1,X2)) -> active(U11(mark(X1),X2)) mark(U21(X1,X2,X3)) -> active(U21(mark(X1),X2,X3)) mark(and(X1,X2)) -> active(and(mark(X1),X2)) mark(isNat(X)) -> active(isNat(X)) mark(plus(X1,X2)) -> active(plus(mark(X1),mark(X2))) mark(s(X)) -> active(s(mark(X))) mark(0) -> active(0) mark(tt) -> active(tt) plus(active(X1),X2) -> plus(X1,X2) plus(mark(X1),X2) -> plus(X1,X2) plus(X1,active(X2)) -> plus(X1,X2) plus(X1,mark(X2)) -> plus(X1,X2) s(active(X)) -> s(X) s(mark(X)) -> s(X) -> Usable rules: U11(active(X1),X2) -> U11(X1,X2) U11(mark(X1),X2) -> U11(X1,X2) U11(X1,active(X2)) -> U11(X1,X2) U11(X1,mark(X2)) -> U11(X1,X2) U21(active(X1),X2,X3) -> U21(X1,X2,X3) U21(mark(X1),X2,X3) -> U21(X1,X2,X3) U21(X1,active(X2),X3) -> U21(X1,X2,X3) U21(X1,mark(X2),X3) -> U21(X1,X2,X3) U21(X1,X2,active(X3)) -> U21(X1,X2,X3) U21(X1,X2,mark(X3)) -> U21(X1,X2,X3) active(U11(tt,N)) -> mark(N) active(U21(tt,M,N)) -> mark(s(plus(N,M))) active(and(tt,X)) -> mark(X) active(isNat(plus(V1,V2))) -> mark(and(isNat(V1),isNat(V2))) active(isNat(s(V1))) -> mark(isNat(V1)) active(isNat(0)) -> mark(tt) active(plus(N,s(M))) -> mark(U21(and(isNat(M),isNat(N)),M,N)) active(plus(N,0)) -> mark(U11(isNat(N),N)) and(active(X1),X2) -> and(X1,X2) and(mark(X1),X2) -> and(X1,X2) and(X1,active(X2)) -> and(X1,X2) and(X1,mark(X2)) -> and(X1,X2) isNat(active(X)) -> isNat(X) isNat(mark(X)) -> isNat(X) mark(U11(X1,X2)) -> active(U11(mark(X1),X2)) mark(U21(X1,X2,X3)) -> active(U21(mark(X1),X2,X3)) mark(and(X1,X2)) -> active(and(mark(X1),X2)) mark(isNat(X)) -> active(isNat(X)) mark(plus(X1,X2)) -> active(plus(mark(X1),mark(X2))) mark(s(X)) -> active(s(mark(X))) mark(0) -> active(0) mark(tt) -> active(tt) plus(active(X1),X2) -> plus(X1,X2) plus(mark(X1),X2) -> plus(X1,X2) plus(X1,active(X2)) -> plus(X1,X2) plus(X1,mark(X2)) -> plus(X1,X2) s(active(X)) -> s(X) s(mark(X)) -> s(X) ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [U11](X1,X2) = 2.X1 + 2.X2 + 2 [U21](X1,X2,X3) = 2.X1 + 2.X2 + 2.X3 + 2 [active](X) = X [and](X1,X2) = X1 + 2.X2 [isNat](X) = 0 [mark](X) = X [plus](X1,X2) = 2.X1 + 2.X2 [s](X) = X + 2 [0] = 2 [tt] = 0 [ACTIVE](X) = 2.X + 2 [MARK](X) = 2.X + 2 Problem 1.7: SCC Processor: -> Pairs: ACTIVE(and(tt,X)) -> MARK(X) ACTIVE(isNat(plus(V1,V2))) -> MARK(and(isNat(V1),isNat(V2))) ACTIVE(isNat(s(V1))) -> MARK(isNat(V1)) MARK(U11(X1,X2)) -> ACTIVE(U11(mark(X1),X2)) MARK(U11(X1,X2)) -> MARK(X1) MARK(U21(X1,X2,X3)) -> ACTIVE(U21(mark(X1),X2,X3)) MARK(U21(X1,X2,X3)) -> MARK(X1) MARK(and(X1,X2)) -> ACTIVE(and(mark(X1),X2)) MARK(and(X1,X2)) -> MARK(X1) MARK(isNat(X)) -> ACTIVE(isNat(X)) MARK(plus(X1,X2)) -> ACTIVE(plus(mark(X1),mark(X2))) MARK(plus(X1,X2)) -> MARK(X1) MARK(plus(X1,X2)) -> MARK(X2) MARK(s(X)) -> ACTIVE(s(mark(X))) MARK(s(X)) -> MARK(X) -> Rules: U11(active(X1),X2) -> U11(X1,X2) U11(mark(X1),X2) -> U11(X1,X2) U11(X1,active(X2)) -> U11(X1,X2) U11(X1,mark(X2)) -> U11(X1,X2) U21(active(X1),X2,X3) -> U21(X1,X2,X3) U21(mark(X1),X2,X3) -> U21(X1,X2,X3) U21(X1,active(X2),X3) -> U21(X1,X2,X3) U21(X1,mark(X2),X3) -> U21(X1,X2,X3) U21(X1,X2,active(X3)) -> U21(X1,X2,X3) U21(X1,X2,mark(X3)) -> U21(X1,X2,X3) active(U11(tt,N)) -> mark(N) active(U21(tt,M,N)) -> mark(s(plus(N,M))) active(and(tt,X)) -> mark(X) active(isNat(plus(V1,V2))) -> mark(and(isNat(V1),isNat(V2))) active(isNat(s(V1))) -> mark(isNat(V1)) active(isNat(0)) -> mark(tt) active(plus(N,s(M))) -> mark(U21(and(isNat(M),isNat(N)),M,N)) active(plus(N,0)) -> mark(U11(isNat(N),N)) and(active(X1),X2) -> and(X1,X2) and(mark(X1),X2) -> and(X1,X2) and(X1,active(X2)) -> and(X1,X2) and(X1,mark(X2)) -> and(X1,X2) isNat(active(X)) -> isNat(X) isNat(mark(X)) -> isNat(X) mark(U11(X1,X2)) -> active(U11(mark(X1),X2)) mark(U21(X1,X2,X3)) -> active(U21(mark(X1),X2,X3)) mark(and(X1,X2)) -> active(and(mark(X1),X2)) mark(isNat(X)) -> active(isNat(X)) mark(plus(X1,X2)) -> active(plus(mark(X1),mark(X2))) mark(s(X)) -> active(s(mark(X))) mark(0) -> active(0) mark(tt) -> active(tt) plus(active(X1),X2) -> plus(X1,X2) plus(mark(X1),X2) -> plus(X1,X2) plus(X1,active(X2)) -> plus(X1,X2) plus(X1,mark(X2)) -> plus(X1,X2) s(active(X)) -> s(X) s(mark(X)) -> s(X) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: ACTIVE(and(tt,X)) -> MARK(X) ACTIVE(isNat(plus(V1,V2))) -> MARK(and(isNat(V1),isNat(V2))) ACTIVE(isNat(s(V1))) -> MARK(isNat(V1)) MARK(U11(X1,X2)) -> ACTIVE(U11(mark(X1),X2)) MARK(U11(X1,X2)) -> MARK(X1) MARK(U21(X1,X2,X3)) -> ACTIVE(U21(mark(X1),X2,X3)) MARK(U21(X1,X2,X3)) -> MARK(X1) MARK(and(X1,X2)) -> ACTIVE(and(mark(X1),X2)) MARK(and(X1,X2)) -> MARK(X1) MARK(isNat(X)) -> ACTIVE(isNat(X)) MARK(plus(X1,X2)) -> ACTIVE(plus(mark(X1),mark(X2))) MARK(plus(X1,X2)) -> MARK(X1) MARK(plus(X1,X2)) -> MARK(X2) MARK(s(X)) -> ACTIVE(s(mark(X))) MARK(s(X)) -> MARK(X) ->->-> Rules: U11(active(X1),X2) -> U11(X1,X2) U11(mark(X1),X2) -> U11(X1,X2) U11(X1,active(X2)) -> U11(X1,X2) U11(X1,mark(X2)) -> U11(X1,X2) U21(active(X1),X2,X3) -> U21(X1,X2,X3) U21(mark(X1),X2,X3) -> U21(X1,X2,X3) U21(X1,active(X2),X3) -> U21(X1,X2,X3) U21(X1,mark(X2),X3) -> U21(X1,X2,X3) U21(X1,X2,active(X3)) -> U21(X1,X2,X3) U21(X1,X2,mark(X3)) -> U21(X1,X2,X3) active(U11(tt,N)) -> mark(N) active(U21(tt,M,N)) -> mark(s(plus(N,M))) active(and(tt,X)) -> mark(X) active(isNat(plus(V1,V2))) -> mark(and(isNat(V1),isNat(V2))) active(isNat(s(V1))) -> mark(isNat(V1)) active(isNat(0)) -> mark(tt) active(plus(N,s(M))) -> mark(U21(and(isNat(M),isNat(N)),M,N)) active(plus(N,0)) -> mark(U11(isNat(N),N)) and(active(X1),X2) -> and(X1,X2) and(mark(X1),X2) -> and(X1,X2) and(X1,active(X2)) -> and(X1,X2) and(X1,mark(X2)) -> and(X1,X2) isNat(active(X)) -> isNat(X) isNat(mark(X)) -> isNat(X) mark(U11(X1,X2)) -> active(U11(mark(X1),X2)) mark(U21(X1,X2,X3)) -> active(U21(mark(X1),X2,X3)) mark(and(X1,X2)) -> active(and(mark(X1),X2)) mark(isNat(X)) -> active(isNat(X)) mark(plus(X1,X2)) -> active(plus(mark(X1),mark(X2))) mark(s(X)) -> active(s(mark(X))) mark(0) -> active(0) mark(tt) -> active(tt) plus(active(X1),X2) -> plus(X1,X2) plus(mark(X1),X2) -> plus(X1,X2) plus(X1,active(X2)) -> plus(X1,X2) plus(X1,mark(X2)) -> plus(X1,X2) s(active(X)) -> s(X) s(mark(X)) -> s(X) Problem 1.7: Reduction Pair Processor: -> Pairs: ACTIVE(and(tt,X)) -> MARK(X) ACTIVE(isNat(plus(V1,V2))) -> MARK(and(isNat(V1),isNat(V2))) ACTIVE(isNat(s(V1))) -> MARK(isNat(V1)) MARK(U11(X1,X2)) -> ACTIVE(U11(mark(X1),X2)) MARK(U11(X1,X2)) -> MARK(X1) MARK(U21(X1,X2,X3)) -> ACTIVE(U21(mark(X1),X2,X3)) MARK(U21(X1,X2,X3)) -> MARK(X1) MARK(and(X1,X2)) -> ACTIVE(and(mark(X1),X2)) MARK(and(X1,X2)) -> MARK(X1) MARK(isNat(X)) -> ACTIVE(isNat(X)) MARK(plus(X1,X2)) -> ACTIVE(plus(mark(X1),mark(X2))) MARK(plus(X1,X2)) -> MARK(X1) MARK(plus(X1,X2)) -> MARK(X2) MARK(s(X)) -> ACTIVE(s(mark(X))) MARK(s(X)) -> MARK(X) -> Rules: U11(active(X1),X2) -> U11(X1,X2) U11(mark(X1),X2) -> U11(X1,X2) U11(X1,active(X2)) -> U11(X1,X2) U11(X1,mark(X2)) -> U11(X1,X2) U21(active(X1),X2,X3) -> U21(X1,X2,X3) U21(mark(X1),X2,X3) -> U21(X1,X2,X3) U21(X1,active(X2),X3) -> U21(X1,X2,X3) U21(X1,mark(X2),X3) -> U21(X1,X2,X3) U21(X1,X2,active(X3)) -> U21(X1,X2,X3) U21(X1,X2,mark(X3)) -> U21(X1,X2,X3) active(U11(tt,N)) -> mark(N) active(U21(tt,M,N)) -> mark(s(plus(N,M))) active(and(tt,X)) -> mark(X) active(isNat(plus(V1,V2))) -> mark(and(isNat(V1),isNat(V2))) active(isNat(s(V1))) -> mark(isNat(V1)) active(isNat(0)) -> mark(tt) active(plus(N,s(M))) -> mark(U21(and(isNat(M),isNat(N)),M,N)) active(plus(N,0)) -> mark(U11(isNat(N),N)) and(active(X1),X2) -> and(X1,X2) and(mark(X1),X2) -> and(X1,X2) and(X1,active(X2)) -> and(X1,X2) and(X1,mark(X2)) -> and(X1,X2) isNat(active(X)) -> isNat(X) isNat(mark(X)) -> isNat(X) mark(U11(X1,X2)) -> active(U11(mark(X1),X2)) mark(U21(X1,X2,X3)) -> active(U21(mark(X1),X2,X3)) mark(and(X1,X2)) -> active(and(mark(X1),X2)) mark(isNat(X)) -> active(isNat(X)) mark(plus(X1,X2)) -> active(plus(mark(X1),mark(X2))) mark(s(X)) -> active(s(mark(X))) mark(0) -> active(0) mark(tt) -> active(tt) plus(active(X1),X2) -> plus(X1,X2) plus(mark(X1),X2) -> plus(X1,X2) plus(X1,active(X2)) -> plus(X1,X2) plus(X1,mark(X2)) -> plus(X1,X2) s(active(X)) -> s(X) s(mark(X)) -> s(X) -> Usable rules: U11(active(X1),X2) -> U11(X1,X2) U11(mark(X1),X2) -> U11(X1,X2) U11(X1,active(X2)) -> U11(X1,X2) U11(X1,mark(X2)) -> U11(X1,X2) U21(active(X1),X2,X3) -> U21(X1,X2,X3) U21(mark(X1),X2,X3) -> U21(X1,X2,X3) U21(X1,active(X2),X3) -> U21(X1,X2,X3) U21(X1,mark(X2),X3) -> U21(X1,X2,X3) U21(X1,X2,active(X3)) -> U21(X1,X2,X3) U21(X1,X2,mark(X3)) -> U21(X1,X2,X3) active(U11(tt,N)) -> mark(N) active(U21(tt,M,N)) -> mark(s(plus(N,M))) active(and(tt,X)) -> mark(X) active(isNat(plus(V1,V2))) -> mark(and(isNat(V1),isNat(V2))) active(isNat(s(V1))) -> mark(isNat(V1)) active(isNat(0)) -> mark(tt) active(plus(N,s(M))) -> mark(U21(and(isNat(M),isNat(N)),M,N)) active(plus(N,0)) -> mark(U11(isNat(N),N)) and(active(X1),X2) -> and(X1,X2) and(mark(X1),X2) -> and(X1,X2) and(X1,active(X2)) -> and(X1,X2) and(X1,mark(X2)) -> and(X1,X2) isNat(active(X)) -> isNat(X) isNat(mark(X)) -> isNat(X) mark(U11(X1,X2)) -> active(U11(mark(X1),X2)) mark(U21(X1,X2,X3)) -> active(U21(mark(X1),X2,X3)) mark(and(X1,X2)) -> active(and(mark(X1),X2)) mark(isNat(X)) -> active(isNat(X)) mark(plus(X1,X2)) -> active(plus(mark(X1),mark(X2))) mark(s(X)) -> active(s(mark(X))) mark(0) -> active(0) mark(tt) -> active(tt) plus(active(X1),X2) -> plus(X1,X2) plus(mark(X1),X2) -> plus(X1,X2) plus(X1,active(X2)) -> plus(X1,X2) plus(X1,mark(X2)) -> plus(X1,X2) s(active(X)) -> s(X) s(mark(X)) -> s(X) ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [U11](X1,X2) = 2.X1 + 2.X2 + 2 [U21](X1,X2,X3) = 2.X1 + 2.X2 + 2.X3 + 2 [active](X) = X [and](X1,X2) = 2.X1 + 2.X2 [isNat](X) = 0 [mark](X) = X [plus](X1,X2) = 2.X1 + 2.X2 + 2 [s](X) = X [0] = 2 [tt] = 0 [ACTIVE](X) = X + 2 [MARK](X) = 2.X + 2 Problem 1.7: SCC Processor: -> Pairs: ACTIVE(and(tt,X)) -> MARK(X) ACTIVE(isNat(plus(V1,V2))) -> MARK(and(isNat(V1),isNat(V2))) ACTIVE(isNat(s(V1))) -> MARK(isNat(V1)) MARK(U11(X1,X2)) -> MARK(X1) MARK(U21(X1,X2,X3)) -> ACTIVE(U21(mark(X1),X2,X3)) MARK(U21(X1,X2,X3)) -> MARK(X1) MARK(and(X1,X2)) -> ACTIVE(and(mark(X1),X2)) MARK(and(X1,X2)) -> MARK(X1) MARK(isNat(X)) -> ACTIVE(isNat(X)) MARK(plus(X1,X2)) -> ACTIVE(plus(mark(X1),mark(X2))) MARK(plus(X1,X2)) -> MARK(X1) MARK(plus(X1,X2)) -> MARK(X2) MARK(s(X)) -> ACTIVE(s(mark(X))) MARK(s(X)) -> MARK(X) -> Rules: U11(active(X1),X2) -> U11(X1,X2) U11(mark(X1),X2) -> U11(X1,X2) U11(X1,active(X2)) -> U11(X1,X2) U11(X1,mark(X2)) -> U11(X1,X2) U21(active(X1),X2,X3) -> U21(X1,X2,X3) U21(mark(X1),X2,X3) -> U21(X1,X2,X3) U21(X1,active(X2),X3) -> U21(X1,X2,X3) U21(X1,mark(X2),X3) -> U21(X1,X2,X3) U21(X1,X2,active(X3)) -> U21(X1,X2,X3) U21(X1,X2,mark(X3)) -> U21(X1,X2,X3) active(U11(tt,N)) -> mark(N) active(U21(tt,M,N)) -> mark(s(plus(N,M))) active(and(tt,X)) -> mark(X) active(isNat(plus(V1,V2))) -> mark(and(isNat(V1),isNat(V2))) active(isNat(s(V1))) -> mark(isNat(V1)) active(isNat(0)) -> mark(tt) active(plus(N,s(M))) -> mark(U21(and(isNat(M),isNat(N)),M,N)) active(plus(N,0)) -> mark(U11(isNat(N),N)) and(active(X1),X2) -> and(X1,X2) and(mark(X1),X2) -> and(X1,X2) and(X1,active(X2)) -> and(X1,X2) and(X1,mark(X2)) -> and(X1,X2) isNat(active(X)) -> isNat(X) isNat(mark(X)) -> isNat(X) mark(U11(X1,X2)) -> active(U11(mark(X1),X2)) mark(U21(X1,X2,X3)) -> active(U21(mark(X1),X2,X3)) mark(and(X1,X2)) -> active(and(mark(X1),X2)) mark(isNat(X)) -> active(isNat(X)) mark(plus(X1,X2)) -> active(plus(mark(X1),mark(X2))) mark(s(X)) -> active(s(mark(X))) mark(0) -> active(0) mark(tt) -> active(tt) plus(active(X1),X2) -> plus(X1,X2) plus(mark(X1),X2) -> plus(X1,X2) plus(X1,active(X2)) -> plus(X1,X2) plus(X1,mark(X2)) -> plus(X1,X2) s(active(X)) -> s(X) s(mark(X)) -> s(X) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: ACTIVE(and(tt,X)) -> MARK(X) ACTIVE(isNat(plus(V1,V2))) -> MARK(and(isNat(V1),isNat(V2))) ACTIVE(isNat(s(V1))) -> MARK(isNat(V1)) MARK(U11(X1,X2)) -> MARK(X1) MARK(U21(X1,X2,X3)) -> ACTIVE(U21(mark(X1),X2,X3)) MARK(U21(X1,X2,X3)) -> MARK(X1) MARK(and(X1,X2)) -> ACTIVE(and(mark(X1),X2)) MARK(and(X1,X2)) -> MARK(X1) MARK(isNat(X)) -> ACTIVE(isNat(X)) MARK(plus(X1,X2)) -> ACTIVE(plus(mark(X1),mark(X2))) MARK(plus(X1,X2)) -> MARK(X1) MARK(plus(X1,X2)) -> MARK(X2) MARK(s(X)) -> ACTIVE(s(mark(X))) MARK(s(X)) -> MARK(X) ->->-> Rules: U11(active(X1),X2) -> U11(X1,X2) U11(mark(X1),X2) -> U11(X1,X2) U11(X1,active(X2)) -> U11(X1,X2) U11(X1,mark(X2)) -> U11(X1,X2) U21(active(X1),X2,X3) -> U21(X1,X2,X3) U21(mark(X1),X2,X3) -> U21(X1,X2,X3) U21(X1,active(X2),X3) -> U21(X1,X2,X3) U21(X1,mark(X2),X3) -> U21(X1,X2,X3) U21(X1,X2,active(X3)) -> U21(X1,X2,X3) U21(X1,X2,mark(X3)) -> U21(X1,X2,X3) active(U11(tt,N)) -> mark(N) active(U21(tt,M,N)) -> mark(s(plus(N,M))) active(and(tt,X)) -> mark(X) active(isNat(plus(V1,V2))) -> mark(and(isNat(V1),isNat(V2))) active(isNat(s(V1))) -> mark(isNat(V1)) active(isNat(0)) -> mark(tt) active(plus(N,s(M))) -> mark(U21(and(isNat(M),isNat(N)),M,N)) active(plus(N,0)) -> mark(U11(isNat(N),N)) and(active(X1),X2) -> and(X1,X2) and(mark(X1),X2) -> and(X1,X2) and(X1,active(X2)) -> and(X1,X2) and(X1,mark(X2)) -> and(X1,X2) isNat(active(X)) -> isNat(X) isNat(mark(X)) -> isNat(X) mark(U11(X1,X2)) -> active(U11(mark(X1),X2)) mark(U21(X1,X2,X3)) -> active(U21(mark(X1),X2,X3)) mark(and(X1,X2)) -> active(and(mark(X1),X2)) mark(isNat(X)) -> active(isNat(X)) mark(plus(X1,X2)) -> active(plus(mark(X1),mark(X2))) mark(s(X)) -> active(s(mark(X))) mark(0) -> active(0) mark(tt) -> active(tt) plus(active(X1),X2) -> plus(X1,X2) plus(mark(X1),X2) -> plus(X1,X2) plus(X1,active(X2)) -> plus(X1,X2) plus(X1,mark(X2)) -> plus(X1,X2) s(active(X)) -> s(X) s(mark(X)) -> s(X) Problem 1.7: Reduction Pair Processor: -> Pairs: ACTIVE(and(tt,X)) -> MARK(X) ACTIVE(isNat(plus(V1,V2))) -> MARK(and(isNat(V1),isNat(V2))) ACTIVE(isNat(s(V1))) -> MARK(isNat(V1)) MARK(U11(X1,X2)) -> MARK(X1) MARK(U21(X1,X2,X3)) -> ACTIVE(U21(mark(X1),X2,X3)) MARK(U21(X1,X2,X3)) -> MARK(X1) MARK(and(X1,X2)) -> ACTIVE(and(mark(X1),X2)) MARK(and(X1,X2)) -> MARK(X1) MARK(isNat(X)) -> ACTIVE(isNat(X)) MARK(plus(X1,X2)) -> ACTIVE(plus(mark(X1),mark(X2))) MARK(plus(X1,X2)) -> MARK(X1) MARK(plus(X1,X2)) -> MARK(X2) MARK(s(X)) -> ACTIVE(s(mark(X))) MARK(s(X)) -> MARK(X) -> Rules: U11(active(X1),X2) -> U11(X1,X2) U11(mark(X1),X2) -> U11(X1,X2) U11(X1,active(X2)) -> U11(X1,X2) U11(X1,mark(X2)) -> U11(X1,X2) U21(active(X1),X2,X3) -> U21(X1,X2,X3) U21(mark(X1),X2,X3) -> U21(X1,X2,X3) U21(X1,active(X2),X3) -> U21(X1,X2,X3) U21(X1,mark(X2),X3) -> U21(X1,X2,X3) U21(X1,X2,active(X3)) -> U21(X1,X2,X3) U21(X1,X2,mark(X3)) -> U21(X1,X2,X3) active(U11(tt,N)) -> mark(N) active(U21(tt,M,N)) -> mark(s(plus(N,M))) active(and(tt,X)) -> mark(X) active(isNat(plus(V1,V2))) -> mark(and(isNat(V1),isNat(V2))) active(isNat(s(V1))) -> mark(isNat(V1)) active(isNat(0)) -> mark(tt) active(plus(N,s(M))) -> mark(U21(and(isNat(M),isNat(N)),M,N)) active(plus(N,0)) -> mark(U11(isNat(N),N)) and(active(X1),X2) -> and(X1,X2) and(mark(X1),X2) -> and(X1,X2) and(X1,active(X2)) -> and(X1,X2) and(X1,mark(X2)) -> and(X1,X2) isNat(active(X)) -> isNat(X) isNat(mark(X)) -> isNat(X) mark(U11(X1,X2)) -> active(U11(mark(X1),X2)) mark(U21(X1,X2,X3)) -> active(U21(mark(X1),X2,X3)) mark(and(X1,X2)) -> active(and(mark(X1),X2)) mark(isNat(X)) -> active(isNat(X)) mark(plus(X1,X2)) -> active(plus(mark(X1),mark(X2))) mark(s(X)) -> active(s(mark(X))) mark(0) -> active(0) mark(tt) -> active(tt) plus(active(X1),X2) -> plus(X1,X2) plus(mark(X1),X2) -> plus(X1,X2) plus(X1,active(X2)) -> plus(X1,X2) plus(X1,mark(X2)) -> plus(X1,X2) s(active(X)) -> s(X) s(mark(X)) -> s(X) -> Usable rules: U11(active(X1),X2) -> U11(X1,X2) U11(mark(X1),X2) -> U11(X1,X2) U11(X1,active(X2)) -> U11(X1,X2) U11(X1,mark(X2)) -> U11(X1,X2) U21(active(X1),X2,X3) -> U21(X1,X2,X3) U21(mark(X1),X2,X3) -> U21(X1,X2,X3) U21(X1,active(X2),X3) -> U21(X1,X2,X3) U21(X1,mark(X2),X3) -> U21(X1,X2,X3) U21(X1,X2,active(X3)) -> U21(X1,X2,X3) U21(X1,X2,mark(X3)) -> U21(X1,X2,X3) active(U11(tt,N)) -> mark(N) active(U21(tt,M,N)) -> mark(s(plus(N,M))) active(and(tt,X)) -> mark(X) active(isNat(plus(V1,V2))) -> mark(and(isNat(V1),isNat(V2))) active(isNat(s(V1))) -> mark(isNat(V1)) active(isNat(0)) -> mark(tt) active(plus(N,s(M))) -> mark(U21(and(isNat(M),isNat(N)),M,N)) active(plus(N,0)) -> mark(U11(isNat(N),N)) and(active(X1),X2) -> and(X1,X2) and(mark(X1),X2) -> and(X1,X2) and(X1,active(X2)) -> and(X1,X2) and(X1,mark(X2)) -> and(X1,X2) isNat(active(X)) -> isNat(X) isNat(mark(X)) -> isNat(X) mark(U11(X1,X2)) -> active(U11(mark(X1),X2)) mark(U21(X1,X2,X3)) -> active(U21(mark(X1),X2,X3)) mark(and(X1,X2)) -> active(and(mark(X1),X2)) mark(isNat(X)) -> active(isNat(X)) mark(plus(X1,X2)) -> active(plus(mark(X1),mark(X2))) mark(s(X)) -> active(s(mark(X))) mark(0) -> active(0) mark(tt) -> active(tt) plus(active(X1),X2) -> plus(X1,X2) plus(mark(X1),X2) -> plus(X1,X2) plus(X1,active(X2)) -> plus(X1,X2) plus(X1,mark(X2)) -> plus(X1,X2) s(active(X)) -> s(X) s(mark(X)) -> s(X) ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [U11](X1,X2) = X1 + 2.X2 + 2 [U21](X1,X2,X3) = 2.X1 + 2.X2 + 2.X3 [active](X) = X [and](X1,X2) = 2.X1 + 2.X2 [isNat](X) = 0 [mark](X) = X [plus](X1,X2) = 2.X1 + 2.X2 [s](X) = X [0] = 2 [tt] = 0 [ACTIVE](X) = 2.X + 2 [MARK](X) = 2.X + 2 Problem 1.7: SCC Processor: -> Pairs: ACTIVE(and(tt,X)) -> MARK(X) ACTIVE(isNat(plus(V1,V2))) -> MARK(and(isNat(V1),isNat(V2))) ACTIVE(isNat(s(V1))) -> MARK(isNat(V1)) MARK(U21(X1,X2,X3)) -> ACTIVE(U21(mark(X1),X2,X3)) MARK(U21(X1,X2,X3)) -> MARK(X1) MARK(and(X1,X2)) -> ACTIVE(and(mark(X1),X2)) MARK(and(X1,X2)) -> MARK(X1) MARK(isNat(X)) -> ACTIVE(isNat(X)) MARK(plus(X1,X2)) -> ACTIVE(plus(mark(X1),mark(X2))) MARK(plus(X1,X2)) -> MARK(X1) MARK(plus(X1,X2)) -> MARK(X2) MARK(s(X)) -> ACTIVE(s(mark(X))) MARK(s(X)) -> MARK(X) -> Rules: U11(active(X1),X2) -> U11(X1,X2) U11(mark(X1),X2) -> U11(X1,X2) U11(X1,active(X2)) -> U11(X1,X2) U11(X1,mark(X2)) -> U11(X1,X2) U21(active(X1),X2,X3) -> U21(X1,X2,X3) U21(mark(X1),X2,X3) -> U21(X1,X2,X3) U21(X1,active(X2),X3) -> U21(X1,X2,X3) U21(X1,mark(X2),X3) -> U21(X1,X2,X3) U21(X1,X2,active(X3)) -> U21(X1,X2,X3) U21(X1,X2,mark(X3)) -> U21(X1,X2,X3) active(U11(tt,N)) -> mark(N) active(U21(tt,M,N)) -> mark(s(plus(N,M))) active(and(tt,X)) -> mark(X) active(isNat(plus(V1,V2))) -> mark(and(isNat(V1),isNat(V2))) active(isNat(s(V1))) -> mark(isNat(V1)) active(isNat(0)) -> mark(tt) active(plus(N,s(M))) -> mark(U21(and(isNat(M),isNat(N)),M,N)) active(plus(N,0)) -> mark(U11(isNat(N),N)) and(active(X1),X2) -> and(X1,X2) and(mark(X1),X2) -> and(X1,X2) and(X1,active(X2)) -> and(X1,X2) and(X1,mark(X2)) -> and(X1,X2) isNat(active(X)) -> isNat(X) isNat(mark(X)) -> isNat(X) mark(U11(X1,X2)) -> active(U11(mark(X1),X2)) mark(U21(X1,X2,X3)) -> active(U21(mark(X1),X2,X3)) mark(and(X1,X2)) -> active(and(mark(X1),X2)) mark(isNat(X)) -> active(isNat(X)) mark(plus(X1,X2)) -> active(plus(mark(X1),mark(X2))) mark(s(X)) -> active(s(mark(X))) mark(0) -> active(0) mark(tt) -> active(tt) plus(active(X1),X2) -> plus(X1,X2) plus(mark(X1),X2) -> plus(X1,X2) plus(X1,active(X2)) -> plus(X1,X2) plus(X1,mark(X2)) -> plus(X1,X2) s(active(X)) -> s(X) s(mark(X)) -> s(X) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: ACTIVE(and(tt,X)) -> MARK(X) ACTIVE(isNat(plus(V1,V2))) -> MARK(and(isNat(V1),isNat(V2))) ACTIVE(isNat(s(V1))) -> MARK(isNat(V1)) MARK(U21(X1,X2,X3)) -> ACTIVE(U21(mark(X1),X2,X3)) MARK(U21(X1,X2,X3)) -> MARK(X1) MARK(and(X1,X2)) -> ACTIVE(and(mark(X1),X2)) MARK(and(X1,X2)) -> MARK(X1) MARK(isNat(X)) -> ACTIVE(isNat(X)) MARK(plus(X1,X2)) -> ACTIVE(plus(mark(X1),mark(X2))) MARK(plus(X1,X2)) -> MARK(X1) MARK(plus(X1,X2)) -> MARK(X2) MARK(s(X)) -> ACTIVE(s(mark(X))) MARK(s(X)) -> MARK(X) ->->-> Rules: U11(active(X1),X2) -> U11(X1,X2) U11(mark(X1),X2) -> U11(X1,X2) U11(X1,active(X2)) -> U11(X1,X2) U11(X1,mark(X2)) -> U11(X1,X2) U21(active(X1),X2,X3) -> U21(X1,X2,X3) U21(mark(X1),X2,X3) -> U21(X1,X2,X3) U21(X1,active(X2),X3) -> U21(X1,X2,X3) U21(X1,mark(X2),X3) -> U21(X1,X2,X3) U21(X1,X2,active(X3)) -> U21(X1,X2,X3) U21(X1,X2,mark(X3)) -> U21(X1,X2,X3) active(U11(tt,N)) -> mark(N) active(U21(tt,M,N)) -> mark(s(plus(N,M))) active(and(tt,X)) -> mark(X) active(isNat(plus(V1,V2))) -> mark(and(isNat(V1),isNat(V2))) active(isNat(s(V1))) -> mark(isNat(V1)) active(isNat(0)) -> mark(tt) active(plus(N,s(M))) -> mark(U21(and(isNat(M),isNat(N)),M,N)) active(plus(N,0)) -> mark(U11(isNat(N),N)) and(active(X1),X2) -> and(X1,X2) and(mark(X1),X2) -> and(X1,X2) and(X1,active(X2)) -> and(X1,X2) and(X1,mark(X2)) -> and(X1,X2) isNat(active(X)) -> isNat(X) isNat(mark(X)) -> isNat(X) mark(U11(X1,X2)) -> active(U11(mark(X1),X2)) mark(U21(X1,X2,X3)) -> active(U21(mark(X1),X2,X3)) mark(and(X1,X2)) -> active(and(mark(X1),X2)) mark(isNat(X)) -> active(isNat(X)) mark(plus(X1,X2)) -> active(plus(mark(X1),mark(X2))) mark(s(X)) -> active(s(mark(X))) mark(0) -> active(0) mark(tt) -> active(tt) plus(active(X1),X2) -> plus(X1,X2) plus(mark(X1),X2) -> plus(X1,X2) plus(X1,active(X2)) -> plus(X1,X2) plus(X1,mark(X2)) -> plus(X1,X2) s(active(X)) -> s(X) s(mark(X)) -> s(X) Problem 1.7: Reduction Pair Processor: -> Pairs: ACTIVE(and(tt,X)) -> MARK(X) ACTIVE(isNat(plus(V1,V2))) -> MARK(and(isNat(V1),isNat(V2))) ACTIVE(isNat(s(V1))) -> MARK(isNat(V1)) MARK(U21(X1,X2,X3)) -> ACTIVE(U21(mark(X1),X2,X3)) MARK(U21(X1,X2,X3)) -> MARK(X1) MARK(and(X1,X2)) -> ACTIVE(and(mark(X1),X2)) MARK(and(X1,X2)) -> MARK(X1) MARK(isNat(X)) -> ACTIVE(isNat(X)) MARK(plus(X1,X2)) -> ACTIVE(plus(mark(X1),mark(X2))) MARK(plus(X1,X2)) -> MARK(X1) MARK(plus(X1,X2)) -> MARK(X2) MARK(s(X)) -> ACTIVE(s(mark(X))) MARK(s(X)) -> MARK(X) -> Rules: U11(active(X1),X2) -> U11(X1,X2) U11(mark(X1),X2) -> U11(X1,X2) U11(X1,active(X2)) -> U11(X1,X2) U11(X1,mark(X2)) -> U11(X1,X2) U21(active(X1),X2,X3) -> U21(X1,X2,X3) U21(mark(X1),X2,X3) -> U21(X1,X2,X3) U21(X1,active(X2),X3) -> U21(X1,X2,X3) U21(X1,mark(X2),X3) -> U21(X1,X2,X3) U21(X1,X2,active(X3)) -> U21(X1,X2,X3) U21(X1,X2,mark(X3)) -> U21(X1,X2,X3) active(U11(tt,N)) -> mark(N) active(U21(tt,M,N)) -> mark(s(plus(N,M))) active(and(tt,X)) -> mark(X) active(isNat(plus(V1,V2))) -> mark(and(isNat(V1),isNat(V2))) active(isNat(s(V1))) -> mark(isNat(V1)) active(isNat(0)) -> mark(tt) active(plus(N,s(M))) -> mark(U21(and(isNat(M),isNat(N)),M,N)) active(plus(N,0)) -> mark(U11(isNat(N),N)) and(active(X1),X2) -> and(X1,X2) and(mark(X1),X2) -> and(X1,X2) and(X1,active(X2)) -> and(X1,X2) and(X1,mark(X2)) -> and(X1,X2) isNat(active(X)) -> isNat(X) isNat(mark(X)) -> isNat(X) mark(U11(X1,X2)) -> active(U11(mark(X1),X2)) mark(U21(X1,X2,X3)) -> active(U21(mark(X1),X2,X3)) mark(and(X1,X2)) -> active(and(mark(X1),X2)) mark(isNat(X)) -> active(isNat(X)) mark(plus(X1,X2)) -> active(plus(mark(X1),mark(X2))) mark(s(X)) -> active(s(mark(X))) mark(0) -> active(0) mark(tt) -> active(tt) plus(active(X1),X2) -> plus(X1,X2) plus(mark(X1),X2) -> plus(X1,X2) plus(X1,active(X2)) -> plus(X1,X2) plus(X1,mark(X2)) -> plus(X1,X2) s(active(X)) -> s(X) s(mark(X)) -> s(X) -> Usable rules: U11(active(X1),X2) -> U11(X1,X2) U11(mark(X1),X2) -> U11(X1,X2) U11(X1,active(X2)) -> U11(X1,X2) U11(X1,mark(X2)) -> U11(X1,X2) U21(active(X1),X2,X3) -> U21(X1,X2,X3) U21(mark(X1),X2,X3) -> U21(X1,X2,X3) U21(X1,active(X2),X3) -> U21(X1,X2,X3) U21(X1,mark(X2),X3) -> U21(X1,X2,X3) U21(X1,X2,active(X3)) -> U21(X1,X2,X3) U21(X1,X2,mark(X3)) -> U21(X1,X2,X3) active(U11(tt,N)) -> mark(N) active(U21(tt,M,N)) -> mark(s(plus(N,M))) active(and(tt,X)) -> mark(X) active(isNat(plus(V1,V2))) -> mark(and(isNat(V1),isNat(V2))) active(isNat(s(V1))) -> mark(isNat(V1)) active(isNat(0)) -> mark(tt) active(plus(N,s(M))) -> mark(U21(and(isNat(M),isNat(N)),M,N)) active(plus(N,0)) -> mark(U11(isNat(N),N)) and(active(X1),X2) -> and(X1,X2) and(mark(X1),X2) -> and(X1,X2) and(X1,active(X2)) -> and(X1,X2) and(X1,mark(X2)) -> and(X1,X2) isNat(active(X)) -> isNat(X) isNat(mark(X)) -> isNat(X) mark(U11(X1,X2)) -> active(U11(mark(X1),X2)) mark(U21(X1,X2,X3)) -> active(U21(mark(X1),X2,X3)) mark(and(X1,X2)) -> active(and(mark(X1),X2)) mark(isNat(X)) -> active(isNat(X)) mark(plus(X1,X2)) -> active(plus(mark(X1),mark(X2))) mark(s(X)) -> active(s(mark(X))) mark(0) -> active(0) mark(tt) -> active(tt) plus(active(X1),X2) -> plus(X1,X2) plus(mark(X1),X2) -> plus(X1,X2) plus(X1,active(X2)) -> plus(X1,X2) plus(X1,mark(X2)) -> plus(X1,X2) s(active(X)) -> s(X) s(mark(X)) -> s(X) ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [U11](X1,X2) = 2.X1 + 2.X2 + 1 [U21](X1,X2,X3) = 2.X1 + 2.X2 + 2.X3 + 2 [active](X) = X [and](X1,X2) = X1 + 2.X2 [isNat](X) = 0 [mark](X) = X [plus](X1,X2) = 2.X1 + 2.X2 + 2 [s](X) = X [0] = 0 [tt] = 0 [ACTIVE](X) = X + 2 [MARK](X) = 2.X + 2 Problem 1.7: SCC Processor: -> Pairs: ACTIVE(and(tt,X)) -> MARK(X) ACTIVE(isNat(plus(V1,V2))) -> MARK(and(isNat(V1),isNat(V2))) ACTIVE(isNat(s(V1))) -> MARK(isNat(V1)) MARK(U21(X1,X2,X3)) -> MARK(X1) MARK(and(X1,X2)) -> ACTIVE(and(mark(X1),X2)) MARK(and(X1,X2)) -> MARK(X1) MARK(isNat(X)) -> ACTIVE(isNat(X)) MARK(plus(X1,X2)) -> ACTIVE(plus(mark(X1),mark(X2))) MARK(plus(X1,X2)) -> MARK(X1) MARK(plus(X1,X2)) -> MARK(X2) MARK(s(X)) -> ACTIVE(s(mark(X))) MARK(s(X)) -> MARK(X) -> Rules: U11(active(X1),X2) -> U11(X1,X2) U11(mark(X1),X2) -> U11(X1,X2) U11(X1,active(X2)) -> U11(X1,X2) U11(X1,mark(X2)) -> U11(X1,X2) U21(active(X1),X2,X3) -> U21(X1,X2,X3) U21(mark(X1),X2,X3) -> U21(X1,X2,X3) U21(X1,active(X2),X3) -> U21(X1,X2,X3) U21(X1,mark(X2),X3) -> U21(X1,X2,X3) U21(X1,X2,active(X3)) -> U21(X1,X2,X3) U21(X1,X2,mark(X3)) -> U21(X1,X2,X3) active(U11(tt,N)) -> mark(N) active(U21(tt,M,N)) -> mark(s(plus(N,M))) active(and(tt,X)) -> mark(X) active(isNat(plus(V1,V2))) -> mark(and(isNat(V1),isNat(V2))) active(isNat(s(V1))) -> mark(isNat(V1)) active(isNat(0)) -> mark(tt) active(plus(N,s(M))) -> mark(U21(and(isNat(M),isNat(N)),M,N)) active(plus(N,0)) -> mark(U11(isNat(N),N)) and(active(X1),X2) -> and(X1,X2) and(mark(X1),X2) -> and(X1,X2) and(X1,active(X2)) -> and(X1,X2) and(X1,mark(X2)) -> and(X1,X2) isNat(active(X)) -> isNat(X) isNat(mark(X)) -> isNat(X) mark(U11(X1,X2)) -> active(U11(mark(X1),X2)) mark(U21(X1,X2,X3)) -> active(U21(mark(X1),X2,X3)) mark(and(X1,X2)) -> active(and(mark(X1),X2)) mark(isNat(X)) -> active(isNat(X)) mark(plus(X1,X2)) -> active(plus(mark(X1),mark(X2))) mark(s(X)) -> active(s(mark(X))) mark(0) -> active(0) mark(tt) -> active(tt) plus(active(X1),X2) -> plus(X1,X2) plus(mark(X1),X2) -> plus(X1,X2) plus(X1,active(X2)) -> plus(X1,X2) plus(X1,mark(X2)) -> plus(X1,X2) s(active(X)) -> s(X) s(mark(X)) -> s(X) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: ACTIVE(and(tt,X)) -> MARK(X) ACTIVE(isNat(plus(V1,V2))) -> MARK(and(isNat(V1),isNat(V2))) ACTIVE(isNat(s(V1))) -> MARK(isNat(V1)) MARK(U21(X1,X2,X3)) -> MARK(X1) MARK(and(X1,X2)) -> ACTIVE(and(mark(X1),X2)) MARK(and(X1,X2)) -> MARK(X1) MARK(isNat(X)) -> ACTIVE(isNat(X)) MARK(plus(X1,X2)) -> ACTIVE(plus(mark(X1),mark(X2))) MARK(plus(X1,X2)) -> MARK(X1) MARK(plus(X1,X2)) -> MARK(X2) MARK(s(X)) -> ACTIVE(s(mark(X))) MARK(s(X)) -> MARK(X) ->->-> Rules: U11(active(X1),X2) -> U11(X1,X2) U11(mark(X1),X2) -> U11(X1,X2) U11(X1,active(X2)) -> U11(X1,X2) U11(X1,mark(X2)) -> U11(X1,X2) U21(active(X1),X2,X3) -> U21(X1,X2,X3) U21(mark(X1),X2,X3) -> U21(X1,X2,X3) U21(X1,active(X2),X3) -> U21(X1,X2,X3) U21(X1,mark(X2),X3) -> U21(X1,X2,X3) U21(X1,X2,active(X3)) -> U21(X1,X2,X3) U21(X1,X2,mark(X3)) -> U21(X1,X2,X3) active(U11(tt,N)) -> mark(N) active(U21(tt,M,N)) -> mark(s(plus(N,M))) active(and(tt,X)) -> mark(X) active(isNat(plus(V1,V2))) -> mark(and(isNat(V1),isNat(V2))) active(isNat(s(V1))) -> mark(isNat(V1)) active(isNat(0)) -> mark(tt) active(plus(N,s(M))) -> mark(U21(and(isNat(M),isNat(N)),M,N)) active(plus(N,0)) -> mark(U11(isNat(N),N)) and(active(X1),X2) -> and(X1,X2) and(mark(X1),X2) -> and(X1,X2) and(X1,active(X2)) -> and(X1,X2) and(X1,mark(X2)) -> and(X1,X2) isNat(active(X)) -> isNat(X) isNat(mark(X)) -> isNat(X) mark(U11(X1,X2)) -> active(U11(mark(X1),X2)) mark(U21(X1,X2,X3)) -> active(U21(mark(X1),X2,X3)) mark(and(X1,X2)) -> active(and(mark(X1),X2)) mark(isNat(X)) -> active(isNat(X)) mark(plus(X1,X2)) -> active(plus(mark(X1),mark(X2))) mark(s(X)) -> active(s(mark(X))) mark(0) -> active(0) mark(tt) -> active(tt) plus(active(X1),X2) -> plus(X1,X2) plus(mark(X1),X2) -> plus(X1,X2) plus(X1,active(X2)) -> plus(X1,X2) plus(X1,mark(X2)) -> plus(X1,X2) s(active(X)) -> s(X) s(mark(X)) -> s(X) Problem 1.7: Reduction Pair Processor: -> Pairs: ACTIVE(and(tt,X)) -> MARK(X) ACTIVE(isNat(plus(V1,V2))) -> MARK(and(isNat(V1),isNat(V2))) ACTIVE(isNat(s(V1))) -> MARK(isNat(V1)) MARK(U21(X1,X2,X3)) -> MARK(X1) MARK(and(X1,X2)) -> ACTIVE(and(mark(X1),X2)) MARK(and(X1,X2)) -> MARK(X1) MARK(isNat(X)) -> ACTIVE(isNat(X)) MARK(plus(X1,X2)) -> ACTIVE(plus(mark(X1),mark(X2))) MARK(plus(X1,X2)) -> MARK(X1) MARK(plus(X1,X2)) -> MARK(X2) MARK(s(X)) -> ACTIVE(s(mark(X))) MARK(s(X)) -> MARK(X) -> Rules: U11(active(X1),X2) -> U11(X1,X2) U11(mark(X1),X2) -> U11(X1,X2) U11(X1,active(X2)) -> U11(X1,X2) U11(X1,mark(X2)) -> U11(X1,X2) U21(active(X1),X2,X3) -> U21(X1,X2,X3) U21(mark(X1),X2,X3) -> U21(X1,X2,X3) U21(X1,active(X2),X3) -> U21(X1,X2,X3) U21(X1,mark(X2),X3) -> U21(X1,X2,X3) U21(X1,X2,active(X3)) -> U21(X1,X2,X3) U21(X1,X2,mark(X3)) -> U21(X1,X2,X3) active(U11(tt,N)) -> mark(N) active(U21(tt,M,N)) -> mark(s(plus(N,M))) active(and(tt,X)) -> mark(X) active(isNat(plus(V1,V2))) -> mark(and(isNat(V1),isNat(V2))) active(isNat(s(V1))) -> mark(isNat(V1)) active(isNat(0)) -> mark(tt) active(plus(N,s(M))) -> mark(U21(and(isNat(M),isNat(N)),M,N)) active(plus(N,0)) -> mark(U11(isNat(N),N)) and(active(X1),X2) -> and(X1,X2) and(mark(X1),X2) -> and(X1,X2) and(X1,active(X2)) -> and(X1,X2) and(X1,mark(X2)) -> and(X1,X2) isNat(active(X)) -> isNat(X) isNat(mark(X)) -> isNat(X) mark(U11(X1,X2)) -> active(U11(mark(X1),X2)) mark(U21(X1,X2,X3)) -> active(U21(mark(X1),X2,X3)) mark(and(X1,X2)) -> active(and(mark(X1),X2)) mark(isNat(X)) -> active(isNat(X)) mark(plus(X1,X2)) -> active(plus(mark(X1),mark(X2))) mark(s(X)) -> active(s(mark(X))) mark(0) -> active(0) mark(tt) -> active(tt) plus(active(X1),X2) -> plus(X1,X2) plus(mark(X1),X2) -> plus(X1,X2) plus(X1,active(X2)) -> plus(X1,X2) plus(X1,mark(X2)) -> plus(X1,X2) s(active(X)) -> s(X) s(mark(X)) -> s(X) -> Usable rules: U11(active(X1),X2) -> U11(X1,X2) U11(mark(X1),X2) -> U11(X1,X2) U11(X1,active(X2)) -> U11(X1,X2) U11(X1,mark(X2)) -> U11(X1,X2) U21(active(X1),X2,X3) -> U21(X1,X2,X3) U21(mark(X1),X2,X3) -> U21(X1,X2,X3) U21(X1,active(X2),X3) -> U21(X1,X2,X3) U21(X1,mark(X2),X3) -> U21(X1,X2,X3) U21(X1,X2,active(X3)) -> U21(X1,X2,X3) U21(X1,X2,mark(X3)) -> U21(X1,X2,X3) active(U11(tt,N)) -> mark(N) active(U21(tt,M,N)) -> mark(s(plus(N,M))) active(and(tt,X)) -> mark(X) active(isNat(plus(V1,V2))) -> mark(and(isNat(V1),isNat(V2))) active(isNat(s(V1))) -> mark(isNat(V1)) active(isNat(0)) -> mark(tt) active(plus(N,s(M))) -> mark(U21(and(isNat(M),isNat(N)),M,N)) active(plus(N,0)) -> mark(U11(isNat(N),N)) and(active(X1),X2) -> and(X1,X2) and(mark(X1),X2) -> and(X1,X2) and(X1,active(X2)) -> and(X1,X2) and(X1,mark(X2)) -> and(X1,X2) isNat(active(X)) -> isNat(X) isNat(mark(X)) -> isNat(X) mark(U11(X1,X2)) -> active(U11(mark(X1),X2)) mark(U21(X1,X2,X3)) -> active(U21(mark(X1),X2,X3)) mark(and(X1,X2)) -> active(and(mark(X1),X2)) mark(isNat(X)) -> active(isNat(X)) mark(plus(X1,X2)) -> active(plus(mark(X1),mark(X2))) mark(s(X)) -> active(s(mark(X))) mark(0) -> active(0) mark(tt) -> active(tt) plus(active(X1),X2) -> plus(X1,X2) plus(mark(X1),X2) -> plus(X1,X2) plus(X1,active(X2)) -> plus(X1,X2) plus(X1,mark(X2)) -> plus(X1,X2) s(active(X)) -> s(X) s(mark(X)) -> s(X) ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [U11](X1,X2) = 2.X1 + X2 + 2 [U21](X1,X2,X3) = 2.X1 + 2.X2 + 2.X3 + 2 [active](X) = X [and](X1,X2) = 2.X1 + X2 [isNat](X) = 0 [mark](X) = X [plus](X1,X2) = 2.X1 + 2.X2 [s](X) = X + 2 [0] = 2 [tt] = 0 [ACTIVE](X) = 2.X + 2 [MARK](X) = 2.X + 2 Problem 1.7: SCC Processor: -> Pairs: ACTIVE(and(tt,X)) -> MARK(X) ACTIVE(isNat(plus(V1,V2))) -> MARK(and(isNat(V1),isNat(V2))) ACTIVE(isNat(s(V1))) -> MARK(isNat(V1)) MARK(and(X1,X2)) -> ACTIVE(and(mark(X1),X2)) MARK(and(X1,X2)) -> MARK(X1) MARK(isNat(X)) -> ACTIVE(isNat(X)) MARK(plus(X1,X2)) -> ACTIVE(plus(mark(X1),mark(X2))) MARK(plus(X1,X2)) -> MARK(X1) MARK(plus(X1,X2)) -> MARK(X2) MARK(s(X)) -> ACTIVE(s(mark(X))) MARK(s(X)) -> MARK(X) -> Rules: U11(active(X1),X2) -> U11(X1,X2) U11(mark(X1),X2) -> U11(X1,X2) U11(X1,active(X2)) -> U11(X1,X2) U11(X1,mark(X2)) -> U11(X1,X2) U21(active(X1),X2,X3) -> U21(X1,X2,X3) U21(mark(X1),X2,X3) -> U21(X1,X2,X3) U21(X1,active(X2),X3) -> U21(X1,X2,X3) U21(X1,mark(X2),X3) -> U21(X1,X2,X3) U21(X1,X2,active(X3)) -> U21(X1,X2,X3) U21(X1,X2,mark(X3)) -> U21(X1,X2,X3) active(U11(tt,N)) -> mark(N) active(U21(tt,M,N)) -> mark(s(plus(N,M))) active(and(tt,X)) -> mark(X) active(isNat(plus(V1,V2))) -> mark(and(isNat(V1),isNat(V2))) active(isNat(s(V1))) -> mark(isNat(V1)) active(isNat(0)) -> mark(tt) active(plus(N,s(M))) -> mark(U21(and(isNat(M),isNat(N)),M,N)) active(plus(N,0)) -> mark(U11(isNat(N),N)) and(active(X1),X2) -> and(X1,X2) and(mark(X1),X2) -> and(X1,X2) and(X1,active(X2)) -> and(X1,X2) and(X1,mark(X2)) -> and(X1,X2) isNat(active(X)) -> isNat(X) isNat(mark(X)) -> isNat(X) mark(U11(X1,X2)) -> active(U11(mark(X1),X2)) mark(U21(X1,X2,X3)) -> active(U21(mark(X1),X2,X3)) mark(and(X1,X2)) -> active(and(mark(X1),X2)) mark(isNat(X)) -> active(isNat(X)) mark(plus(X1,X2)) -> active(plus(mark(X1),mark(X2))) mark(s(X)) -> active(s(mark(X))) mark(0) -> active(0) mark(tt) -> active(tt) plus(active(X1),X2) -> plus(X1,X2) plus(mark(X1),X2) -> plus(X1,X2) plus(X1,active(X2)) -> plus(X1,X2) plus(X1,mark(X2)) -> plus(X1,X2) s(active(X)) -> s(X) s(mark(X)) -> s(X) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: ACTIVE(and(tt,X)) -> MARK(X) ACTIVE(isNat(plus(V1,V2))) -> MARK(and(isNat(V1),isNat(V2))) ACTIVE(isNat(s(V1))) -> MARK(isNat(V1)) MARK(and(X1,X2)) -> ACTIVE(and(mark(X1),X2)) MARK(and(X1,X2)) -> MARK(X1) MARK(isNat(X)) -> ACTIVE(isNat(X)) MARK(plus(X1,X2)) -> ACTIVE(plus(mark(X1),mark(X2))) MARK(plus(X1,X2)) -> MARK(X1) MARK(plus(X1,X2)) -> MARK(X2) MARK(s(X)) -> ACTIVE(s(mark(X))) MARK(s(X)) -> MARK(X) ->->-> Rules: U11(active(X1),X2) -> U11(X1,X2) U11(mark(X1),X2) -> U11(X1,X2) U11(X1,active(X2)) -> U11(X1,X2) U11(X1,mark(X2)) -> U11(X1,X2) U21(active(X1),X2,X3) -> U21(X1,X2,X3) U21(mark(X1),X2,X3) -> U21(X1,X2,X3) U21(X1,active(X2),X3) -> U21(X1,X2,X3) U21(X1,mark(X2),X3) -> U21(X1,X2,X3) U21(X1,X2,active(X3)) -> U21(X1,X2,X3) U21(X1,X2,mark(X3)) -> U21(X1,X2,X3) active(U11(tt,N)) -> mark(N) active(U21(tt,M,N)) -> mark(s(plus(N,M))) active(and(tt,X)) -> mark(X) active(isNat(plus(V1,V2))) -> mark(and(isNat(V1),isNat(V2))) active(isNat(s(V1))) -> mark(isNat(V1)) active(isNat(0)) -> mark(tt) active(plus(N,s(M))) -> mark(U21(and(isNat(M),isNat(N)),M,N)) active(plus(N,0)) -> mark(U11(isNat(N),N)) and(active(X1),X2) -> and(X1,X2) and(mark(X1),X2) -> and(X1,X2) and(X1,active(X2)) -> and(X1,X2) and(X1,mark(X2)) -> and(X1,X2) isNat(active(X)) -> isNat(X) isNat(mark(X)) -> isNat(X) mark(U11(X1,X2)) -> active(U11(mark(X1),X2)) mark(U21(X1,X2,X3)) -> active(U21(mark(X1),X2,X3)) mark(and(X1,X2)) -> active(and(mark(X1),X2)) mark(isNat(X)) -> active(isNat(X)) mark(plus(X1,X2)) -> active(plus(mark(X1),mark(X2))) mark(s(X)) -> active(s(mark(X))) mark(0) -> active(0) mark(tt) -> active(tt) plus(active(X1),X2) -> plus(X1,X2) plus(mark(X1),X2) -> plus(X1,X2) plus(X1,active(X2)) -> plus(X1,X2) plus(X1,mark(X2)) -> plus(X1,X2) s(active(X)) -> s(X) s(mark(X)) -> s(X) Problem 1.7: Reduction Pair Processor: -> Pairs: ACTIVE(and(tt,X)) -> MARK(X) ACTIVE(isNat(plus(V1,V2))) -> MARK(and(isNat(V1),isNat(V2))) ACTIVE(isNat(s(V1))) -> MARK(isNat(V1)) MARK(and(X1,X2)) -> ACTIVE(and(mark(X1),X2)) MARK(and(X1,X2)) -> MARK(X1) MARK(isNat(X)) -> ACTIVE(isNat(X)) MARK(plus(X1,X2)) -> ACTIVE(plus(mark(X1),mark(X2))) MARK(plus(X1,X2)) -> MARK(X1) MARK(plus(X1,X2)) -> MARK(X2) MARK(s(X)) -> ACTIVE(s(mark(X))) MARK(s(X)) -> MARK(X) -> Rules: U11(active(X1),X2) -> U11(X1,X2) U11(mark(X1),X2) -> U11(X1,X2) U11(X1,active(X2)) -> U11(X1,X2) U11(X1,mark(X2)) -> U11(X1,X2) U21(active(X1),X2,X3) -> U21(X1,X2,X3) U21(mark(X1),X2,X3) -> U21(X1,X2,X3) U21(X1,active(X2),X3) -> U21(X1,X2,X3) U21(X1,mark(X2),X3) -> U21(X1,X2,X3) U21(X1,X2,active(X3)) -> U21(X1,X2,X3) U21(X1,X2,mark(X3)) -> U21(X1,X2,X3) active(U11(tt,N)) -> mark(N) active(U21(tt,M,N)) -> mark(s(plus(N,M))) active(and(tt,X)) -> mark(X) active(isNat(plus(V1,V2))) -> mark(and(isNat(V1),isNat(V2))) active(isNat(s(V1))) -> mark(isNat(V1)) active(isNat(0)) -> mark(tt) active(plus(N,s(M))) -> mark(U21(and(isNat(M),isNat(N)),M,N)) active(plus(N,0)) -> mark(U11(isNat(N),N)) and(active(X1),X2) -> and(X1,X2) and(mark(X1),X2) -> and(X1,X2) and(X1,active(X2)) -> and(X1,X2) and(X1,mark(X2)) -> and(X1,X2) isNat(active(X)) -> isNat(X) isNat(mark(X)) -> isNat(X) mark(U11(X1,X2)) -> active(U11(mark(X1),X2)) mark(U21(X1,X2,X3)) -> active(U21(mark(X1),X2,X3)) mark(and(X1,X2)) -> active(and(mark(X1),X2)) mark(isNat(X)) -> active(isNat(X)) mark(plus(X1,X2)) -> active(plus(mark(X1),mark(X2))) mark(s(X)) -> active(s(mark(X))) mark(0) -> active(0) mark(tt) -> active(tt) plus(active(X1),X2) -> plus(X1,X2) plus(mark(X1),X2) -> plus(X1,X2) plus(X1,active(X2)) -> plus(X1,X2) plus(X1,mark(X2)) -> plus(X1,X2) s(active(X)) -> s(X) s(mark(X)) -> s(X) -> Usable rules: U11(active(X1),X2) -> U11(X1,X2) U11(mark(X1),X2) -> U11(X1,X2) U11(X1,active(X2)) -> U11(X1,X2) U11(X1,mark(X2)) -> U11(X1,X2) U21(active(X1),X2,X3) -> U21(X1,X2,X3) U21(mark(X1),X2,X3) -> U21(X1,X2,X3) U21(X1,active(X2),X3) -> U21(X1,X2,X3) U21(X1,mark(X2),X3) -> U21(X1,X2,X3) U21(X1,X2,active(X3)) -> U21(X1,X2,X3) U21(X1,X2,mark(X3)) -> U21(X1,X2,X3) active(U11(tt,N)) -> mark(N) active(U21(tt,M,N)) -> mark(s(plus(N,M))) active(and(tt,X)) -> mark(X) active(isNat(plus(V1,V2))) -> mark(and(isNat(V1),isNat(V2))) active(isNat(s(V1))) -> mark(isNat(V1)) active(isNat(0)) -> mark(tt) active(plus(N,s(M))) -> mark(U21(and(isNat(M),isNat(N)),M,N)) active(plus(N,0)) -> mark(U11(isNat(N),N)) and(active(X1),X2) -> and(X1,X2) and(mark(X1),X2) -> and(X1,X2) and(X1,active(X2)) -> and(X1,X2) and(X1,mark(X2)) -> and(X1,X2) isNat(active(X)) -> isNat(X) isNat(mark(X)) -> isNat(X) mark(U11(X1,X2)) -> active(U11(mark(X1),X2)) mark(U21(X1,X2,X3)) -> active(U21(mark(X1),X2,X3)) mark(and(X1,X2)) -> active(and(mark(X1),X2)) mark(isNat(X)) -> active(isNat(X)) mark(plus(X1,X2)) -> active(plus(mark(X1),mark(X2))) mark(s(X)) -> active(s(mark(X))) mark(0) -> active(0) mark(tt) -> active(tt) plus(active(X1),X2) -> plus(X1,X2) plus(mark(X1),X2) -> plus(X1,X2) plus(X1,active(X2)) -> plus(X1,X2) plus(X1,mark(X2)) -> plus(X1,X2) s(active(X)) -> s(X) s(mark(X)) -> s(X) ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [U11](X1,X2) = X2 [U21](X1,X2,X3) = 2.X2 + 2.X3 [active](X) = X [and](X1,X2) = X1 + X2 [isNat](X) = 2.X [mark](X) = X [plus](X1,X2) = 2.X1 + 2.X2 [s](X) = X [0] = 2 [tt] = 2 [ACTIVE](X) = 2.X + 2 [MARK](X) = 2.X + 2 Problem 1.7: SCC Processor: -> Pairs: ACTIVE(isNat(plus(V1,V2))) -> MARK(and(isNat(V1),isNat(V2))) ACTIVE(isNat(s(V1))) -> MARK(isNat(V1)) MARK(and(X1,X2)) -> ACTIVE(and(mark(X1),X2)) MARK(and(X1,X2)) -> MARK(X1) MARK(isNat(X)) -> ACTIVE(isNat(X)) MARK(plus(X1,X2)) -> ACTIVE(plus(mark(X1),mark(X2))) MARK(plus(X1,X2)) -> MARK(X1) MARK(plus(X1,X2)) -> MARK(X2) MARK(s(X)) -> ACTIVE(s(mark(X))) MARK(s(X)) -> MARK(X) -> Rules: U11(active(X1),X2) -> U11(X1,X2) U11(mark(X1),X2) -> U11(X1,X2) U11(X1,active(X2)) -> U11(X1,X2) U11(X1,mark(X2)) -> U11(X1,X2) U21(active(X1),X2,X3) -> U21(X1,X2,X3) U21(mark(X1),X2,X3) -> U21(X1,X2,X3) U21(X1,active(X2),X3) -> U21(X1,X2,X3) U21(X1,mark(X2),X3) -> U21(X1,X2,X3) U21(X1,X2,active(X3)) -> U21(X1,X2,X3) U21(X1,X2,mark(X3)) -> U21(X1,X2,X3) active(U11(tt,N)) -> mark(N) active(U21(tt,M,N)) -> mark(s(plus(N,M))) active(and(tt,X)) -> mark(X) active(isNat(plus(V1,V2))) -> mark(and(isNat(V1),isNat(V2))) active(isNat(s(V1))) -> mark(isNat(V1)) active(isNat(0)) -> mark(tt) active(plus(N,s(M))) -> mark(U21(and(isNat(M),isNat(N)),M,N)) active(plus(N,0)) -> mark(U11(isNat(N),N)) and(active(X1),X2) -> and(X1,X2) and(mark(X1),X2) -> and(X1,X2) and(X1,active(X2)) -> and(X1,X2) and(X1,mark(X2)) -> and(X1,X2) isNat(active(X)) -> isNat(X) isNat(mark(X)) -> isNat(X) mark(U11(X1,X2)) -> active(U11(mark(X1),X2)) mark(U21(X1,X2,X3)) -> active(U21(mark(X1),X2,X3)) mark(and(X1,X2)) -> active(and(mark(X1),X2)) mark(isNat(X)) -> active(isNat(X)) mark(plus(X1,X2)) -> active(plus(mark(X1),mark(X2))) mark(s(X)) -> active(s(mark(X))) mark(0) -> active(0) mark(tt) -> active(tt) plus(active(X1),X2) -> plus(X1,X2) plus(mark(X1),X2) -> plus(X1,X2) plus(X1,active(X2)) -> plus(X1,X2) plus(X1,mark(X2)) -> plus(X1,X2) s(active(X)) -> s(X) s(mark(X)) -> s(X) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: ACTIVE(isNat(plus(V1,V2))) -> MARK(and(isNat(V1),isNat(V2))) ACTIVE(isNat(s(V1))) -> MARK(isNat(V1)) MARK(and(X1,X2)) -> ACTIVE(and(mark(X1),X2)) MARK(and(X1,X2)) -> MARK(X1) MARK(isNat(X)) -> ACTIVE(isNat(X)) MARK(plus(X1,X2)) -> ACTIVE(plus(mark(X1),mark(X2))) MARK(plus(X1,X2)) -> MARK(X1) MARK(plus(X1,X2)) -> MARK(X2) MARK(s(X)) -> ACTIVE(s(mark(X))) MARK(s(X)) -> MARK(X) ->->-> Rules: U11(active(X1),X2) -> U11(X1,X2) U11(mark(X1),X2) -> U11(X1,X2) U11(X1,active(X2)) -> U11(X1,X2) U11(X1,mark(X2)) -> U11(X1,X2) U21(active(X1),X2,X3) -> U21(X1,X2,X3) U21(mark(X1),X2,X3) -> U21(X1,X2,X3) U21(X1,active(X2),X3) -> U21(X1,X2,X3) U21(X1,mark(X2),X3) -> U21(X1,X2,X3) U21(X1,X2,active(X3)) -> U21(X1,X2,X3) U21(X1,X2,mark(X3)) -> U21(X1,X2,X3) active(U11(tt,N)) -> mark(N) active(U21(tt,M,N)) -> mark(s(plus(N,M))) active(and(tt,X)) -> mark(X) active(isNat(plus(V1,V2))) -> mark(and(isNat(V1),isNat(V2))) active(isNat(s(V1))) -> mark(isNat(V1)) active(isNat(0)) -> mark(tt) active(plus(N,s(M))) -> mark(U21(and(isNat(M),isNat(N)),M,N)) active(plus(N,0)) -> mark(U11(isNat(N),N)) and(active(X1),X2) -> and(X1,X2) and(mark(X1),X2) -> and(X1,X2) and(X1,active(X2)) -> and(X1,X2) and(X1,mark(X2)) -> and(X1,X2) isNat(active(X)) -> isNat(X) isNat(mark(X)) -> isNat(X) mark(U11(X1,X2)) -> active(U11(mark(X1),X2)) mark(U21(X1,X2,X3)) -> active(U21(mark(X1),X2,X3)) mark(and(X1,X2)) -> active(and(mark(X1),X2)) mark(isNat(X)) -> active(isNat(X)) mark(plus(X1,X2)) -> active(plus(mark(X1),mark(X2))) mark(s(X)) -> active(s(mark(X))) mark(0) -> active(0) mark(tt) -> active(tt) plus(active(X1),X2) -> plus(X1,X2) plus(mark(X1),X2) -> plus(X1,X2) plus(X1,active(X2)) -> plus(X1,X2) plus(X1,mark(X2)) -> plus(X1,X2) s(active(X)) -> s(X) s(mark(X)) -> s(X) Problem 1.7: Reduction Pair Processor: -> Pairs: ACTIVE(isNat(plus(V1,V2))) -> MARK(and(isNat(V1),isNat(V2))) ACTIVE(isNat(s(V1))) -> MARK(isNat(V1)) MARK(and(X1,X2)) -> ACTIVE(and(mark(X1),X2)) MARK(and(X1,X2)) -> MARK(X1) MARK(isNat(X)) -> ACTIVE(isNat(X)) MARK(plus(X1,X2)) -> ACTIVE(plus(mark(X1),mark(X2))) MARK(plus(X1,X2)) -> MARK(X1) MARK(plus(X1,X2)) -> MARK(X2) MARK(s(X)) -> ACTIVE(s(mark(X))) MARK(s(X)) -> MARK(X) -> Rules: U11(active(X1),X2) -> U11(X1,X2) U11(mark(X1),X2) -> U11(X1,X2) U11(X1,active(X2)) -> U11(X1,X2) U11(X1,mark(X2)) -> U11(X1,X2) U21(active(X1),X2,X3) -> U21(X1,X2,X3) U21(mark(X1),X2,X3) -> U21(X1,X2,X3) U21(X1,active(X2),X3) -> U21(X1,X2,X3) U21(X1,mark(X2),X3) -> U21(X1,X2,X3) U21(X1,X2,active(X3)) -> U21(X1,X2,X3) U21(X1,X2,mark(X3)) -> U21(X1,X2,X3) active(U11(tt,N)) -> mark(N) active(U21(tt,M,N)) -> mark(s(plus(N,M))) active(and(tt,X)) -> mark(X) active(isNat(plus(V1,V2))) -> mark(and(isNat(V1),isNat(V2))) active(isNat(s(V1))) -> mark(isNat(V1)) active(isNat(0)) -> mark(tt) active(plus(N,s(M))) -> mark(U21(and(isNat(M),isNat(N)),M,N)) active(plus(N,0)) -> mark(U11(isNat(N),N)) and(active(X1),X2) -> and(X1,X2) and(mark(X1),X2) -> and(X1,X2) and(X1,active(X2)) -> and(X1,X2) and(X1,mark(X2)) -> and(X1,X2) isNat(active(X)) -> isNat(X) isNat(mark(X)) -> isNat(X) mark(U11(X1,X2)) -> active(U11(mark(X1),X2)) mark(U21(X1,X2,X3)) -> active(U21(mark(X1),X2,X3)) mark(and(X1,X2)) -> active(and(mark(X1),X2)) mark(isNat(X)) -> active(isNat(X)) mark(plus(X1,X2)) -> active(plus(mark(X1),mark(X2))) mark(s(X)) -> active(s(mark(X))) mark(0) -> active(0) mark(tt) -> active(tt) plus(active(X1),X2) -> plus(X1,X2) plus(mark(X1),X2) -> plus(X1,X2) plus(X1,active(X2)) -> plus(X1,X2) plus(X1,mark(X2)) -> plus(X1,X2) s(active(X)) -> s(X) s(mark(X)) -> s(X) -> Usable rules: U11(active(X1),X2) -> U11(X1,X2) U11(mark(X1),X2) -> U11(X1,X2) U11(X1,active(X2)) -> U11(X1,X2) U11(X1,mark(X2)) -> U11(X1,X2) U21(active(X1),X2,X3) -> U21(X1,X2,X3) U21(mark(X1),X2,X3) -> U21(X1,X2,X3) U21(X1,active(X2),X3) -> U21(X1,X2,X3) U21(X1,mark(X2),X3) -> U21(X1,X2,X3) U21(X1,X2,active(X3)) -> U21(X1,X2,X3) U21(X1,X2,mark(X3)) -> U21(X1,X2,X3) active(U11(tt,N)) -> mark(N) active(U21(tt,M,N)) -> mark(s(plus(N,M))) active(and(tt,X)) -> mark(X) active(isNat(plus(V1,V2))) -> mark(and(isNat(V1),isNat(V2))) active(isNat(s(V1))) -> mark(isNat(V1)) active(isNat(0)) -> mark(tt) active(plus(N,s(M))) -> mark(U21(and(isNat(M),isNat(N)),M,N)) active(plus(N,0)) -> mark(U11(isNat(N),N)) and(active(X1),X2) -> and(X1,X2) and(mark(X1),X2) -> and(X1,X2) and(X1,active(X2)) -> and(X1,X2) and(X1,mark(X2)) -> and(X1,X2) isNat(active(X)) -> isNat(X) isNat(mark(X)) -> isNat(X) mark(U11(X1,X2)) -> active(U11(mark(X1),X2)) mark(U21(X1,X2,X3)) -> active(U21(mark(X1),X2,X3)) mark(and(X1,X2)) -> active(and(mark(X1),X2)) mark(isNat(X)) -> active(isNat(X)) mark(plus(X1,X2)) -> active(plus(mark(X1),mark(X2))) mark(s(X)) -> active(s(mark(X))) mark(0) -> active(0) mark(tt) -> active(tt) plus(active(X1),X2) -> plus(X1,X2) plus(mark(X1),X2) -> plus(X1,X2) plus(X1,active(X2)) -> plus(X1,X2) plus(X1,mark(X2)) -> plus(X1,X2) s(active(X)) -> s(X) s(mark(X)) -> s(X) ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [U11](X1,X2) = 2.X2 + 2 [U21](X1,X2,X3) = 2.X2 + 2.X3 + 2 [active](X) = X [and](X1,X2) = X1 + X2 + 1 [isNat](X) = 2.X + 2 [mark](X) = X [plus](X1,X2) = 2.X1 + 2.X2 + 2 [s](X) = X [0] = 1 [tt] = 1 [ACTIVE](X) = 2.X + 2 [MARK](X) = 2.X + 2 Problem 1.7: SCC Processor: -> Pairs: ACTIVE(isNat(s(V1))) -> MARK(isNat(V1)) MARK(and(X1,X2)) -> ACTIVE(and(mark(X1),X2)) MARK(and(X1,X2)) -> MARK(X1) MARK(isNat(X)) -> ACTIVE(isNat(X)) MARK(plus(X1,X2)) -> ACTIVE(plus(mark(X1),mark(X2))) MARK(plus(X1,X2)) -> MARK(X1) MARK(plus(X1,X2)) -> MARK(X2) MARK(s(X)) -> ACTIVE(s(mark(X))) MARK(s(X)) -> MARK(X) -> Rules: U11(active(X1),X2) -> U11(X1,X2) U11(mark(X1),X2) -> U11(X1,X2) U11(X1,active(X2)) -> U11(X1,X2) U11(X1,mark(X2)) -> U11(X1,X2) U21(active(X1),X2,X3) -> U21(X1,X2,X3) U21(mark(X1),X2,X3) -> U21(X1,X2,X3) U21(X1,active(X2),X3) -> U21(X1,X2,X3) U21(X1,mark(X2),X3) -> U21(X1,X2,X3) U21(X1,X2,active(X3)) -> U21(X1,X2,X3) U21(X1,X2,mark(X3)) -> U21(X1,X2,X3) active(U11(tt,N)) -> mark(N) active(U21(tt,M,N)) -> mark(s(plus(N,M))) active(and(tt,X)) -> mark(X) active(isNat(plus(V1,V2))) -> mark(and(isNat(V1),isNat(V2))) active(isNat(s(V1))) -> mark(isNat(V1)) active(isNat(0)) -> mark(tt) active(plus(N,s(M))) -> mark(U21(and(isNat(M),isNat(N)),M,N)) active(plus(N,0)) -> mark(U11(isNat(N),N)) and(active(X1),X2) -> and(X1,X2) and(mark(X1),X2) -> and(X1,X2) and(X1,active(X2)) -> and(X1,X2) and(X1,mark(X2)) -> and(X1,X2) isNat(active(X)) -> isNat(X) isNat(mark(X)) -> isNat(X) mark(U11(X1,X2)) -> active(U11(mark(X1),X2)) mark(U21(X1,X2,X3)) -> active(U21(mark(X1),X2,X3)) mark(and(X1,X2)) -> active(and(mark(X1),X2)) mark(isNat(X)) -> active(isNat(X)) mark(plus(X1,X2)) -> active(plus(mark(X1),mark(X2))) mark(s(X)) -> active(s(mark(X))) mark(0) -> active(0) mark(tt) -> active(tt) plus(active(X1),X2) -> plus(X1,X2) plus(mark(X1),X2) -> plus(X1,X2) plus(X1,active(X2)) -> plus(X1,X2) plus(X1,mark(X2)) -> plus(X1,X2) s(active(X)) -> s(X) s(mark(X)) -> s(X) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: ACTIVE(isNat(s(V1))) -> MARK(isNat(V1)) MARK(and(X1,X2)) -> ACTIVE(and(mark(X1),X2)) MARK(and(X1,X2)) -> MARK(X1) MARK(isNat(X)) -> ACTIVE(isNat(X)) MARK(plus(X1,X2)) -> ACTIVE(plus(mark(X1),mark(X2))) MARK(plus(X1,X2)) -> MARK(X1) MARK(plus(X1,X2)) -> MARK(X2) MARK(s(X)) -> ACTIVE(s(mark(X))) MARK(s(X)) -> MARK(X) ->->-> Rules: U11(active(X1),X2) -> U11(X1,X2) U11(mark(X1),X2) -> U11(X1,X2) U11(X1,active(X2)) -> U11(X1,X2) U11(X1,mark(X2)) -> U11(X1,X2) U21(active(X1),X2,X3) -> U21(X1,X2,X3) U21(mark(X1),X2,X3) -> U21(X1,X2,X3) U21(X1,active(X2),X3) -> U21(X1,X2,X3) U21(X1,mark(X2),X3) -> U21(X1,X2,X3) U21(X1,X2,active(X3)) -> U21(X1,X2,X3) U21(X1,X2,mark(X3)) -> U21(X1,X2,X3) active(U11(tt,N)) -> mark(N) active(U21(tt,M,N)) -> mark(s(plus(N,M))) active(and(tt,X)) -> mark(X) active(isNat(plus(V1,V2))) -> mark(and(isNat(V1),isNat(V2))) active(isNat(s(V1))) -> mark(isNat(V1)) active(isNat(0)) -> mark(tt) active(plus(N,s(M))) -> mark(U21(and(isNat(M),isNat(N)),M,N)) active(plus(N,0)) -> mark(U11(isNat(N),N)) and(active(X1),X2) -> and(X1,X2) and(mark(X1),X2) -> and(X1,X2) and(X1,active(X2)) -> and(X1,X2) and(X1,mark(X2)) -> and(X1,X2) isNat(active(X)) -> isNat(X) isNat(mark(X)) -> isNat(X) mark(U11(X1,X2)) -> active(U11(mark(X1),X2)) mark(U21(X1,X2,X3)) -> active(U21(mark(X1),X2,X3)) mark(and(X1,X2)) -> active(and(mark(X1),X2)) mark(isNat(X)) -> active(isNat(X)) mark(plus(X1,X2)) -> active(plus(mark(X1),mark(X2))) mark(s(X)) -> active(s(mark(X))) mark(0) -> active(0) mark(tt) -> active(tt) plus(active(X1),X2) -> plus(X1,X2) plus(mark(X1),X2) -> plus(X1,X2) plus(X1,active(X2)) -> plus(X1,X2) plus(X1,mark(X2)) -> plus(X1,X2) s(active(X)) -> s(X) s(mark(X)) -> s(X) Problem 1.7: Reduction Pair Processor: -> Pairs: ACTIVE(isNat(s(V1))) -> MARK(isNat(V1)) MARK(and(X1,X2)) -> ACTIVE(and(mark(X1),X2)) MARK(and(X1,X2)) -> MARK(X1) MARK(isNat(X)) -> ACTIVE(isNat(X)) MARK(plus(X1,X2)) -> ACTIVE(plus(mark(X1),mark(X2))) MARK(plus(X1,X2)) -> MARK(X1) MARK(plus(X1,X2)) -> MARK(X2) MARK(s(X)) -> ACTIVE(s(mark(X))) MARK(s(X)) -> MARK(X) -> Rules: U11(active(X1),X2) -> U11(X1,X2) U11(mark(X1),X2) -> U11(X1,X2) U11(X1,active(X2)) -> U11(X1,X2) U11(X1,mark(X2)) -> U11(X1,X2) U21(active(X1),X2,X3) -> U21(X1,X2,X3) U21(mark(X1),X2,X3) -> U21(X1,X2,X3) U21(X1,active(X2),X3) -> U21(X1,X2,X3) U21(X1,mark(X2),X3) -> U21(X1,X2,X3) U21(X1,X2,active(X3)) -> U21(X1,X2,X3) U21(X1,X2,mark(X3)) -> U21(X1,X2,X3) active(U11(tt,N)) -> mark(N) active(U21(tt,M,N)) -> mark(s(plus(N,M))) active(and(tt,X)) -> mark(X) active(isNat(plus(V1,V2))) -> mark(and(isNat(V1),isNat(V2))) active(isNat(s(V1))) -> mark(isNat(V1)) active(isNat(0)) -> mark(tt) active(plus(N,s(M))) -> mark(U21(and(isNat(M),isNat(N)),M,N)) active(plus(N,0)) -> mark(U11(isNat(N),N)) and(active(X1),X2) -> and(X1,X2) and(mark(X1),X2) -> and(X1,X2) and(X1,active(X2)) -> and(X1,X2) and(X1,mark(X2)) -> and(X1,X2) isNat(active(X)) -> isNat(X) isNat(mark(X)) -> isNat(X) mark(U11(X1,X2)) -> active(U11(mark(X1),X2)) mark(U21(X1,X2,X3)) -> active(U21(mark(X1),X2,X3)) mark(and(X1,X2)) -> active(and(mark(X1),X2)) mark(isNat(X)) -> active(isNat(X)) mark(plus(X1,X2)) -> active(plus(mark(X1),mark(X2))) mark(s(X)) -> active(s(mark(X))) mark(0) -> active(0) mark(tt) -> active(tt) plus(active(X1),X2) -> plus(X1,X2) plus(mark(X1),X2) -> plus(X1,X2) plus(X1,active(X2)) -> plus(X1,X2) plus(X1,mark(X2)) -> plus(X1,X2) s(active(X)) -> s(X) s(mark(X)) -> s(X) -> Usable rules: U11(active(X1),X2) -> U11(X1,X2) U11(mark(X1),X2) -> U11(X1,X2) U11(X1,active(X2)) -> U11(X1,X2) U11(X1,mark(X2)) -> U11(X1,X2) U21(active(X1),X2,X3) -> U21(X1,X2,X3) U21(mark(X1),X2,X3) -> U21(X1,X2,X3) U21(X1,active(X2),X3) -> U21(X1,X2,X3) U21(X1,mark(X2),X3) -> U21(X1,X2,X3) U21(X1,X2,active(X3)) -> U21(X1,X2,X3) U21(X1,X2,mark(X3)) -> U21(X1,X2,X3) active(U11(tt,N)) -> mark(N) active(U21(tt,M,N)) -> mark(s(plus(N,M))) active(and(tt,X)) -> mark(X) active(isNat(plus(V1,V2))) -> mark(and(isNat(V1),isNat(V2))) active(isNat(s(V1))) -> mark(isNat(V1)) active(isNat(0)) -> mark(tt) active(plus(N,s(M))) -> mark(U21(and(isNat(M),isNat(N)),M,N)) active(plus(N,0)) -> mark(U11(isNat(N),N)) and(active(X1),X2) -> and(X1,X2) and(mark(X1),X2) -> and(X1,X2) and(X1,active(X2)) -> and(X1,X2) and(X1,mark(X2)) -> and(X1,X2) isNat(active(X)) -> isNat(X) isNat(mark(X)) -> isNat(X) mark(U11(X1,X2)) -> active(U11(mark(X1),X2)) mark(U21(X1,X2,X3)) -> active(U21(mark(X1),X2,X3)) mark(and(X1,X2)) -> active(and(mark(X1),X2)) mark(isNat(X)) -> active(isNat(X)) mark(plus(X1,X2)) -> active(plus(mark(X1),mark(X2))) mark(s(X)) -> active(s(mark(X))) mark(0) -> active(0) mark(tt) -> active(tt) plus(active(X1),X2) -> plus(X1,X2) plus(mark(X1),X2) -> plus(X1,X2) plus(X1,active(X2)) -> plus(X1,X2) plus(X1,mark(X2)) -> plus(X1,X2) s(active(X)) -> s(X) s(mark(X)) -> s(X) ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [U11](X1,X2) = 2.X2 + 2 [U21](X1,X2,X3) = 2.X2 + 2.X3 + 2 [active](X) = X [and](X1,X2) = 2.X1 + X2 [isNat](X) = 2.X + 1 [mark](X) = X [plus](X1,X2) = 2.X1 + 2.X2 + 1 [s](X) = X + 1 [0] = 2 [tt] = 2 [ACTIVE](X) = 2.X + 2 [MARK](X) = 2.X + 2 Problem 1.7: SCC Processor: -> Pairs: MARK(and(X1,X2)) -> ACTIVE(and(mark(X1),X2)) MARK(and(X1,X2)) -> MARK(X1) MARK(isNat(X)) -> ACTIVE(isNat(X)) MARK(plus(X1,X2)) -> ACTIVE(plus(mark(X1),mark(X2))) MARK(plus(X1,X2)) -> MARK(X1) MARK(plus(X1,X2)) -> MARK(X2) MARK(s(X)) -> ACTIVE(s(mark(X))) MARK(s(X)) -> MARK(X) -> Rules: U11(active(X1),X2) -> U11(X1,X2) U11(mark(X1),X2) -> U11(X1,X2) U11(X1,active(X2)) -> U11(X1,X2) U11(X1,mark(X2)) -> U11(X1,X2) U21(active(X1),X2,X3) -> U21(X1,X2,X3) U21(mark(X1),X2,X3) -> U21(X1,X2,X3) U21(X1,active(X2),X3) -> U21(X1,X2,X3) U21(X1,mark(X2),X3) -> U21(X1,X2,X3) U21(X1,X2,active(X3)) -> U21(X1,X2,X3) U21(X1,X2,mark(X3)) -> U21(X1,X2,X3) active(U11(tt,N)) -> mark(N) active(U21(tt,M,N)) -> mark(s(plus(N,M))) active(and(tt,X)) -> mark(X) active(isNat(plus(V1,V2))) -> mark(and(isNat(V1),isNat(V2))) active(isNat(s(V1))) -> mark(isNat(V1)) active(isNat(0)) -> mark(tt) active(plus(N,s(M))) -> mark(U21(and(isNat(M),isNat(N)),M,N)) active(plus(N,0)) -> mark(U11(isNat(N),N)) and(active(X1),X2) -> and(X1,X2) and(mark(X1),X2) -> and(X1,X2) and(X1,active(X2)) -> and(X1,X2) and(X1,mark(X2)) -> and(X1,X2) isNat(active(X)) -> isNat(X) isNat(mark(X)) -> isNat(X) mark(U11(X1,X2)) -> active(U11(mark(X1),X2)) mark(U21(X1,X2,X3)) -> active(U21(mark(X1),X2,X3)) mark(and(X1,X2)) -> active(and(mark(X1),X2)) mark(isNat(X)) -> active(isNat(X)) mark(plus(X1,X2)) -> active(plus(mark(X1),mark(X2))) mark(s(X)) -> active(s(mark(X))) mark(0) -> active(0) mark(tt) -> active(tt) plus(active(X1),X2) -> plus(X1,X2) plus(mark(X1),X2) -> plus(X1,X2) plus(X1,active(X2)) -> plus(X1,X2) plus(X1,mark(X2)) -> plus(X1,X2) s(active(X)) -> s(X) s(mark(X)) -> s(X) ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: MARK(and(X1,X2)) -> MARK(X1) MARK(plus(X1,X2)) -> MARK(X1) MARK(plus(X1,X2)) -> MARK(X2) MARK(s(X)) -> MARK(X) ->->-> Rules: U11(active(X1),X2) -> U11(X1,X2) U11(mark(X1),X2) -> U11(X1,X2) U11(X1,active(X2)) -> U11(X1,X2) U11(X1,mark(X2)) -> U11(X1,X2) U21(active(X1),X2,X3) -> U21(X1,X2,X3) U21(mark(X1),X2,X3) -> U21(X1,X2,X3) U21(X1,active(X2),X3) -> U21(X1,X2,X3) U21(X1,mark(X2),X3) -> U21(X1,X2,X3) U21(X1,X2,active(X3)) -> U21(X1,X2,X3) U21(X1,X2,mark(X3)) -> U21(X1,X2,X3) active(U11(tt,N)) -> mark(N) active(U21(tt,M,N)) -> mark(s(plus(N,M))) active(and(tt,X)) -> mark(X) active(isNat(plus(V1,V2))) -> mark(and(isNat(V1),isNat(V2))) active(isNat(s(V1))) -> mark(isNat(V1)) active(isNat(0)) -> mark(tt) active(plus(N,s(M))) -> mark(U21(and(isNat(M),isNat(N)),M,N)) active(plus(N,0)) -> mark(U11(isNat(N),N)) and(active(X1),X2) -> and(X1,X2) and(mark(X1),X2) -> and(X1,X2) and(X1,active(X2)) -> and(X1,X2) and(X1,mark(X2)) -> and(X1,X2) isNat(active(X)) -> isNat(X) isNat(mark(X)) -> isNat(X) mark(U11(X1,X2)) -> active(U11(mark(X1),X2)) mark(U21(X1,X2,X3)) -> active(U21(mark(X1),X2,X3)) mark(and(X1,X2)) -> active(and(mark(X1),X2)) mark(isNat(X)) -> active(isNat(X)) mark(plus(X1,X2)) -> active(plus(mark(X1),mark(X2))) mark(s(X)) -> active(s(mark(X))) mark(0) -> active(0) mark(tt) -> active(tt) plus(active(X1),X2) -> plus(X1,X2) plus(mark(X1),X2) -> plus(X1,X2) plus(X1,active(X2)) -> plus(X1,X2) plus(X1,mark(X2)) -> plus(X1,X2) s(active(X)) -> s(X) s(mark(X)) -> s(X) Problem 1.7: Subterm Processor: -> Pairs: MARK(and(X1,X2)) -> MARK(X1) MARK(plus(X1,X2)) -> MARK(X1) MARK(plus(X1,X2)) -> MARK(X2) MARK(s(X)) -> MARK(X) -> Rules: U11(active(X1),X2) -> U11(X1,X2) U11(mark(X1),X2) -> U11(X1,X2) U11(X1,active(X2)) -> U11(X1,X2) U11(X1,mark(X2)) -> U11(X1,X2) U21(active(X1),X2,X3) -> U21(X1,X2,X3) U21(mark(X1),X2,X3) -> U21(X1,X2,X3) U21(X1,active(X2),X3) -> U21(X1,X2,X3) U21(X1,mark(X2),X3) -> U21(X1,X2,X3) U21(X1,X2,active(X3)) -> U21(X1,X2,X3) U21(X1,X2,mark(X3)) -> U21(X1,X2,X3) active(U11(tt,N)) -> mark(N) active(U21(tt,M,N)) -> mark(s(plus(N,M))) active(and(tt,X)) -> mark(X) active(isNat(plus(V1,V2))) -> mark(and(isNat(V1),isNat(V2))) active(isNat(s(V1))) -> mark(isNat(V1)) active(isNat(0)) -> mark(tt) active(plus(N,s(M))) -> mark(U21(and(isNat(M),isNat(N)),M,N)) active(plus(N,0)) -> mark(U11(isNat(N),N)) and(active(X1),X2) -> and(X1,X2) and(mark(X1),X2) -> and(X1,X2) and(X1,active(X2)) -> and(X1,X2) and(X1,mark(X2)) -> and(X1,X2) isNat(active(X)) -> isNat(X) isNat(mark(X)) -> isNat(X) mark(U11(X1,X2)) -> active(U11(mark(X1),X2)) mark(U21(X1,X2,X3)) -> active(U21(mark(X1),X2,X3)) mark(and(X1,X2)) -> active(and(mark(X1),X2)) mark(isNat(X)) -> active(isNat(X)) mark(plus(X1,X2)) -> active(plus(mark(X1),mark(X2))) mark(s(X)) -> active(s(mark(X))) mark(0) -> active(0) mark(tt) -> active(tt) plus(active(X1),X2) -> plus(X1,X2) plus(mark(X1),X2) -> plus(X1,X2) plus(X1,active(X2)) -> plus(X1,X2) plus(X1,mark(X2)) -> plus(X1,X2) s(active(X)) -> s(X) s(mark(X)) -> s(X) ->Projection: pi(MARK) = 1 Problem 1.7: SCC Processor: -> Pairs: Empty -> Rules: U11(active(X1),X2) -> U11(X1,X2) U11(mark(X1),X2) -> U11(X1,X2) U11(X1,active(X2)) -> U11(X1,X2) U11(X1,mark(X2)) -> U11(X1,X2) U21(active(X1),X2,X3) -> U21(X1,X2,X3) U21(mark(X1),X2,X3) -> U21(X1,X2,X3) U21(X1,active(X2),X3) -> U21(X1,X2,X3) U21(X1,mark(X2),X3) -> U21(X1,X2,X3) U21(X1,X2,active(X3)) -> U21(X1,X2,X3) U21(X1,X2,mark(X3)) -> U21(X1,X2,X3) active(U11(tt,N)) -> mark(N) active(U21(tt,M,N)) -> mark(s(plus(N,M))) active(and(tt,X)) -> mark(X) active(isNat(plus(V1,V2))) -> mark(and(isNat(V1),isNat(V2))) active(isNat(s(V1))) -> mark(isNat(V1)) active(isNat(0)) -> mark(tt) active(plus(N,s(M))) -> mark(U21(and(isNat(M),isNat(N)),M,N)) active(plus(N,0)) -> mark(U11(isNat(N),N)) and(active(X1),X2) -> and(X1,X2) and(mark(X1),X2) -> and(X1,X2) and(X1,active(X2)) -> and(X1,X2) and(X1,mark(X2)) -> and(X1,X2) isNat(active(X)) -> isNat(X) isNat(mark(X)) -> isNat(X) mark(U11(X1,X2)) -> active(U11(mark(X1),X2)) mark(U21(X1,X2,X3)) -> active(U21(mark(X1),X2,X3)) mark(and(X1,X2)) -> active(and(mark(X1),X2)) mark(isNat(X)) -> active(isNat(X)) mark(plus(X1,X2)) -> active(plus(mark(X1),mark(X2))) mark(s(X)) -> active(s(mark(X))) mark(0) -> active(0) mark(tt) -> active(tt) plus(active(X1),X2) -> plus(X1,X2) plus(mark(X1),X2) -> plus(X1,X2) plus(X1,active(X2)) -> plus(X1,X2) plus(X1,mark(X2)) -> plus(X1,X2) s(active(X)) -> s(X) s(mark(X)) -> s(X) ->Strongly Connected Components: There is no strongly connected component The problem is finite.