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