f(s(

f(

f(

R

↳Dependency Pair Analysis

F(s(X),X) -> F(X, a(X))

F(X, c(X)) -> F(s(X),X)

Furthermore,

R

↳DPs

→DP Problem 1

↳Argument Filtering and Ordering

→DP Problem 2

↳AFS

**F(s( X), X) -> F(X, a(X))**

f(s(X),X) -> f(X, a(X))

f(X, c(X)) -> f(s(X),X)

f(X,X) -> c(X)

The following dependency pair can be strictly oriented:

F(s(X),X) -> F(X, a(X))

The following rules can be oriented:

f(s(X),X) -> f(X, a(X))

f(X, c(X)) -> f(s(X),X)

f(X,X) -> c(X)

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

F > a

f > c

resulting in one new DP problem.

Used Argument Filtering System:

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

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

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

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

c(x) -> c_{1}

R

↳DPs

→DP Problem 1

↳AFS

→DP Problem 3

↳Dependency Graph

→DP Problem 2

↳AFS

f(s(X),X) -> f(X, a(X))

f(X, c(X)) -> f(s(X),X)

f(X,X) -> c(X)

Using the Dependency Graph resulted in no new DP problems.

R

↳DPs

→DP Problem 1

↳AFS

→DP Problem 2

↳Argument Filtering and Ordering

**F( X, c(X)) -> F(s(X), X)**

f(s(X),X) -> f(X, a(X))

f(X, c(X)) -> f(s(X),X)

f(X,X) -> c(X)

The following dependency pair can be strictly oriented:

F(X, c(X)) -> F(s(X),X)

The following rules can be oriented:

f(s(X),X) -> f(X, a(X))

f(X, c(X)) -> f(s(X),X)

f(X,X) -> c(X)

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

f > c > F

f > c > s

resulting in one new DP problem.

Used Argument Filtering System:

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

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

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

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

a(x) ->_{1}x_{1}

R

↳DPs

→DP Problem 1

↳AFS

→DP Problem 2

↳AFS

→DP Problem 4

↳Dependency Graph

f(s(X),X) -> f(X, a(X))

f(X, c(X)) -> f(s(X),X)

f(X,X) -> c(X)

Using the Dependency Graph resulted in no new DP problems.

Duration:

0:00 minutes