g(

g(

f(0, 1,

f(

R

↳Dependency Pair Analysis

F(0, 1,x) -> F(s(x),x,x)

F(x,y, s(z)) -> F(0, 1,z)

Furthermore,

R

↳DPs

→DP Problem 1

↳Argument Filtering and Ordering

**F( x, y, s(z)) -> F(0, 1, z)**

g(x,y) ->x

g(x,y) ->y

f(0, 1,x) -> f(s(x),x,x)

f(x,y, s(z)) -> s(f(0, 1,z))

The following dependency pair can be strictly oriented:

F(x,y, s(z)) -> F(0, 1,z)

There are no usable rules w.r.t. to the AFS 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,_{2}x) ->_{3}x_{3}

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

R

↳DPs

→DP Problem 1

↳AFS

→DP Problem 2

↳Dependency Graph

**F(0, 1, x) -> F(s(x), x, x)**

g(x,y) ->x

g(x,y) ->y

f(0, 1,x) -> f(s(x),x,x)

f(x,y, s(z)) -> s(f(0, 1,z))

Using the Dependency Graph resulted in no new DP problems.

Duration:

0:00 minutes