0.00/0.53 YES 0.00/0.53 0.00/0.53 Problem 1: 0.00/0.53 0.00/0.53 (VAR k l x y) 0.00/0.53 (THEORY 0.00/0.53 (AC plus)) 0.00/0.53 (RULES 0.00/0.53 app(cons(x,l),k) -> cons(x,app(l,k)) 0.00/0.53 app(nil,k) -> k 0.00/0.53 app(l,nil) -> l 0.00/0.53 plus(0,y) -> y 0.00/0.53 plus(s(x),y) -> s(plus(x,y)) 0.00/0.53 pred(cons(s(x),nil)) -> cons(x,nil) 0.00/0.53 sum(app(l,cons(x,cons(y,k)))) -> sum(app(l,sum(cons(x,cons(y,k))))) 0.00/0.53 sum(cons(0,cons(plus(x,y),l))) -> pred(sum(cons(s(x),cons(y,l)))) 0.00/0.53 sum(cons(x,cons(y,l))) -> sum(cons(plus(x,y),l)) 0.00/0.53 sum(cons(x,nil)) -> cons(x,nil) 0.00/0.53 ) 0.00/0.53 0.00/0.53 Problem 1: 0.00/0.53 0.00/0.53 Reduction Order Processor: 0.00/0.53 -> Rules: 0.00/0.53 app(cons(x,l),k) -> cons(x,app(l,k)) 0.00/0.53 app(nil,k) -> k 0.00/0.53 app(l,nil) -> l 0.00/0.53 plus(0,y) -> y 0.00/0.53 plus(s(x),y) -> s(plus(x,y)) 0.00/0.53 pred(cons(s(x),nil)) -> cons(x,nil) 0.00/0.53 sum(app(l,cons(x,cons(y,k)))) -> sum(app(l,sum(cons(x,cons(y,k))))) 0.00/0.53 sum(cons(0,cons(plus(x,y),l))) -> pred(sum(cons(s(x),cons(y,l)))) 0.00/0.53 sum(cons(x,cons(y,l))) -> sum(cons(plus(x,y),l)) 0.00/0.53 sum(cons(x,nil)) -> cons(x,nil) 0.00/0.53 ->Interpretation type: 0.00/0.53 Linear 0.00/0.53 ->Coefficients: 0.00/0.53 Natural Numbers 0.00/0.53 ->Dimension: 0.00/0.53 1 0.00/0.53 ->Bound: 0.00/0.53 2 0.00/0.53 ->Interpretation: 0.00/0.53 0.00/0.53 [app](X1,X2) = 2.X1 + 2.X2 + 2 0.00/0.53 [plus](X1,X2) = X1 + X2 + 2 0.00/0.53 [pred](X) = X + 2 0.00/0.53 [sum](X) = X 0.00/0.53 [0] = 1 0.00/0.53 [cons](X1,X2) = X1 + X2 + 2 0.00/0.53 [nil] = 2 0.00/0.53 [s](X) = X 0.00/0.53 0.00/0.53 Problem 1: 0.00/0.53 0.00/0.53 Reduction Order Processor: 0.00/0.53 -> Rules: 0.00/0.53 app(nil,k) -> k 0.00/0.53 app(l,nil) -> l 0.00/0.53 plus(0,y) -> y 0.00/0.53 plus(s(x),y) -> s(plus(x,y)) 0.00/0.53 pred(cons(s(x),nil)) -> cons(x,nil) 0.00/0.53 sum(app(l,cons(x,cons(y,k)))) -> sum(app(l,sum(cons(x,cons(y,k))))) 0.00/0.53 sum(cons(0,cons(plus(x,y),l))) -> pred(sum(cons(s(x),cons(y,l)))) 0.00/0.53 sum(cons(x,cons(y,l))) -> sum(cons(plus(x,y),l)) 0.00/0.53 sum(cons(x,nil)) -> cons(x,nil) 0.00/0.53 ->Interpretation type: 0.00/0.53 Linear 0.00/0.53 ->Coefficients: 0.00/0.53 Natural Numbers 0.00/0.53 ->Dimension: 0.00/0.53 1 0.00/0.53 ->Bound: 0.00/0.53 2 0.00/0.53 ->Interpretation: 0.00/0.53 0.00/0.53 [app](X1,X2) = X1 + 2.X2 + 2 0.00/0.53 [plus](X1,X2) = X1 + X2 + 2 0.00/0.53 [pred](X) = X + 2 0.00/0.53 [sum](X) = X 0.00/0.53 [0] = 2 0.00/0.53 [cons](X1,X2) = 2.X1 + 2.X2 + 2 0.00/0.53 [nil] = 2 0.00/0.53 [s](X) = X + 2 0.00/0.53 0.00/0.53 Problem 1: 0.00/0.53 0.00/0.53 Reduction Order Processor: 0.00/0.53 -> Rules: 0.00/0.53 app(l,nil) -> l 0.00/0.53 plus(0,y) -> y 0.00/0.53 plus(s(x),y) -> s(plus(x,y)) 0.00/0.53 pred(cons(s(x),nil)) -> cons(x,nil) 0.00/0.53 sum(app(l,cons(x,cons(y,k)))) -> sum(app(l,sum(cons(x,cons(y,k))))) 0.00/0.53 sum(cons(0,cons(plus(x,y),l))) -> pred(sum(cons(s(x),cons(y,l)))) 0.00/0.53 sum(cons(x,cons(y,l))) -> sum(cons(plus(x,y),l)) 0.00/0.53 sum(cons(x,nil)) -> cons(x,nil) 0.00/0.53 ->Interpretation type: 0.00/0.53 Linear 0.00/0.53 ->Coefficients: 0.00/0.53 Natural Numbers 0.00/0.53 ->Dimension: 0.00/0.53 1 0.00/0.53 ->Bound: 0.00/0.53 2 0.00/0.53 ->Interpretation: 0.00/0.53 0.00/0.53 [app](X1,X2) = 2.X1 + 2.X2 0.00/0.53 [plus](X1,X2) = X1 + X2 + 2 0.00/0.53 [pred](X) = X + 2 0.00/0.53 [sum](X) = X 0.00/0.53 [0] = 1 0.00/0.53 [cons](X1,X2) = 2.X1 + 2.X2 + 2 0.00/0.53 [nil] = 2 0.00/0.53 [s](X) = X + 2 0.00/0.53 0.00/0.53 Problem 1: 0.00/0.53 0.00/0.53 Reduction Order Processor: 0.00/0.53 -> Rules: 0.00/0.53 plus(0,y) -> y 0.00/0.53 plus(s(x),y) -> s(plus(x,y)) 0.00/0.53 pred(cons(s(x),nil)) -> cons(x,nil) 0.00/0.53 sum(app(l,cons(x,cons(y,k)))) -> sum(app(l,sum(cons(x,cons(y,k))))) 0.00/0.53 sum(cons(0,cons(plus(x,y),l))) -> pred(sum(cons(s(x),cons(y,l)))) 0.00/0.53 sum(cons(x,cons(y,l))) -> sum(cons(plus(x,y),l)) 0.00/0.53 sum(cons(x,nil)) -> cons(x,nil) 0.00/0.53 ->Interpretation type: 0.00/0.53 Linear 0.00/0.53 ->Coefficients: 0.00/0.53 Natural Numbers 0.00/0.53 ->Dimension: 0.00/0.53 1 0.00/0.53 ->Bound: 0.00/0.53 2 0.00/0.53 ->Interpretation: 0.00/0.53 0.00/0.53 [app](X1,X2) = 2.X1 + 2.X2 0.00/0.53 [plus](X1,X2) = X1 + X2 + 2 0.00/0.53 [pred](X) = X + 2 0.00/0.53 [sum](X) = X 0.00/0.53 [0] = 1 0.00/0.53 [cons](X1,X2) = 2.X1 + 2.X2 + 2 0.00/0.53 [nil] = 1 0.00/0.53 [s](X) = X + 2 0.00/0.53 0.00/0.53 Problem 1: 0.00/0.53 0.00/0.53 Reduction Order Processor: 0.00/0.53 -> Rules: 0.00/0.53 plus(s(x),y) -> s(plus(x,y)) 0.00/0.53 pred(cons(s(x),nil)) -> cons(x,nil) 0.00/0.53 sum(app(l,cons(x,cons(y,k)))) -> sum(app(l,sum(cons(x,cons(y,k))))) 0.00/0.53 sum(cons(0,cons(plus(x,y),l))) -> pred(sum(cons(s(x),cons(y,l)))) 0.00/0.53 sum(cons(x,cons(y,l))) -> sum(cons(plus(x,y),l)) 0.00/0.53 sum(cons(x,nil)) -> cons(x,nil) 0.00/0.53 ->Interpretation type: 0.00/0.53 Linear 0.00/0.53 ->Coefficients: 0.00/0.53 Natural Numbers 0.00/0.53 ->Dimension: 0.00/0.53 1 0.00/0.53 ->Bound: 0.00/0.53 2 0.00/0.53 ->Interpretation: 0.00/0.53 0.00/0.53 [app](X1,X2) = X1 + 2.X2 0.00/0.53 [plus](X1,X2) = X1 + X2 0.00/0.53 [pred](X) = X 0.00/0.53 [sum](X) = X 0.00/0.53 [0] = 2 0.00/0.53 [cons](X1,X2) = 2.X1 + 2.X2 + 2 0.00/0.53 [nil] = 1 0.00/0.53 [s](X) = X + 2 0.00/0.53 0.00/0.53 Problem 1: 0.00/0.53 0.00/0.53 Reduction Order Processor: 0.00/0.53 -> Rules: 0.00/0.53 plus(s(x),y) -> s(plus(x,y)) 0.00/0.53 sum(app(l,cons(x,cons(y,k)))) -> sum(app(l,sum(cons(x,cons(y,k))))) 0.00/0.53 sum(cons(0,cons(plus(x,y),l))) -> pred(sum(cons(s(x),cons(y,l)))) 0.00/0.53 sum(cons(x,cons(y,l))) -> sum(cons(plus(x,y),l)) 0.00/0.53 sum(cons(x,nil)) -> cons(x,nil) 0.00/0.53 ->Interpretation type: 0.00/0.53 Linear 0.00/0.53 ->Coefficients: 0.00/0.53 Natural Numbers 0.00/0.53 ->Dimension: 0.00/0.53 1 0.00/0.53 ->Bound: 0.00/0.53 2 0.00/0.53 ->Interpretation: 0.00/0.53 0.00/0.53 [app](X1,X2) = 2.X1 + 2.X2 0.00/0.53 [plus](X1,X2) = X1 + X2 + 2 0.00/0.53 [pred](X) = X + 2 0.00/0.53 [sum](X) = X 0.00/0.53 [0] = 2 0.00/0.53 [cons](X1,X2) = 2.X1 + 2.X2 + 2 0.00/0.53 [nil] = 1 0.00/0.53 [s](X) = X + 2 0.00/0.53 0.00/0.53 Problem 1: 0.00/0.53 0.00/0.53 Reduction Order Processor: 0.00/0.53 -> Rules: 0.00/0.53 plus(s(x),y) -> s(plus(x,y)) 0.00/0.53 sum(app(l,cons(x,cons(y,k)))) -> sum(app(l,sum(cons(x,cons(y,k))))) 0.00/0.53 sum(cons(x,cons(y,l))) -> sum(cons(plus(x,y),l)) 0.00/0.53 sum(cons(x,nil)) -> cons(x,nil) 0.00/0.53 ->Interpretation type: 0.00/0.53 Linear 0.00/0.53 ->Coefficients: 0.00/0.53 Natural Numbers 0.00/0.53 ->Dimension: 0.00/0.53 1 0.00/0.53 ->Bound: 0.00/0.53 2 0.00/0.53 ->Interpretation: 0.00/0.53 0.00/0.53 [app](X1,X2) = 2.X1 + 2.X2 0.00/0.53 [plus](X1,X2) = X1 + X2 + 1 0.00/0.53 [pred](X) = X 0.00/0.53 [sum](X) = X 0.00/0.53 [0] = 0 0.00/0.53 [cons](X1,X2) = 2.X1 + 2.X2 + 2 0.00/0.53 [nil] = 2 0.00/0.53 [s](X) = X 0.00/0.53 0.00/0.53 Problem 1: 0.00/0.53 0.00/0.53 Dependency Pairs Processor: 0.00/0.53 -> FAxioms: 0.00/0.53 PLUS(plus(x4,x5),x6) = PLUS(x4,plus(x5,x6)) 0.00/0.53 PLUS(x4,x5) = PLUS(x5,x4) 0.00/0.53 -> Pairs: 0.00/0.53 PLUS(plus(s(x),y),x4) -> PLUS(s(plus(x,y)),x4) 0.00/0.53 PLUS(plus(s(x),y),x4) -> PLUS(x,y) 0.00/0.53 PLUS(s(x),y) -> PLUS(x,y) 0.00/0.53 SUM(app(l,cons(x,cons(y,k)))) -> APP(l,sum(cons(x,cons(y,k)))) 0.00/0.53 SUM(app(l,cons(x,cons(y,k)))) -> SUM(app(l,sum(cons(x,cons(y,k))))) 0.00/0.53 SUM(app(l,cons(x,cons(y,k)))) -> SUM(cons(x,cons(y,k))) 0.00/0.53 -> EAxioms: 0.00/0.53 plus(plus(x4,x5),x6) = plus(x4,plus(x5,x6)) 0.00/0.53 plus(x4,x5) = plus(x5,x4) 0.00/0.53 -> Rules: 0.00/0.53 plus(s(x),y) -> s(plus(x,y)) 0.00/0.53 sum(app(l,cons(x,cons(y,k)))) -> sum(app(l,sum(cons(x,cons(y,k))))) 0.00/0.53 sum(cons(x,nil)) -> cons(x,nil) 0.00/0.53 -> SRules: 0.00/0.53 PLUS(plus(x4,x5),x6) -> PLUS(x4,x5) 0.00/0.53 PLUS(x4,plus(x5,x6)) -> PLUS(x5,x6) 0.00/0.53 0.00/0.53 Problem 1: 0.00/0.53 0.00/0.53 SCC Processor: 0.00/0.53 -> FAxioms: 0.00/0.53 PLUS(plus(x4,x5),x6) = PLUS(x4,plus(x5,x6)) 0.00/0.53 PLUS(x4,x5) = PLUS(x5,x4) 0.00/0.53 -> Pairs: 0.00/0.53 PLUS(plus(s(x),y),x4) -> PLUS(s(plus(x,y)),x4) 0.00/0.53 PLUS(plus(s(x),y),x4) -> PLUS(x,y) 0.00/0.53 PLUS(s(x),y) -> PLUS(x,y) 0.00/0.53 SUM(app(l,cons(x,cons(y,k)))) -> APP(l,sum(cons(x,cons(y,k)))) 0.00/0.53 SUM(app(l,cons(x,cons(y,k)))) -> SUM(app(l,sum(cons(x,cons(y,k))))) 0.00/0.53 SUM(app(l,cons(x,cons(y,k)))) -> SUM(cons(x,cons(y,k))) 0.00/0.53 -> EAxioms: 0.00/0.53 plus(plus(x4,x5),x6) = plus(x4,plus(x5,x6)) 0.00/0.53 plus(x4,x5) = plus(x5,x4) 0.00/0.53 -> Rules: 0.00/0.53 plus(s(x),y) -> s(plus(x,y)) 0.00/0.53 sum(app(l,cons(x,cons(y,k)))) -> sum(app(l,sum(cons(x,cons(y,k))))) 0.00/0.53 sum(cons(x,nil)) -> cons(x,nil) 0.00/0.53 -> SRules: 0.00/0.53 PLUS(plus(x4,x5),x6) -> PLUS(x4,x5) 0.00/0.53 PLUS(x4,plus(x5,x6)) -> PLUS(x5,x6) 0.00/0.53 ->Strongly Connected Components: 0.00/0.53 ->->Cycle: 0.00/0.53 ->->-> Pairs: 0.00/0.53 SUM(app(l,cons(x,cons(y,k)))) -> SUM(app(l,sum(cons(x,cons(y,k))))) 0.00/0.53 -> FAxioms: 0.00/0.53 plus(plus(x4,x5),x6) -> plus(x4,plus(x5,x6)) 0.00/0.53 plus(x4,x5) -> plus(x5,x4) 0.00/0.53 -> EAxioms: 0.00/0.53 plus(plus(x4,x5),x6) = plus(x4,plus(x5,x6)) 0.00/0.53 plus(x4,x5) = plus(x5,x4) 0.00/0.53 ->->-> Rules: 0.00/0.53 plus(s(x),y) -> s(plus(x,y)) 0.00/0.53 sum(app(l,cons(x,cons(y,k)))) -> sum(app(l,sum(cons(x,cons(y,k))))) 0.00/0.53 sum(cons(x,nil)) -> cons(x,nil) 0.00/0.53 -> SRules: 0.00/0.53 Empty 0.00/0.53 ->->Cycle: 0.00/0.53 ->->-> Pairs: 0.00/0.53 PLUS(plus(s(x),y),x4) -> PLUS(s(plus(x,y)),x4) 0.00/0.53 PLUS(plus(s(x),y),x4) -> PLUS(x,y) 0.00/0.53 PLUS(s(x),y) -> PLUS(x,y) 0.00/0.53 -> FAxioms: 0.00/0.53 plus(plus(x4,x5),x6) -> plus(x4,plus(x5,x6)) 0.00/0.53 plus(x4,x5) -> plus(x5,x4) 0.00/0.53 PLUS(plus(x4,x5),x6) -> PLUS(x4,plus(x5,x6)) 0.00/0.53 PLUS(x4,x5) -> PLUS(x5,x4) 0.00/0.53 -> EAxioms: 0.00/0.53 plus(plus(x4,x5),x6) = plus(x4,plus(x5,x6)) 0.00/0.53 plus(x4,x5) = plus(x5,x4) 0.00/0.53 ->->-> Rules: 0.00/0.53 plus(s(x),y) -> s(plus(x,y)) 0.00/0.53 sum(app(l,cons(x,cons(y,k)))) -> sum(app(l,sum(cons(x,cons(y,k))))) 0.00/0.53 sum(cons(x,nil)) -> cons(x,nil) 0.00/0.53 -> SRules: 0.00/0.53 PLUS(plus(x4,x5),x6) -> PLUS(x4,x5) 0.00/0.53 PLUS(x4,plus(x5,x6)) -> PLUS(x5,x6) 0.00/0.53 0.00/0.53 0.00/0.53 The problem is decomposed in 2 subproblems. 0.00/0.53 0.00/0.53 Problem 1.1: 0.00/0.53 0.00/0.53 Reduction Pairs Processor: 0.00/0.53 -> FAxioms: 0.00/0.53 Empty 0.00/0.53 -> Pairs: 0.00/0.53 SUM(app(l,cons(x,cons(y,k)))) -> SUM(app(l,sum(cons(x,cons(y,k))))) 0.00/0.53 -> EAxioms: 0.00/0.53 plus(plus(x4,x5),x6) = plus(x4,plus(x5,x6)) 0.00/0.53 plus(x4,x5) = plus(x5,x4) 0.00/0.53 -> Usable Equations: 0.00/0.53 Empty 0.00/0.53 -> Rules: 0.00/0.53 plus(s(x),y) -> s(plus(x,y)) 0.00/0.53 sum(app(l,cons(x,cons(y,k)))) -> sum(app(l,sum(cons(x,cons(y,k))))) 0.00/0.53 sum(cons(x,nil)) -> cons(x,nil) 0.00/0.53 -> Usable Rules: 0.00/0.53 sum(app(l,cons(x,cons(y,k)))) -> sum(app(l,sum(cons(x,cons(y,k))))) 0.00/0.53 sum(cons(x,nil)) -> cons(x,nil) 0.00/0.53 -> SRules: 0.00/0.53 Empty 0.00/0.53 ->Interpretation type: 0.00/0.53 Linear 0.00/0.53 ->Coefficients: 0.00/0.53 Natural Numbers 0.00/0.53 ->Dimension: 0.00/0.53 1 0.00/0.53 ->Bound: 0.00/0.53 2 0.00/0.53 ->Interpretation: 0.00/0.53 0.00/0.53 [app](X1,X2) = 2.X2 0.00/0.53 [plus](X1,X2) = 0 0.00/0.53 [pred](X) = 0 0.00/0.53 [sum](X) = 2 0.00/0.53 [0] = 0 0.00/0.53 [cons](X1,X2) = 2.X2 + 2 0.00/0.53 [nil] = 0 0.00/0.53 [s](X) = 0 0.00/0.53 [APP](X1,X2) = 0 0.00/0.53 [PLUS](X1,X2) = 0 0.00/0.53 [SUM](X) = 2.X 0.00/0.53 0.00/0.53 Problem 1.1: 0.00/0.53 0.00/0.53 SCC Processor: 0.00/0.53 -> FAxioms: 0.00/0.53 Empty 0.00/0.53 -> Pairs: 0.00/0.53 Empty 0.00/0.53 -> EAxioms: 0.00/0.53 plus(plus(x4,x5),x6) = plus(x4,plus(x5,x6)) 0.00/0.53 plus(x4,x5) = plus(x5,x4) 0.00/0.53 -> Rules: 0.00/0.53 plus(s(x),y) -> s(plus(x,y)) 0.00/0.53 sum(app(l,cons(x,cons(y,k)))) -> sum(app(l,sum(cons(x,cons(y,k))))) 0.00/0.53 sum(cons(x,nil)) -> cons(x,nil) 0.00/0.53 -> SRules: 0.00/0.53 Empty 0.00/0.53 ->Strongly Connected Components: 0.00/0.53 There is no strongly connected component 0.00/0.53 0.00/0.53 The problem is finite. 0.00/0.53 0.00/0.53 Problem 1.2: 0.00/0.53 0.00/0.53 Reduction Pairs Processor: 0.00/0.53 -> FAxioms: 0.00/0.53 PLUS(plus(x4,x5),x6) = PLUS(x4,plus(x5,x6)) 0.00/0.53 PLUS(x4,x5) = PLUS(x5,x4) 0.00/0.53 -> Pairs: 0.00/0.53 PLUS(plus(s(x),y),x4) -> PLUS(s(plus(x,y)),x4) 0.00/0.53 PLUS(plus(s(x),y),x4) -> PLUS(x,y) 0.00/0.53 PLUS(s(x),y) -> PLUS(x,y) 0.00/0.53 -> EAxioms: 0.00/0.53 plus(plus(x4,x5),x6) = plus(x4,plus(x5,x6)) 0.00/0.53 plus(x4,x5) = plus(x5,x4) 0.00/0.53 -> Usable Equations: 0.00/0.53 plus(plus(x4,x5),x6) = plus(x4,plus(x5,x6)) 0.00/0.53 plus(x4,x5) = plus(x5,x4) 0.00/0.53 -> Rules: 0.00/0.53 plus(s(x),y) -> s(plus(x,y)) 0.00/0.53 sum(app(l,cons(x,cons(y,k)))) -> sum(app(l,sum(cons(x,cons(y,k))))) 0.00/0.53 sum(cons(x,nil)) -> cons(x,nil) 0.00/0.53 -> Usable Rules: 0.00/0.53 plus(s(x),y) -> s(plus(x,y)) 0.00/0.53 -> SRules: 0.00/0.53 PLUS(plus(x4,x5),x6) -> PLUS(x4,x5) 0.00/0.53 PLUS(x4,plus(x5,x6)) -> PLUS(x5,x6) 0.00/0.53 ->Interpretation type: 0.00/0.53 Linear 0.00/0.53 ->Coefficients: 0.00/0.53 Natural Numbers 0.00/0.53 ->Dimension: 0.00/0.53 1 0.00/0.53 ->Bound: 0.00/0.53 2 0.00/0.53 ->Interpretation: 0.00/0.53 0.00/0.53 [app](X1,X2) = 0 0.00/0.53 [plus](X1,X2) = X1 + X2 + 2 0.00/0.53 [pred](X) = 0 0.00/0.53 [sum](X) = 0 0.00/0.53 [0] = 0 0.00/0.53 [cons](X1,X2) = 0 0.00/0.53 [nil] = 0 0.00/0.53 [s](X) = X + 2 0.00/0.53 [APP](X1,X2) = 0 0.00/0.53 [PLUS](X1,X2) = 2.X1 + 2.X2 0.00/0.53 [SUM](X) = 0 0.00/0.53 0.00/0.53 Problem 1.2: 0.00/0.53 0.00/0.53 SCC Processor: 0.00/0.53 -> FAxioms: 0.00/0.53 PLUS(plus(x4,x5),x6) = PLUS(x4,plus(x5,x6)) 0.00/0.53 PLUS(x4,x5) = PLUS(x5,x4) 0.00/0.53 -> Pairs: 0.00/0.53 PLUS(plus(s(x),y),x4) -> PLUS(s(plus(x,y)),x4) 0.00/0.53 PLUS(s(x),y) -> PLUS(x,y) 0.00/0.53 -> EAxioms: 0.00/0.53 plus(plus(x4,x5),x6) = plus(x4,plus(x5,x6)) 0.00/0.53 plus(x4,x5) = plus(x5,x4) 0.00/0.53 -> Rules: 0.00/0.53 plus(s(x),y) -> s(plus(x,y)) 0.00/0.53 sum(app(l,cons(x,cons(y,k)))) -> sum(app(l,sum(cons(x,cons(y,k))))) 0.00/0.53 sum(cons(x,nil)) -> cons(x,nil) 0.00/0.53 -> SRules: 0.00/0.53 PLUS(plus(x4,x5),x6) -> PLUS(x4,x5) 0.00/0.53 PLUS(x4,plus(x5,x6)) -> PLUS(x5,x6) 0.00/0.53 ->Strongly Connected Components: 0.00/0.53 ->->Cycle: 0.00/0.53 ->->-> Pairs: 0.00/0.53 PLUS(plus(s(x),y),x4) -> PLUS(s(plus(x,y)),x4) 0.00/0.53 PLUS(s(x),y) -> PLUS(x,y) 0.00/0.53 -> FAxioms: 0.00/0.53 plus(plus(x4,x5),x6) -> plus(x4,plus(x5,x6)) 0.00/0.53 plus(x4,x5) -> plus(x5,x4) 0.00/0.53 PLUS(plus(x4,x5),x6) -> PLUS(x4,plus(x5,x6)) 0.00/0.53 PLUS(x4,x5) -> PLUS(x5,x4) 0.00/0.53 -> EAxioms: 0.00/0.53 plus(plus(x4,x5),x6) = plus(x4,plus(x5,x6)) 0.00/0.53 plus(x4,x5) = plus(x5,x4) 0.00/0.53 ->->-> Rules: 0.00/0.53 plus(s(x),y) -> s(plus(x,y)) 0.00/0.53 sum(app(l,cons(x,cons(y,k)))) -> sum(app(l,sum(cons(x,cons(y,k))))) 0.00/0.53 sum(cons(x,nil)) -> cons(x,nil) 0.00/0.53 -> SRules: 0.00/0.53 PLUS(plus(x4,x5),x6) -> PLUS(x4,x5) 0.00/0.53 PLUS(x4,plus(x5,x6)) -> PLUS(x5,x6) 0.00/0.53 0.00/0.53 Problem 1.2: 0.00/0.53 0.00/0.53 Reduction Pairs Processor: 0.00/0.53 -> FAxioms: 0.00/0.53 PLUS(plus(x4,x5),x6) = PLUS(x4,plus(x5,x6)) 0.00/0.53 PLUS(x4,x5) = PLUS(x5,x4) 0.00/0.53 -> Pairs: 0.00/0.53 PLUS(plus(s(x),y),x4) -> PLUS(s(plus(x,y)),x4) 0.00/0.53 PLUS(s(x),y) -> PLUS(x,y) 0.00/0.53 -> EAxioms: 0.00/0.53 plus(plus(x4,x5),x6) = plus(x4,plus(x5,x6)) 0.00/0.53 plus(x4,x5) = plus(x5,x4) 0.00/0.53 -> Usable Equations: 0.00/0.53 plus(plus(x4,x5),x6) = plus(x4,plus(x5,x6)) 0.00/0.53 plus(x4,x5) = plus(x5,x4) 0.00/0.53 -> Rules: 0.00/0.53 plus(s(x),y) -> s(plus(x,y)) 0.00/0.53 sum(app(l,cons(x,cons(y,k)))) -> sum(app(l,sum(cons(x,cons(y,k))))) 0.00/0.53 sum(cons(x,nil)) -> cons(x,nil) 0.00/0.53 -> Usable Rules: 0.00/0.53 plus(s(x),y) -> s(plus(x,y)) 0.00/0.53 -> SRules: 0.00/0.53 PLUS(plus(x4,x5),x6) -> PLUS(x4,x5) 0.00/0.53 PLUS(x4,plus(x5,x6)) -> PLUS(x5,x6) 0.00/0.53 ->Interpretation type: 0.00/0.53 Linear 0.00/0.53 ->Coefficients: 0.00/0.53 Natural Numbers 0.00/0.53 ->Dimension: 0.00/0.53 1 0.00/0.53 ->Bound: 0.00/0.53 2 0.00/0.53 ->Interpretation: 0.00/0.53 0.00/0.53 [app](X1,X2) = 0 0.00/0.53 [plus](X1,X2) = X1 + X2 + 2 0.00/0.53 [pred](X) = 0 0.00/0.53 [sum](X) = 0 0.00/0.53 [0] = 0 0.00/0.53 [cons](X1,X2) = 0 0.00/0.53 [nil] = 0 0.00/0.53 [s](X) = X + 2 0.00/0.53 [APP](X1,X2) = 0 0.00/0.53 [PLUS](X1,X2) = 2.X1 + 2.X2 0.00/0.53 [SUM](X) = 0 0.00/0.53 0.00/0.53 Problem 1.2: 0.00/0.53 0.00/0.53 SCC Processor: 0.00/0.53 -> FAxioms: 0.00/0.53 PLUS(plus(x4,x5),x6) = PLUS(x4,plus(x5,x6)) 0.00/0.53 PLUS(x4,x5) = PLUS(x5,x4) 0.00/0.53 -> Pairs: 0.00/0.53 PLUS(plus(s(x),y),x4) -> PLUS(s(plus(x,y)),x4) 0.00/0.53 PLUS(s(x),y) -> PLUS(x,y) 0.00/0.53 -> EAxioms: 0.00/0.53 plus(plus(x4,x5),x6) = plus(x4,plus(x5,x6)) 0.00/0.53 plus(x4,x5) = plus(x5,x4) 0.00/0.53 -> Rules: 0.00/0.53 plus(s(x),y) -> s(plus(x,y)) 0.00/0.53 sum(app(l,cons(x,cons(y,k)))) -> sum(app(l,sum(cons(x,cons(y,k))))) 0.00/0.53 sum(cons(x,nil)) -> cons(x,nil) 0.00/0.53 -> SRules: 0.00/0.53 PLUS(x4,plus(x5,x6)) -> PLUS(x5,x6) 0.00/0.53 ->Strongly Connected Components: 0.00/0.53 ->->Cycle: 0.00/0.53 ->->-> Pairs: 0.00/0.53 PLUS(plus(s(x),y),x4) -> PLUS(s(plus(x,y)),x4) 0.00/0.53 PLUS(s(x),y) -> PLUS(x,y) 0.00/0.53 -> FAxioms: 0.00/0.53 plus(plus(x4,x5),x6) -> plus(x4,plus(x5,x6)) 0.00/0.53 plus(x4,x5) -> plus(x5,x4) 0.00/0.53 PLUS(plus(x4,x5),x6) -> PLUS(x4,plus(x5,x6)) 0.00/0.53 PLUS(x4,x5) -> PLUS(x5,x4) 0.00/0.53 -> EAxioms: 0.00/0.53 plus(plus(x4,x5),x6) = plus(x4,plus(x5,x6)) 0.00/0.53 plus(x4,x5) = plus(x5,x4) 0.00/0.53 ->->-> Rules: 0.00/0.53 plus(s(x),y) -> s(plus(x,y)) 0.00/0.53 sum(app(l,cons(x,cons(y,k)))) -> sum(app(l,sum(cons(x,cons(y,k))))) 0.00/0.53 sum(cons(x,nil)) -> cons(x,nil) 0.00/0.53 -> SRules: 0.00/0.53 PLUS(x4,plus(x5,x6)) -> PLUS(x5,x6) 0.00/0.53 0.00/0.53 Problem 1.2: 0.00/0.53 0.00/0.53 Reduction Pairs Processor: 0.00/0.53 -> FAxioms: 0.00/0.53 PLUS(plus(x4,x5),x6) = PLUS(x4,plus(x5,x6)) 0.00/0.53 PLUS(x4,x5) = PLUS(x5,x4) 0.00/0.53 -> Pairs: 0.00/0.53 PLUS(plus(s(x),y),x4) -> PLUS(s(plus(x,y)),x4) 0.00/0.53 PLUS(s(x),y) -> PLUS(x,y) 0.00/0.53 -> EAxioms: 0.00/0.53 plus(plus(x4,x5),x6) = plus(x4,plus(x5,x6)) 0.00/0.53 plus(x4,x5) = plus(x5,x4) 0.00/0.53 -> Usable Equations: 0.00/0.53 plus(plus(x4,x5),x6) = plus(x4,plus(x5,x6)) 0.00/0.53 plus(x4,x5) = plus(x5,x4) 0.00/0.53 -> Rules: 0.00/0.53 plus(s(x),y) -> s(plus(x,y)) 0.00/0.53 sum(app(l,cons(x,cons(y,k)))) -> sum(app(l,sum(cons(x,cons(y,k))))) 0.00/0.53 sum(cons(x,nil)) -> cons(x,nil) 0.00/0.53 -> Usable Rules: 0.00/0.53 plus(s(x),y) -> s(plus(x,y)) 0.00/0.53 -> SRules: 0.00/0.53 PLUS(x4,plus(x5,x6)) -> PLUS(x5,x6) 0.00/0.53 ->Interpretation type: 0.00/0.53 Linear 0.00/0.53 ->Coefficients: 0.00/0.53 Natural Numbers 0.00/0.53 ->Dimension: 0.00/0.53 1 0.00/0.53 ->Bound: 0.00/0.53 2 0.00/0.53 ->Interpretation: 0.00/0.53 0.00/0.53 [app](X1,X2) = 0 0.00/0.53 [plus](X1,X2) = X1 + X2 + 2 0.00/0.53 [pred](X) = 0 0.00/0.53 [sum](X) = 0 0.00/0.53 [0] = 0 0.00/0.53 [cons](X1,X2) = 0 0.00/0.53 [nil] = 0 0.00/0.53 [s](X) = X + 2 0.00/0.53 [APP](X1,X2) = 0 0.00/0.53 [PLUS](X1,X2) = 2.X1 + 2.X2 0.00/0.53 [SUM](X) = 0 0.00/0.53 0.00/0.53 Problem 1.2: 0.00/0.53 0.00/0.53 SCC Processor: 0.00/0.53 -> FAxioms: 0.00/0.53 PLUS(plus(x4,x5),x6) = PLUS(x4,plus(x5,x6)) 0.00/0.53 PLUS(x4,x5) = PLUS(x5,x4) 0.00/0.53 -> Pairs: 0.00/0.53 PLUS(plus(s(x),y),x4) -> PLUS(s(plus(x,y)),x4) 0.00/0.53 -> EAxioms: 0.00/0.53 plus(plus(x4,x5),x6) = plus(x4,plus(x5,x6)) 0.00/0.53 plus(x4,x5) = plus(x5,x4) 0.00/0.53 -> Rules: 0.00/0.53 plus(s(x),y) -> s(plus(x,y)) 0.00/0.53 sum(app(l,cons(x,cons(y,k)))) -> sum(app(l,sum(cons(x,cons(y,k))))) 0.00/0.53 sum(cons(x,nil)) -> cons(x,nil) 0.00/0.53 -> SRules: 0.00/0.53 PLUS(x4,plus(x5,x6)) -> PLUS(x5,x6) 0.00/0.53 ->Strongly Connected Components: 0.00/0.53 ->->Cycle: 0.00/0.53 ->->-> Pairs: 0.00/0.53 PLUS(plus(s(x),y),x4) -> PLUS(s(plus(x,y)),x4) 0.00/0.53 -> FAxioms: 0.00/0.53 plus(plus(x4,x5),x6) -> plus(x4,plus(x5,x6)) 0.00/0.53 plus(x4,x5) -> plus(x5,x4) 0.00/0.53 PLUS(plus(x4,x5),x6) -> PLUS(x4,plus(x5,x6)) 0.00/0.53 PLUS(x4,x5) -> PLUS(x5,x4) 0.00/0.53 -> EAxioms: 0.00/0.53 plus(plus(x4,x5),x6) = plus(x4,plus(x5,x6)) 0.00/0.53 plus(x4,x5) = plus(x5,x4) 0.00/0.53 ->->-> Rules: 0.00/0.53 plus(s(x),y) -> s(plus(x,y)) 0.00/0.53 sum(app(l,cons(x,cons(y,k)))) -> sum(app(l,sum(cons(x,cons(y,k))))) 0.00/0.53 sum(cons(x,nil)) -> cons(x,nil) 0.00/0.53 -> SRules: 0.00/0.53 PLUS(x4,plus(x5,x6)) -> PLUS(x5,x6) 0.00/0.53 0.00/0.53 Problem 1.2: 0.00/0.53 0.00/0.53 Reduction Pairs Processor: 0.00/0.53 -> FAxioms: 0.00/0.53 PLUS(plus(x4,x5),x6) = PLUS(x4,plus(x5,x6)) 0.00/0.53 PLUS(x4,x5) = PLUS(x5,x4) 0.00/0.53 -> Pairs: 0.00/0.53 PLUS(plus(s(x),y),x4) -> PLUS(s(plus(x,y)),x4) 0.00/0.53 -> EAxioms: 0.00/0.53 plus(plus(x4,x5),x6) = plus(x4,plus(x5,x6)) 0.00/0.53 plus(x4,x5) = plus(x5,x4) 0.00/0.53 -> Usable Equations: 0.00/0.53 plus(plus(x4,x5),x6) = plus(x4,plus(x5,x6)) 0.00/0.53 plus(x4,x5) = plus(x5,x4) 0.00/0.53 -> Rules: 0.00/0.53 plus(s(x),y) -> s(plus(x,y)) 0.00/0.53 sum(app(l,cons(x,cons(y,k)))) -> sum(app(l,sum(cons(x,cons(y,k))))) 0.00/0.53 sum(cons(x,nil)) -> cons(x,nil) 0.00/0.53 -> Usable Rules: 0.00/0.53 plus(s(x),y) -> s(plus(x,y)) 0.00/0.53 -> SRules: 0.00/0.53 PLUS(x4,plus(x5,x6)) -> PLUS(x5,x6) 0.00/0.53 ->Interpretation type: 0.00/0.53 Linear 0.00/0.53 ->Coefficients: 0.00/0.53 Natural Numbers 0.00/0.53 ->Dimension: 0.00/0.53 1 0.00/0.53 ->Bound: 0.00/0.53 2 0.00/0.53 ->Interpretation: 0.00/0.53 0.00/0.53 [app](X1,X2) = 0 0.00/0.53 [plus](X1,X2) = X1 + X2 + 2 0.00/0.53 [pred](X) = 0 0.00/0.53 [sum](X) = 0 0.00/0.53 [0] = 0 0.00/0.53 [cons](X1,X2) = 0 0.00/0.53 [nil] = 0 0.00/0.53 [s](X) = 2 0.00/0.53 [APP](X1,X2) = 0 0.00/0.53 [PLUS](X1,X2) = 2.X1 + 2.X2 0.00/0.53 [SUM](X) = 0 0.00/0.53 0.00/0.53 Problem 1.2: 0.00/0.53 0.00/0.53 SCC Processor: 0.00/0.53 -> FAxioms: 0.00/0.53 PLUS(plus(x4,x5),x6) = PLUS(x4,plus(x5,x6)) 0.00/0.53 PLUS(x4,x5) = PLUS(x5,x4) 0.00/0.53 -> Pairs: 0.00/0.53 Empty 0.00/0.53 -> EAxioms: 0.00/0.53 plus(plus(x4,x5),x6) = plus(x4,plus(x5,x6)) 0.00/0.53 plus(x4,x5) = plus(x5,x4) 0.00/0.53 -> Rules: 0.00/0.53 plus(s(x),y) -> s(plus(x,y)) 0.00/0.53 sum(app(l,cons(x,cons(y,k)))) -> sum(app(l,sum(cons(x,cons(y,k))))) 0.00/0.53 sum(cons(x,nil)) -> cons(x,nil) 0.00/0.53 -> SRules: 0.00/0.53 PLUS(x4,plus(x5,x6)) -> PLUS(x5,x6) 0.00/0.53 ->Strongly Connected Components: 0.00/0.53 There is no strongly connected component 0.00/0.53 0.00/0.53 The problem is finite. 0.00/0.53 EOF