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