f(c(s(

g(c(

g(s(f(

R

↳Dependency Pair Analysis

F(c(s(x),y)) -> F(c(x, s(y)))

G(c(x, s(y))) -> G(c(s(x),y))

G(s(f(x))) -> G(f(x))

Furthermore,

R

↳DPs

→DP Problem 1

↳Argument Filtering and Ordering

→DP Problem 2

↳AFS

**F(c(s( x), y)) -> F(c(x, s(y)))**

f(c(s(x),y)) -> f(c(x, s(y)))

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

g(s(f(x))) -> g(f(x))

innermost

The following dependency pair can be strictly oriented:

F(c(s(x),y)) -> F(c(x, s(y)))

There are no usable rules for innermost w.r.t. to the AFS that need to be oriented.

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

c > s

resulting in one new DP problem.

Used Argument Filtering System:

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

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

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

R

↳DPs

→DP Problem 1

↳AFS

→DP Problem 3

↳Dependency Graph

→DP Problem 2

↳AFS

f(c(s(x),y)) -> f(c(x, s(y)))

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

g(s(f(x))) -> g(f(x))

innermost

Using the Dependency Graph resulted in no new DP problems.

R

↳DPs

→DP Problem 1

↳AFS

→DP Problem 2

↳Argument Filtering and Ordering

**G(c( x, s(y))) -> G(c(s(x), y))**

f(c(s(x),y)) -> f(c(x, s(y)))

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

g(s(f(x))) -> g(f(x))

innermost

The following dependency pair can be strictly oriented:

G(c(x, s(y))) -> G(c(s(x),y))

There are no usable rules for innermost 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:

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

c(x,_{1}x) ->_{2}x_{2}

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

R

↳DPs

→DP Problem 1

↳AFS

→DP Problem 2

↳AFS

→DP Problem 4

↳Dependency Graph

f(c(s(x),y)) -> f(c(x, s(y)))

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

g(s(f(x))) -> g(f(x))

innermost

Using the Dependency Graph resulted in no new DP problems.

Duration:

0:00 minutes