0.00/0.11 MAYBE 0.00/0.11 Input TRS: 0.00/0.11 AC symbols: + U * 0.00/0.11 1: 0(\#()) -> \#() 0.00/0.11 2: +(\#(),x) -> x 0.00/0.11 3: +(0(x),0(y)) -> 0(+(x,y)) 0.00/0.11 4: +(0(x),1(y)) -> 1(+(x,y)) 0.00/0.11 5: +(1(x),1(y)) -> 0(+(1(\#()),+(x,y))) 0.00/0.11 6: *(\#(),x) -> \#() 0.00/0.11 7: *(0(x),y) -> 0(*(x,y)) 0.00/0.11 8: *(1(x),y) -> +(0(*(x,y)),y) 0.00/0.11 9: *(+(y,z),x) -> +(*(x,y),*(x,z)) 0.00/0.11 10: U(empty(),b) -> b 0.00/0.11 11: sum(empty()) -> 0(\#()) 0.00/0.11 12: sum(singl(x)) -> x 0.00/0.11 13: sum(U(x,y)) -> +(sum(x),sum(y)) 0.00/0.11 14: prod(empty()) -> 1(\#()) 0.00/0.11 15: prod(singl(x)) -> x 0.00/0.11 16: prod(U(x,y)) -> *(prod(x),prod(y)) 0.00/0.11 Number of strict rules: 16 0.00/0.11 Direct POLO(bPol) ... failed. 0.00/0.11 Uncurrying ... failed. 0.00/0.11 Dependency Pairs: 0.00/0.11 #1: #sum(U(x,y)) -> #+(sum(x),sum(y)) 0.00/0.11 #2: #sum(U(x,y)) -> #sum(x) 0.00/0.11 #3: #sum(U(x,y)) -> #sum(y) 0.00/0.11 #4: #*(+(y,z),x) -> #+(*(x,y),*(x,z)) 0.00/0.11 #5: #*(+(y,z),x) -> #*(x,y) 0.00/0.11 #6: #*(+(y,z),x) -> #*(x,z) 0.00/0.11 #7: #sum(empty()) -> #0(\#()) 0.00/0.11 #8: #*(0(x),y) -> #0(*(x,y)) 0.00/0.11 #9: #*(0(x),y) -> #*(x,y) 0.00/0.11 #10: #+(1(x),1(y)) -> #0(+(1(\#()),+(x,y))) 0.00/0.11 #11: #+(1(x),1(y)) -> #+(1(\#()),+(x,y)) 0.00/0.11 #12: #+(1(x),1(y)) -> #+(x,y) 0.00/0.11 #13: #+(x,+(y,z)) ->= #+(+(x,y),z) 0.00/0.11 #14: #+(x,+(y,z)) ->= #+(x,y) 0.00/0.11 #15: #*(x,*(y,z)) ->= #*(*(x,y),z) 0.00/0.11 #16: #*(x,*(y,z)) ->= #*(x,y) 0.00/0.11 #17: #prod(U(x,y)) -> #*(prod(x),prod(y)) 0.00/0.11 #18: #prod(U(x,y)) -> #prod(x) 0.00/0.11 #19: #prod(U(x,y)) -> #prod(y) 0.00/0.11 #20: #+(0(x),0(y)) -> #0(+(x,y)) 0.00/0.11 #21: #+(0(x),0(y)) -> #+(x,y) 0.00/0.11 #22: #*(1(x),y) -> #+(0(*(x,y)),y) 0.00/0.11 #23: #*(1(x),y) -> #0(*(x,y)) 0.00/0.11 #24: #*(1(x),y) -> #*(x,y) 0.00/0.11 #25: #+(0(x),1(y)) -> #+(x,y) 0.00/0.11 #26: #U(x,U(y,z)) ->= #U(U(x,y),z) 0.00/0.11 #27: #U(x,U(y,z)) ->= #U(x,y) 0.00/0.11 Number of SCCs: 5, DPs: 18 0.00/0.11 SCC { #18 #19 } 0.00/0.11 POLO(Sum)... succeeded. 0.00/0.11 #0 w: 0 0.00/0.11 1 w: 0 0.00/0.11 prod w: 0 0.00/0.11 #prod w: x1 0.00/0.11 #* w: 0 0.00/0.11 \# w: 0 0.00/0.11 #U w: 0 0.00/0.11 sum w: 0 0.00/0.11 0 w: 0 0.00/0.11 singl w: 0 0.00/0.11 empty w: 0 0.00/0.11 + w: 0 0.00/0.11 #sum w: 0 0.00/0.11 U w: x1 + x2 + 1 0.00/0.11 #+ w: 0 0.00/0.11 * w: 0 0.00/0.11 USABLE RULES: { } 0.00/0.11 Removed DPs: #18 #19 0.00/0.11 Number of SCCs: 4, DPs: 16 0.00/0.11 SCC { #2 #3 } 0.00/0.11 POLO(Sum)... succeeded. 0.00/0.11 #0 w: 0 0.00/0.11 1 w: 0 0.00/0.11 prod w: 0 0.00/0.11 #prod w: 0 0.00/0.11 #* w: 0 0.00/0.11 \# w: 0 0.00/0.11 #U w: 0 0.00/0.11 sum w: 0 0.00/0.11 0 w: 0 0.00/0.11 singl w: 0 0.00/0.11 empty w: 0 0.00/0.11 + w: 0 0.00/0.11 #sum w: x1 0.00/0.11 U w: x1 + x2 + 1 0.00/0.11 #+ w: 0 0.00/0.11 * w: 0 0.00/0.11 USABLE RULES: { } 0.00/0.11 Removed DPs: #2 #3 0.00/0.11 Number of SCCs: 3, DPs: 14 0.00/0.11 SCC { #26 #27 } 0.00/0.11 only weak rules. 0.00/0.11 Number of SCCs: 2, DPs: 12 0.00/0.11 SCC { #5 #6 #9 #15 #16 #24 } 0.00/0.11 POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... succeeded. 0.00/0.11 #0 w: 0 0.00/0.11 1 w: max(x1, 0) 0.00/0.11 prod w: 0 0.00/0.11 #prod w: max(x1 - 1, 0) 0.00/0.11 #* w: max(x1 + x2 - 1, 0) 0.00/0.11 \# w: 0 0.00/0.11 #U w: max(x1 + x2 - 1, 0) 0.00/0.11 sum w: 0 0.00/0.11 0 w: max(x1, 0) 0.00/0.11 singl w: max(x1 - 1, 0) 0.00/0.11 empty w: 0 0.00/0.11 + w: max(x1, x2, 0) 0.00/0.11 #sum w: max(x1 - 1, 0) 0.00/0.11 U w: 0 0.00/0.11 #+ w: 0 0.00/0.11 * w: max(x1 + x2 + 2, 0) 0.00/0.11 USABLE RULES: { 1..9 17 19 } 0.00/0.11 Removed DPs: #16 0.00/0.11 Number of SCCs: 2, DPs: 11 0.00/0.11 SCC { #5 #6 #9 #15 #24 } 0.00/0.11 POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed. 0.00/0.11 Finding a loop... failed. 0.00/0.11 EOF