/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- MAYBE Input TRS: 1: min(x,0()) -> 0() 2: min(0(),y) -> 0() 3: min(s(x),s(y)) -> s(min(x,y)) 4: max(x,0()) -> x 5: max(0(),y) -> y 6: max(s(x),s(y)) -> s(max(x,y)) 7: -(x,0()) -> x 8: -(s(x),s(y)) -> -(x,y) 9: gcd(s(x),s(y)) -> gcd(-(s(max(x,y)),s(min(x,y))),s(min(x,y))) 10: gcd(s(x),0()) -> s(x) 11: gcd(0(),s(y)) -> s(y) Number of strict rules: 11 Direct poly ... failed. Freezing ... failed. Dependency Pairs: #1: #max(s(x),s(y)) -> #max(x,y) #2: #gcd(s(x),s(y)) -> #gcd(-(s(max(x,y)),s(min(x,y))),s(min(x,y))) #3: #gcd(s(x),s(y)) -> #-(s(max(x,y)),s(min(x,y))) #4: #gcd(s(x),s(y)) -> #max(x,y) #5: #gcd(s(x),s(y)) -> #min(x,y) #6: #gcd(s(x),s(y)) -> #min(x,y) #7: #min(s(x),s(y)) -> #min(x,y) #8: #-(s(x),s(y)) -> #-(x,y) Number of SCCs: 4, DPs: 4 SCC { #8 } Sum... succeeded. s(x1) w: (1 + x1) gcd(x1,x2) w: (0) #min(x1,x2) w: (0) 0() w: (0) max(x1,x2) w: (0) #max(x1,x2) w: (0) -(x1,x2) w: (0) min(x1,x2) w: (0) #-(x1,x2) w: (x2 + x1) #gcd(x1,x2) w: (0) USABLE RULES: { } Removed DPs: #8 Number of SCCs: 3, DPs: 3 SCC { #1 } Sum... succeeded. s(x1) w: (1 + x1) gcd(x1,x2) w: (0) #min(x1,x2) w: (0) 0() w: (0) max(x1,x2) w: (0) #max(x1,x2) w: (x2) -(x1,x2) w: (0) min(x1,x2) w: (0) #-(x1,x2) w: (0) #gcd(x1,x2) w: (0) USABLE RULES: { } Removed DPs: #1 Number of SCCs: 2, DPs: 2 SCC { #7 } Sum... succeeded. s(x1) w: (1 + x1) gcd(x1,x2) w: (0) #min(x1,x2) w: (x2) 0() w: (0) max(x1,x2) w: (0) #max(x1,x2) w: (0) -(x1,x2) w: (0) min(x1,x2) w: (0) #-(x1,x2) w: (0) #gcd(x1,x2) w: (0) USABLE RULES: { } Removed DPs: #7 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.