/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- MAYBE Input TRS: 1: double(x) -> plus(x,x) 2: double(0()) -> 0() 3: double(s(x)) -> s(s(double(x))) 4: plus(0(),y) -> y 5: plus(s(x),y) -> s(plus(x,y)) 6: minus(s(x),s(y)) -> minus(x,y) 7: minus(0(),x) -> 0() 8: minus(x,0()) -> x 9: div(s(x),s(y)) -> s(div(minus(s(x),double(s(y))),s(y))) 10: div(0(),s(y)) -> 0() Number of strict rules: 10 Direct poly ... failed. Freezing ... failed. Dependency Pairs: #1: #minus(s(x),s(y)) -> #minus(x,y) #2: #div(s(x),s(y)) -> #div(minus(s(x),double(s(y))),s(y)) #3: #div(s(x),s(y)) -> #minus(s(x),double(s(y))) #4: #div(s(x),s(y)) -> #double(s(y)) #5: #plus(s(x),y) -> #plus(x,y) #6: #double(s(x)) -> #double(x) #7: #double(x) -> #plus(x,x) Number of SCCs: 4, DPs: 4 SCC { #6 } Sum... succeeded. #div(x1,x2) w: (0) s(x1) w: (1 + x1) minus(x1,x2) w: (0) #plus(x1,x2) w: (0) div(x1,x2) w: (0) 0() w: (0) #double(x1) w: (x1) double(x1) w: (0) #minus(x1,x2) w: (0) plus(x1,x2) w: (0) USABLE RULES: { } Removed DPs: #6 Number of SCCs: 3, DPs: 3 SCC { #5 } Sum... succeeded. #div(x1,x2) w: (0) s(x1) w: (1 + x1) minus(x1,x2) w: (0) #plus(x1,x2) w: (x1) div(x1,x2) w: (0) 0() w: (0) #double(x1) w: (0) double(x1) w: (0) #minus(x1,x2) w: (0) plus(x1,x2) w: (0) USABLE RULES: { } Removed DPs: #5 Number of SCCs: 2, DPs: 2 SCC { #1 } Sum... succeeded. #div(x1,x2) w: (0) s(x1) w: (1 + x1) minus(x1,x2) w: (0) #plus(x1,x2) w: (0) div(x1,x2) w: (0) 0() w: (0) #double(x1) w: (0) double(x1) w: (0) #minus(x1,x2) w: (x2) plus(x1,x2) w: (0) USABLE RULES: { } Removed DPs: #1 Number of SCCs: 1, DPs: 1 SCC { #2 } Sum... Max... QLPOpS... NegMaxSum... QWPOpSMaxSum... 2D-Mat... sum_sum_int,sum_neg... heuristic_int,sum_neg... failed. Finding a loop... failed.