norm(nil) -> 0

norm(g(

f(

f(

rem(nil,

rem(g(

rem(g(

R

↳Dependency Pair Analysis

NORM(g(x,y)) -> NORM(x)

F(x, g(y,z)) -> F(x,y)

REM(g(x,y), s(z)) -> REM(x,z)

Furthermore,

R

↳DPs

→DP Problem 1

↳Argument Filtering and Ordering

→DP Problem 2

↳AFS

→DP Problem 3

↳AFS

**NORM(g( x, y)) -> NORM(x)**

norm(nil) -> 0

norm(g(x,y)) -> s(norm(x))

f(x, nil) -> g(nil,x)

f(x, g(y,z)) -> g(f(x,y),z)

rem(nil,y) -> nil

rem(g(x,y), 0) -> g(x,y)

rem(g(x,y), s(z)) -> rem(x,z)

innermost

The following dependency pair can be strictly oriented:

NORM(g(x,y)) -> NORM(x)

There are no usable rules for innermost that need to be oriented.

Used ordering: Lexicographic Path Order with Non-Strict Precedence with Quasi Precedence:

trivial

resulting in one new DP problem.

Used Argument Filtering System:

NORM(x) -> NORM(_{1}x)_{1}

g(x,_{1}x) -> g(_{2}x,_{1}x)_{2}

R

↳DPs

→DP Problem 1

↳AFS

→DP Problem 4

↳Dependency Graph

→DP Problem 2

↳AFS

→DP Problem 3

↳AFS

norm(nil) -> 0

norm(g(x,y)) -> s(norm(x))

f(x, nil) -> g(nil,x)

f(x, g(y,z)) -> g(f(x,y),z)

rem(nil,y) -> nil

rem(g(x,y), 0) -> g(x,y)

rem(g(x,y), s(z)) -> rem(x,z)

innermost

Using the Dependency Graph resulted in no new DP problems.

R

↳DPs

→DP Problem 1

↳AFS

→DP Problem 2

↳Argument Filtering and Ordering

→DP Problem 3

↳AFS

**F( x, g(y, z)) -> F(x, y)**

norm(nil) -> 0

norm(g(x,y)) -> s(norm(x))

f(x, nil) -> g(nil,x)

f(x, g(y,z)) -> g(f(x,y),z)

rem(nil,y) -> nil

rem(g(x,y), 0) -> g(x,y)

rem(g(x,y), s(z)) -> rem(x,z)

innermost

The following dependency pair can be strictly oriented:

F(x, g(y,z)) -> F(x,y)

There are no usable rules for innermost that need to be oriented.

Used ordering: Lexicographic Path Order with Non-Strict Precedence with Quasi Precedence:

trivial

resulting in one new DP problem.

Used Argument Filtering System:

F(x,_{1}x) -> F(_{2}x,_{1}x)_{2}

g(x,_{1}x) -> g(_{2}x,_{1}x)_{2}

R

↳DPs

→DP Problem 1

↳AFS

→DP Problem 2

↳AFS

→DP Problem 5

↳Dependency Graph

→DP Problem 3

↳AFS

norm(nil) -> 0

norm(g(x,y)) -> s(norm(x))

f(x, nil) -> g(nil,x)

f(x, g(y,z)) -> g(f(x,y),z)

rem(nil,y) -> nil

rem(g(x,y), 0) -> g(x,y)

rem(g(x,y), s(z)) -> rem(x,z)

innermost

Using the Dependency Graph resulted in no new DP problems.

R

↳DPs

→DP Problem 1

↳AFS

→DP Problem 2

↳AFS

→DP Problem 3

↳Argument Filtering and Ordering

**REM(g( x, y), s(z)) -> REM(x, z)**

norm(nil) -> 0

norm(g(x,y)) -> s(norm(x))

f(x, nil) -> g(nil,x)

f(x, g(y,z)) -> g(f(x,y),z)

rem(nil,y) -> nil

rem(g(x,y), 0) -> g(x,y)

rem(g(x,y), s(z)) -> rem(x,z)

innermost

The following dependency pair can be strictly oriented:

REM(g(x,y), s(z)) -> REM(x,z)

There are no usable rules for innermost that need to be oriented.

Used ordering: Lexicographic Path Order with Non-Strict Precedence with Quasi Precedence:

trivial

resulting in one new DP problem.

Used Argument Filtering System:

REM(x,_{1}x) -> REM(_{2}x,_{1}x)_{2}

g(x,_{1}x) -> g(_{2}x,_{1}x)_{2}

s(x) -> s(_{1}x)_{1}

R

↳DPs

→DP Problem 1

↳AFS

→DP Problem 2

↳AFS

→DP Problem 3

↳AFS

→DP Problem 6

↳Dependency Graph

norm(nil) -> 0

norm(g(x,y)) -> s(norm(x))

f(x, nil) -> g(nil,x)

f(x, g(y,z)) -> g(f(x,y),z)

rem(nil,y) -> nil

rem(g(x,y), 0) -> g(x,y)

rem(g(x,y), s(z)) -> rem(x,z)

innermost

Using the Dependency Graph resulted in no new DP problems.

Duration:

0:00 minutes