R
↳Dependency Pair Analysis
INTLIST(cons(x, y)) -> INTLIST(y)
INT(s(x), s(y)) -> INTLIST(int(x, y))
INT(s(x), s(y)) -> INT(x, y)
INT(0, s(y)) -> INT(s(0), s(y))
R
↳DPs
→DP Problem 1
↳Polynomial Ordering
→DP Problem 2
↳Polo
INTLIST(cons(x, y)) -> INTLIST(y)
intlist(nil) -> nil
intlist(cons(x, y)) -> cons(s(x), intlist(y))
intlist(cons(x, nil)) -> cons(s(x), nil)
int(s(x), 0) -> nil
int(x, x) -> cons(x, nil)
int(s(x), s(y)) -> intlist(int(x, y))
int(0, s(y)) -> cons(0, int(s(0), s(y)))
INTLIST(cons(x, y)) -> INTLIST(y)
POL(cons(x1, x2)) = 1 + x2 POL(INTLIST(x1)) = x1
R
↳DPs
→DP Problem 1
↳Polo
→DP Problem 3
↳Dependency Graph
→DP Problem 2
↳Polo
intlist(nil) -> nil
intlist(cons(x, y)) -> cons(s(x), intlist(y))
intlist(cons(x, nil)) -> cons(s(x), nil)
int(s(x), 0) -> nil
int(x, x) -> cons(x, nil)
int(s(x), s(y)) -> intlist(int(x, y))
int(0, s(y)) -> cons(0, int(s(0), s(y)))
R
↳DPs
→DP Problem 1
↳Polo
→DP Problem 2
↳Polynomial Ordering
INT(0, s(y)) -> INT(s(0), s(y))
INT(s(x), s(y)) -> INT(x, y)
intlist(nil) -> nil
intlist(cons(x, y)) -> cons(s(x), intlist(y))
intlist(cons(x, nil)) -> cons(s(x), nil)
int(s(x), 0) -> nil
int(x, x) -> cons(x, nil)
int(s(x), s(y)) -> intlist(int(x, y))
int(0, s(y)) -> cons(0, int(s(0), s(y)))
INT(s(x), s(y)) -> INT(x, y)
POL(0) = 0 POL(s(x1)) = 1 + x1 POL(INT(x1, x2)) = x2
R
↳DPs
→DP Problem 1
↳Polo
→DP Problem 2
↳Polo
→DP Problem 4
↳Dependency Graph
INT(0, s(y)) -> INT(s(0), s(y))
intlist(nil) -> nil
intlist(cons(x, y)) -> cons(s(x), intlist(y))
intlist(cons(x, nil)) -> cons(s(x), nil)
int(s(x), 0) -> nil
int(x, x) -> cons(x, nil)
int(s(x), s(y)) -> intlist(int(x, y))
int(0, s(y)) -> cons(0, int(s(0), s(y)))