Input TRS: 1: del(.(x,.(y,z))) -> f(=(x,y),x,y,z) 2: f(true,x,y,z) -> del(.(y,z)) 3: f(false,x,y,z) -> .(x,del(.(y,z))) 4: =(nil,nil) -> true 5: =(.(x,y),nil) -> false 6: =(nil,.(y,z)) -> false 7: =(.(x,y),.(u,v)) -> and(=(x,u),=(y,v)) Dependency Pairs: #1: #del(.(x,.(y,z))) -> #f(=(x,y),x,y,z) #2: #del(.(x,.(y,z))) -> #=(x,y) #3: #f(true,x,y,z) -> #del(.(y,z)) #4: #f(false,x,y,z) -> #del(.(y,z)) #5: #=(.(x,y),.(u,v)) -> #=(x,u) #6: #=(.(x,y),.(u,v)) -> #=(y,v) Number of SCCs: 1 SCC { #1 #3 #4 } QKBOPS(sum)... removes: #4 I(false) = 3 I(.) = 2 + x1 + x2 \pi(.) = [] I(#del) = x1 \pi(#del) = [] I(true) = 1 I(nil) = 1 I(u) = 2 I(v) = 5 I(and) = x2 \pi(and) = [] I(=) = 4 \pi(=) = [] I(#f) = x1 + x2 + x3 + x4 \pi(#f) = [] PREC: v > . = #del = = = #f > false = true = and > nil = u USABLE RULES: { 7..4 } Number of SCCs: 1 SCC { #1 #3 } QKBOPS(sum)... removes: #1 #3 I(false) = 4 I(.) = 3 + x1 + x2 \pi(.) = [] I(#del) = x1 \pi(#del) = 1 I(true) = 3 I(nil) = 3 I(u) = 2 I(v) = 6 I(and) = x2 \pi(and) = [] I(=) = 5 \pi(=) = [] I(#f) = x1 + x2 + x3 + x4 \pi(#f) = [] PREC: v > . = #f > = > false = true = and > nil = u USABLE RULES: { 7..4 } Number of SCCs: 0