Term Rewriting System R:
[f, x, 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(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))


Rules:


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))
four new Dependency Pairs are created:

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
             ↳Narrowing 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, 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), xs)) -> APP(f, x)
APP(app(map, f), app(app(cons, x), xs)) -> APP(app(map, f), xs)


Rules:


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, 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))
six new Dependency Pairs are created:

APP(app(map, app(map, app(map, f'))), app(app(cons, app(app(cons, nil), xs'')), xs)) -> APP(app(cons, app(app(cons, nil), app(app(map, app(map, f')), xs''))), app(app(map, app(map, app(map, f'))), xs))
APP(app(map, app(map, app(map, f'))), app(app(cons, app(app(cons, app(app(cons, x'), xs''')), xs'')), xs)) -> APP(app(cons, app(app(cons, app(app(cons, app(f', x')), app(app(map, f'), xs'''))), app(app(map, app(map, f')), xs''))), app(app(map, app(map, app(map, f'))), xs))
APP(app(map, app(map, f''')), app(app(cons, app(app(cons, x''), nil)), xs)) -> APP(app(cons, app(app(cons, app(f''', x'')), nil)), app(app(map, app(map, f''')), xs))
APP(app(map, app(map, f''')), app(app(cons, app(app(cons, x''), app(app(cons, x'), xs'''))), xs)) -> APP(app(cons, app(app(cons, app(f''', x'')), app(app(cons, app(f''', x')), app(app(map, f'''), xs''')))), app(app(map, app(map, f''')), xs))
APP(app(map, app(map, f''')), app(app(cons, app(app(cons, x''), xs'')), nil)) -> APP(app(cons, app(app(cons, app(f''', x'')), app(app(map, f'''), xs''))), nil)
APP(app(map, app(map, f''')), app(app(cons, app(app(cons, x''), xs'')), app(app(cons, x'), xs'''))) -> APP(app(cons, app(app(cons, app(f''', x'')), app(app(map, f'''), xs''))), app(app(cons, app(app(map, f'''), x')), app(app(map, app(map, f''')), xs''')))

The transformation is resulting in one new DP problem: 



   R
     ↳DPs
       →DP Problem 1
         ↳Nar
           →DP Problem 2
             ↳Nar
             ...
               →DP Problem 3
                 ↳Narrowing Transformation


Dependency Pairs:

APP(app(map, app(map, f''')), app(app(cons, app(app(cons, x''), xs'')), app(app(cons, x'), xs'''))) -> APP(app(cons, app(app(cons, app(f''', x'')), app(app(map, f'''), xs''))), app(app(cons, app(app(map, f'''), x')), app(app(map, app(map, f''')), xs''')))
APP(app(map, app(map, f''')), app(app(cons, app(app(cons, x''), app(app(cons, x'), xs'''))), xs)) -> APP(app(cons, app(app(cons, app(f''', x'')), app(app(cons, app(f''', x')), app(app(map, f'''), xs''')))), app(app(map, app(map, f''')), xs))
APP(app(map, app(map, f''')), app(app(cons, app(app(cons, x''), nil)), xs)) -> APP(app(cons, app(app(cons, app(f''', x'')), nil)), app(app(map, app(map, f''')), xs))
APP(app(map, app(map, app(map, f'))), app(app(cons, app(app(cons, app(app(cons, x'), xs''')), xs'')), xs)) -> APP(app(cons, app(app(cons, app(app(cons, app(f', x')), app(app(map, f'), xs'''))), app(app(map, app(map, f')), xs''))), app(app(map, app(map, app(map, f'))), xs))
APP(app(map, app(map, app(map, f'))), app(app(cons, app(app(cons, nil), xs'')), xs)) -> APP(app(cons, app(app(cons, nil), app(app(map, app(map, f')), xs''))), app(app(map, app(map, app(map, f'))), xs))
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), 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(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), app(app(cons, x''), xs''))) -> APP(app(cons, app(f'', x)), app(app(cons, app(f'', x'')), app(app(map, f''), xs'')))
six new Dependency Pairs are created:

APP(app(map, app(map, f')), app(app(cons, nil), app(app(cons, x''), xs''))) -> APP(app(cons, nil), app(app(cons, app(app(map, f'), x'')), app(app(map, app(map, f')), xs'')))
APP(app(map, app(map, f')), app(app(cons, app(app(cons, x'''), xs')), app(app(cons, x''), xs''))) -> APP(app(cons, app(app(cons, app(f', x''')), app(app(map, f'), xs'))), app(app(cons, app(app(map, f'), x'')), app(app(map, app(map, f')), xs'')))
APP(app(map, app(map, f')), app(app(cons, x), app(app(cons, nil), xs''))) -> APP(app(cons, app(app(map, f'), x)), app(app(cons, nil), app(app(map, app(map, f')), xs'')))
APP(app(map, app(map, f')), app(app(cons, x), app(app(cons, app(app(cons, x'''), xs')), xs''))) -> APP(app(cons, app(app(map, f'), x)), 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), app(app(cons, x''), nil))) -> APP(app(cons, app(f''', x)), app(app(cons, app(f''', x'')), nil))
APP(app(map, f'''), app(app(cons, x), app(app(cons, x''), app(app(cons, x'''), xs')))) -> APP(app(cons, app(f''', x)), 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
             ↳Nar
             ...
               →DP Problem 4
                 ↳Forward Instantiation Transformation


