Input TRS: 1: active(p(0)) -> mark(0) 2: active(p(s(X))) -> mark(X) 3: active(leq(0,Y)) -> mark(true) 4: active(leq(s(X),0)) -> mark(false) 5: active(leq(s(X),s(Y))) -> mark(leq(X,Y)) 6: active(if(true,X,Y)) -> mark(X) 7: active(if(false,X,Y)) -> mark(Y) 8: active(diff(X,Y)) -> mark(if(leq(X,Y),0,s(diff(p(X),Y)))) 9: mark(p(X)) -> active(p(mark(X))) 10: mark(0) -> active(0) 11: mark(s(X)) -> active(s(mark(X))) 12: mark(leq(X1,X2)) -> active(leq(mark(X1),mark(X2))) 13: mark(true) -> active(true) 14: mark(false) -> active(false) 15: mark(if(X1,X2,X3)) -> active(if(mark(X1),X2,X3)) 16: mark(diff(X1,X2)) -> active(diff(mark(X1),mark(X2))) 17: p(mark(X)) -> p(X) 18: p(active(X)) -> p(X) 19: s(mark(X)) -> s(X) 20: s(active(X)) -> s(X) 21: leq(mark(X1),X2) -> leq(X1,X2) 22: leq(X1,mark(X2)) -> leq(X1,X2) 23: leq(active(X1),X2) -> leq(X1,X2) 24: leq(X1,active(X2)) -> leq(X1,X2) 25: if(mark(X1),X2,X3) -> if(X1,X2,X3) 26: if(X1,mark(X2),X3) -> if(X1,X2,X3) 27: if(X1,X2,mark(X3)) -> if(X1,X2,X3) 28: if(active(X1),X2,X3) -> if(X1,X2,X3) 29: if(X1,active(X2),X3) -> if(X1,X2,X3) 30: if(X1,X2,active(X3)) -> if(X1,X2,X3) 31: diff(mark(X1),X2) -> diff(X1,X2) 32: diff(X1,mark(X2)) -> diff(X1,X2) 33: diff(active(X1),X2) -> diff(X1,X2) 34: diff(X1,active(X2)) -> diff(X1,X2) Dependency Pairs: #1: #active(p(0)) -> #mark(0) #2: #active(p(s(X))) -> #mark(X) #3: #active(leq(0,Y)) -> #mark(true) #4: #active(leq(s(X),0)) -> #mark(false) #5: #active(leq(s(X),s(Y))) -> #mark(leq(X,Y)) #6: #active(leq(s(X),s(Y))) -> #leq(X,Y) #7: #active(if(true,X,Y)) -> #mark(X) #8: #active(if(false,X,Y)) -> #mark(Y) #9: #active(diff(X,Y)) -> #mark(if(leq(X,Y),0,s(diff(p(X),Y)))) #10: #active(diff(X,Y)) -> #if(leq(X,Y),0,s(diff(p(X),Y))) #11: #active(diff(X,Y)) -> #leq(X,Y) #12: #active(diff(X,Y)) -> #s(diff(p(X),Y)) #13: #active(diff(X,Y)) -> #diff(p(X),Y) #14: #active(diff(X,Y)) -> #p(X) #15: #mark(p(X)) -> #active(p(mark(X))) #16: #mark(p(X)) -> #p(mark(X)) #17: #mark(p(X)) -> #mark(X) #18: #mark(0) -> #active(0) #19: #mark(s(X)) -> #active(s(mark(X))) #20: #mark(s(X)) -> #s(mark(X)) #21: #mark(s(X)) -> #mark(X) #22: #mark(leq(X1,X2)) -> #active(leq(mark(X1),mark(X2))) #23: #mark(leq(X1,X2)) -> #leq(mark(X1),mark(X2)) #24: #mark(leq(X1,X2)) -> #mark(X1) #25: #mark(leq(X1,X2)) -> #mark(X2) #26: #mark(true) -> #active(true) #27: #mark(false) -> #active(false) #28: #mark(if(X1,X2,X3)) -> #active(if(mark(X1),X2,X3)) #29: #mark(if(X1,X2,X3)) -> #if(mark(X1),X2,X3) #30: #mark(if(X1,X2,X3)) -> #mark(X1) #31: #mark(diff(X1,X2)) -> #active(diff(mark(X1),mark(X2))) #32: #mark(diff(X1,X2)) -> #diff(mark(X1),mark(X2)) #33: #mark(diff(X1,X2)) -> #mark(X1) #34: #mark(diff(X1,X2)) -> #mark(X2) #35: #p(mark(X)) -> #p(X) #36: #p(active(X)) -> #p(X) #37: #s(mark(X)) -> #s(X) #38: #s(active(X)) -> #s(X) #39: #leq(mark(X1),X2) -> #leq(X1,X2) #40: #leq(X1,mark(X2)) -> #leq(X1,X2) #41: #leq(active(X1),X2) -> #leq(X1,X2) #42: #leq(X1,active(X2)) -> #leq(X1,X2) #43: #if(mark(X1),X2,X3) -> #if(X1,X2,X3) #44: #if(X1,mark(X2),X3) -> #if(X1,X2,X3) #45: #if(X1,X2,mark(X3)) -> #if(X1,X2,X3) #46: #if(active(X1),X2,X3) -> #if(X1,X2,X3) #47: #if(X1,active(X2),X3) -> #if(X1,X2,X3) #48: #if(X1,X2,active(X3)) -> #if(X1,X2,X3) #49: #diff(mark(X1),X2) -> #diff(X1,X2) #50: #diff(X1,mark(X2)) -> #diff(X1,X2) #51: #diff(active(X1),X2) -> #diff(X1,X2) #52: #diff(X1,active(X2)) -> #diff(X1,X2) Number of SCCs: 6 SCC { #35 #36 } QKBOPS(sum)... removes: #35 #36 I(#p) = x1 \pi(#p) = 1 I(active) = x1 \pi(active) = [1] I(mark) = 1 + x1 \pi(mark) = [] PREC: active = mark USABLE RULES: { } Number of SCCs: 5 SCC { #37 #38 } QKBOPS(sum)... removes: #37 #38 I(active) = x1 \pi(active) = [1] I(#s) = x1 \pi(#s) = [1] I(mark) = 1 + x1 \pi(mark) = [] PREC: active = #s = mark USABLE RULES: { } Number of SCCs: 4 SCC { #39 #40 #41 #42 } QKBOPS(sum)... removes: #39 #40 #41 #42 I(active) = 1 + x1 \pi(active) = [1] I(mark) = 1 + x1 \pi(mark) = [1] I(#leq) = x1 + x2 \pi(#leq) = [1] PREC: #leq > active = mark USABLE RULES: { } Number of SCCs: 3 SCC { #49 #50 #51 #52 } QKBOPS(sum)... removes: #50 I(#diff) = x2 \pi(#diff) = [] I(active) = x1 \pi(active) = [] I(mark) = 1 + x1 \pi(mark) = [] PREC: #diff = active = mark USABLE RULES: { } Number of SCCs: 3 SCC { #49 #51 #52 } QKBOPS(sum)... removes: #49 I(#diff) = 2 + x1 \pi(#diff) = [] I(active) = x1 \pi(active) = [] I(mark) = 1 + x1 \pi(mark) = [] PREC: #diff = mark > active USABLE RULES: { } Number of SCCs: 3 SCC { #51 #52 } QKBOPS(sum)... removes: #51 #52 I(#diff) = 1 + x1 + x2 \pi(#diff) = [1] I(active) = 2 + x1 \pi(active) = [] PREC: #diff > active USABLE RULES: { } Number of SCCs: 2 SCC { #43 #44 #45 #46 #47 #48 } QKBOPS(sum)... removes: #44 #47 #48 I(active) = 1 + x1 \pi(active) = [1] I(#if) = 2 + x2 + x3 \pi(#if) = [2] I(mark) = x1 \pi(mark) = [1] PREC: #if = mark > active USABLE RULES: { } Number of SCCs: 2 SCC { #43 #45 #46 } QKBOPS(sum)... removes: #45 I(active) = x1 \pi(active) = [] I(#if) = 1 + x1 + x3 \pi(#if) = [3] I(mark) = x1 \pi(mark) = [1] PREC: #if = mark > active USABLE RULES: { } Number of SCCs: 2 SCC { #43 #46 } QKBOPS(sum)... removes: #43 I(active) = x1 \pi(active) = 1 I(#if) = x1 \pi(#if) = 1 I(mark) = 1 + x1 \pi(mark) = [] PREC: mark USABLE RULES: { } Number of SCCs: 2 SCC { #46 } QKBOPS(sum)... removes: #46 I(active) = 2 + x1 \pi(active) = [1] I(#if) = 1 + x1 + x3 \pi(#if) = [3] PREC: #if > active USABLE RULES: { } Number of SCCs: 1 SCC { #2 #5 #7 #8 #9 #15 #17 #19 #21 #22 #24 #25 #28 #30 #31 #33 #34 } QKBOPS(sum)... removes: #19 I(active) = 6 \pi(active) = [] I(false) = 3 I(#mark) = 4 \pi(#mark) = [] I(0) = 2 I(p) = 4 \pi(p) = [] I(if) = 4 \pi(if) = [] I(true) = 5 I(s) = 2 \pi(s) = [] I(#active) = x1 \pi(#active) = 1 I(diff) = 4 \pi(diff) = [] I(mark) = 5 \pi(mark) = [] I(leq) = 4 \pi(leq) = [] PREC: active > #mark = 0 = p = if = true = s = diff = mark = leq > false USABLE RULES: { 34..17 } Number of SCCs: 1 SCC { #2 #5 #7 #8 #9 #15 #17 #21 #22 #24 #25 #28 #30 #31 #33 #34 } QKBOPS(sum)... failed.