/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- MAYBE Input TRS: 1: active(h(X)) -> mark(g(X,X)) 2: active(g(a(),X)) -> mark(f(b(),X)) 3: active(f(X,X)) -> mark(h(a())) 4: active(a()) -> mark(b()) 5: mark(h(X)) -> active(h(mark(X))) 6: mark(g(X1,X2)) -> active(g(mark(X1),X2)) 7: mark(a()) -> active(a()) 8: mark(f(X1,X2)) -> active(f(mark(X1),X2)) 9: mark(b()) -> active(b()) 10: h(mark(X)) -> h(X) 11: h(active(X)) -> h(X) 12: g(mark(X1),X2) -> g(X1,X2) 13: g(X1,mark(X2)) -> g(X1,X2) 14: g(active(X1),X2) -> g(X1,X2) 15: g(X1,active(X2)) -> g(X1,X2) 16: f(mark(X1),X2) -> f(X1,X2) 17: f(X1,mark(X2)) -> f(X1,X2) 18: f(active(X1),X2) -> f(X1,X2) 19: f(X1,active(X2)) -> f(X1,X2) Number of strict rules: 19 Direct poly ... failed. Freezing ... failed. Dependency Pairs: #1: #active(g(a(),X)) -> #mark(f(b(),X)) #2: #active(g(a(),X)) -> #f(b(),X) #3: #mark(g(X1,X2)) -> #active(g(mark(X1),X2)) #4: #mark(g(X1,X2)) -> #g(mark(X1),X2) #5: #mark(g(X1,X2)) -> #mark(X1) #6: #g(X1,mark(X2)) -> #g(X1,X2) #7: #mark(b()) -> #active(b()) #8: #h(active(X)) -> #h(X) #9: #g(mark(X1),X2) -> #g(X1,X2) #10: #g(active(X1),X2) -> #g(X1,X2) #11: #mark(a()) -> #active(a()) #12: #h(mark(X)) -> #h(X) #13: #mark(h(X)) -> #active(h(mark(X))) #14: #mark(h(X)) -> #h(mark(X)) #15: #mark(h(X)) -> #mark(X) #16: #f(X1,mark(X2)) -> #f(X1,X2) #17: #f(X1,active(X2)) -> #f(X1,X2) #18: #f(mark(X1),X2) -> #f(X1,X2) #19: #active(f(X,X)) -> #mark(h(a())) #20: #active(f(X,X)) -> #h(a()) #21: #active(h(X)) -> #mark(g(X,X)) #22: #active(h(X)) -> #g(X,X) #23: #mark(f(X1,X2)) -> #active(f(mark(X1),X2)) #24: #mark(f(X1,X2)) -> #f(mark(X1),X2) #25: #mark(f(X1,X2)) -> #mark(X1) #26: #g(X1,active(X2)) -> #g(X1,X2) #27: #active(a()) -> #mark(b()) #28: #f(active(X1),X2) -> #f(X1,X2) Number of SCCs: 4, DPs: 19 SCC { #8 #12 } Sum... succeeded. h(x1) w: (0) a() w: (0) b() w: (0) f(x1,x2) w: (0) #mark(x1) w: (0) #h(x1) w: (x1) mark(x1) w: (1 + x1) #f(x1,x2) w: (0) #g(x1,x2) w: (0) active(x1) w: (1 + x1) #active(x1) w: (0) g(x1,x2) w: (0) USABLE RULES: { } Removed DPs: #8 #12 Number of SCCs: 3, DPs: 17 SCC { #6 #9 #10 #26 } Sum... succeeded. h(x1) w: (0) a() w: (0) b() w: (0) f(x1,x2) w: (0) #mark(x1) w: (0) #h(x1) w: (0) mark(x1) w: (1 + x1) #f(x1,x2) w: (0) #g(x1,x2) w: (x2) active(x1) w: (1 + x1) #active(x1) w: (0) g(x1,x2) w: (0) USABLE RULES: { } Removed DPs: #6 #26 Number of SCCs: 3, DPs: 15 SCC { #9 #10 } Sum... succeeded. h(x1) w: (0) a() w: (0) b() w: (0) f(x1,x2) w: (0) #mark(x1) w: (0) #h(x1) w: (0) mark(x1) w: (1 + x1) #f(x1,x2) w: (0) #g(x1,x2) w: (x1) active(x1) w: (1 + x1) #active(x1) w: (0) g(x1,x2) w: (0) USABLE RULES: { } Removed DPs: #9 #10 Number of SCCs: 2, DPs: 13 SCC { #16..18 #28 } Sum... succeeded. h(x1) w: (0) a() w: (0) b() w: (0) f(x1,x2) w: (0) #mark(x1) w: (0) #h(x1) w: (0) mark(x1) w: (1 + x1) #f(x1,x2) w: (x2) #g(x1,x2) w: (0) active(x1) w: (1 + x1) #active(x1) w: (0) g(x1,x2) w: (0) USABLE RULES: { } Removed DPs: #16 #17 Number of SCCs: 2, DPs: 11 SCC { #18 #28 } Sum... succeeded. h(x1) w: (0) a() w: (0) b() w: (0) f(x1,x2) w: (0) #mark(x1) w: (0) #h(x1) w: (0) mark(x1) w: (1 + x1) #f(x1,x2) w: (x1) #g(x1,x2) w: (0) active(x1) w: (1 + x1) #active(x1) w: (0) g(x1,x2) w: (0) USABLE RULES: { } Removed DPs: #18 #28 Number of SCCs: 1, DPs: 9 SCC { #1 #3 #5 #13 #15 #19 #21 #23 #25 } Sum... succeeded. h(x1) w: (20977 + x1) a() w: (31892) b() w: (0) f(x1,x2) w: (52869 + x1) #mark(x1) w: (x1) #h(x1) w: (0) mark(x1) w: (x1) #f(x1,x2) w: (0) #g(x1,x2) w: (0) active(x1) w: (x1) #active(x1) w: (x1) g(x1,x2) w: (20977 + x1) USABLE RULES: { 1..19 } Removed DPs: #5 #15 #25 Number of SCCs: 1, DPs: 6 SCC { #1 #3 #13 #19 #21 #23 } Sum... Max... QLPOpS... NegMaxSum... QWPOpSMaxSum... 2D-Mat... sum_sum_int,sum_neg... heuristic_int,sum_neg... failed. Finding a loop... failed.