Dependency Pairs:

APP(app(map, f'''), app(app(cons, x), app(app(cons, x''), app(app(cons, x'''), xs')))) -> APP(app(cons, app(f''', x)), 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), app(app(cons, x''), nil))) -> APP(app(cons, app(f''', x)), app(app(cons, app(f''', x'')), nil))
APP(app(map, app(map, f')), app(app(cons, x), app(app(cons, app(app(cons, x'''), xs')), xs''))) -> APP(app(cons, app(app(map, f'), x)), app(app(cons, app(app(cons, app(f', x''')), app(app(map, f'), xs'))), app(app(map, app(map, f')), xs'')))
APP(app(map, app(map, f')), app(app(cons, x), app(app(cons, nil), xs''))) -> APP(app(cons, app(app(map, f'), x)), 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')), app(app(cons, x''), xs''))) -> APP(app(cons, app(app(cons, app(f', x''')), app(app(map, f'), xs'))), app(app(cons, app(app(map, f'), x'')), app(app(map, app(map, f')), xs'')))
APP(app(map, app(map, f''')), app(app(cons, app(app(cons, x''), app(app(cons, x'), xs'''))), xs)) -> APP(app(cons, app(app(cons, app(f''', x'')), app(app(cons, app(f''', x')), app(app(map, f'''), xs''')))), app(app(map, app(map, f''')), xs))
APP(app(map, app(map, f''')), app(app(cons, app(app(cons, x''), nil)), xs)) -> APP(app(cons, app(app(cons, app(f''', x'')), nil)), app(app(map, app(map, f''')), xs))
APP(app(map, app(map, app(map, f'))), app(app(cons, app(app(cons, app(app(cons, x'), xs''')), xs'')), xs)) -> APP(app(cons, app(app(cons, app(app(cons, app(f', x')), app(app(map, f'), xs'''))), app(app(map, app(map, f')), xs''))), app(app(map, app(map, app(map, f'))), xs))
APP(app(map, app(map, app(map, f'))), app(app(cons, app(app(cons, nil), xs'')), xs)) -> APP(app(cons, app(app(cons, nil), app(app(map, app(map, f')), xs''))), app(app(map, app(map, app(map, f'))), xs))
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, app(map, f''')), app(app(cons, app(app(cons, x''), xs'')), app(app(cons, x'), xs'''))) -> APP(app(cons, app(app(cons, app(f''', x'')), app(app(map, f'''), xs''))), app(app(cons, app(app(map, f'''), x')), app(app(map, app(map, f''')), xs''')))


Rules:


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)
11 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(map, app(map, app(map, f''')))), app(app(cons, app(app(cons, app(app(cons, nil), xs'''')), xs'')), xs)) -> APP(app(map, app(map, app(map, f'''))), app(app(cons, app(app(cons, nil), xs'''')), xs''))
APP(app(map, app(map, app(map, app(map, f''')))), app(app(cons, app(app(cons, app(app(cons, app(app(cons, x'''), xs''''')), xs''0')), xs'')), xs)) -> APP(app(map, app(map, app(map, f'''))), app(app(cons, app(app(cons, app(app(cons, x'''), xs''''')), xs''0')), xs''))
APP(app(map, app(map, app(map, f'''''))), app(app(cons, app(app(cons, app(app(cons, x''''), nil)), xs'')), xs)) -> APP(app(map, app(map, f''''')), app(app(cons, app(app(cons, x''''), nil)), xs''))
APP(app(map, app(map, app(map, f'''''))), app(app(cons, app(app(cons, app(app(cons, x''''), app(app(cons, x'0'), xs'''''))), xs'')), xs)) -> APP(app(map, app(map, f''''')), app(app(cons, app(app(cons, x''''), app(app(cons, x'0'), xs'''''))), xs''))
APP(app(map, app(map, app(map, f'''''))), app(app(cons, app(app(cons, app(app(cons, x''''), xs''''0)), app(app(cons, x'0'), xs''''''))), xs)) -> APP(app(map, app(map, f''''')), app(app(cons, app(app(cons, x''''), xs''''0)), app(app(cons, x'0'), xs'''''')))
APP(app(map, app(map, app(map, f'''))), app(app(cons, app(app(cons, app(app(cons, x'''''), xs''''')), app(app(cons, x''0'), xs''''''))), xs)) -> APP(app(map, app(map, f''')), app(app(cons, app(app(cons, x'''''), xs''''')), app(app(cons, x''0'), xs'''''')))
APP(app(map, app(map, app(map, f'''))), app(app(cons, app(app(cons, x''), app(app(cons, nil), xs''''))), xs)) -> APP(app(map, app(map, f''')), app(app(cons, x''), app(app(cons, nil), xs'''')))
APP(app(map, app(map, app(map, f'''))), app(app(cons, app(app(cons, x''), app(app(cons, app(app(cons, x'''''), xs''''')), xs''''''))), xs)) -> APP(app(map, app(map, f''')), app(app(cons, x''), app(app(cons, app(app(cons, x'''''), xs''''')), xs'''''')))
APP(app(map, app(map, f''''')), app(app(cons, app(app(cons, x''), app(app(cons, x''''), nil))), xs)) -> APP(app(map, f'''''), app(app(cons, x''), app(app(cons, x''''), nil)))
APP(app(map, app(map, f''''')), app(app(cons, app(app(cons, x''), app(app(cons, x''''0), app(app(cons, x''''''), xs''')))), xs)) -> APP(app(map, f'''''), app(app(cons, x''), app(app(cons, x''''0), app(app(cons, x''''''), xs'''))))

The transformation is resulting in one new DP problem: 



   R
     ↳DPs
       →DP Problem 1
         ↳Nar
           →DP Problem 2
             ↳Nar
             ...
               →DP Problem 5
                 ↳Argument Filtering and Ordering


Dependency Pairs:

APP(app(map, app(map, f''''')), app(app(cons, app(app(cons, x''), app(app(cons, x''''0), app(app(cons, x''''''), xs''')))), xs)) -> APP(app(map, f'''''), app(app(cons, x''), app(app(cons, x''''0), app(app(cons, x''''''), xs'''))))
APP(app(map, app(map, f''''')), app(app(cons, app(app(cons, x''), app(app(cons, x''''), nil))), xs)) -> APP(app(map, f'''''), app(app(cons, x''), app(app(cons, x''''), nil)))
APP(app(map, app(map, app(map, f'''))), app(app(cons, app(app(cons, x''), app(app(cons, app(app(cons, x'''''), xs''''')), xs''''''))), xs)) -> APP(app(map, app(map, f''')), app(app(cons, x''), app(app(cons, app(app(cons, x'''''), xs''''')), xs'''''')))
APP(app(map, app(map, app(map, f'''))), app(app(cons, app(app(cons, app(app(cons, x'''''), xs''''')), app(app(cons, x''0'), xs''''''))), xs)) -> APP(app(map, app(map, f''')), app(app(cons, app(app(cons, x'''''), xs''''')), app(app(cons, x''0'), xs'''''')))
APP(app(map, app(map, app(map, f'''''))), app(app(cons, app(app(cons, app(app(cons, x''''), xs''''0)), app(app(cons, x'0'), xs''''''))), xs)) -> APP(app(map, app(map, f''''')), app(app(cons, app(app(cons, x''''), xs''''0)), app(app(cons, x'0'), xs'''''')))
APP(app(map, app(map, app(map, f'''''))), app(app(cons, app(app(cons, app(app(cons, x''''), app(app(cons, x'0'), xs'''''))), xs'')), xs)) -> APP(app(map, app(map, f''''')), app(app(cons, app(app(cons, x''''), app(app(cons, x'0'), xs'''''))), xs''))
APP(app(map, app(map, app(map, f'''''))), app(app(cons, app(app(cons, app(app(cons, x''''), nil)), xs'')), xs)) -> APP(app(map, app(map, f''''')), app(app(cons, app(app(cons, x''''), nil)), xs''))
APP(app(map, app(map, app(map, app(map, f''')))), app(app(cons, app(app(cons, app(app(cons, app(app(cons, x'''), xs''''')), xs''0')), xs'')), xs)) -> APP(app(map, app(map, app(map, f'''))), app(app(cons, app(app(cons, app(app(cons, x'''), xs''''')), xs''0')), xs''))
APP(app(map, app(map, app(map, f'''))), app(app(cons, app(app(cons, x''), app(app(cons, nil), xs''''))), xs)) -> APP(app(map, app(map, f''')), app(app(cons, x''), app(app(cons, nil), xs'''')))
APP(app(map, app(map, app(map, app(map, f''')))), app(app(cons, app(app(cons, app(app(cons, nil), xs'''')), xs'')), xs)) -> APP(app(map, app(map, app(map, f'''))), app(app(cons, app(app(cons, nil), xs'''')), xs''))
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), app(app(cons, x''), nil))) -> APP(app(cons, app(f''', x)), app(app(cons, app(f''', x'')), nil))
APP(app(map, app(map, f')), app(app(cons, x), app(app(cons, app(app(cons, x'''), xs')), xs''))) -> APP(app(cons, app(app(map, f'), x)), app(app(cons, app(app(cons, app(f', x''')), app(app(map, f'), xs'))), app(app(map, app(map, f')), xs'')))
APP(app(map, app(map, f')), app(app(cons, x), app(app(cons, nil), xs''))) -> APP(app(cons, app(app(map, f'), x)), 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')), app(app(cons, x''), xs''))) -> APP(app(cons, app(app(cons, app(f', x''')), app(app(map, f'), xs'))), app(app(cons, app(app(map, f'), x'')), app(app(map, app(map, f')), xs'')))
APP(app(map, app(map, f''')), app(app(cons, app(app(cons, x''), xs'')), app(app(cons, x'), xs'''))) -> APP(app(cons, app(app(cons, app(f''', x'')), app(app(map, f'''), xs''))), app(app(cons, app(app(map, f'''), x')), app(app(map, app(map, f''')), xs''')))
APP(app(map, app(map, f''')), app(app(cons, app(app(cons, x''), app(app(cons, x'), xs'''))), xs)) -> APP(app(cons, app(app(cons, app(f''', x'')), app(app(cons, app(f''', x')), app(app(map, f'''), xs''')))), app(app(map, app(map, f''')), xs))
APP(app(map, app(map, f''')), app(app(cons, app(app(cons, x''), nil)), xs)) -> APP(app(cons, app(app(cons, app(f''', x'')), nil)), app(app(map, app(map, f''')), xs))
APP(app(map, app(map, app(map, f'))), app(app(cons, app(app(cons, app(app(cons, x'), xs''')), xs'')), xs)) -> APP(app(cons, app(app(cons, app(app(cons, app(f', x')), app(app(map, f'), xs'''))), app(app(map, app(map, f')), xs''))), app(app(map, app(map, app(map, f'))), xs))
APP(app(map, app(map, app(map, f'))), app(app(cons, app(app(cons, nil), xs'')), xs)) -> APP(app(cons, app(app(cons, nil), app(app(map, app(map, f')), xs''))), app(app(map, app(map, app(map, f'))), xs))
APP(app(map, f), app(app(cons, x), xs)) -> APP(app(map, f), xs)
APP(app(map, f'''), app(app(cons, x), app(app(cons, x''), app(app(cons, x'''), xs')))) -> APP(app(cons, app(f''', x)), app(app(cons, app(f''', x'')), app(app(cons, app(f''', x''')), app(app(map, f'''), xs'))))


Rules:


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




The following dependency pairs can be strictly oriented:

APP(app(map, f'''), app(app(cons, x), app(app(cons, x''), nil))) -> APP(app(cons, app(f''', x)), app(app(cons, app(f''', x'')), nil))
APP(app(map, app(map, f')), app(app(cons, x), app(app(cons, app(app(cons, x'''), xs')), xs''))) -> APP(app(cons, app(app(map, f'), x)), app(app(cons, app(app(cons, app(f', x''')), app(app(map, f'), xs'))), app(app(map, app(map, f')), xs'')))
APP(app(map, app(map, f')), app(app(cons, x), app(app(cons, nil), xs''))) -> APP(app(cons, app(app(map, f'), x)), 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')), app(app(cons, x''), xs''))) -> APP(app(cons, app(app(cons, app(f', x''')), app(app(map, f'), xs'))), app(app(cons, app(app(map, f'), x'')), app(app(map, app(map, f')), xs'')))
APP(app(map, app(map, f''')), app(app(cons, app(app(cons, x''), xs'')), app(app(cons, x'), xs'''))) -> APP(app(cons, app(app(cons, app(f''', x'')), app(app(map, f'''), xs''))), app(app(cons, app(app(map, f'''), x')), app(app(map, app(map, f''')), xs''')))
APP(app(map, app(map, f''')), app(app(cons, app(app(cons, x''), app(app(cons, x'), xs'''))), xs)) -> APP(app(cons, app(app(cons, app(f''', x'')), app(app(cons, app(f''', x')), app(app(map, f'''), xs''')))), app(app(map, app(map, f''')), xs))
APP(app(map, app(map, f''')), app(app(cons, app(app(cons, x''), nil)), xs)) -> APP(app(cons, app(app(cons, app(f''', x'')), nil)), app(app(map, app(map, f''')), xs))
APP(app(map, app(map, app(map, f'))), app(app(cons, app(app(cons, app(app(cons, x'), xs''')), xs'')), xs)) -> APP(app(cons, app(app(cons, app(app(cons, app(f', x')), app(app(map, f'), xs'''))), app(app(map, app(map, f')), xs''))), app(app(map, app(map, app(map, f'))), xs))
APP(app(map, app(map, app(map, f'))), app(app(cons, app(app(cons, nil), xs'')), xs)) -> APP(app(cons, app(app(cons, nil), app(app(map, app(map, f')), xs''))), app(app(map, app(map, app(map, f'))), xs))
APP(app(map, f'''), app(app(cons, x), app(app(cons, x''), app(app(cons, x'''), xs')))) -> APP(app(cons, app(f''', x)), app(app(cons, app(f''', x'')), app(app(cons, app(f''', x''')), app(app(map, f'''), xs'))))


The following usable rules for innermost w.r.t. to the AFS can be oriented:

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


Used ordering: Lexicographic Path Order with Non-Strict Precedence with Quasi Precedence:
{nil, map} > cons

resulting in one new DP problem.
Used Argument Filtering System:
APP(x1, x2) -> x1
app(x1, x2) -> x1


   R
     ↳DPs
       →DP Problem 1
         ↳Nar
           →DP Problem 2
             ↳Nar
             ...
               →DP Problem 6
                 ↳Argument Filtering and Ordering


Dependency Pairs:

APP(app(map, app(map, f''''')), app(app(cons, app(app(cons, x''), app(app(cons, x''''0), app(app(cons, x''''''), xs''')))), xs)) -> APP(app(map, f'''''), app(app(cons, x''), app(app(cons, x''''0), app(app(cons, x''''''), xs'''))))
APP(app(map, app(map, f''''')), app(app(cons, app(app(cons, x''), app(app(cons, x''''), nil))), xs)) -> APP(app(map, f'''''), app(app(cons, x''), app(app(cons, x''''), nil)))
APP(app(map, app(map, app(map, f'''))), app(app(cons, app(app(cons, x''), app(app(cons, app(app(cons, x'''''), xs''''')), xs''''''))), xs)) -> APP(app(map, app(map, f''')), app(app(cons, x''), app(app(cons, app(app(cons, x'''''), xs''''')), xs'''''')))
APP(app(map, app(map, app(map, f'''))), app(app(cons, app(app(cons, app(app(cons, x'''''), xs''''')), app(app(cons, x''0'), xs''''''))), xs)) -> APP(app(map, app(map, f''')), app(app(cons, app(app(cons, x'''''), xs''''')), app(app(cons, x''0'), xs'''''')))
APP(app(map, app(map, app(map, f'''''))), app(app(cons, app(app(cons, app(app(cons, x''''), xs''''0)), app(app(cons, x'0'), xs''''''))), xs)) -> APP(app(map, app(map, f''''')), app(app(cons, app(app(cons, x''''), xs''''0)), app(app(cons, x'0'), xs'''''')))
APP(app(map, app(map, app(map, f'''''))), app(app(cons, app(app(cons, app(app(cons, x''''), app(app(cons, x'0'), xs'''''))), xs'')), xs)) -> APP(app(map, app(map, f''''')), app(app(cons, app(app(cons, x''''), app(app(cons, x'0'), xs'''''))), xs''))
APP(app(map, app(map, app(map, f'''''))), app(app(cons, app(app(cons, app(app(cons, x''''), nil)), xs'')), xs)) -> APP(app(map, app(map, f''''')), app(app(cons, app(app(cons, x''''), nil)), xs''))
APP(app(map, app(map, app(map, app(map, f''')))), app(app(cons, app(app(cons, app(app(cons, app(app(cons, x'''), xs''''')), xs''0')), xs'')), xs)) -> APP(app(map, app(map, app(map, f'''))), app(app(cons, app(app(cons, app(app(cons, x'''), xs''''')), xs''0')), xs''))
APP(app(map, app(map, app(map, f'''))), app(app(cons, app(app(cons, x''), app(app(cons, nil), xs''''))), xs)) -> APP(app(map, app(map, f''')), app(app(cons, x''), app(app(cons, nil), xs'''')))
APP(app(map, app(map, app(map, app(map, f''')))), app(app(cons, app(app(cons, app(app(cons, nil), xs'''')), xs'')), xs)) -> APP(app(map, app(map, app(map, f'''))), app(app(cons, app(app(cons, nil), xs'''')), xs''))
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), xs)) -> APP(app(map, f), xs)


Rules:


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




The following dependency pairs can be strictly oriented:

APP(app(map, app(map, f''''')), app(app(cons, app(app(cons, x''), app(app(cons, x''''0), app(app(cons, x''''''), xs''')))), xs)) -> APP(app(map, f'''''), app(app(cons, x''), app(app(cons, x''''0), app(app(cons, x''''''), xs'''))))
APP(app(map, app(map, f''''')), app(app(cons, app(app(cons, x''), app(app(cons, x''''), nil))), xs)) -> APP(app(map, f'''''), app(app(cons, x''), app(app(cons, x''''), nil)))
APP(app(map, app(map, app(map, f'''))), app(app(cons, app(app(cons, x''), app(app(cons, app(app(cons, x'''''), xs''''')), xs''''''))), xs)) -> APP(app(map, app(map, f''')), app(app(cons, x''), app(app(cons, app(app(cons, x'''''), xs''''')), xs'''''')))
APP(app(map, app(map, app(map, f'''))), app(app(cons, app(app(cons, app(app(cons, x'''''), xs''''')), app(app(cons, x''0'), xs''''''))), xs)) -> APP(app(map, app(map, f''')), app(app(cons, app(app(cons, x'''''), xs''''')), app(app(cons, x''0'), xs'''''')))
APP(app(map, app(map, app(map, f'''''))), app(app(cons, app(app(cons, app(app(cons, x''''), xs''''0)), app(app(cons, x'0'), xs''''''))), xs)) -> APP(app(map, app(map, f''''')), app(app(cons, app(app(cons, x''''), xs''''0)), app(app(cons, x'0'), xs'''''')))
APP(app(map, app(map, app(map, f'''''))), app(app(cons, app(app(cons, app(app(cons, x''''), app(app(cons, x'0'), xs'''''))), xs'')), xs)) -> APP(app(map, app(map, f''''')), app(app(cons, app(app(cons, x''''), app(app(cons, x'0'), xs'''''))), xs''))
APP(app(map, app(map, app(map, f'''''))), app(app(cons, app(app(cons, app(app(cons, x''''), nil)), xs'')), xs)) -> APP(app(map, app(map, f''''')), app(app(cons, app(app(cons, x''''), nil)), xs''))
APP(app(map, app(map, app(map, app(map, f''')))), app(app(cons, app(app(cons, app(app(cons, app(app(cons, x'''), xs''''')), xs''0')), xs'')), xs)) -> APP(app(map, app(map, app(map, f'''))), app(app(cons, app(app(cons, app(app(cons, x'''), xs''''')), xs''0')), xs''))
APP(app(map, app(map, app(map, f'''))), app(app(cons, app(app(cons, x''), app(app(cons, nil), xs''''))), xs)) -> APP(app(map, app(map, f''')), app(app(cons, x''), app(app(cons, nil), xs'''')))
APP(app(map, app(map, app(map, app(map, f''')))), app(app(cons, app(app(cons, app(app(cons, nil), xs'''')), xs'')), xs)) -> APP(app(map, app(map, app(map, f'''))), app(app(cons, app(app(cons, nil), xs'''')), xs''))
APP(app(map, app(map, f'')), app(app(cons, app(app(cons, x''), xs'')), xs)) -> APP(app(map, f''), app(app(cons, x''), xs''))


The following usable rules for innermost w.r.t. to the AFS can be oriented:

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


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

resulting in one new DP problem.
Used Argument Filtering System:
APP(x1, x2) -> x1
app(x1, x2) -> app(x2)


   R
     ↳DPs
       →DP Problem 1
         ↳Nar
           →DP Problem 2
             ↳Nar
             ...
               →DP Problem 7
                 ↳Argument Filtering and Ordering


Dependency Pair:

APP(app(map, f), app(app(cons, x), xs)) -> APP(app(map, f), xs)


Rules:


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




The following dependency pair can be strictly oriented:

APP(app(map, f), app(app(cons, x), xs)) -> APP(app(map, f), xs)


The following usable rules for innermost w.r.t. to the AFS can be oriented:

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


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

resulting in one new DP problem.
Used Argument Filtering System:
APP(x1, x2) -> APP(x1, x2)
app(x1, x2) -> app(x2)


   R
     ↳DPs
       →DP Problem 1
         ↳Nar
           →DP Problem 2
             ↳Nar
             ...
               →DP Problem 8
                 ↳Dependency Graph


Dependency Pair:


Rules:


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




Using the Dependency Graph resulted in no new DP problems.

Innermost Termination of R successfully shown.
Duration:
0:49 minutes