/export/starexec/sandbox/solver/bin/starexec_run_Default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES Input TRS: 1: g(x,0()) -> 0() 2: g(d(),s(x)) -> s(s(g(d(),x))) 3: g(h(),s(0())) -> 0() 4: g(h(),s(s(x))) -> s(g(h(),x)) 5: double(x) -> g(d(),x) 6: half(x) -> g(h(),x) 7: f(s(x),y) -> f(half(s(x)),double(y)) 8: f(s(0()),y) -> y 9: id(x) -> f(x,s(0())) Number of strict rules: 9 Direct POLO(bPol) ... removes: 8 9 h w: 0 d w: 0 s w: x1 f w: x1 + x2 half w: x1 0 w: 1 double w: x1 id w: 2 * x1 + 2 g w: x1 + x2 Number of strict rules: 7 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #g(d(),s(x)) -> #g(d(),x) #2: #half(x) -> #g(h(),x) #3: #f(s(x),y) -> #f(half(s(x)),double(y)) #4: #f(s(x),y) -> #half(s(x)) #5: #f(s(x),y) -> #double(y) #6: #double(x) -> #g(d(),x) #7: #g(h(),s(s(x))) -> #g(h(),x) Number of SCCs: 3, DPs: 3 SCC { #1 } POLO(Sum)... succeeded. h w: 0 d w: 0 s w: x1 + 1 #half w: 0 f w: 0 half w: 0 0 w: 0 #double w: 0 double w: 0 #f w: 0 #g w: x2 id w: 0 g w: 0 USABLE RULES: { } Removed DPs: #1 Number of SCCs: 2, DPs: 2 SCC { #7 } POLO(Sum)... succeeded. h w: 0 d w: 0 s w: x1 + 1 #half w: 0 f w: 0 half w: 0 0 w: 0 #double w: 0 double w: 0 #f w: 0 #g w: x2 id w: 0 g w: 0 USABLE RULES: { } Removed DPs: #7 Number of SCCs: 1, DPs: 1 SCC { #3 } POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... succeeded. h w: 1 d w: 1 s w: max(x1 + 3, 0) #half w: 0 f w: max(x2 - 1, 0) half w: max(x1 - 2, 0) 0 w: 0 #double w: max(x1 - 1, 0) double w: 1 #f w: max(x1 - 2, 0) #g w: max(x1 - 1, 0) id w: 0 g w: max(x2 - 2, 0) USABLE RULES: { 1 3 4 6 } Removed DPs: #3 Number of SCCs: 0, DPs: 0