/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- MAYBE Input TRS: 1: minus(s(x),y) -> if(gt(s(x),y),x,y) 2: if(true(),x,y) -> s(minus(x,y)) 3: if(false(),x,y) -> 0() 4: gcd(x,y) -> if1(ge(x,y),x,y) 5: if1(true(),x,y) -> if2(gt(y,0()),x,y) 6: if1(false(),x,y) -> if3(gt(x,0()),x,y) 7: if2(true(),x,y) -> gcd(minus(x,y),y) 8: if2(false(),x,y) -> x 9: if3(true(),x,y) -> gcd(x,minus(y,x)) 10: if3(false(),x,y) -> y 11: gt(0(),y) -> false() 12: gt(s(x),0()) -> true() 13: gt(s(x),s(y)) -> gt(x,y) 14: ge(x,0()) -> true() 15: ge(0(),s(x)) -> false() 16: ge(s(x),s(y)) -> ge(x,y) Number of strict rules: 16 Direct poly ... failed. Freezing gt 1: minus(s(x),y) -> if(gt❆1_s(x,y),x,y) 2: if(true(),x,y) -> s(minus(x,y)) 3: if(false(),x,y) -> 0() 4: gcd(x,y) -> if1(ge(x,y),x,y) 5: if1(true(),x,y) -> if2(gt(y,0()),x,y) 6: if1(false(),x,y) -> if3(gt(x,0()),x,y) 7: if2(true(),x,y) -> gcd(minus(x,y),y) 8: if2(false(),x,y) -> x 9: if3(true(),x,y) -> gcd(x,minus(y,x)) 10: if3(false(),x,y) -> y 11: gt❆1_0(y) -> false() 12: gt❆1_s(x,0()) -> true() 13: gt❆1_s(x,s(y)) -> gt(x,y) 14: ge(x,0()) -> true() 15: ge(0(),s(x)) -> false() 16: ge(s(x),s(y)) -> ge(x,y) 17: gt(0(),_1) ->= gt❆1_0(_1) 18: gt(s(_1),_2) ->= gt❆1_s(_1,_2) Number of strict rules: 16 Direct poly ... failed. Dependency Pairs: #1: #if(true(),x,y) -> #minus(x,y) #2: #if1(false(),x,y) -> #if3(gt(x,0()),x,y) #3: #if1(false(),x,y) -> #gt(x,0()) #4: #gt❆1_s(x,s(y)) -> #gt(x,y) #5: #if3(true(),x,y) -> #gcd(x,minus(y,x)) #6: #if3(true(),x,y) -> #minus(y,x) #7: #if2(true(),x,y) -> #gcd(minus(x,y),y) #8: #if2(true(),x,y) -> #minus(x,y) #9: #if1(true(),x,y) -> #if2(gt(y,0()),x,y) #10: #if1(true(),x,y) -> #gt(y,0()) #11: #gt(0(),_1) ->? #gt❆1_0(_1) #12: #ge(s(x),s(y)) -> #ge(x,y) #13: #minus(s(x),y) -> #if(gt❆1_s(x,y),x,y) #14: #minus(s(x),y) -> #gt❆1_s(x,y) #15: #gcd(x,y) -> #if1(ge(x,y),x,y) #16: #gcd(x,y) -> #ge(x,y) #17: #gt(s(_1),_2) ->? #gt❆1_s(_1,_2) Number of SCCs: 4, DPs: 10 SCC { #12 } Sum... succeeded. s(x1) w: (1 + x1) gt❆1_0(x1) w: (0) gt(x1,x2) w: (0) minus(x1,x2) w: (0) gcd(x1,x2) w: (0) if1(x1,x2,x3) w: (0) false() w: (0) #ge(x1,x2) w: (x2 + x1) true() w: (0) #if1(x1,x2,x3) w: (0) if2(x1,x2,x3) w: (0) #if3(x1,x2,x3) w: (0) if(x1,x2,x3) w: (0) 0() w: (0) ge(x1,x2) w: (0) #gt❆1_0(x1) w: (0) #gt(x1,x2) w: (0) #gt❆1_s(x1,x2) w: (0) #minus(x1,x2) w: (0) if3(x1,x2,x3) w: (0) #if(x1,x2,x3) w: (0) gt❆1_s(x1,x2) w: (0) #if2(x1,x2,x3) w: (0) #gcd(x1,x2) w: (0) USABLE RULES: { } Removed DPs: #12 Number of SCCs: 3, DPs: 9 SCC { #4 #17 } Sum... succeeded. s(x1) w: (2 + x1) gt❆1_0(x1) w: (0) gt(x1,x2) w: (0) minus(x1,x2) w: (0) gcd(x1,x2) w: (0) if1(x1,x2,x3) w: (0) false() w: (0) #ge(x1,x2) w: (0) true() w: (0) #if1(x1,x2,x3) w: (0) if2(x1,x2,x3) w: (0) #if3(x1,x2,x3) w: (0) if(x1,x2,x3) w: (0) 0() w: (0) ge(x1,x2) w: (0) #gt❆1_0(x1) w: (0) #gt(x1,x2) w: (1 + x2) #gt❆1_s(x1,x2) w: (x2) #minus(x1,x2) w: (0) if3(x1,x2,x3) w: (0) #if(x1,x2,x3) w: (0) gt❆1_s(x1,x2) w: (0) #if2(x1,x2,x3) w: (0) #gcd(x1,x2) w: (0) USABLE RULES: { } Removed DPs: #4 #17 Number of SCCs: 2, DPs: 7 SCC { #1 #13 } Sum... succeeded. s(x1) w: (2 + x1) gt❆1_0(x1) w: (42) gt(x1,x2) w: (40 + x2 + x1) minus(x1,x2) w: (0) gcd(x1,x2) w: (0) if1(x1,x2,x3) w: (0) false() w: (43) #ge(x1,x2) w: (0) true() w: (40) #if1(x1,x2,x3) w: (0) if2(x1,x2,x3) w: (0) #if3(x1,x2,x3) w: (0) if(x1,x2,x3) w: (0) 0() w: (1) ge(x1,x2) w: (0) #gt❆1_0(x1) w: (0) #gt(x1,x2) w: (1) #gt❆1_s(x1,x2) w: (0) #minus(x1,x2) w: (x2 + x1) if3(x1,x2,x3) w: (0) #if(x1,x2,x3) w: (1 + x3 + x2) gt❆1_s(x1,x2) w: (39) #if2(x1,x2,x3) w: (0) #gcd(x1,x2) w: (0) USABLE RULES: { } Removed DPs: #1 #13 Number of SCCs: 1, DPs: 5 SCC { #2 #5 #7 #9 #15 } Sum... Max... QLPOpS... NegMaxSum... QWPOpSMaxSum... 2D-Mat... sum_sum_int,sum_neg... heuristic_int,sum_neg... failed. Finding a loop... failed.