/export/starexec/sandbox/solver/bin/starexec_run_default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- MAYBE Input TRS: 1: a__sel(s(X),cons(Y,Z)) -> a__sel(mark(X),mark(Z)) 2: a__sel(0(),cons(X,Z)) -> mark(X) 3: a__first(0(),Z) -> nil() 4: a__first(s(X),cons(Y,Z)) -> cons(mark(Y),first(X,Z)) 5: a__from(X) -> cons(mark(X),from(s(X))) 6: a__sel1(s(X),cons(Y,Z)) -> a__sel1(mark(X),mark(Z)) 7: a__sel1(0(),cons(X,Z)) -> a__quote(X) 8: a__first1(0(),Z) -> nil1() 9: a__first1(s(X),cons(Y,Z)) -> cons1(a__quote(Y),a__first1(mark(X),mark(Z))) 10: a__quote(0()) -> 01() 11: a__quote1(cons(X,Z)) -> cons1(a__quote(X),a__quote1(Z)) 12: a__quote1(nil()) -> nil1() 13: a__quote(s(X)) -> s1(a__quote(X)) 14: a__quote(sel(X,Z)) -> a__sel1(mark(X),mark(Z)) 15: a__quote1(first(X,Z)) -> a__first1(mark(X),mark(Z)) 16: a__unquote(01()) -> 0() 17: a__unquote(s1(X)) -> s(a__unquote(mark(X))) 18: a__unquote1(nil1()) -> nil() 19: a__unquote1(cons1(X,Z)) -> a__fcons(a__unquote(mark(X)),a__unquote1(mark(Z))) 20: a__fcons(X,Z) -> cons(mark(X),Z) 21: mark(sel(X1,X2)) -> a__sel(mark(X1),mark(X2)) 22: mark(first(X1,X2)) -> a__first(mark(X1),mark(X2)) 23: mark(from(X)) -> a__from(mark(X)) 24: mark(sel1(X1,X2)) -> a__sel1(mark(X1),mark(X2)) 25: mark(quote(X)) -> a__quote(X) 26: mark(first1(X1,X2)) -> a__first1(mark(X1),mark(X2)) 27: mark(quote1(X)) -> a__quote1(X) 28: mark(unquote(X)) -> a__unquote(mark(X)) 29: mark(unquote1(X)) -> a__unquote1(mark(X)) 30: mark(fcons(X1,X2)) -> a__fcons(mark(X1),mark(X2)) 31: mark(s(X)) -> s(mark(X)) 32: mark(cons(X1,X2)) -> cons(mark(X1),X2) 33: mark(0()) -> 0() 34: mark(nil()) -> nil() 35: mark(nil1()) -> nil1() 36: mark(cons1(X1,X2)) -> cons1(mark(X1),mark(X2)) 37: mark(01()) -> 01() 38: mark(s1(X)) -> s1(mark(X)) 39: a__sel(X1,X2) -> sel(X1,X2) 40: a__first(X1,X2) -> first(X1,X2) 41: a__from(X) -> from(X) 42: a__sel1(X1,X2) -> sel1(X1,X2) 43: a__quote(X) -> quote(X) 44: a__first1(X1,X2) -> first1(X1,X2) 45: a__quote1(X) -> quote1(X) 46: a__unquote(X) -> unquote(X) 47: a__unquote1(X) -> unquote1(X) 48: a__fcons(X1,X2) -> fcons(X1,X2) Number of strict rules: 48 Direct poly ... failed. Freezing ... failed. Dependency Pairs: #1: #a__sel(0(),cons(X,Z)) -> #mark(X) #2: #mark(unquote1(X)) -> #a__unquote1(mark(X)) #3: #mark(unquote1(X)) -> #mark(X) #4: #mark(s1(X)) -> #mark(X) #5: #a__sel1(s(X),cons(Y,Z)) -> #a__sel1(mark(X),mark(Z)) #6: #a__sel1(s(X),cons(Y,Z)) -> #mark(X) #7: #a__sel1(s(X),cons(Y,Z)) -> #mark(Z) #8: #a__quote(s(X)) -> #a__quote(X) #9: #a__first1(s(X),cons(Y,Z)) -> #a__quote(Y) #10: #a__first1(s(X),cons(Y,Z)) -> #a__first1(mark(X),mark(Z)) #11: #a__first1(s(X),cons(Y,Z)) -> #mark(X) #12: #a__first1(s(X),cons(Y,Z)) -> #mark(Z) #13: #a__quote1(cons(X,Z)) -> #a__quote(X) #14: #a__quote1(cons(X,Z)) -> #a__quote1(Z) #15: #mark(sel1(X1,X2)) -> #a__sel1(mark(X1),mark(X2)) #16: #mark(sel1(X1,X2)) -> #mark(X1) #17: #mark(sel1(X1,X2)) -> #mark(X2) #18: #mark(from(X)) -> #a__from(mark(X)) #19: #mark(from(X)) -> #mark(X) #20: #mark(s(X)) -> #mark(X) #21: #a__quote(sel(X,Z)) -> #a__sel1(mark(X),mark(Z)) #22: #a__quote(sel(X,Z)) -> #mark(X) #23: #a__quote(sel(X,Z)) -> #mark(Z) #24: #mark(fcons(X1,X2)) -> #a__fcons(mark(X1),mark(X2)) #25: #mark(fcons(X1,X2)) -> #mark(X1) #26: #mark(fcons(X1,X2)) -> #mark(X2) #27: #mark(quote(X)) -> #a__quote(X) #28: #a__fcons(X,Z) -> #mark(X) #29: #a__sel1(0(),cons(X,Z)) -> #a__quote(X) #30: #a__from(X) -> #mark(X) #31: #mark(unquote(X)) -> #a__unquote(mark(X)) #32: #mark(unquote(X)) -> #mark(X) #33: #mark(first(X1,X2)) -> #a__first(mark(X1),mark(X2)) #34: #mark(first(X1,X2)) -> #mark(X1) #35: #mark(first(X1,X2)) -> #mark(X2) #36: #mark(quote1(X)) -> #a__quote1(X) #37: #a__unquote(s1(X)) -> #a__unquote(mark(X)) #38: #a__unquote(s1(X)) -> #mark(X) #39: #mark(cons(X1,X2)) -> #mark(X1) #40: #a__unquote1(cons1(X,Z)) -> #a__fcons(a__unquote(mark(X)),a__unquote1(mark(Z))) #41: #a__unquote1(cons1(X,Z)) -> #a__unquote(mark(X)) #42: #a__unquote1(cons1(X,Z)) -> #mark(X) #43: #a__unquote1(cons1(X,Z)) -> #a__unquote1(mark(Z)) #44: #a__unquote1(cons1(X,Z)) -> #mark(Z) #45: #mark(first1(X1,X2)) -> #a__first1(mark(X1),mark(X2)) #46: #mark(first1(X1,X2)) -> #mark(X1) #47: #mark(first1(X1,X2)) -> #mark(X2) #48: #mark(cons1(X1,X2)) -> #mark(X1) #49: #mark(cons1(X1,X2)) -> #mark(X2) #50: #mark(sel(X1,X2)) -> #a__sel(mark(X1),mark(X2)) #51: #mark(sel(X1,X2)) -> #mark(X1) #52: #mark(sel(X1,X2)) -> #mark(X2) #53: #a__sel(s(X),cons(Y,Z)) -> #a__sel(mark(X),mark(Z)) #54: #a__sel(s(X),cons(Y,Z)) -> #mark(X) #55: #a__sel(s(X),cons(Y,Z)) -> #mark(Z) #56: #a__quote1(first(X,Z)) -> #a__first1(mark(X),mark(Z)) #57: #a__quote1(first(X,Z)) -> #mark(X) #58: #a__quote1(first(X,Z)) -> #mark(Z) #59: #a__first(s(X),cons(Y,Z)) -> #mark(Y) Number of SCCs: 1, DPs: 59 SCC { #1..59 } Sum... Max... succeeded. #a__quote(x1) w: (59824 + x1) 01() w: (1) s(x1) w: (x1) unquote1(x1) w: (29538 + x1) a__first1(x1,x2) w: (max{28285 + x2, 28284 + x1}) #a__from(x1) w: (31599 + x1) #a__fcons(x1,x2) w: (max{0, 31599 + x1}) #a__first(x1,x2) w: (max{31599 + x2, 0}) a__from(x1) w: (55 + x1) #a__first1(x1,x2) w: (max{59825 + x2, 59881 + x1}) #a__unquote(x1) w: (31599 + x1) a__unquote(x1) w: (2 + x1) a__sel1(x1,x2) w: (max{28226 + x2, 35108 + x1}) a__fcons(x1,x2) w: (max{x2, 29595 + x1}) cons1(x1,x2) w: (max{x2, 59 + x1}) #mark(x1) w: (31598 + x1) 0() w: (3) a__quote(x1) w: (28227 + x1) from(x1) w: (55 + x1) sel(x1,x2) w: (max{6882 + x2, 6881 + x1}) #a__sel1(x1,x2) w: (max{59823 + x2, 59822 + x1}) nil() w: (55) quote1(x1) w: (28231 + x1) #a__quote1(x1) w: (59828 + x1) #a__sel(x1,x2) w: (max{38478 + x2, 38477 + x1}) mark(x1) w: (x1) nil1() w: (28286) a__sel(x1,x2) w: (max{6882 + x2, 6881 + x1}) first(x1,x2) w: (max{54 + x2, 54 + x1}) a__first(x1,x2) w: (max{54 + x2, 54 + x1}) first1(x1,x2) w: (max{28285 + x2, 28284 + x1}) a__unquote1(x1) w: (29538 + x1) #a__unquote1(x1) w: (61135 + x1) quote(x1) w: (28227 + x1) cons(x1,x2) w: (max{x2, 55 + x1}) sel1(x1,x2) w: (max{28226 + x2, 35108 + x1}) a__quote1(x1) w: (28231 + x1) s1(x1) w: (x1) unquote(x1) w: (2 + x1) fcons(x1,x2) w: (max{x2, 29595 + x1}) USABLE RULES: { 1..48 } Removed DPs: #1..3 #6 #7 #9 #11..13 #15..19 #21..25 #27..36 #38..42 #44..48 #50..52 #54..59 Number of SCCs: 8, DPs: 11 SCC { #8 } Sum... succeeded. #a__quote(x1) w: (1 + x1) 01() w: (0) s(x1) w: (2 + x1) unquote1(x1) w: (1) a__first1(x1,x2) w: (13507 + x2) #a__from(x1) w: (1) #a__fcons(x1,x2) w: (1) #a__first(x1,x2) w: (0) a__from(x1) w: (43902) #a__first1(x1,x2) w: (2) #a__unquote(x1) w: (1) a__unquote(x1) w: (19514) a__sel1(x1,x2) w: (7180 + x2) a__fcons(x1,x2) w: (19516) cons1(x1,x2) w: (1 + x2) #mark(x1) w: (1) 0() w: (19514) a__quote(x1) w: (19514 + x1) from(x1) w: (43903 + x1) sel(x1,x2) w: (7178 + x2) #a__sel1(x1,x2) w: (1) nil() w: (19515) quote1(x1) w: (33020) #a__quote1(x1) w: (1) #a__sel(x1,x2) w: (1) mark(x1) w: (19513) nil1() w: (33020) a__sel(x1,x2) w: (1 + x1) first(x1,x2) w: (19515 + x2 + x1) a__first(x1,x2) w: (19514) first1(x1,x2) w: (13508) a__unquote1(x1) w: (19515) #a__unquote1(x1) w: (1) quote(x1) w: (19515) cons(x1,x2) w: (4 + x2 + x1) sel1(x1,x2) w: (7181) a__quote1(x1) w: (33019) s1(x1) w: (19517) unquote(x1) w: (19514) fcons(x1,x2) w: (19517) USABLE RULES: { 16 18 46 47 } Removed DPs: #8 Number of SCCs: 7, DPs: 10 SCC { #37 } Sum... Max... QLPOpS... NegMaxSum... succeeded. #a__quote(x1) w: (0) 01() w: (1) s(x1) w: (max{0, 4 + x1}) unquote1(x1) w: (max{0, 1 + x1}) a__first1(x1,x2) w: (max{0, 8 + x2 + x1}) #a__from(x1) w: (0) #a__fcons(x1,x2) w: (0) #a__first(x1,x2) w: (0) a__from(x1) w: (max{0, 47566 + x1}) #a__first1(x1,x2) w: (0) #a__unquote(x1) w: (max{0, -2 + x1}) a__unquote(x1) w: (max{0, 3 + x1}) a__sel1(x1,x2) w: (max{0, 5 + x2 + x1}) a__fcons(x1,x2) w: (max{0, -4 + x2, -5 + x1}) cons1(x1,x2) w: (max{0, -4 + x2, 1 + x1}) #mark(x1) w: (0) 0() w: (1) a__quote(x1) w: (max{0, 1 + x1}) from(x1) w: (max{0, 47566 + x1}) sel(x1,x2) w: (max{0, 4 + x2 + x1}) #a__sel1(x1,x2) w: (0) nil() w: (1) quote1(x1) w: (max{0, 7 + x1}) #a__quote1(x1) w: (0) #a__sel(x1,x2) w: (0) mark(x1) w: (max{0, x1}) nil1() w: (1) a__sel(x1,x2) w: (max{0, 4 + x2 + x1}) first(x1,x2) w: (max{0, 5 + x2 + x1}) a__first(x1,x2) w: (max{0, 5 + x2 + x1}) first1(x1,x2) w: (max{0, 8 + x2 + x1}) a__unquote1(x1) w: (max{0, 1 + x1}) #a__unquote1(x1) w: (0) quote(x1) w: (max{0, 1 + x1}) cons(x1,x2) w: (max{0, -4 + x2, -5 + x1}) sel1(x1,x2) w: (max{0, 5 + x2 + x1}) a__quote1(x1) w: (max{0, 7 + x1}) s1(x1) w: (max{0, 4 + x1}) unquote(x1) w: (max{0, 3 + x1}) fcons(x1,x2) w: (max{0, -4 + x2, -5 + x1}) USABLE RULES: { 1..48 } Removed DPs: #37 Number of SCCs: 6, DPs: 9 SCC { #14 } Sum... succeeded. #a__quote(x1) w: (1) 01() w: (6) s(x1) w: (1 + x1) unquote1(x1) w: (2) a__first1(x1,x2) w: (33018 + x2) #a__from(x1) w: (1) #a__fcons(x1,x2) w: (1) #a__first(x1,x2) w: (0) a__from(x1) w: (43902 + x1) #a__first1(x1,x2) w: (2) #a__unquote(x1) w: (1) a__unquote(x1) w: (1 + x1) a__sel1(x1,x2) w: (9) a__fcons(x1,x2) w: (8) cons1(x1,x2) w: (1 + x2 + x1) #mark(x1) w: (1) 0() w: (8) a__quote(x1) w: (6 + x1) from(x1) w: (43903 + x1) sel(x1,x2) w: (2) #a__sel1(x1,x2) w: (1) nil() w: (33021) quote1(x1) w: (7) #a__quote1(x1) w: (1 + x1) #a__sel(x1,x2) w: (1) mark(x1) w: (5) nil1() w: (33019) a__sel(x1,x2) w: (1 + x1) first(x1,x2) w: (7 + x1) a__first(x1,x2) w: (6) first1(x1,x2) w: (33019 + x1) a__unquote1(x1) w: (1 + x1) #a__unquote1(x1) w: (1) quote(x1) w: (7) cons(x1,x2) w: (4 + x2 + x1) sel1(x1,x2) w: (10 + x2 + x1) a__quote1(x1) w: (6 + x1) s1(x1) w: (2 + x1) unquote(x1) w: (2) fcons(x1,x2) w: (9 + x1) USABLE RULES: { } Removed DPs: #14 Number of SCCs: 5, DPs: 8 SCC { #43 } Sum... Max... QLPOpS... NegMaxSum... QWPOpSMaxSum... 2D-Mat... sum_sum_int,sum_neg... heuristic_int,sum_neg... failed. Finding a loop... failed.