Term Rewriting System R:
[y, x, xs, f]
app(app(plus, 0), y) -> y
app(app(plus, app(s, x)), y) -> app(s, app(app(plus, x), y))
app(inc, xs) -> app(app(map, app(plus, app(s, 0))), xs)
app(app(map, f), nil) -> nil
app(app(map, f), app(app(cons, x), xs)) -> app(app(cons, app(f, x)), app(app(map, f), xs))

Innermost Termination of R to be shown.

`   R`
`     ↳Dependency Pair Analysis`

R contains the following Dependency Pairs:

APP(app(plus, app(s, x)), y) -> APP(s, app(app(plus, x), y))
APP(app(plus, app(s, x)), y) -> APP(app(plus, x), y)
APP(app(plus, app(s, x)), y) -> APP(plus, x)
APP(inc, xs) -> APP(app(map, app(plus, app(s, 0))), xs)
APP(inc, xs) -> APP(map, app(plus, app(s, 0)))
APP(inc, xs) -> APP(plus, app(s, 0))
APP(inc, xs) -> APP(s, 0)
APP(app(map, f), app(app(cons, x), xs)) -> APP(app(cons, app(f, x)), app(app(map, f), xs))
APP(app(map, f), app(app(cons, x), xs)) -> APP(cons, app(f, x))
APP(app(map, f), app(app(cons, x), xs)) -> APP(f, x)
APP(app(map, f), app(app(cons, x), xs)) -> APP(app(map, f), xs)

Furthermore, R contains one SCC.

`   R`
`     ↳DPs`
`       →DP Problem 1`
`         ↳Narrowing Transformation`

Dependency Pairs:

APP(app(map, f), app(app(cons, x), xs)) -> APP(app(map, f), xs)
APP(app(map, f), app(app(cons, x), xs)) -> APP(f, x)
APP(app(map, f), app(app(cons, x), xs)) -> APP(app(cons, app(f, x)), app(app(map, f), xs))
APP(inc, xs) -> APP(app(map, app(plus, app(s, 0))), xs)
APP(app(plus, app(s, x)), y) -> APP(app(plus, x), y)

Rules:

app(app(plus, 0), y) -> y
app(app(plus, app(s, x)), y) -> app(s, app(app(plus, x), y))
app(inc, xs) -> app(app(map, app(plus, app(s, 0))), xs)
app(app(map, f), nil) -> nil
app(app(map, f), app(app(cons, x), xs)) -> app(app(cons, app(f, x)), app(app(map, f), xs))

Strategy:

innermost

On this DP problem, a Narrowing SCC transformation can be performed.
As a result of transforming the rule

APP(app(map, f), app(app(cons, x), xs)) -> APP(app(cons, app(f, x)), app(app(map, f), xs))
seven new Dependency Pairs are created:

