R
↳Dependency Pair Analysis
MSORT(.(x, y)) -> MIN(x, y)
MSORT(.(x, y)) -> MSORT(del(min(x, y), .(x, y)))
MSORT(.(x, y)) -> DEL(min(x, y), .(x, y))
MIN(x, .(y, z)) -> MIN(x, z)
MIN(x, .(y, z)) -> MIN(y, z)
DEL(x, .(y, z)) -> DEL(x, z)
R
↳DPs
→DP Problem 1
↳Remaining Obligation(s)
→DP Problem 2
↳Remaining Obligation(s)
→DP Problem 3
↳Remaining Obligation(s)
MIN(x, .(y, z)) -> MIN(y, z)
MIN(x, .(y, z)) -> MIN(x, z)
msort(nil) -> nil
msort(.(x, y)) -> .(min(x, y), msort(del(min(x, y), .(x, y))))
min(x, nil) -> x
min(x, .(y, z)) -> if(<=(x, y), min(x, z), min(y, z))
del(x, nil) -> nil
del(x, .(y, z)) -> if(=(x, y), z, .(y, del(x, z)))
DEL(x, .(y, z)) -> DEL(x, z)
msort(nil) -> nil
msort(.(x, y)) -> .(min(x, y), msort(del(min(x, y), .(x, y))))
min(x, nil) -> x
min(x, .(y, z)) -> if(<=(x, y), min(x, z), min(y, z))
del(x, nil) -> nil
del(x, .(y, z)) -> if(=(x, y), z, .(y, del(x, z)))
MSORT(.(x, y)) -> MSORT(del(min(x, y), .(x, y)))
msort(nil) -> nil
msort(.(x, y)) -> .(min(x, y), msort(del(min(x, y), .(x, y))))
min(x, nil) -> x
min(x, .(y, z)) -> if(<=(x, y), min(x, z), min(y, z))
del(x, nil) -> nil
del(x, .(y, z)) -> if(=(x, y), z, .(y, del(x, z)))
R
↳DPs
→DP Problem 1
↳Remaining Obligation(s)
→DP Problem 2
↳Remaining Obligation(s)
→DP Problem 3
↳Remaining Obligation(s)
MIN(x, .(y, z)) -> MIN(y, z)
MIN(x, .(y, z)) -> MIN(x, z)
msort(nil) -> nil
msort(.(x, y)) -> .(min(x, y), msort(del(min(x, y), .(x, y))))
min(x, nil) -> x
min(x, .(y, z)) -> if(<=(x, y), min(x, z), min(y, z))
del(x, nil) -> nil
del(x, .(y, z)) -> if(=(x, y), z, .(y, del(x, z)))
DEL(x, .(y, z)) -> DEL(x, z)
msort(nil) -> nil
msort(.(x, y)) -> .(min(x, y), msort(del(min(x, y), .(x, y))))
min(x, nil) -> x
min(x, .(y, z)) -> if(<=(x, y), min(x, z), min(y, z))
del(x, nil) -> nil
del(x, .(y, z)) -> if(=(x, y), z, .(y, del(x, z)))
MSORT(.(x, y)) -> MSORT(del(min(x, y), .(x, y)))
msort(nil) -> nil
msort(.(x, y)) -> .(min(x, y), msort(del(min(x, y), .(x, y))))
min(x, nil) -> x
min(x, .(y, z)) -> if(<=(x, y), min(x, z), min(y, z))
del(x, nil) -> nil
del(x, .(y, z)) -> if(=(x, y), z, .(y, del(x, z)))
R
↳DPs
→DP Problem 1
↳Remaining Obligation(s)
→DP Problem 2
↳Remaining Obligation(s)
→DP Problem 3
↳Remaining Obligation(s)
MIN(x, .(y, z)) -> MIN(y, z)
MIN(x, .(y, z)) -> MIN(x, z)
msort(nil) -> nil
msort(.(x, y)) -> .(min(x, y), msort(del(min(x, y), .(x, y))))
min(x, nil) -> x
min(x, .(y, z)) -> if(<=(x, y), min(x, z), min(y, z))
del(x, nil) -> nil
del(x, .(y, z)) -> if(=(x, y), z, .(y, del(x, z)))
DEL(x, .(y, z)) -> DEL(x, z)
msort(nil) -> nil
msort(.(x, y)) -> .(min(x, y), msort(del(min(x, y), .(x, y))))
min(x, nil) -> x
min(x, .(y, z)) -> if(<=(x, y), min(x, z), min(y, z))
del(x, nil) -> nil
del(x, .(y, z)) -> if(=(x, y), z, .(y, del(x, z)))
MSORT(.(x, y)) -> MSORT(del(min(x, y), .(x, y)))
msort(nil) -> nil
msort(.(x, y)) -> .(min(x, y), msort(del(min(x, y), .(x, y))))
min(x, nil) -> x
min(x, .(y, z)) -> if(<=(x, y), min(x, z), min(y, z))
del(x, nil) -> nil
del(x, .(y, z)) -> if(=(x, y), z, .(y, del(x, z)))