/export/starexec/sandbox2/solver/bin/starexec_run_Default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES Input TRS: 1: intlist(nil()) -> nil() 2: int(s(x),0()) -> nil() 3: int(x,x) -> cons(x,nil()) 4: intlist(cons(x,y)) -> cons(s(x),intlist(y)) 5: int(s(x),s(y)) -> intlist(int(x,y)) 6: int(0(),s(y)) -> cons(0(),int(s(0()),s(y))) 7: intlist(cons(x,nil())) -> cons(s(x),nil()) Number of strict rules: 7 Direct POLO(bPol) ... removes: 3 2 s w: x1 0 w: 0 nil w: 1 intlist w: x1 int w: x1 + x2 + 3 cons w: x1 + x2 Number of strict rules: 5 Direct POLO(bPol) ... removes: 1 7 s w: 2 * x1 0 w: 0 nil w: 1 intlist w: 2 * x1 int w: x1 + x2 cons w: x1 + x2 Number of strict rules: 3 Direct POLO(bPol) ... failed. Uncurrying int 4: intlist(cons(x,y)) -> cons(s(x),intlist(y)) 5: int^1_s(x,s(y)) -> intlist(int(x,y)) 6: int^1_0(s(y)) -> cons(0(),int^1_s(0(),s(y))) 8: int(0(),_1) ->= int^1_0(_1) 9: int(s(_1),_2) ->= int^1_s(_1,_2) Number of strict rules: 3 Direct POLO(bPol) ... removes: 9 int^1_0 w: 2 * x1 + 1 s w: 2 * x1 + 1 0 w: 0 nil w: 0 intlist w: 2 * x1 int w: x1 + 2 * x2 + 1 cons w: x1 + x2 + 1 int^1_s w: 2 * x1 + 2 * x2 Number of strict rules: 3 Direct POLO(bPol) ... failed. Dependency Pairs: #1: #int^1_0(s(y)) -> #int^1_s(0(),s(y)) #2: #int^1_s(x,s(y)) -> #intlist(int(x,y)) #3: #int^1_s(x,s(y)) -> #int(x,y) #4: #int(0(),_1) ->? #int^1_0(_1) #5: #intlist(cons(x,y)) -> #intlist(y) Number of SCCs: 2, DPs: 4 SCC { #5 } POLO(Sum)... succeeded. int^1_0 w: 0 #intlist w: x1 s w: 0 0 w: 0 nil w: 0 intlist w: 0 #int^1_0 w: 0 int w: 0 cons w: x2 + 1 int^1_s w: 0 #int^1_s w: 0 #int w: 0 USABLE RULES: { } Removed DPs: #5 Number of SCCs: 1, DPs: 3 SCC { #1 #3 #4 } POLO(Sum)... succeeded. int^1_0 w: 0 #intlist w: 0 s w: x1 + 4 0 w: 1 nil w: 0 intlist w: 0 #int^1_0 w: x1 + 2 int w: 0 cons w: 1 int^1_s w: 0 #int^1_s w: x1 + x2 #int w: x2 + 3 USABLE RULES: { } Removed DPs: #1 #3 #4 Number of SCCs: 0, DPs: 0