f(0,

f(

f(i(

f(f(

f(g(

f(1, g(

f(2, g(

R

↳Dependency Pair Analysis

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

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

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

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

Furthermore,

R

↳DPs

→DP Problem 1

↳Argument Filtering and Ordering

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

f(0,y) ->y

f(x, 0) ->x

f(i(x),y) -> i(x)

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

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

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

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

The following dependency pairs can be strictly oriented:

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

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

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

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

The following usable rules w.r.t. to the AFS can be oriented:

f(0,y) ->y

f(x, 0) ->x

f(i(x),y) -> i(x)

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

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

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

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

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

F > f > g

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}

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

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

R

↳DPs

→DP Problem 1

↳AFS

→DP Problem 2

↳Dependency Graph

f(0,y) ->y

f(x, 0) ->x

f(i(x),y) -> i(x)

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

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

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

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

Using the Dependency Graph resulted in no new DP problems.

Duration:

0:00 minutes