APP(app(map, app(plus, 0)), app(app(cons, x'), xs)) -> APP(app(cons, x'), app(app(map, app(plus, 0)), xs))
APP(app(map, app(plus, app(s, x''))), app(app(cons, x0), xs)) -> APP(app(cons, app(s, app(app(plus, x''), x0))), app(app(map, app(plus, app(s, x''))), xs))
APP(app(map, inc), app(app(cons, x'), xs)) -> APP(app(cons, app(app(map, app(plus, app(s, 0))), x')), app(app(map, inc), xs))
APP(app(map, app(map, f'')), app(app(cons, nil), xs)) -> APP(app(cons, nil), app(app(map, app(map, f'')), xs))
APP(app(map, app(map, f'')), app(app(cons, app(app(cons, x''), xs'')), xs)) -> APP(app(cons, app(app(cons, app(f'', x'')), app(app(map, f''), xs''))), app(app(map, app(map, f'')), xs))
APP(app(map, f''), app(app(cons, x), nil)) -> APP(app(cons, app(f'', x)), nil)
APP(app(map, f''), app(app(cons, x), app(app(cons, x''), xs''))) -> APP(app(cons, app(f'', x)), app(app(cons, app(f'', x'')), app(app(map, f''), xs'')))

The transformation is resulting in one new DP problem:

`   R`
`     ↳DPs`
`       →DP Problem 1`
`         ↳Nar`
`           →DP Problem 2`
`             ↳Forward Instantiation Transformation`

Dependency Pairs:

APP(app(map, f''), app(app(cons, x), app(app(cons, x''), xs''))) -> APP(app(cons, app(f'', x)), app(app(cons, app(f'', x'')), app(app(map, f''), xs'')))
APP(app(map, f''), app(app(cons, x), nil)) -> APP(app(cons, app(f'', x)), nil)
APP(app(map, app(map, f'')), app(app(cons, app(app(cons, x''), xs'')), xs)) -> APP(app(cons, app(app(cons, app(f'', x'')), app(app(map, f''), xs''))), app(app(map, app(map, f'')), xs))
APP(app(map, inc), app(app(cons, x'), xs)) -> APP(app(cons, app(app(map, app(plus, app(s, 0))), x')), app(app(map, inc), xs))
APP(app(map, app(plus, app(s, x''))), app(app(cons, x0), xs)) -> APP(app(cons, app(s, app(app(plus, x''), x0))), app(app(map, app(plus, app(s, x''))), xs))
APP(inc, xs) -> APP(app(map, app(plus, app(s, 0))), xs)
APP(app(plus, app(s, x)), y) -> APP(app(plus, x), y)
APP(app(map, f), app(app(cons, x), xs)) -> APP(f, x)
APP(app(map, f), app(app(cons, x), xs)) -> APP(app(map, f), xs)

Rules:

app(app(plus, 0), y) -> y
app(app(plus, app(s, x)), y) -> app(s, app(app(plus, x), y))
app(inc, xs) -> app(app(map, app(plus, app(s, 0))), xs)
app(app(map, f), nil) -> nil
app(app(map, f), app(app(cons, x), xs)) -> app(app(cons, app(f, x)), app(app(map, f), xs))

Strategy:

innermost

On this DP problem, a Forward Instantiation SCC transformation can be performed.
As a result of transforming the rule

APP(app(map, f), app(app(cons, x), xs)) -> APP(f, x)
eight new Dependency Pairs are created:

APP(app(map, app(map, f'')), app(app(cons, app(app(cons, x''), xs'')), xs)) -> APP(app(map, f''), app(app(cons, x''), xs''))
APP(app(map, app(plus, app(s, x''))), app(app(cons, x0), xs)) -> APP(app(plus, app(s, x'')), x0)
APP(app(map, inc), app(app(cons, x'), xs)) -> APP(inc, x')
APP(app(map, app(map, app(plus, app(s, x'''')))), app(app(cons, app(app(cons, x0''), xs'')), xs)) -> APP(app(map, app(plus, app(s, x''''))), app(app(cons, x0''), xs''))
APP(app(map, app(map, inc)), app(app(cons, app(app(cons, x'''), xs'')), xs)) -> APP(app(map, inc), app(app(cons, x'''), xs''))
APP(app(map, app(map, app(map, f''''))), app(app(cons, app(app(cons, app(app(cons, x''''), xs'''')), xs'')), xs)) -> APP(app(map, app(map, f'''')), app(app(cons, app(app(cons, x''''), xs'''')), xs''))
APP(app(map, app(map, f'''')), app(app(cons, app(app(cons, x''), nil)), xs)) -> APP(app(map, f''''), app(app(cons, x''), nil))
APP(app(map, app(map, f'''')), app(app(cons, app(app(cons, x''), app(app(cons, x''''), xs''''))), xs)) -> APP(app(map, f''''), app(app(cons, x''), app(app(cons, x''''), xs'''')))

The transformation is resulting in one new DP problem:

`   R`
`     ↳DPs`
`       →DP Problem 1`
`         ↳Nar`
`           →DP Problem 2`
`             ↳FwdInst`
`             ...`
`               →DP Problem 3`
`                 ↳Remaining Obligation(s)`

The following remains to be proven:
Dependency Pairs:

APP(app(map, app(map, f'''')), app(app(cons, app(app(cons, x''), app(app(cons, x''''), xs''''))), xs)) -> APP(app(map, f''''), app(app(cons, x''), app(app(cons, x''''), xs'''')))
APP(app(map, app(map, f'''')), app(app(cons, app(app(cons, x''), nil)), xs)) -> APP(app(map, f''''), app(app(cons, x''), nil))
APP(app(map, app(map, app(map, f''''))), app(app(cons, app(app(cons, app(app(cons, x''''), xs'''')), xs'')), xs)) -> APP(app(map, app(map, f'''')), app(app(cons, app(app(cons, x''''), xs'''')), xs''))
APP(app(map, app(map, inc)), app(app(cons, app(app(cons, x'''), xs'')), xs)) -> APP(app(map, inc), app(app(cons, x'''), xs''))
APP(app(map, app(map, app(plus, app(s, x'''')))), app(app(cons, app(app(cons, x0''), xs'')), xs)) -> APP(app(map, app(plus, app(s, x''''))), app(app(cons, x0''), xs''))
APP(app(map, inc), app(app(cons, x'), xs)) -> APP(inc, x')
APP(app(map, app(plus, app(s, x''))), app(app(cons, x0), xs)) -> APP(app(plus, app(s, x'')), x0)
APP(app(map, app(map, f'')), app(app(cons, app(app(cons, x''), xs'')), xs)) -> APP(app(map, f''), app(app(cons, x''), xs''))
APP(app(map, f''), app(app(cons, x), nil)) -> APP(app(cons, app(f'', x)), nil)
APP(app(map, app(map, f'')), app(app(cons, app(app(cons, x''), xs'')), xs)) -> APP(app(cons, app(app(cons, app(f'', x'')), app(app(map, f''), xs''))), app(app(map, app(map, f'')), xs))
APP(app(map, inc), app(app(cons, x'), xs)) -> APP(app(cons, app(app(map, app(plus, app(s, 0))), x')), app(app(map, inc), xs))
APP(app(map, app(plus, app(s, x''))), app(app(cons, x0), xs)) -> APP(app(cons, app(s, app(app(plus, x''), x0))), app(app(map, app(plus, app(s, x''))), xs))
APP(app(map, f), app(app(cons, x), xs)) -> APP(app(map, f), xs)
APP(inc, xs) -> APP(app(map, app(plus, app(s, 0))), xs)
APP(app(plus, app(s, x)), y) -> APP(app(plus, x), y)
APP(app(map, f''), app(app(cons, x), app(app(cons, x''), xs''))) -> APP(app(cons, app(f'', x)), app(app(cons, app(f'', x'')), app(app(map, f''), xs'')))

Rules:

app(app(plus, 0), y) -> y
app(app(plus, app(s, x)), y) -> app(s, app(app(plus, x), y))
app(inc, xs) -> app(app(map, app(plus, app(s, 0))), xs)
app(app(map, f), nil) -> nil
app(app(map, f), app(app(cons, x), xs)) -> app(app(cons, app(f, x)), app(app(map, f), xs))

Strategy:

innermost

Innermost Termination of R could not be shown.
Duration:
0:10 minutes