/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES Problem 1: (VAR M N X X1 X2) (RULES a__and(tt,X) -> mark(X) a__and(X1,X2) -> and(X1,X2) a__plus(N,0) -> mark(N) a__plus(N,s(M)) -> s(a__plus(mark(N),mark(M))) a__plus(X1,X2) -> plus(X1,X2) mark(0) -> 0 mark(and(X1,X2)) -> a__and(mark(X1),X2) mark(plus(X1,X2)) -> a__plus(mark(X1),mark(X2)) mark(s(X)) -> s(mark(X)) mark(tt) -> tt ) Problem 1: Dependency Pairs Processor: -> Pairs: A__AND(tt,X) -> MARK(X) A__PLUS(N,0) -> MARK(N) A__PLUS(N,s(M)) -> A__PLUS(mark(N),mark(M)) A__PLUS(N,s(M)) -> MARK(M) A__PLUS(N,s(M)) -> MARK(N) MARK(and(X1,X2)) -> A__AND(mark(X1),X2) MARK(and(X1,X2)) -> MARK(X1) MARK(plus(X1,X2)) -> A__PLUS(mark(X1),mark(X2)) MARK(plus(X1,X2)) -> MARK(X1) MARK(plus(X1,X2)) -> MARK(X2) MARK(s(X)) -> MARK(X) -> Rules: a__and(tt,X) -> mark(X) a__and(X1,X2) -> and(X1,X2) a__plus(N,0) -> mark(N) a__plus(N,s(M)) -> s(a__plus(mark(N),mark(M))) a__plus(X1,X2) -> plus(X1,X2) mark(0) -> 0 mark(and(X1,X2)) -> a__and(mark(X1),X2) mark(plus(X1,X2)) -> a__plus(mark(X1),mark(X2)) mark(s(X)) -> s(mark(X)) mark(tt) -> tt Problem 1: SCC Processor: -> Pairs: A__AND(tt,X) -> MARK(X) A__PLUS(N,0) -> MARK(N) A__PLUS(N,s(M)) -> A__PLUS(mark(N),mark(M)) A__PLUS(N,s(M)) -> MARK(M) A__PLUS(N,s(M)) -> MARK(N) MARK(and(X1,X2)) -> A__AND(mark(X1),X2) MARK(and(X1,X2)) -> MARK(X1) MARK(plus(X1,X2)) -> A__PLUS(mark(X1),mark(X2)) MARK(plus(X1,X2)) -> MARK(X1) MARK(plus(X1,X2)) -> MARK(X2) MARK(s(X)) -> MARK(X) -> Rules: a__and(tt,X) -> mark(X) a__and(X1,X2) -> and(X1,X2) a__plus(N,0) -> mark(N) a__plus(N,s(M)) -> s(a__plus(mark(N),mark(M))) a__plus(X1,X2) -> plus(X1,X2) mark(0) -> 0 mark(and(X1,X2)) -> a__and(mark(X1),X2) mark(plus(X1,X2)) -> a__plus(mark(X1),mark(X2)) mark(s(X)) -> s(mark(X)) mark(tt) -> tt ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: A__AND(tt,X) -> MARK(X) A__PLUS(N,0) -> MARK(N) A__PLUS(N,s(M)) -> A__PLUS(mark(N),mark(M)) A__PLUS(N,s(M)) -> MARK(M) A__PLUS(N,s(M)) -> MARK(N) MARK(and(X1,X2)) -> A__AND(mark(X1),X2) MARK(and(X1,X2)) -> MARK(X1) MARK(plus(X1,X2)) -> A__PLUS(mark(X1),mark(X2)) MARK(plus(X1,X2)) -> MARK(X1) MARK(plus(X1,X2)) -> MARK(X2) MARK(s(X)) -> MARK(X) ->->-> Rules: a__and(tt,X) -> mark(X) a__and(X1,X2) -> and(X1,X2) a__plus(N,0) -> mark(N) a__plus(N,s(M)) -> s(a__plus(mark(N),mark(M))) a__plus(X1,X2) -> plus(X1,X2) mark(0) -> 0 mark(and(X1,X2)) -> a__and(mark(X1),X2) mark(plus(X1,X2)) -> a__plus(mark(X1),mark(X2)) mark(s(X)) -> s(mark(X)) mark(tt) -> tt Problem 1: Reduction Pair Processor: -> Pairs: A__AND(tt,X) -> MARK(X) A__PLUS(N,0) -> MARK(N) A__PLUS(N,s(M)) -> A__PLUS(mark(N),mark(M)) A__PLUS(N,s(M)) -> MARK(M) A__PLUS(N,s(M)) -> MARK(N) MARK(and(X1,X2)) -> A__AND(mark(X1),X2) MARK(and(X1,X2)) -> MARK(X1) MARK(plus(X1,X2)) -> A__PLUS(mark(X1),mark(X2)) MARK(plus(X1,X2)) -> MARK(X1) MARK(plus(X1,X2)) -> MARK(X2) MARK(s(X)) -> MARK(X) -> Rules: a__and(tt,X) -> mark(X) a__and(X1,X2) -> and(X1,X2) a__plus(N,0) -> mark(N) a__plus(N,s(M)) -> s(a__plus(mark(N),mark(M))) a__plus(X1,X2) -> plus(X1,X2) mark(0) -> 0 mark(and(X1,X2)) -> a__and(mark(X1),X2) mark(plus(X1,X2)) -> a__plus(mark(X1),mark(X2)) mark(s(X)) -> s(mark(X)) mark(tt) -> tt -> Usable rules: a__and(tt,X) -> mark(X) a__and(X1,X2) -> and(X1,X2) a__plus(N,0) -> mark(N) a__plus(N,s(M)) -> s(a__plus(mark(N),mark(M))) a__plus(X1,X2) -> plus(X1,X2) mark(0) -> 0 mark(and(X1,X2)) -> a__and(mark(X1),X2) mark(plus(X1,X2)) -> a__plus(mark(X1),mark(X2)) mark(s(X)) -> s(mark(X)) mark(tt) -> tt ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [a__and](X1,X2) = 2.X1 + X2 + 1 [a__plus](X1,X2) = 2.X1 + 2.X2 + 2 [mark](X) = X [0] = 1 [and](X1,X2) = 2.X1 + X2 + 1 [plus](X1,X2) = 2.X1 + 2.X2 + 2 [s](X) = X + 2 [tt] = 2 [A__AND](X1,X2) = 2.X1 + 2.X2 + 2 [A__PLUS](X1,X2) = 2.X1 + 2.X2 + 2 [MARK](X) = 2.X + 1 Problem 1: SCC Processor: -> Pairs: A__PLUS(N,0) -> MARK(N) A__PLUS(N,s(M)) -> A__PLUS(mark(N),mark(M)) A__PLUS(N,s(M)) -> MARK(M) A__PLUS(N,s(M)) -> MARK(N) MARK(and(X1,X2)) -> A__AND(mark(X1),X2) MARK(and(X1,X2)) -> MARK(X1) MARK(plus(X1,X2)) -> A__PLUS(mark(X1),mark(X2)) MARK(plus(X1,X2)) -> MARK(X1) MARK(plus(X1,X2)) -> MARK(X2) MARK(s(X)) -> MARK(X) -> Rules: a__and(tt,X) -> mark(X) a__and(X1,X2) -> and(X1,X2) a__plus(N,0) -> mark(N) a__plus(N,s(M)) -> s(a__plus(mark(N),mark(M))) a__plus(X1,X2) -> plus(X1,X2) mark(0) -> 0 mark(and(X1,X2)) -> a__and(mark(X1),X2) mark(plus(X1,X2)) -> a__plus(mark(X1),mark(X2)) mark(s(X)) -> s(mark(X)) mark(tt) -> tt ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: A__PLUS(N,0) -> MARK(N) A__PLUS(N,s(M)) -> A__PLUS(mark(N),mark(M)) A__PLUS(N,s(M)) -> MARK(M) A__PLUS(N,s(M)) -> MARK(N) MARK(and(X1,X2)) -> MARK(X1) MARK(plus(X1,X2)) -> A__PLUS(mark(X1),mark(X2)) MARK(plus(X1,X2)) -> MARK(X1) MARK(plus(X1,X2)) -> MARK(X2) MARK(s(X)) -> MARK(X) ->->-> Rules: a__and(tt,X) -> mark(X) a__and(X1,X2) -> and(X1,X2) a__plus(N,0) -> mark(N) a__plus(N,s(M)) -> s(a__plus(mark(N),mark(M))) a__plus(X1,X2) -> plus(X1,X2) mark(0) -> 0 mark(and(X1,X2)) -> a__and(mark(X1),X2) mark(plus(X1,X2)) -> a__plus(mark(X1),mark(X2)) mark(s(X)) -> s(mark(X)) mark(tt) -> tt Problem 1: Reduction Pair Processor: -> Pairs: A__PLUS(N,0) -> MARK(N) A__PLUS(N,s(M)) -> A__PLUS(mark(N),mark(M)) A__PLUS(N,s(M)) -> MARK(M) A__PLUS(N,s(M)) -> MARK(N) MARK(and(X1,X2)) -> MARK(X1) MARK(plus(X1,X2)) -> A__PLUS(mark(X1),mark(X2)) MARK(plus(X1,X2)) -> MARK(X1) MARK(plus(X1,X2)) -> MARK(X2) MARK(s(X)) -> MARK(X) -> Rules: a__and(tt,X) -> mark(X) a__and(X1,X2) -> and(X1,X2) a__plus(N,0) -> mark(N) a__plus(N,s(M)) -> s(a__plus(mark(N),mark(M))) a__plus(X1,X2) -> plus(X1,X2) mark(0) -> 0 mark(and(X1,X2)) -> a__and(mark(X1),X2) mark(plus(X1,X2)) -> a__plus(mark(X1),mark(X2)) mark(s(X)) -> s(mark(X)) mark(tt) -> tt -> Usable rules: a__and(tt,X) -> mark(X) a__and(X1,X2) -> and(X1,X2) a__plus(N,0) -> mark(N) a__plus(N,s(M)) -> s(a__plus(mark(N),mark(M))) a__plus(X1,X2) -> plus(X1,X2) mark(0) -> 0 mark(and(X1,X2)) -> a__and(mark(X1),X2) mark(plus(X1,X2)) -> a__plus(mark(X1),mark(X2)) mark(s(X)) -> s(mark(X)) mark(tt) -> tt ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [a__and](X1,X2) = 2.X1 + 2.X2 [a__plus](X1,X2) = 2.X1 + X2 + 2 [mark](X) = X [0] = 2 [and](X1,X2) = 2.X1 + 2.X2 [plus](X1,X2) = 2.X1 + X2 + 2 [s](X) = X + 2 [tt] = 1 [A__PLUS](X1,X2) = 2.X1 + 2.X2 + 2 [MARK](X) = 2.X + 2 Problem 1: SCC Processor: -> Pairs: A__PLUS(N,s(M)) -> A__PLUS(mark(N),mark(M)) A__PLUS(N,s(M)) -> MARK(M) A__PLUS(N,s(M)) -> MARK(N) MARK(and(X1,X2)) -> MARK(X1) MARK(plus(X1,X2)) -> A__PLUS(mark(X1),mark(X2)) MARK(plus(X1,X2)) -> MARK(X1) MARK(plus(X1,X2)) -> MARK(X2) MARK(s(X)) -> MARK(X) -> Rules: a__and(tt,X) -> mark(X) a__and(X1,X2) -> and(X1,X2) a__plus(N,0) -> mark(N) a__plus(N,s(M)) -> s(a__plus(mark(N),mark(M))) a__plus(X1,X2) -> plus(X1,X2) mark(0) -> 0 mark(and(X1,X2)) -> a__and(mark(X1),X2) mark(plus(X1,X2)) -> a__plus(mark(X1),mark(X2)) mark(s(X)) -> s(mark(X)) mark(tt) -> tt ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: A__PLUS(N,s(M)) -> A__PLUS(mark(N),mark(M)) A__PLUS(N,s(M)) -> MARK(M) A__PLUS(N,s(M)) -> MARK(N) MARK(and(X1,X2)) -> MARK(X1) MARK(plus(X1,X2)) -> A__PLUS(mark(X1),mark(X2)) MARK(plus(X1,X2)) -> MARK(X1) MARK(plus(X1,X2)) -> MARK(X2) MARK(s(X)) -> MARK(X) ->->-> Rules: a__and(tt,X) -> mark(X) a__and(X1,X2) -> and(X1,X2) a__plus(N,0) -> mark(N) a__plus(N,s(M)) -> s(a__plus(mark(N),mark(M))) a__plus(X1,X2) -> plus(X1,X2) mark(0) -> 0 mark(and(X1,X2)) -> a__and(mark(X1),X2) mark(plus(X1,X2)) -> a__plus(mark(X1),mark(X2)) mark(s(X)) -> s(mark(X)) mark(tt) -> tt Problem 1: Reduction Pair Processor: -> Pairs: A__PLUS(N,s(M)) -> A__PLUS(mark(N),mark(M)) A__PLUS(N,s(M)) -> MARK(M) A__PLUS(N,s(M)) -> MARK(N) MARK(and(X1,X2)) -> MARK(X1) MARK(plus(X1,X2)) -> A__PLUS(mark(X1),mark(X2)) MARK(plus(X1,X2)) -> MARK(X1) MARK(plus(X1,X2)) -> MARK(X2) MARK(s(X)) -> MARK(X) -> Rules: a__and(tt,X) -> mark(X) a__and(X1,X2) -> and(X1,X2) a__plus(N,0) -> mark(N) a__plus(N,s(M)) -> s(a__plus(mark(N),mark(M))) a__plus(X1,X2) -> plus(X1,X2) mark(0) -> 0 mark(and(X1,X2)) -> a__and(mark(X1),X2) mark(plus(X1,X2)) -> a__plus(mark(X1),mark(X2)) mark(s(X)) -> s(mark(X)) mark(tt) -> tt -> Usable rules: a__and(tt,X) -> mark(X) a__and(X1,X2) -> and(X1,X2) a__plus(N,0) -> mark(N) a__plus(N,s(M)) -> s(a__plus(mark(N),mark(M))) a__plus(X1,X2) -> plus(X1,X2) mark(0) -> 0 mark(and(X1,X2)) -> a__and(mark(X1),X2) mark(plus(X1,X2)) -> a__plus(mark(X1),mark(X2)) mark(s(X)) -> s(mark(X)) mark(tt) -> tt ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [a__and](X1,X2) = 2.X1 + 2.X2 + 2 [a__plus](X1,X2) = 2.X1 + 2.X2 [mark](X) = X [0] = 2 [and](X1,X2) = 2.X1 + 2.X2 + 2 [plus](X1,X2) = 2.X1 + 2.X2 [s](X) = X + 2 [tt] = 2 [A__PLUS](X1,X2) = 2.X1 + 2.X2 + 2 [MARK](X) = X + 2 Problem 1: SCC Processor: -> Pairs: A__PLUS(N,s(M)) -> MARK(M) A__PLUS(N,s(M)) -> MARK(N) MARK(and(X1,X2)) -> MARK(X1) MARK(plus(X1,X2)) -> A__PLUS(mark(X1),mark(X2)) MARK(plus(X1,X2)) -> MARK(X1) MARK(plus(X1,X2)) -> MARK(X2) MARK(s(X)) -> MARK(X) -> Rules: a__and(tt,X) -> mark(X) a__and(X1,X2) -> and(X1,X2) a__plus(N,0) -> mark(N) a__plus(N,s(M)) -> s(a__plus(mark(N),mark(M))) a__plus(X1,X2) -> plus(X1,X2) mark(0) -> 0 mark(and(X1,X2)) -> a__and(mark(X1),X2) mark(plus(X1,X2)) -> a__plus(mark(X1),mark(X2)) mark(s(X)) -> s(mark(X)) mark(tt) -> tt ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: A__PLUS(N,s(M)) -> MARK(M) A__PLUS(N,s(M)) -> MARK(N) MARK(and(X1,X2)) -> MARK(X1) MARK(plus(X1,X2)) -> A__PLUS(mark(X1),mark(X2)) MARK(plus(X1,X2)) -> MARK(X1) MARK(plus(X1,X2)) -> MARK(X2) MARK(s(X)) -> MARK(X) ->->-> Rules: a__and(tt,X) -> mark(X) a__and(X1,X2) -> and(X1,X2) a__plus(N,0) -> mark(N) a__plus(N,s(M)) -> s(a__plus(mark(N),mark(M))) a__plus(X1,X2) -> plus(X1,X2) mark(0) -> 0 mark(and(X1,X2)) -> a__and(mark(X1),X2) mark(plus(X1,X2)) -> a__plus(mark(X1),mark(X2)) mark(s(X)) -> s(mark(X)) mark(tt) -> tt Problem 1: Reduction Pair Processor: -> Pairs: A__PLUS(N,s(M)) -> MARK(M) A__PLUS(N,s(M)) -> MARK(N) MARK(and(X1,X2)) -> MARK(X1) MARK(plus(X1,X2)) -> A__PLUS(mark(X1),mark(X2)) MARK(plus(X1,X2)) -> MARK(X1) MARK(plus(X1,X2)) -> MARK(X2) MARK(s(X)) -> MARK(X) -> Rules: a__and(tt,X) -> mark(X) a__and(X1,X2) -> and(X1,X2) a__plus(N,0) -> mark(N) a__plus(N,s(M)) -> s(a__plus(mark(N),mark(M))) a__plus(X1,X2) -> plus(X1,X2) mark(0) -> 0 mark(and(X1,X2)) -> a__and(mark(X1),X2) mark(plus(X1,X2)) -> a__plus(mark(X1),mark(X2)) mark(s(X)) -> s(mark(X)) mark(tt) -> tt -> Usable rules: a__and(tt,X) -> mark(X) a__and(X1,X2) -> and(X1,X2) a__plus(N,0) -> mark(N) a__plus(N,s(M)) -> s(a__plus(mark(N),mark(M))) a__plus(X1,X2) -> plus(X1,X2) mark(0) -> 0 mark(and(X1,X2)) -> a__and(mark(X1),X2) mark(plus(X1,X2)) -> a__plus(mark(X1),mark(X2)) mark(s(X)) -> s(mark(X)) mark(tt) -> tt ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [a__and](X1,X2) = 2.X1 + 2.X2 [a__plus](X1,X2) = 2.X1 + 2.X2 + 2 [mark](X) = X [0] = 0 [and](X1,X2) = 2.X1 + 2.X2 [plus](X1,X2) = 2.X1 + 2.X2 + 2 [s](X) = X [tt] = 1 [A__PLUS](X1,X2) = 2.X1 + 2.X2 + 2 [MARK](X) = 2.X + 1 Problem 1: SCC Processor: -> Pairs: A__PLUS(N,s(M)) -> MARK(N) MARK(and(X1,X2)) -> MARK(X1) MARK(plus(X1,X2)) -> A__PLUS(mark(X1),mark(X2)) MARK(plus(X1,X2)) -> MARK(X1) MARK(plus(X1,X2)) -> MARK(X2) MARK(s(X)) -> MARK(X) -> Rules: a__and(tt,X) -> mark(X) a__and(X1,X2) -> and(X1,X2) a__plus(N,0) -> mark(N) a__plus(N,s(M)) -> s(a__plus(mark(N),mark(M))) a__plus(X1,X2) -> plus(X1,X2) mark(0) -> 0 mark(and(X1,X2)) -> a__and(mark(X1),X2) mark(plus(X1,X2)) -> a__plus(mark(X1),mark(X2)) mark(s(X)) -> s(mark(X)) mark(tt) -> tt ->Strongly Connected Components: ->->Cycle: ->->-> Pairs: A__PLUS(N,s(M)) -> MARK(N) MARK(and(X1,X2)) -> MARK(X1) MARK(plus(X1,X2)) -> A__PLUS(mark(X1),mark(X2)) MARK(plus(X1,X2)) -> MARK(X1) MARK(plus(X1,X2)) -> MARK(X2) MARK(s(X)) -> MARK(X) ->->-> Rules: a__and(tt,X) -> mark(X) a__and(X1,X2) -> and(X1,X2) a__plus(N,0) -> mark(N) a__plus(N,s(M)) -> s(a__plus(mark(N),mark(M))) a__plus(X1,X2) -> plus(X1,X2) mark(0) -> 0 mark(and(X1,X2)) -> a__and(mark(X1),X2) mark(plus(X1,X2)) -> a__plus(mark(X1),mark(X2)) mark(s(X)) -> s(mark(X)) mark(tt) -> tt Problem 1: Reduction Pair Processor: -> Pairs: A__PLUS(N,s(M)) -> MARK(N) MARK(and(X1,X2)) -> MARK(X1) MARK(plus(X1,X2)) -> A__PLUS(mark(X1),mark(X2)) MARK(plus(X1,X2)) -> MARK(X1) MARK(plus(X1,X2)) -> MARK(X2) MARK(s(X)) -> MARK(X) -> Rules: a__and(tt,X) -> mark(X) a__and(X1,X2) -> and(X1,X2) a__plus(N,0) -> mark(N) a__plus(N,s(M)) -> s(a__plus(mark(N),mark(M))) a__plus(X1,X2) -> plus(X1,X2) mark(0) -> 0 mark(and(X1,X2)) -> a__and(mark(X1),X2) mark(plus(X1,X2)) -> a__plus(mark(X1),mark(X2)) mark(s(X)) -> s(mark(X)) mark(tt) -> tt -> Usable rules: a__and(tt,X) -> mark(X) a__and(X1,X2) -> and(X1,X2) a__plus(N,0) -> mark(N) a__plus(N,s(M)) -> s(a__plus(mark(N),mark(M))) a__plus(X1,X2) -> plus(X1,X2) mark(0) -> 0 mark(and(X1,X2)) -> a__and(mark(X1),X2) mark(plus(X1,X2)) -> a__plus(mark(X1),mark(X2)) mark(s(X)) -> s(mark(X)) mark(tt) -> tt ->Interpretation type: Linear ->Coefficients: Natural Numbers ->Dimension: 1 ->Bound: 2 ->Interpretation: [a__and](X1,X2) = 2.X1 + 2.X2 + 2 [a__plus](X1,X2) = 2.X1 + 2.X2 + 2 [mark](X) = X [0] = 2 [and](X1,X2) = 2.X1 + 2.X2 + 2 [plus](X1,X2) = 2.X1 + 2.X2 + 2 [s](X) = X + 2 [tt] = 2 [A__PLUS](X1,X2) = 2.X1 + X2 + 2 [MARK](X) = 2.X + 2 Problem 1: SCC Processor: -> Pairs: MARK(and(X1,X2)) -> MARK(X1) MARK(plus(X1,X2)) -> A__PLUS(mark(X1),mark(X2)) MARK(plus(X1,X2)) -> MARK(X1) MARK(plus(X1,X2)) -> MARK(X2) MARK(s(X)) -> MARK(X) -> Rules: a__and(tt,X) -> mark(X) a__and(X1,X2) -> and(X1,X2) a__plus(N,0) -> mark(N) a__plus(N,s(M)) -> s(a__plus(mark(N),mark(M))) a__plus(X1,X2) -> plus(X1,X2) mark(0) -> 0 mark(and(X1,X2)) -> a__and(mark(X1),X2) mark(plus(X1,X2)) -> a__plus(mark(X1),mark(X2)) mark(s(X)) -> s(mark(X)) mark(tt) -> tt ->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: a__and(tt,X) -> mark(X) a__and(X1,X2) -> and(X1,X2) a__plus(N,0) -> mark(N) a__plus(N,s(M)) -> s(a__plus(mark(N),mark(M))) a__plus(X1,X2) -> plus(X1,X2) mark(0) -> 0 mark(and(X1,X2)) -> a__and(mark(X1),X2) mark(plus(X1,X2)) -> a__plus(mark(X1),mark(X2)) mark(s(X)) -> s(mark(X)) mark(tt) -> tt Problem 1: 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: a__and(tt,X) -> mark(X) a__and(X1,X2) -> and(X1,X2) a__plus(N,0) -> mark(N) a__plus(N,s(M)) -> s(a__plus(mark(N),mark(M))) a__plus(X1,X2) -> plus(X1,X2) mark(0) -> 0 mark(and(X1,X2)) -> a__and(mark(X1),X2) mark(plus(X1,X2)) -> a__plus(mark(X1),mark(X2)) mark(s(X)) -> s(mark(X)) mark(tt) -> tt ->Projection: pi(MARK) = 1 Problem 1: SCC Processor: -> Pairs: Empty -> Rules: a__and(tt,X) -> mark(X) a__and(X1,X2) -> and(X1,X2) a__plus(N,0) -> mark(N) a__plus(N,s(M)) -> s(a__plus(mark(N),mark(M))) a__plus(X1,X2) -> plus(X1,X2) mark(0) -> 0 mark(and(X1,X2)) -> a__and(mark(X1),X2) mark(plus(X1,X2)) -> a__plus(mark(X1),mark(X2)) mark(s(X)) -> s(mark(X)) mark(tt) -> tt ->Strongly Connected Components: There is no strongly connected component The problem is finite.