Input TRS: 1: notZero(pos(s(x))) -> true 2: notZero(neg(s(x))) -> true 3: notZero(neg(0)) -> false 4: notZero(pos(0)) -> false 5: greaterZero(pos(s(x))) -> true 6: greaterZero(pos(0)) -> false 7: greaterZero(neg(x)) -> false 8: and(false,false) -> false 9: and(false,true) -> false 10: and(true,false) -> false 11: and(true,true) -> true 12: minusT(0,y) -> neg(y) 13: minusT(x,0) -> pos(x) 14: minusT(s(x),s(y)) -> minusT(x,y) 15: plusNat(0,y) -> y 16: plusNat(s(x),y) -> plusNat(x,s(y)) 17: negate(pos(x)) -> neg(x) 18: negate(neg(x)) -> pos(x) 19: minus(pos(x),pos(y)) -> minusT(x,y) 20: minus(neg(x),neg(y)) -> negate(minusT(x,y)) 21: minus(pos(x),neg(y)) -> pos(plusNat(x,y)) 22: minus(neg(x),pos(y)) -> neg(plusNat(x,y)) 23: while(true,i,y) -> while(and(notZero(y),greaterZero(i)),minus(i,y),y) Dependency Pairs: #1: #minusT(s(x),s(y)) -> #minusT(x,y) #2: #plusNat(s(x),y) -> #plusNat(x,s(y)) #3: #minus(pos(x),pos(y)) -> #minusT(x,y) #4: #minus(neg(x),neg(y)) -> #negate(minusT(x,y)) #5: #minus(neg(x),neg(y)) -> #minusT(x,y) #6: #minus(pos(x),neg(y)) -> #plusNat(x,y) #7: #minus(neg(x),pos(y)) -> #plusNat(x,y) #8: #while(true,i,y) -> #while(and(notZero(y),greaterZero(i)),minus(i,y),y) #9: #while(true,i,y) -> #and(notZero(y),greaterZero(i)) #10: #while(true,i,y) -> #notZero(y) #11: #while(true,i,y) -> #greaterZero(i) #12: #while(true,i,y) -> #minus(i,y) Number of SCCs: 3 SCC { #1 } QKBOS(sum)... removes: #1 I(s) = 1 + x1 \pi(s) = [1] I(#minusT) = x1 + x2 \pi(#minusT) = [2,1] PREC: #minusT > s USABLE RULES: { } Number of SCCs: 2 SCC { #2 } QKBOS(sum)... removes: #2 I(#plusNat) = 1 + x1 \pi(#plusNat) = [1] I(s) = x1 \pi(s) = [1] PREC: s > #plusNat USABLE RULES: { } Number of SCCs: 1 SCC { #8 } QKBOS(sum)... failed.