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

↳Instantiation Transformation

→DP Problem 2

↳Inst

**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

On this DP problem, an Instantiation SCC transformation can be performed.

As a result of transforming the rule

one new Dependency Pair is created:

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

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

The transformation is resulting in one new DP problem:

R

↳DPs

→DP Problem 1

↳Inst

→DP Problem 3

↳Instantiation Transformation

→DP Problem 2

↳Inst

**F(c(s( x''), s(y''))) -> F(c(x'', s(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

On this DP problem, an Instantiation SCC transformation can be performed.

As a result of transforming the rule

one new Dependency Pair is created:

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

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

The transformation is resulting in one new DP problem:

R

↳DPs

→DP Problem 1

↳Inst

→DP Problem 3

↳Inst

...

→DP Problem 4

↳Argument Filtering and Ordering

→DP Problem 2

↳Inst

**F(c(s( x''''), s(s(y'''')))) -> F(c(x'''', s(s(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''''), s(s(y'''')))) -> F(c(x'''', s(s(s(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:

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

↳Inst

→DP Problem 3

↳Inst

...

→DP Problem 5

↳Dependency Graph

→DP Problem 2

↳Inst

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

↳Inst

→DP Problem 2

↳Instantiation Transformation

**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

On this DP problem, an Instantiation SCC transformation can be performed.

As a result of transforming the rule

one new Dependency Pair is created:

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

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

The transformation is resulting in one new DP problem:

R

↳DPs

→DP Problem 1

↳Inst

→DP Problem 2

↳Inst

→DP Problem 6

↳Instantiation Transformation

**G(c(s( x''), s(y''))) -> G(c(s(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

On this DP problem, an Instantiation SCC transformation can be performed.

As a result of transforming the rule

one new Dependency Pair is created:

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

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

The transformation is resulting in one new DP problem:

R

↳DPs

→DP Problem 1

↳Inst

→DP Problem 2

↳Inst

→DP Problem 6

↳Inst

...

→DP Problem 7

↳Argument Filtering and Ordering

**G(c(s(s( x'''')), s(y''''))) -> G(c(s(s(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(s(s(x'''')), s(y''''))) -> G(c(s(s(s(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:

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

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

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

R

↳DPs

→DP Problem 1

↳Inst

→DP Problem 2

↳Inst

→DP Problem 6

↳Inst

...

→DP Problem 8

↳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