Input TRS: 1: active(sel(s(X),cons(Y,Z))) -> mark(sel(X,Z)) 2: active(sel(0(),cons(X,Z))) -> mark(X) 3: active(first(0(),Z)) -> mark(nil()) 4: active(first(s(X),cons(Y,Z))) -> mark(cons(Y,first(X,Z))) 5: active(from(X)) -> mark(cons(X,from(s(X)))) 6: active(sel1(s(X),cons(Y,Z))) -> mark(sel1(X,Z)) 7: active(sel1(0(),cons(X,Z))) -> mark(quote(X)) 8: active(first1(0(),Z)) -> mark(nil1()) 9: active(first1(s(X),cons(Y,Z))) -> mark(cons1(quote(Y),first1(X,Z))) 10: active(quote(0())) -> mark(01()) 11: active(quote1(cons(X,Z))) -> mark(cons1(quote(X),quote1(Z))) 12: active(quote1(nil())) -> mark(nil1()) 13: active(quote(s(X))) -> mark(s1(quote(X))) 14: active(quote(sel(X,Z))) -> mark(sel1(X,Z)) 15: active(quote1(first(X,Z))) -> mark(first1(X,Z)) 16: active(unquote(01())) -> mark(0()) 17: active(unquote(s1(X))) -> mark(s(unquote(X))) 18: active(unquote1(nil1())) -> mark(nil()) 19: active(unquote1(cons1(X,Z))) -> mark(fcons(unquote(X),unquote1(Z))) 20: active(fcons(X,Z)) -> mark(cons(X,Z)) 21: mark(sel(X1,X2)) -> active(sel(mark(X1),mark(X2))) 22: mark(s(X)) -> active(s(mark(X))) 23: mark(cons(X1,X2)) -> active(cons(mark(X1),X2)) 24: mark(0()) -> active(0()) 25: mark(first(X1,X2)) -> active(first(mark(X1),mark(X2))) 26: mark(nil()) -> active(nil()) 27: mark(from(X)) -> active(from(mark(X))) 28: mark(sel1(X1,X2)) -> active(sel1(mark(X1),mark(X2))) 29: mark(quote(X)) -> active(quote(X)) 30: mark(first1(X1,X2)) -> active(first1(mark(X1),mark(X2))) 31: mark(nil1()) -> active(nil1()) 32: mark(cons1(X1,X2)) -> active(cons1(mark(X1),mark(X2))) 33: mark(01()) -> active(01()) 34: mark(quote1(X)) -> active(quote1(X)) 35: mark(s1(X)) -> active(s1(mark(X))) 36: mark(unquote(X)) -> active(unquote(mark(X))) 37: mark(unquote1(X)) -> active(unquote1(mark(X))) 38: mark(fcons(X1,X2)) -> active(fcons(mark(X1),mark(X2))) 39: sel(mark(X1),X2) -> sel(X1,X2) 40: sel(X1,mark(X2)) -> sel(X1,X2) 41: sel(active(X1),X2) -> sel(X1,X2) 42: sel(X1,active(X2)) -> sel(X1,X2) 43: s(mark(X)) -> s(X) 44: s(active(X)) -> s(X) 45: cons(mark(X1),X2) -> cons(X1,X2) 46: cons(X1,mark(X2)) -> cons(X1,X2) 47: cons(active(X1),X2) -> cons(X1,X2) 48: cons(X1,active(X2)) -> cons(X1,X2) 49: first(mark(X1),X2) -> first(X1,X2) 50: first(X1,mark(X2)) -> first(X1,X2) 51: first(active(X1),X2) -> first(X1,X2) 52: first(X1,active(X2)) -> first(X1,X2) 53: from(mark(X)) -> from(X) 54: from(active(X)) -> from(X) 55: sel1(mark(X1),X2) -> sel1(X1,X2) 56: sel1(X1,mark(X2)) -> sel1(X1,X2) 57: sel1(active(X1),X2) -> sel1(X1,X2) 58: sel1(X1,active(X2)) -> sel1(X1,X2) 59: quote(mark(X)) -> quote(X) 60: quote(active(X)) -> quote(X) 61: first1(mark(X1),X2) -> first1(X1,X2) 62: first1(X1,mark(X2)) -> first1(X1,X2) 63: first1(active(X1),X2) -> first1(X1,X2) 64: first1(X1,active(X2)) -> first1(X1,X2) 65: cons1(mark(X1),X2) -> cons1(X1,X2) 66: cons1(X1,mark(X2)) -> cons1(X1,X2) 67: cons1(active(X1),X2) -> cons1(X1,X2) 68: cons1(X1,active(X2)) -> cons1(X1,X2) 69: quote1(mark(X)) -> quote1(X) 70: quote1(active(X)) -> quote1(X) 71: s1(mark(X)) -> s1(X) 72: s1(active(X)) -> s1(X) 73: unquote(mark(X)) -> unquote(X) 74: unquote(active(X)) -> unquote(X) 75: unquote1(mark(X)) -> unquote1(X) 76: unquote1(active(X)) -> unquote1(X) 77: fcons(mark(X1),X2) -> fcons(X1,X2) 78: fcons(X1,mark(X2)) -> fcons(X1,X2) 79: fcons(active(X1),X2) -> fcons(X1,X2) 80: fcons(X1,active(X2)) -> fcons(X1,X2) Number of strict rules: 80 Direct Order(PosReal,>,Poly) ... failed. Freezing ... failed. Dependency Pairs: #1: #active(sel(0(),cons(X,Z))) -> #mark(X) #2: #s(mark(X)) -> #s(X) #3: #mark(quote(X)) -> #active(quote(X)) #4: #mark(s1(X)) -> #active(s1(mark(X))) #5: #mark(s1(X)) -> #s1(mark(X)) #6: #mark(s1(X)) -> #mark(X) #7: #cons1(X1,mark(X2)) -> #cons1(X1,X2) #8: #cons(X1,mark(X2)) -> #cons(X1,X2) #9: #sel(X1,active(X2)) -> #sel(X1,X2) #10: #sel(active(X1),X2) -> #sel(X1,X2) #11: #mark(unquote1(X)) -> #active(unquote1(mark(X))) #12: #mark(unquote1(X)) -> #unquote1(mark(X)) #13: #mark(unquote1(X)) -> #mark(X) #14: #unquote(mark(X)) -> #unquote(X) #15: #cons(active(X1),X2) -> #cons(X1,X2) #16: #from(mark(X)) -> #from(X) #17: #s1(mark(X)) -> #s1(X) #18: #cons(X1,active(X2)) -> #cons(X1,X2) #19: #unquote1(mark(X)) -> #unquote1(X) #20: #unquote(active(X)) -> #unquote(X) #21: #sel1(X1,active(X2)) -> #sel1(X1,X2) #22: #first1(mark(X1),X2) -> #first1(X1,X2) #23: #mark(fcons(X1,X2)) -> #active(fcons(mark(X1),mark(X2))) #24: #mark(fcons(X1,X2)) -> #fcons(mark(X1),mark(X2)) #25: #mark(fcons(X1,X2)) -> #mark(X1) #26: #mark(fcons(X1,X2)) -> #mark(X2) #27: #active(sel1(s(X),cons(Y,Z))) -> #mark(sel1(X,Z)) #28: #active(sel1(s(X),cons(Y,Z))) -> #sel1(X,Z) #29: #quote(mark(X)) -> #quote(X) #30: #sel1(mark(X1),X2) -> #sel1(X1,X2) #31: #cons1(active(X1),X2) -> #cons1(X1,X2) #32: #sel(X1,mark(X2)) -> #sel(X1,X2) #33: #first(active(X1),X2) -> #first(X1,X2) #34: #active(quote(s(X))) -> #mark(s1(quote(X))) #35: #active(quote(s(X))) -> #s1(quote(X)) #36: #active(quote(s(X))) -> #quote(X) #37: #active(first1(s(X),cons(Y,Z))) -> #mark(cons1(quote(Y),first1(X,Z))) #38: #active(first1(s(X),cons(Y,Z))) -> #cons1(quote(Y),first1(X,Z)) #39: #active(first1(s(X),cons(Y,Z))) -> #quote(Y) #40: #active(first1(s(X),cons(Y,Z))) -> #first1(X,Z) #41: #active(quote1(cons(X,Z))) -> #mark(cons1(quote(X),quote1(Z))) #42: #active(quote1(cons(X,Z))) -> #cons1(quote(X),quote1(Z)) #43: #active(quote1(cons(X,Z))) -> #quote(X) #44: #active(quote1(cons(X,Z))) -> #quote1(Z) #45: #sel1(active(X1),X2) -> #sel1(X1,X2) #46: #unquote1(active(X)) -> #unquote1(X) #47: #mark(0()) -> #active(0()) #48: #quote1(active(X)) -> #quote1(X) #49: #mark(cons(X1,X2)) -> #active(cons(mark(X1),X2)) #50: #mark(cons(X1,X2)) -> #cons(mark(X1),X2) #51: #mark(cons(X1,X2)) -> #mark(X1) #52: #fcons(X1,mark(X2)) -> #fcons(X1,X2) #53: #cons(mark(X1),X2) -> #cons(X1,X2) #54: #quote1(mark(X)) -> #quote1(X) #55: #active(quote1(nil())) -> #mark(nil1()) #56: #mark(nil1()) -> #active(nil1()) #57: #fcons(active(X1),X2) -> #fcons(X1,X2) #58: #sel1(X1,mark(X2)) -> #sel1(X1,X2) #59: #active(quote(sel(X,Z))) -> #mark(sel1(X,Z)) #60: #active(quote(sel(X,Z))) -> #sel1(X,Z) #61: #first1(X1,mark(X2)) -> #first1(X1,X2) #62: #mark(first1(X1,X2)) -> #active(first1(mark(X1),mark(X2))) #63: #mark(first1(X1,X2)) -> #first1(mark(X1),mark(X2)) #64: #mark(first1(X1,X2)) -> #mark(X1) #65: #mark(first1(X1,X2)) -> #mark(X2) #66: #first(X1,active(X2)) -> #first(X1,X2) #67: #first(mark(X1),X2) -> #first(X1,X2) #68: #mark(first(X1,X2)) -> #active(first(mark(X1),mark(X2))) #69: #mark(first(X1,X2)) -> #first(mark(X1),mark(X2)) #70: #mark(first(X1,X2)) -> #mark(X1) #71: #mark(first(X1,X2)) -> #mark(X2) #72: #active(fcons(X,Z)) -> #mark(cons(X,Z)) #73: #active(fcons(X,Z)) -> #cons(X,Z) #74: #active(sel1(0(),cons(X,Z))) -> #mark(quote(X)) #75: #active(sel1(0(),cons(X,Z))) -> #quote(X) #76: #sel(mark(X1),X2) -> #sel(X1,X2) #77: #active(quote(0())) -> #mark(01()) #78: #first1(X1,active(X2)) -> #first1(X1,X2) #79: #mark(01()) -> #active(01()) #80: #s1(active(X)) -> #s1(X) #81: #active(from(X)) -> #mark(cons(X,from(s(X)))) #82: #active(from(X)) -> #cons(X,from(s(X))) #83: #active(from(X)) -> #from(s(X)) #84: #active(from(X)) -> #s(X) #85: #s(active(X)) -> #s(X) #86: #cons1(mark(X1),X2) -> #cons1(X1,X2) #87: #mark(sel1(X1,X2)) -> #active(sel1(mark(X1),mark(X2))) #88: #mark(sel1(X1,X2)) -> #sel1(mark(X1),mark(X2)) #89: #mark(sel1(X1,X2)) -> #mark(X1) #90: #mark(sel1(X1,X2)) -> #mark(X2) #91: #mark(s(X)) -> #active(s(mark(X))) #92: #mark(s(X)) -> #s(mark(X)) #93: #mark(s(X)) -> #mark(X) #94: #mark(quote1(X)) -> #active(quote1(X)) #95: #mark(from(X)) -> #active(from(mark(X))) #96: #mark(from(X)) -> #from(mark(X)) #97: #mark(from(X)) -> #mark(X) #98: #quote(active(X)) -> #quote(X) #99: #active(unquote(s1(X))) -> #mark(s(unquote(X))) #100: #active(unquote(s1(X))) -> #s(unquote(X)) #101: #active(unquote(s1(X))) -> #unquote(X) #102: #mark(cons1(X1,X2)) -> #active(cons1(mark(X1),mark(X2))) #103: #mark(cons1(X1,X2)) -> #cons1(mark(X1),mark(X2)) #104: #mark(cons1(X1,X2)) -> #mark(X1) #105: #mark(cons1(X1,X2)) -> #mark(X2) #106: #active(unquote1(cons1(X,Z))) -> #mark(fcons(unquote(X),unquote1(Z))) #107: #active(unquote1(cons1(X,Z))) -> #fcons(unquote(X),unquote1(Z)) #108: #active(unquote1(cons1(X,Z))) -> #unquote(X) #109: #active(unquote1(cons1(X,Z))) -> #unquote1(Z) #110: #first1(active(X1),X2) -> #first1(X1,X2) #111: #mark(nil()) -> #active(nil()) #112: #cons1(X1,active(X2)) -> #cons1(X1,X2) #113: #mark(unquote(X)) -> #active(unquote(mark(X))) #114: #mark(unquote(X)) -> #unquote(mark(X)) #115: #mark(unquote(X)) -> #mark(X) #116: #mark(sel(X1,X2)) -> #active(sel(mark(X1),mark(X2))) #117: #mark(sel(X1,X2)) -> #sel(mark(X1),mark(X2)) #118: #mark(sel(X1,X2)) -> #mark(X1) #119: #mark(sel(X1,X2)) -> #mark(X2) #120: #active(unquote(01())) -> #mark(0()) #121: #active(first(0(),Z)) -> #mark(nil()) #122: #fcons(mark(X1),X2) -> #fcons(X1,X2) #123: #active(sel(s(X),cons(Y,Z))) -> #mark(sel(X,Z)) #124: #active(sel(s(X),cons(Y,Z))) -> #sel(X,Z) #125: #from(active(X)) -> #from(X) #126: #active(first1(0(),Z)) -> #mark(nil1()) #127: #active(quote1(first(X,Z))) -> #mark(first1(X,Z)) #128: #active(quote1(first(X,Z))) -> #first1(X,Z) #129: #active(first(s(X),cons(Y,Z))) -> #mark(cons(Y,first(X,Z))) #130: #active(first(s(X),cons(Y,Z))) -> #cons(Y,first(X,Z)) #131: #active(first(s(X),cons(Y,Z))) -> #first(X,Z) #132: #fcons(X1,active(X2)) -> #fcons(X1,X2) #133: #first(X1,mark(X2)) -> #first(X1,X2) #134: #active(unquote1(nil1())) -> #mark(nil()) Number of SCCs: 15, DPs: 84, edges: 711 SCC { #14 #20 } Removing DPs: Order(PosReal,>,Sum)... succeeded. 01() weight: 0 #cons(x1,x2) weight: 0 s(x1) weight: 0 unquote1(x1) weight: 0 #quote1(x1) weight: 0 #cons1(x1,x2) weight: 0 #unquote1(x1) weight: 0 #fcons(x1,x2) weight: 0 #first1(x1,x2) weight: 0 cons1(x1,x2) weight: 0 #mark(x1) weight: 0 0() weight: 0 #sel(x1,x2) weight: 0 sel(x1,x2) weight: 0 from(x1) weight: 0 #s(x1) weight: 0 #first(x1,x2) weight: 0 nil() weight: 0 #sel1(x1,x2) weight: 0 quote1(x1) weight: 0 mark(x1) weight: (/ 1 2) + x1 nil1() weight: 0 first(x1,x2) weight: 0 first1(x1,x2) weight: 0 #unquote(x1) weight: x1 #from(x1) weight: 0 active(x1) weight: (/ 1 2) + x1 quote(x1) weight: 0 cons(x1,x2) weight: 0 #active(x1) weight: 0 #quote(x1) weight: 0 #s1(x1) weight: 0 sel1(x1,x2) weight: 0 s1(x1) weight: 0 unquote(x1) weight: 0 fcons(x1,x2) weight: 0 Usable rules: { } Removed DPs: #14 #20 Number of SCCs: 14, DPs: 82, edges: 707 SCC { #2 #85 } Removing DPs: Order(PosReal,>,Sum)... succeeded. 01() weight: 0 #cons(x1,x2) weight: 0 s(x1) weight: 0 unquote1(x1) weight: 0 #quote1(x1) weight: 0 #cons1(x1,x2) weight: 0 #unquote1(x1) weight: 0 #fcons(x1,x2) weight: 0 #first1(x1,x2) weight: 0 cons1(x1,x2) weight: 0 #mark(x1) weight: 0 0() weight: 0 #sel(x1,x2) weight: 0 sel(x1,x2) weight: 0 from(x1) weight: 0 #s(x1) weight: x1 #first(x1,x2) weight: 0 nil() weight: 0 #sel1(x1,x2) weight: 0 quote1(x1) weight: 0 mark(x1) weight: (/ 1 2) + x1 nil1() weight: 0 first(x1,x2) weight: 0 first1(x1,x2) weight: 0 #unquote(x1) weight: 0 #from(x1) weight: 0 active(x1) weight: (/ 1 2) + x1 quote(x1) weight: 0 cons(x1,x2) weight: 0 #active(x1) weight: 0 #quote(x1) weight: 0 #s1(x1) weight: 0 sel1(x1,x2) weight: 0 s1(x1) weight: 0 unquote(x1) weight: 0 fcons(x1,x2) weight: 0 Usable rules: { } Removed DPs: #2 #85 Number of SCCs: 13, DPs: 80, edges: 703 SCC { #29 #98 } Removing DPs: Order(PosReal,>,Sum)... succeeded. 01() weight: 0 #cons(x1,x2) weight: 0 s(x1) weight: 0 unquote1(x1) weight: 0 #quote1(x1) weight: 0 #cons1(x1,x2) weight: 0 #unquote1(x1) weight: 0 #fcons(x1,x2) weight: 0 #first1(x1,x2) weight: 0 cons1(x1,x2) weight: 0 #mark(x1) weight: 0 0() weight: 0 #sel(x1,x2) weight: 0 sel(x1,x2) weight: 0 from(x1) weight: 0 #s(x1) weight: 0 #first(x1,x2) weight: 0 nil() weight: 0 #sel1(x1,x2) weight: 0 quote1(x1) weight: 0 mark(x1) weight: (/ 1 2) + x1 nil1() weight: 0 first(x1,x2) weight: 0 first1(x1,x2) weight: 0 #unquote(x1) weight: 0 #from(x1) weight: 0 active(x1) weight: (/ 1 2) + x1 quote(x1) weight: 0 cons(x1,x2) weight: 0 #active(x1) weight: 0 #quote(x1) weight: x1 #s1(x1) weight: 0 sel1(x1,x2) weight: 0 s1(x1) weight: 0 unquote(x1) weight: 0 fcons(x1,x2) weight: 0 Usable rules: { } Removed DPs: #29 #98 Number of SCCs: 12, DPs: 78, edges: 699 SCC { #19 #46 } Removing DPs: Order(PosReal,>,Sum)... succeeded. 01() weight: 0 #cons(x1,x2) weight: 0 s(x1) weight: 0 unquote1(x1) weight: 0 #quote1(x1) weight: 0 #cons1(x1,x2) weight: 0 #unquote1(x1) weight: x1 #fcons(x1,x2) weight: 0 #first1(x1,x2) weight: 0 cons1(x1,x2) weight: 0 #mark(x1) weight: 0 0() weight: 0 #sel(x1,x2) weight: 0 sel(x1,x2) weight: 0 from(x1) weight: 0 #s(x1) weight: 0 #first(x1,x2) weight: 0 nil() weight: 0 #sel1(x1,x2) weight: 0 quote1(x1) weight: 0 mark(x1) weight: (/ 1 2) + x1 nil1() weight: 0 first(x1,x2) weight: 0 first1(x1,x2) weight: 0 #unquote(x1) weight: 0 #from(x1) weight: 0 active(x1) weight: (/ 1 2) + x1 quote(x1) weight: 0 cons(x1,x2) weight: 0 #active(x1) weight: 0 #quote(x1) weight: 0 #s1(x1) weight: 0 sel1(x1,x2) weight: 0 s1(x1) weight: 0 unquote(x1) weight: 0 fcons(x1,x2) weight: 0 Usable rules: { } Removed DPs: #19 #46 Number of SCCs: 11, DPs: 76, edges: 695 SCC { #16 #125 } Removing DPs: Order(PosReal,>,Sum)... succeeded. 01() weight: 0 #cons(x1,x2) weight: 0 s(x1) weight: 0 unquote1(x1) weight: 0 #quote1(x1) weight: 0 #cons1(x1,x2) weight: 0 #unquote1(x1) weight: 0 #fcons(x1,x2) weight: 0 #first1(x1,x2) weight: 0 cons1(x1,x2) weight: 0 #mark(x1) weight: 0 0() weight: 0 #sel(x1,x2) weight: 0 sel(x1,x2) weight: 0 from(x1) weight: 0 #s(x1) weight: 0 #first(x1,x2) weight: 0 nil() weight: 0 #sel1(x1,x2) weight: 0 quote1(x1) weight: 0 mark(x1) weight: (/ 1 2) + x1 nil1() weight: 0 first(x1,x2) weight: 0 first1(x1,x2) weight: 0 #unquote(x1) weight: 0 #from(x1) weight: x1 active(x1) weight: (/ 1 2) + x1 quote(x1) weight: 0 cons(x1,x2) weight: 0 #active(x1) weight: 0 #quote(x1) weight: 0 #s1(x1) weight: 0 sel1(x1,x2) weight: 0 s1(x1) weight: 0 unquote(x1) weight: 0 fcons(x1,x2) weight: 0 Usable rules: { } Removed DPs: #16 #125 Number of SCCs: 10, DPs: 74, edges: 691 SCC { #17 #80 } Removing DPs: Order(PosReal,>,Sum)... succeeded. 01() weight: 0 #cons(x1,x2) weight: 0 s(x1) weight: 0 unquote1(x1) weight: 0 #quote1(x1) weight: 0 #cons1(x1,x2) weight: 0 #unquote1(x1) weight: 0 #fcons(x1,x2) weight: 0 #first1(x1,x2) weight: 0 cons1(x1,x2) weight: 0 #mark(x1) weight: 0 0() weight: 0 #sel(x1,x2) weight: 0 sel(x1,x2) weight: 0 from(x1) weight: 0 #s(x1) weight: 0 #first(x1,x2) weight: 0 nil() weight: 0 #sel1(x1,x2) weight: 0 quote1(x1) weight: 0 mark(x1) weight: (/ 1 2) + x1 nil1() weight: 0 first(x1,x2) weight: 0 first1(x1,x2) weight: 0 #unquote(x1) weight: 0 #from(x1) weight: 0 active(x1) weight: (/ 1 2) + x1 quote(x1) weight: 0 cons(x1,x2) weight: 0 #active(x1) weight: 0 #quote(x1) weight: 0 #s1(x1) weight: x1 sel1(x1,x2) weight: 0 s1(x1) weight: 0 unquote(x1) weight: 0 fcons(x1,x2) weight: 0 Usable rules: { } Removed DPs: #17 #80 Number of SCCs: 9, DPs: 72, edges: 687 SCC { #48 #54 } Removing DPs: Order(PosReal,>,Sum)... succeeded. 01() weight: 0 #cons(x1,x2) weight: 0 s(x1) weight: 0 unquote1(x1) weight: 0 #quote1(x1) weight: x1 #cons1(x1,x2) weight: 0 #unquote1(x1) weight: 0 #fcons(x1,x2) weight: 0 #first1(x1,x2) weight: 0 cons1(x1,x2) weight: 0 #mark(x1) weight: 0 0() weight: 0 #sel(x1,x2) weight: 0 sel(x1,x2) weight: 0 from(x1) weight: 0 #s(x1) weight: 0 #first(x1,x2) weight: 0 nil() weight: 0 #sel1(x1,x2) weight: 0 quote1(x1) weight: 0 mark(x1) weight: (/ 1 2) + x1 nil1() weight: 0 first(x1,x2) weight: 0 first1(x1,x2) weight: 0 #unquote(x1) weight: 0 #from(x1) weight: 0 active(x1) weight: (/ 1 2) + x1 quote(x1) weight: 0 cons(x1,x2) weight: 0 #active(x1) weight: 0 #quote(x1) weight: 0 #s1(x1) weight: 0 sel1(x1,x2) weight: 0 s1(x1) weight: 0 unquote(x1) weight: 0 fcons(x1,x2) weight: 0 Usable rules: { } Removed DPs: #48 #54 Number of SCCs: 8, DPs: 70, edges: 683 SCC { #7 #31 #86 #112 } Removing DPs: Order(PosReal,>,Sum)... succeeded. 01() weight: 0 #cons(x1,x2) weight: 0 s(x1) weight: 0 unquote1(x1) weight: 0 #quote1(x1) weight: 0 #cons1(x1,x2) weight: x2 #unquote1(x1) weight: 0 #fcons(x1,x2) weight: 0 #first1(x1,x2) weight: 0 cons1(x1,x2) weight: 0 #mark(x1) weight: 0 0() weight: 0 #sel(x1,x2) weight: 0 sel(x1,x2) weight: 0 from(x1) weight: 0 #s(x1) weight: 0 #first(x1,x2) weight: 0 nil() weight: 0 #sel1(x1,x2) weight: 0 quote1(x1) weight: 0 mark(x1) weight: (/ 1 2) + x1 nil1() weight: 0 first(x1,x2) weight: 0 first1(x1,x2) weight: 0 #unquote(x1) weight: 0 #from(x1) weight: 0 active(x1) weight: (/ 1 2) + x1 quote(x1) weight: 0 cons(x1,x2) weight: 0 #active(x1) weight: 0 #quote(x1) weight: 0 #s1(x1) weight: 0 sel1(x1,x2) weight: 0 s1(x1) weight: 0 unquote(x1) weight: 0 fcons(x1,x2) weight: 0 Usable rules: { } Removed DPs: #7 #112 Number of SCCs: 8, DPs: 68, edges: 671 SCC { #31 #86 } Removing DPs: Order(PosReal,>,Sum)... succeeded. 01() weight: 0 #cons(x1,x2) weight: 0 s(x1) weight: 0 unquote1(x1) weight: 0 #quote1(x1) weight: 0 #cons1(x1,x2) weight: x1 #unquote1(x1) weight: 0 #fcons(x1,x2) weight: 0 #first1(x1,x2) weight: 0 cons1(x1,x2) weight: 0 #mark(x1) weight: 0 0() weight: 0 #sel(x1,x2) weight: 0 sel(x1,x2) weight: 0 from(x1) weight: 0 #s(x1) weight: 0 #first(x1,x2) weight: 0 nil() weight: 0 #sel1(x1,x2) weight: 0 quote1(x1) weight: 0 mark(x1) weight: (/ 1 2) + x1 nil1() weight: 0 first(x1,x2) weight: 0 first1(x1,x2) weight: 0 #unquote(x1) weight: 0 #from(x1) weight: 0 active(x1) weight: (/ 1 2) + x1 quote(x1) weight: 0 cons(x1,x2) weight: 0 #active(x1) weight: 0 #quote(x1) weight: 0 #s1(x1) weight: 0 sel1(x1,x2) weight: 0 s1(x1) weight: 0 unquote(x1) weight: 0 fcons(x1,x2) weight: 0 Usable rules: { } Removed DPs: #31 #86 Number of SCCs: 7, DPs: 66, edges: 667 SCC { #21 #30 #45 #58 } Removing DPs: Order(PosReal,>,Sum)... succeeded. 01() weight: 0 #cons(x1,x2) weight: 0 s(x1) weight: 0 unquote1(x1) weight: 0 #quote1(x1) weight: 0 #cons1(x1,x2) weight: 0 #unquote1(x1) weight: 0 #fcons(x1,x2) weight: 0 #first1(x1,x2) weight: 0 cons1(x1,x2) weight: 0 #mark(x1) weight: 0 0() weight: 0 #sel(x1,x2) weight: 0 sel(x1,x2) weight: 0 from(x1) weight: 0 #s(x1) weight: 0 #first(x1,x2) weight: 0 nil() weight: 0 #sel1(x1,x2) weight: x1 quote1(x1) weight: 0 mark(x1) weight: (/ 1 2) + x1 nil1() weight: 0 first(x1,x2) weight: 0 first1(x1,x2) weight: 0 #unquote(x1) weight: 0 #from(x1) weight: 0 active(x1) weight: (/ 1 2) + x1 quote(x1) weight: 0 cons(x1,x2) weight: 0 #active(x1) weight: 0 #quote(x1) weight: 0 #s1(x1) weight: 0 sel1(x1,x2) weight: 0 s1(x1) weight: 0 unquote(x1) weight: 0 fcons(x1,x2) weight: 0 Usable rules: { } Removed DPs: #30 #45 Number of SCCs: 8, DPs: 64, edges: 655 SCC { #21 #58 } Removing DPs: Order(PosReal,>,Sum)... succeeded. 01() weight: 0 #cons(x1,x2) weight: 0 s(x1) weight: 0 unquote1(x1) weight: 0 #quote1(x1) weight: 0 #cons1(x1,x2) weight: 0 #unquote1(x1) weight: 0 #fcons(x1,x2) weight: 0 #first1(x1,x2) weight: 0 cons1(x1,x2) weight: 0 #mark(x1) weight: 0 0() weight: 0 #sel(x1,x2) weight: 0 sel(x1,x2) weight: 0 from(x1) weight: 0 #s(x1) weight: 0 #first(x1,x2) weight: 0 nil() weight: 0 #sel1(x1,x2) weight: x2 quote1(x1) weight: 0 mark(x1) weight: (/ 1 2) + x1 nil1() weight: 0 first(x1,x2) weight: 0 first1(x1,x2) weight: 0 #unquote(x1) weight: 0 #from(x1) weight: 0 active(x1) weight: (/ 1 2) + x1 quote(x1) weight: 0 cons(x1,x2) weight: 0 #active(x1) weight: 0 #quote(x1) weight: 0 #s1(x1) weight: 0 sel1(x1,x2) weight: 0 s1(x1) weight: 0 unquote(x1) weight: 0 fcons(x1,x2) weight: 0 Usable rules: { } Removed DPs: #21 #58 Number of SCCs: 7, DPs: 62, edges: 651 SCC { #33 #66 #67 #133 } Removing DPs: Order(PosReal,>,Sum)... succeeded. 01() weight: 0 #cons(x1,x2) weight: 0 s(x1) weight: 0 unquote1(x1) weight: 0 #quote1(x1) weight: 0 #cons1(x1,x2) weight: 0 #unquote1(x1) weight: 0 #fcons(x1,x2) weight: 0 #first1(x1,x2) weight: 0 cons1(x1,x2) weight: 0 #mark(x1) weight: 0 0() weight: 0 #sel(x1,x2) weight: 0 sel(x1,x2) weight: 0 from(x1) weight: 0 #s(x1) weight: 0 #first(x1,x2) weight: x1 nil() weight: 0 #sel1(x1,x2) weight: 0 quote1(x1) weight: 0 mark(x1) weight: (/ 1 2) + x1 nil1() weight: 0 first(x1,x2) weight: 0 first1(x1,x2) weight: 0 #unquote(x1) weight: 0 #from(x1) weight: 0 active(x1) weight: (/ 1 2) + x1 quote(x1) weight: 0 cons(x1,x2) weight: 0 #active(x1) weight: 0 #quote(x1) weight: 0 #s1(x1) weight: 0 sel1(x1,x2) weight: 0 s1(x1) weight: 0 unquote(x1) weight: 0 fcons(x1,x2) weight: 0 Usable rules: { } Removed DPs: #33 #67 Number of SCCs: 8, DPs: 60, edges: 639 SCC { #66 #133 } Removing DPs: Order(PosReal,>,Sum)... succeeded. 01() weight: 0 #cons(x1,x2) weight: 0 s(x1) weight: 0 unquote1(x1) weight: 0 #quote1(x1) weight: 0 #cons1(x1,x2) weight: 0 #unquote1(x1) weight: 0 #fcons(x1,x2) weight: 0 #first1(x1,x2) weight: 0 cons1(x1,x2) weight: 0 #mark(x1) weight: 0 0() weight: 0 #sel(x1,x2) weight: 0 sel(x1,x2) weight: 0 from(x1) weight: 0 #s(x1) weight: 0 #first(x1,x2) weight: x2 nil() weight: 0 #sel1(x1,x2) weight: 0 quote1(x1) weight: 0 mark(x1) weight: (/ 1 2) + x1 nil1() weight: 0 first(x1,x2) weight: 0 first1(x1,x2) weight: 0 #unquote(x1) weight: 0 #from(x1) weight: 0 active(x1) weight: (/ 1 2) + x1 quote(x1) weight: 0 cons(x1,x2) weight: 0 #active(x1) weight: 0 #quote(x1) weight: 0 #s1(x1) weight: 0 sel1(x1,x2) weight: 0 s1(x1) weight: 0 unquote(x1) weight: 0 fcons(x1,x2) weight: 0 Usable rules: { } Removed DPs: #66 #133 Number of SCCs: 7, DPs: 58, edges: 635 SCC { #9 #10 #32 #76 } Removing DPs: Order(PosReal,>,Sum)... succeeded. 01() weight: 0 #cons(x1,x2) weight: 0 s(x1) weight: 0 unquote1(x1) weight: 0 #quote1(x1) weight: 0 #cons1(x1,x2) weight: 0 #unquote1(x1) weight: 0 #fcons(x1,x2) weight: 0 #first1(x1,x2) weight: 0 cons1(x1,x2) weight: 0 #mark(x1) weight: 0 0() weight: 0 #sel(x1,x2) weight: x2 sel(x1,x2) weight: 0 from(x1) weight: 0 #s(x1) weight: 0 #first(x1,x2) weight: 0 nil() weight: 0 #sel1(x1,x2) weight: 0 quote1(x1) weight: 0 mark(x1) weight: (/ 1 2) + x1 nil1() weight: 0 first(x1,x2) weight: 0 first1(x1,x2) weight: 0 #unquote(x1) weight: 0 #from(x1) weight: 0 active(x1) weight: (/ 1 2) + x1 quote(x1) weight: 0 cons(x1,x2) weight: 0 #active(x1) weight: 0 #quote(x1) weight: 0 #s1(x1) weight: 0 sel1(x1,x2) weight: 0 s1(x1) weight: 0 unquote(x1) weight: 0 fcons(x1,x2) weight: 0 Usable rules: { } Removed DPs: #9 #32 Number of SCCs: 8, DPs: 56, edges: 623 SCC { #10 #76 } Removing DPs: Order(PosReal,>,Sum)... succeeded. 01() weight: 0 #cons(x1,x2) weight: 0 s(x1) weight: 0 unquote1(x1) weight: 0 #quote1(x1) weight: 0 #cons1(x1,x2) weight: 0 #unquote1(x1) weight: 0 #fcons(x1,x2) weight: 0 #first1(x1,x2) weight: 0 cons1(x1,x2) weight: 0 #mark(x1) weight: 0 0() weight: 0 #sel(x1,x2) weight: x1 sel(x1,x2) weight: 0 from(x1) weight: 0 #s(x1) weight: 0 #first(x1,x2) weight: 0 nil() weight: 0 #sel1(x1,x2) weight: 0 quote1(x1) weight: 0 mark(x1) weight: (/ 1 2) + x1 nil1() weight: 0 first(x1,x2) weight: 0 first1(x1,x2) weight: 0 #unquote(x1) weight: 0 #from(x1) weight: 0 active(x1) weight: (/ 1 2) + x1 quote(x1) weight: 0 cons(x1,x2) weight: 0 #active(x1) weight: 0 #quote(x1) weight: 0 #s1(x1) weight: 0 sel1(x1,x2) weight: 0 s1(x1) weight: 0 unquote(x1) weight: 0 fcons(x1,x2) weight: 0 Usable rules: { } Removed DPs: #10 #76 Number of SCCs: 7, DPs: 54, edges: 619 SCC { #8 #15 #18 #53 } Removing DPs: Order(PosReal,>,Sum)... succeeded. 01() weight: 0 #cons(x1,x2) weight: x2 s(x1) weight: 0 unquote1(x1) weight: 0 #quote1(x1) weight: 0 #cons1(x1,x2) weight: 0 #unquote1(x1) weight: 0 #fcons(x1,x2) weight: 0 #first1(x1,x2) weight: 0 cons1(x1,x2) weight: 0 #mark(x1) weight: 0 0() weight: 0 #sel(x1,x2) weight: 0 sel(x1,x2) weight: 0 from(x1) weight: 0 #s(x1) weight: 0 #first(x1,x2) weight: 0 nil() weight: 0 #sel1(x1,x2) weight: 0 quote1(x1) weight: 0 mark(x1) weight: (/ 1 2) + x1 nil1() weight: 0 first(x1,x2) weight: 0 first1(x1,x2) weight: 0 #unquote(x1) weight: 0 #from(x1) weight: 0 active(x1) weight: (/ 1 2) + x1 quote(x1) weight: 0 cons(x1,x2) weight: 0 #active(x1) weight: 0 #quote(x1) weight: 0 #s1(x1) weight: 0 sel1(x1,x2) weight: 0 s1(x1) weight: 0 unquote(x1) weight: 0 fcons(x1,x2) weight: 0 Usable rules: { } Removed DPs: #8 #18 Number of SCCs: 8, DPs: 52, edges: 607 SCC { #15 #53 } Removing DPs: Order(PosReal,>,Sum)... succeeded. 01() weight: 0 #cons(x1,x2) weight: x1 s(x1) weight: 0 unquote1(x1) weight: 0 #quote1(x1) weight: 0 #cons1(x1,x2) weight: 0 #unquote1(x1) weight: 0 #fcons(x1,x2) weight: 0 #first1(x1,x2) weight: 0 cons1(x1,x2) weight: 0 #mark(x1) weight: 0 0() weight: 0 #sel(x1,x2) weight: 0 sel(x1,x2) weight: 0 from(x1) weight: 0 #s(x1) weight: 0 #first(x1,x2) weight: 0 nil() weight: 0 #sel1(x1,x2) weight: 0 quote1(x1) weight: 0 mark(x1) weight: (/ 1 2) + x1 nil1() weight: 0 first(x1,x2) weight: 0 first1(x1,x2) weight: 0 #unquote(x1) weight: 0 #from(x1) weight: 0 active(x1) weight: (/ 1 2) + x1 quote(x1) weight: 0 cons(x1,x2) weight: 0 #active(x1) weight: 0 #quote(x1) weight: 0 #s1(x1) weight: 0 sel1(x1,x2) weight: 0 s1(x1) weight: 0 unquote(x1) weight: 0 fcons(x1,x2) weight: 0 Usable rules: { } Removed DPs: #15 #53 Number of SCCs: 7, DPs: 50, edges: 603 SCC { #22 #61 #78 #110 } Removing DPs: Order(PosReal,>,Sum)... succeeded. 01() weight: 0 #cons(x1,x2) weight: 0 s(x1) weight: 0 unquote1(x1) weight: 0 #quote1(x1) weight: 0 #cons1(x1,x2) weight: 0 #unquote1(x1) weight: 0 #fcons(x1,x2) weight: 0 #first1(x1,x2) weight: x2 cons1(x1,x2) weight: 0 #mark(x1) weight: 0 0() weight: 0 #sel(x1,x2) weight: 0 sel(x1,x2) weight: 0 from(x1) weight: 0 #s(x1) weight: 0 #first(x1,x2) weight: 0 nil() weight: 0 #sel1(x1,x2) weight: 0 quote1(x1) weight: 0 mark(x1) weight: (/ 1 2) + x1 nil1() weight: 0 first(x1,x2) weight: 0 first1(x1,x2) weight: 0 #unquote(x1) weight: 0 #from(x1) weight: 0 active(x1) weight: (/ 1 2) + x1 quote(x1) weight: 0 cons(x1,x2) weight: 0 #active(x1) weight: 0 #quote(x1) weight: 0 #s1(x1) weight: 0 sel1(x1,x2) weight: 0 s1(x1) weight: 0 unquote(x1) weight: 0 fcons(x1,x2) weight: 0 Usable rules: { } Removed DPs: #61 #78 Number of SCCs: 8, DPs: 48, edges: 591 SCC { #22 #110 } Removing DPs: Order(PosReal,>,Sum)... succeeded. 01() weight: 0 #cons(x1,x2) weight: 0 s(x1) weight: 0 unquote1(x1) weight: 0 #quote1(x1) weight: 0 #cons1(x1,x2) weight: 0 #unquote1(x1) weight: 0 #fcons(x1,x2) weight: 0 #first1(x1,x2) weight: x1 cons1(x1,x2) weight: 0 #mark(x1) weight: 0 0() weight: 0 #sel(x1,x2) weight: 0 sel(x1,x2) weight: 0 from(x1) weight: 0 #s(x1) weight: 0 #first(x1,x2) weight: 0 nil() weight: 0 #sel1(x1,x2) weight: 0 quote1(x1) weight: 0 mark(x1) weight: (/ 1 2) + x1 nil1() weight: 0 first(x1,x2) weight: 0 first1(x1,x2) weight: 0 #unquote(x1) weight: 0 #from(x1) weight: 0 active(x1) weight: (/ 1 2) + x1 quote(x1) weight: 0 cons(x1,x2) weight: 0 #active(x1) weight: 0 #quote(x1) weight: 0 #s1(x1) weight: 0 sel1(x1,x2) weight: 0 s1(x1) weight: 0 unquote(x1) weight: 0 fcons(x1,x2) weight: 0 Usable rules: { } Removed DPs: #22 #110 Number of SCCs: 7, DPs: 46, edges: 587 SCC { #52 #57 #122 #132 } Removing DPs: Order(PosReal,>,Sum)... succeeded. 01() weight: 0 #cons(x1,x2) weight: 0 s(x1) weight: 0 unquote1(x1) weight: 0 #quote1(x1) weight: 0 #cons1(x1,x2) weight: 0 #unquote1(x1) weight: 0 #fcons(x1,x2) weight: x1 #first1(x1,x2) weight: 0 cons1(x1,x2) weight: 0 #mark(x1) weight: 0 0() weight: 0 #sel(x1,x2) weight: 0 sel(x1,x2) weight: 0 from(x1) weight: 0 #s(x1) weight: 0 #first(x1,x2) weight: 0 nil() weight: 0 #sel1(x1,x2) weight: 0 quote1(x1) weight: 0 mark(x1) weight: (/ 1 2) + x1 nil1() weight: 0 first(x1,x2) weight: 0 first1(x1,x2) weight: 0 #unquote(x1) weight: 0 #from(x1) weight: 0 active(x1) weight: (/ 1 2) + x1 quote(x1) weight: 0 cons(x1,x2) weight: 0 #active(x1) weight: 0 #quote(x1) weight: 0 #s1(x1) weight: 0 sel1(x1,x2) weight: 0 s1(x1) weight: 0 unquote(x1) weight: 0 fcons(x1,x2) weight: 0 Usable rules: { } Removed DPs: #57 #122 Number of SCCs: 8, DPs: 44, edges: 575 SCC { #52 #132 } Removing DPs: Order(PosReal,>,Sum)... succeeded. 01() weight: 0 #cons(x1,x2) weight: 0 s(x1) weight: 0 unquote1(x1) weight: 0 #quote1(x1) weight: 0 #cons1(x1,x2) weight: 0 #unquote1(x1) weight: 0 #fcons(x1,x2) weight: x2 #first1(x1,x2) weight: 0 cons1(x1,x2) weight: 0 #mark(x1) weight: 0 0() weight: 0 #sel(x1,x2) weight: 0 sel(x1,x2) weight: 0 from(x1) weight: 0 #s(x1) weight: 0 #first(x1,x2) weight: 0 nil() weight: 0 #sel1(x1,x2) weight: 0 quote1(x1) weight: 0 mark(x1) weight: (/ 1 2) + x1 nil1() weight: 0 first(x1,x2) weight: 0 first1(x1,x2) weight: 0 #unquote(x1) weight: 0 #from(x1) weight: 0 active(x1) weight: (/ 1 2) + x1 quote(x1) weight: 0 cons(x1,x2) weight: 0 #active(x1) weight: 0 #quote(x1) weight: 0 #s1(x1) weight: 0 sel1(x1,x2) weight: 0 s1(x1) weight: 0 unquote(x1) weight: 0 fcons(x1,x2) weight: 0 Usable rules: { } Removed DPs: #52 #132 Number of SCCs: 7, DPs: 42, edges: 571 SCC { #1 #3 #6 #11 #13 #23 #25..27 #34 #37 #41 #51 #59 #62 #64 #65 #68 #70..72 #74 #81 #87 #89 #90 #93..95 #97 #99 #104..106 #113 #115 #116 #118 #119 #123 #127 #129 } Removing DPs: Order(PosReal,>,Sum)... Order(PosReal,>,Max)... succeeded. 01() weight: (/ 1 8) #cons(x1,x2) weight: 0 s(x1) weight: x1 unquote1(x1) weight: (/ 22957 4) + x1 #quote1(x1) weight: 0 #cons1(x1,x2) weight: 0 #unquote1(x1) weight: 0 #fcons(x1,x2) weight: 0 #first1(x1,x2) weight: 0 cons1(x1,x2) weight: max{x2, (/ 46825 8) + x1} #mark(x1) weight: x1 0() weight: (/ 1 8) #sel(x1,x2) weight: 0 sel(x1,x2) weight: max{(/ 122449 4) + x2, (/ 244899 8) + x1} from(x1) weight: (/ 83603 8) + x1 #s(x1) weight: 0 #first(x1,x2) weight: 0 nil() weight: (/ 41803 4) #sel1(x1,x2) weight: 0 quote1(x1) weight: (/ 1 8) + x1 mark(x1) weight: x1 nil1() weight: (/ 9423 2) first(x1,x2) weight: max{(/ 41803 4) + x2, (/ 20901 2) + x1} first1(x1,x2) weight: max{(/ 1 8) + x2, (/ 20901 2) + x1} #unquote(x1) weight: 0 #from(x1) weight: 0 active(x1) weight: x1 quote(x1) weight: (/ 18389 4) + x1 cons(x1,x2) weight: max{x2, (/ 41801 4) + x1} #active(x1) weight: x1 #quote(x1) weight: 0 #s1(x1) weight: 0 sel1(x1,x2) weight: max{(/ 36779 8) + x2, (/ 18389 4) + x1} s1(x1) weight: x1 unquote(x1) weight: (/ 9137 8) + x1 fcons(x1,x2) weight: max{x2, (/ 41801 4) + x1} Usable rules: { 1..80 } Removed DPs: #1 #13 #25 #51 #59 #64 #65 #70 #71 #74 #89 #90 #97 #104 #115 #118 #119 #127 Number of SCCs: 10, DPs: 18, edges: 50 SCC { #116 #123 } Removing DPs: Order(PosReal,>,Sum)... Order(PosReal,>,Max)... QLPOpS... Order(PosReal,>,MaxSum)... QWPOpS(PosReal,>,MaxSum)... succeeded. 01() weight: (/ 1 8) status: [] precedence above: 0 nil nil1 #cons(x1,x2) weight: (/ 1 16) + x2 + x1 status: [x1,x2] precedence above: s(x1) weight: x1 status: [x1] precedence above: #mark #active s1 unquote1(x1) weight: (/ 5 16) + x1 status: [] precedence above: cons1 mark nil1 active quote cons sel1 fcons #quote1(x1) weight: (/ 1 16) status: [] precedence above: #cons1(x1,x2) weight: (/ 1 16) + x2 + x1 status: [x2,x1] precedence above: #unquote1(x1) weight: (/ 1 16) status: [] precedence above: #fcons(x1,x2) weight: x2 status: [x2] precedence above: #first1(x1,x2) weight: (/ 1 16) + x2 + x1 status: [x1,x2] precedence above: cons1(x1,x2) weight: max{x2, (/ 1 8) + x1} status: [] precedence above: mark #mark(x1) weight: (/ 1 16) + x1 status: [x1] precedence above: #active 0() weight: (/ 1 8) status: [] precedence above: 01 nil nil1 #sel(x1,x2) weight: x1 status: [] precedence above: sel(x1,x2) weight: (/ 3 8) + x2 + x1 status: [x1,x2] precedence above: from(x1) weight: (/ 3 8) + x1 status: [x1] precedence above: cons1 mark nil1 active quote cons sel1 fcons #s(x1) weight: x1 status: [] precedence above: #first(x1,x2) weight: x1 status: [] precedence above: nil() weight: (/ 1 16) status: [] precedence above: #sel1(x1,x2) weight: (/ 1 16) + x2 status: [x2] precedence above: quote1(x1) weight: (/ 3 16) + x1 status: [] precedence above: cons1 mark nil1 first1 mark(x1) weight: x1 status: x1 nil1() weight: (/ 3 16) status: [] precedence above: first(x1,x2) weight: (/ 1 16) + x2 + x1 status: [x2,x1] precedence above: cons1 nil mark quote cons sel1 fcons first1(x1,x2) weight: (/ 1 4) + x2 status: [] precedence above: cons1 quote1 mark nil1 #unquote(x1) weight: x1 status: [] precedence above: #from(x1) weight: x1 status: [] precedence above: active(x1) weight: x1 status: x1 quote(x1) weight: x1 status: x1 cons(x1,x2) weight: max{x2, (/ 5 16) + x1} status: [] precedence above: cons1 mark quote sel1 fcons #active(x1) weight: (/ 1 16) + x1 status: [x1] precedence above: #mark #quote(x1) weight: x1 status: [] precedence above: #s1(x1) weight: (/ 1 16) status: [] precedence above: sel1(x1,x2) weight: x2 status: [] precedence above: cons1 mark quote s1(x1) weight: x1 status: [x1] precedence above: s #mark #active unquote(x1) weight: x1 status: x1 fcons(x1,x2) weight: max{x2, (/ 3 8) + x1} status: [x1] precedence above: cons1 mark quote cons sel1 Usable rules: { 1..80 } Removed DPs: #123 Number of SCCs: 9, DPs: 16, edges: 48 SCC { #27 #87 } Removing DPs: Order(PosReal,>,Sum)... Order(PosReal,>,Max)... QLPOpS... Order(PosReal,>,MaxSum)... QWPOpS(PosReal,>,MaxSum)... succeeded. 01() weight: (/ 1 4) status: [] precedence above: nil nil1 #cons(x1,x2) weight: (/ 1 8) + x2 + x1 status: [x1,x2] precedence above: s(x1) weight: x1 status: [x1] precedence above: unquote1 cons1 0 sel from nil mark first active cons fcons unquote1(x1) weight: (/ 3 4) + x1 status: [] precedence above: s cons1 0 sel from nil mark first active cons fcons #quote1(x1) weight: (/ 1 8) status: [] precedence above: #cons1(x1,x2) weight: (/ 1 8) + x2 + x1 status: [x2,x1] precedence above: #unquote1(x1) weight: (/ 1 8) status: [] precedence above: #fcons(x1,x2) weight: x2 status: [x2] precedence above: #first1(x1,x2) weight: (/ 1 8) + x2 + x1 status: [x1,x2] precedence above: cons1(x1,x2) weight: max{x2, x1} status: [] precedence above: s unquote1 0 sel from nil mark first active cons fcons #mark(x1) weight: x1 status: [x1] precedence above: #active 0() weight: (/ 1 4) status: [] precedence above: nil #sel(x1,x2) weight: x2 + x1 status: [x2] precedence above: sel(x1,x2) weight: x2 + x1 status: [] precedence above: from(x1) weight: (/ 1 2) + x1 status: [] precedence above: s unquote1 cons1 0 sel nil mark first active cons fcons #s(x1) weight: x1 status: [] precedence above: #first(x1,x2) weight: x1 status: [] precedence above: nil() weight: (/ 1 8) status: [] precedence above: #sel1(x1,x2) weight: (/ 1 8) + x2 status: [x2] precedence above: quote1(x1) weight: (/ 5 8) + x1 status: [] precedence above: s unquote1 cons1 #mark 0 sel from nil mark nil1 first first1 active quote cons #active sel1 s1 unquote fcons mark(x1) weight: x1 status: x1 nil1() weight: 0 status: [] precedence above: first(x1,x2) weight: (/ 1 8) + x2 status: [] precedence above: s unquote1 cons1 0 sel from nil mark active cons fcons first1(x1,x2) weight: x2 status: [x2] precedence above: s unquote1 cons1 0 sel from nil mark nil1 first active cons fcons #unquote(x1) weight: x1 status: [] precedence above: #from(x1) weight: x1 status: [] precedence above: active(x1) weight: x1 status: x1 quote(x1) weight: (/ 1 2) + x1 status: [x1] precedence above: s unquote1 cons1 #mark 0 sel from nil mark first active cons #active sel1 s1 unquote fcons cons(x1,x2) weight: max{x2, (/ 1 2) + x1} status: [] precedence above: s unquote1 cons1 0 sel from nil mark first active fcons #active(x1) weight: x1 status: [x1] precedence above: #mark #quote(x1) weight: x1 status: [] precedence above: #s1(x1) weight: (/ 1 8) status: [] precedence above: sel1(x1,x2) weight: (/ 1 8) + x2 + x1 status: [x1] precedence above: #mark 0 sel nil mark active #active s1(x1) weight: x1 status: [x1] precedence above: s unquote1 cons1 0 sel from nil mark first active cons unquote fcons unquote(x1) weight: x1 status: [x1] precedence above: s unquote1 cons1 0 sel from nil mark first active cons fcons fcons(x1,x2) weight: max{x2, (/ 5 8) + x1} status: [] precedence above: s unquote1 cons1 0 sel from nil mark first active cons Usable rules: { 1..80 } Removed DPs: #27 Number of SCCs: 8, DPs: 14, edges: 46 SCC { #3 #6 #11 #26 #34 #37 #41 #62 #93 #94 #99 #105 #106 #113 } Removing DPs: Order(PosReal,>,Sum)... Order(PosReal,>,Max)... QLPOpS... succeeded. 01() status: [] precedence above: #cons(x1,x2) status: [x1] precedence above: s(x1) status: x1 unquote1(x1) status: [] precedence above: cons1 #quote1(x1) status: [] precedence above: #cons1(x1,x2) status: [] precedence above: #unquote1(x1) status: [] precedence above: #fcons(x1,x2) status: [] precedence above: #first1(x1,x2) status: [x1,x2] precedence above: cons1(x1,x2) status: x2 #mark(x1) status: [x1] precedence above: 01 unquote1 cons1 0 sel from quote1 mark nil1 first first1 active quote cons #active sel1 unquote 0() status: [] precedence above: nil1 #sel(x1,x2) status: [x1] precedence above: sel(x1,x2) status: [] precedence above: from(x1) status: [x1] precedence above: sel #s(x1) status: [] precedence above: #first(x1,x2) status: [x1,x2] precedence above: nil() status: [] precedence above: #sel1(x1,x2) status: [] precedence above: quote1(x1) status: [x1] precedence above: nil1 cons mark(x1) status: [x1] precedence above: 01 0 sel quote1 nil1 first active cons unquote nil1() status: [] precedence above: first(x1,x2) status: [x2,x1] precedence above: 01 0 sel quote1 mark nil1 active cons unquote first1(x1,x2) status: [] precedence above: 01 unquote1 cons1 0 sel from quote1 mark nil1 first active cons unquote #unquote(x1) status: [] precedence above: #from(x1) status: [] precedence above: active(x1) status: [x1] precedence above: 01 0 sel quote1 mark nil1 first cons unquote quote(x1) status: [x1] precedence above: sel1 cons(x1,x2) status: [x2] precedence above: quote1 nil1 #active(x1) status: [x1] precedence above: 01 unquote1 cons1 #mark 0 sel from quote1 mark nil1 first first1 active quote cons sel1 unquote #quote(x1) status: [] precedence above: #s1(x1) status: [] precedence above: sel1(x1,x2) status: [] precedence above: s1(x1) status: x1 unquote(x1) status: [] precedence above: 0 nil1 fcons(x1,x2) status: x2 Usable rules: { 39..42 55..64 69 70 73..76 } Removed DPs: #41 Number of SCCs: 8, DPs: 12, edges: 40 SCC { #3 #6 #11 #26 #34 #37 #62 #93 #99 #105 #106 #113 } Removing DPs: Order(PosReal,>,Sum)... Order(PosReal,>,Max)... QLPOpS... Order(PosReal,>,MaxSum)... succeeded. 01() weight: (/ 87 64) #cons(x1,x2) weight: 0 s(x1) weight: max{0, (/ 23 64) + x1} unquote1(x1) weight: (max (- (/ 1 8)) 0) #quote1(x1) weight: 0 #cons1(x1,x2) weight: 0 #unquote1(x1) weight: 0 #fcons(x1,x2) weight: 0 #first1(x1,x2) weight: 0 cons1(x1,x2) weight: max{0, (/ 3 8) + x2} #mark(x1) weight: max{0, (- (/ 9 16)) + x1} 0() weight: (/ 35 64) #sel(x1,x2) weight: 0 sel(x1,x2) weight: (max (- (/ 1 8)) 0) from(x1) weight: (max (- (/ 5 32)) 0) #s(x1) weight: 0 #first(x1,x2) weight: 0 nil() weight: 0 #sel1(x1,x2) weight: 0 quote1(x1) weight: (max (- (/ 5 32)) 0) mark(x1) weight: max{0, x1} nil1() weight: (/ 3 8) first(x1,x2) weight: max{0, (- (/ 35 64)) + x2 + x1} first1(x1,x2) weight: (max (/ 3 16) 0) #unquote(x1) weight: 0 #from(x1) weight: 0 active(x1) weight: max{0, (/ 5 32) + x1} quote(x1) weight: max{0, (/ 5 8) + x1} cons(x1,x2) weight: 0 #active(x1) weight: max{0, (- (/ 19 32)) + x1} #quote(x1) weight: 0 #s1(x1) weight: 0 sel1(x1,x2) weight: (max (- (/ 3 16)) 0) s1(x1) weight: max{0, (/ 3 16) + x1} unquote(x1) weight: (max (/ 13 64) 0) fcons(x1,x2) weight: max{0, (/ 1 8) + x1, (/ 1 16) + x2} Usable rules: { 39..44 55..64 73..76 } Removed DPs: #3 #34 Number of SCCs: 8, DPs: 10, edges: 34 SCC { #6 #11 #26 #37 #62 #93 #99 #105 #106 #113 } Removing DPs: Order(PosReal,>,Sum)... succeeded. 01() weight: 0 #cons(x1,x2) weight: 0 s(x1) weight: x1 unquote1(x1) weight: (/ 1 4) #quote1(x1) weight: 0 #cons1(x1,x2) weight: 0 #unquote1(x1) weight: 0 #fcons(x1,x2) weight: 0 #first1(x1,x2) weight: 0 cons1(x1,x2) weight: x2 #mark(x1) weight: x1 0() weight: 0 #sel(x1,x2) weight: 0 sel(x1,x2) weight: (/ 1 4) from(x1) weight: (/ 1 4) #s(x1) weight: 0 #first(x1,x2) weight: 0 nil() weight: 0 #sel1(x1,x2) weight: 0 quote1(x1) weight: (/ 1 4) mark(x1) weight: (/ 1 4) nil1() weight: 0 first(x1,x2) weight: (/ 1 4) first1(x1,x2) weight: (/ 1 4) #unquote(x1) weight: 0 #from(x1) weight: 0 active(x1) weight: (/ 1 4) quote(x1) weight: (/ 1 4) cons(x1,x2) weight: (/ 1 4) #active(x1) weight: (/ 1 4) #quote(x1) weight: 0 #s1(x1) weight: 0 sel1(x1,x2) weight: (/ 1 4) s1(x1) weight: (/ 1 4) + x1 unquote(x1) weight: (/ 1 4) fcons(x1,x2) weight: x2 Usable rules: { 1..42 45..48 55..64 69 70 73..76 } Removed DPs: #6 Number of SCCs: 8, DPs: 9, edges: 24 SCC { #11 #26 #37 #62 #93 #99 #105 #106 #113 } Removing DPs: Order(PosReal,>,Sum)... Order(PosReal,>,Max)... QLPOpS... Order(PosReal,>,MaxSum)... QWPOpS(PosReal,>,MaxSum)... Order(PosReal,>,Sum-Sum; PosReal,≥,Sum-Sum)... Order(PosReal,>,Sum-Sum; NegReal,≥,Sum)... Order(PosReal,>,MaxSum-Sum; NegReal,≥,Sum)... failed. Removing edges: failed. Finding a loop... failed. MAYBE