Term Rewriting System R:
[y, x, f]
app(app(add, 0), y) -> y
app(app(add, app(s, x)), y) -> app(s, app(app(add, x), y))
app(app(mult, 0), y) -> 0
app(app(mult, app(s, x)), y) -> app(app(add, app(app(mult, x), y)), y)
app(app(app(rec, f), x), 0) -> x
app(app(app(rec, f), x), app(s, y)) -> app(app(f, app(s, y)), app(app(app(rec, f), x), y))
fact -> app(app(rec, mult), app(s, 0))

Innermost Termination of R to be shown. 



   R
     ↳Dependency Pair Analysis



R contains the following Dependency Pairs:

APP(app(add, app(s, x)), y) -> APP(s, app(app(add, x), y))
APP(app(add, app(s, x)), y) -> APP(app(add, x), y)
APP(app(add, app(s, x)), y) -> APP(add, x)
APP(app(mult, app(s, x)), y) -> APP(app(add, app(app(mult, x), y)), y)
APP(app(mult, app(s, x)), y) -> APP(add, app(app(mult, x), y))
APP(app(mult, app(s, x)), y) -> APP(app(mult, x), y)
APP(app(mult, app(s, x)), y) -> APP(mult, x)
APP(app(app(rec, f), x), app(s, y)) -> APP(app(f, app(s, y)), app(app(app(rec, f), x), y))
APP(app(app(rec, f), x), app(s, y)) -> APP(f, app(s, y))
APP(app(app(rec, f), x), app(s, y)) -> APP(app(app(rec, f), x), y)
FACT -> APP(app(rec, mult), app(s, 0))
FACT -> APP(rec, mult)
FACT -> APP(s, 0)

Furthermore, R contains one SCC. 


   R
     ↳DPs
       →DP Problem 1
         ↳Narrowing Transformation


Dependency Pairs:

APP(app(app(rec, f), x), app(s, y)) -> APP(app(app(rec, f), x), y)
APP(app(app(rec, f), x), app(s, y)) -> APP(f, app(s, y))
APP(app(app(rec, f), x), app(s, y)) -> APP(app(f, app(s, y)), app(app(app(rec, f), x), y))
APP(app(mult, app(s, x)), y) -> APP(app(mult, x), y)
APP(app(mult, app(s, x)), y) -> APP(app(add, app(app(mult, x), y)), y)
APP(app(add, app(s, x)), y) -> APP(app(add, x), y)


Rules:


app(app(add, 0), y) -> y
app(app(add, app(s, x)), y) -> app(s, app(app(add, x), y))
app(app(mult, 0), y) -> 0
app(app(mult, app(s, x)), y) -> app(app(add, app(app(mult, x), y)), y)
app(app(app(rec, f), x), 0) -> x
app(app(app(rec, f), x), app(s, y)) -> app(app(f, app(s, y)), app(app(app(rec, f), x), y))
fact -> app(app(rec, mult), app(s, 0))


Strategy:

innermost




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

APP(app(mult, app(s, x)), y) -> APP(app(add, app(app(mult, x), y)), y)
two new Dependency Pairs are created:

APP(app(mult, app(s, 0)), y'') -> APP(app(add, 0), y'')
APP(app(mult, app(s, app(s, x''))), y'') -> APP(app(add, app(app(add, app(app(mult, x''), y'')), y'')), y'')

The transformation is resulting in one new DP problem: 



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


Dependency Pairs:

APP(app(mult, app(s, app(s, x''))), y'') -> APP(app(add, app(app(add, app(app(mult, x''), y'')), y'')), y'')
APP(app(mult, app(s, 0)), y'') -> APP(app(add, 0), y'')
APP(app(app(rec, f), x), app(s, y)) -> APP(f, app(s, y))
APP(app(mult, app(s, x)), y) -> APP(app(mult, x), y)
APP(app(add, app(s, x)), y) -> APP(app(add, x), y)
APP(app(app(rec, f), x), app(s, y)) -> APP(app(f, app(s, y)), app(app(app(rec, f), x), y))
APP(app(app(rec, f), x), app(s, y)) -> APP(app(app(rec, f), x), y)


Rules:


app(app(add, 0), y) -> y
app(app(add, app(s, x)), y) -> app(s, app(app(add, x), y))
app(app(mult, 0), y) -> 0
app(app(mult, app(s, x)), y) -> app(app(add, app(app(mult, x), y)), y)
app(app(app(rec, f), x), 0) -> x
app(app(app(rec, f), x), app(s, y)) -> app(app(f, app(s, y)), app(app(app(rec, f), x), y))
fact -> app(app(rec, mult), app(s, 0))


Strategy:

innermost




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

APP(app(mult, app(s, 0)), y'') -> APP(app(add, 0), y'')
no new Dependency Pairs are created.
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(app(rec, f), x), app(s, y)) -> APP(app(app(rec, f), x), y)
APP(app(app(rec, f), x), app(s, y)) -> APP(f, app(s, y))
APP(app(app(rec, f), x), app(s, y)) -> APP(app(f, app(s, y)), app(app(app(rec, f), x), y))
APP(app(mult, app(s, x)), y) -> APP(app(mult, x), y)
APP(app(add, app(s, x)), y) -> APP(app(add, x), y)
APP(app(mult, app(s, app(s, x''))), y'') -> APP(app(add, app(app(add, app(app(mult, x''), y'')), y'')), y'')


Rules:


app(app(add, 0), y) -> y
app(app(add, app(s, x)), y) -> app(s, app(app(add, x), y))
app(app(mult, 0), y) -> 0
app(app(mult, app(s, x)), y) -> app(app(add, app(app(mult, x), y)), y)
app(app(app(rec, f), x), 0) -> x
app(app(app(rec, f), x), app(s, y)) -> app(app(f, app(s, y)), app(app(app(rec, f), x), y))
fact -> app(app(rec, mult), app(s, 0))


Strategy:

innermost




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

APP(app(mult, app(s, app(s, x''))), y'') -> APP(app(add, app(app(add, app(app(mult, x''), y'')), y'')), y'')
two new Dependency Pairs are created:

APP(app(mult, app(s, app(s, 0))), y''') -> APP(app(add, app(app(add, 0), y''')), y''')
APP(app(mult, app(s, app(s, app(s, x')))), y''') -> APP(app(add, app(app(add, app(app(add, app(app(mult, x'), y''')), y''')), y''')), y''')

The transformation is resulting in one new DP problem: 



   R
     ↳DPs
       →DP Problem 1
         ↳Nar
           →DP Problem 2
             ↳Nar
             ...
               →DP Problem 4
                 ↳Rewriting Transformation


Dependency Pairs:

APP(app(mult, app(s, app(s, app(s, x')))), y''') -> APP(app(add, app(app(add, app(app(add, app(app(mult, x'), y''')), y''')), y''')), y''')
APP(app(mult, app(s, app(s, 0))), y''') -> APP(app(add, app(app(add, 0), y''')), y''')
APP(app(app(rec, f), x), app(s, y)) -> APP(f, app(s, y))
APP(app(mult, app(s, x)), y) -> APP(app(mult, x), y)
APP(app(add, app(s, x)), y) -> APP(app(add, x), y)
APP(app(app(rec, f), x), app(s, y)) -> APP(app(f, app(s, y)), app(app(app(rec, f), x), y))
APP(app(app(rec, f), x), app(s, y)) -> APP(app(app(rec, f), x), y)


Rules:


app(app(add, 0), y) -> y
app(app(add, app(s, x)), y) -> app(s, app(app(add, x), y))
app(app(mult, 0), y) -> 0
app(app(mult, app(s, x)), y) -> app(app(add, app(app(mult, x), y)), y)
app(app(app(rec, f), x), 0) -> x
app(app(app(rec, f), x), app(s, y)) -> app(app(f, app(s, y)), app(app(app(rec, f), x), y))
fact -> app(app(rec, mult), app(s, 0))


Strategy:

innermost




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

APP(app(mult, app(s, app(s, 0))), y''') -> APP(app(add, app(app(add, 0), y''')), y''')
one new Dependency Pair is created:

APP(app(mult, app(s, app(s, 0))), y''') -> APP(app(add, y'''), y''')

The transformation is resulting in one new DP problem: 



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


Dependency Pairs:

APP(app(mult, app(s, app(s, 0))), y''') -> APP(app(add, y'''), y''')
APP(app(app(rec, f), x), app(s, y)) -> APP(app(app(rec, f), x), y)
APP(app(app(rec, f), x), app(s, y)) -> APP(f, app(s, y))
APP(app(app(rec, f), x), app(s, y)) -> APP(app(f, app(s, y)), app(app(app(rec, f), x), y))
APP(app(mult, app(s, x)), y) -> APP(app(mult, x), y)
APP(app(add, app(s, x)), y) -> APP(app(add, x), y)
APP(app(mult, app(s, app(s, app(s, x')))), y''') -> APP(app(add, app(app(add, app(app(add, app(app(mult, x'), y''')), y''')), y''')), y''')


Rules:


app(app(add, 0), y) -> y
app(app(add, app(s, x)), y) -> app(s, app(app(add, x), y))
app(app(mult, 0), y) -> 0
app(app(mult, app(s, x)), y) -> app(app(add, app(app(mult, x), y)), y)
app(app(app(rec, f), x), 0) -> x
app(app(app(rec, f), x), app(s, y)) -> app(app(f, app(s, y)), app(app(app(rec, f), x), y))
fact -> app(app(rec, mult), app(s, 0))


Strategy:

innermost




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

APP(app(mult, app(s, app(s, app(s, x')))), y''') -> APP(app(add, app(app(add, app(app(add, app(app(mult, x'), y''')), y''')), y''')), y''')
two new Dependency Pairs are created:

APP(app(mult, app(s, app(s, app(s, 0)))), y'''') -> APP(app(add, app(app(add, app(app(add, 0), y'''')), y'''')), y'''')
APP(app(mult, app(s, app(s, app(s, app(s, x''))))), y'''') -> APP(app(add, app(app(add, app(app(add, app(app(add, app(app(mult, x''), y'''')), y'''')), y'''')), y'''')), y'''')

The transformation is resulting in one new DP problem: 



   R
     ↳DPs
       →DP Problem 1
         ↳Nar
           →DP Problem 2
             ↳Nar
             ...
               →DP Problem 6
                 ↳Rewriting Transformation


Dependency Pairs:

APP(app(mult, app(s, app(s, app(s, app(s, x''))))), y'''') -> APP(app(add, app(app(add, app(app(add, app(app(add, app(app(mult, x''), y'''')), y'''')), y'''')), y'''')), y'''')
APP(app(mult, app(s, app(s, app(s, 0)))), y'''') -> APP(app(add, app(app(add, app(app(add, 0), y'''')), y'''')), y'''')
APP(app(app(rec, f), x), app(s, y)) -> APP(app(app(rec, f), x), y)
APP(app(app(rec, f), x), app(s, y)) -> APP(f, app(s, y))
APP(app(app(rec, f), x), app(s, y)) -> APP(app(f, app(s, y)), app(app(app(rec, f), x), y))
APP(app(mult, app(s, x)), y) -> APP(app(mult, x), y)
APP(app(add, app(s, x)), y) -> APP(app(add, x), y)
APP(app(mult, app(s, app(s, 0))), y''') -> APP(app(add, y'''), y''')


Rules:


app(app(add, 0), y) -> y
app(app(add, app(s, x)), y) -> app(s, app(app(add, x), y))
app(app(mult, 0), y) -> 0
app(app(mult, app(s, x)), y) -> app(app(add, app(app(mult, x), y)), y)
app(app(app(rec, f), x), 0) -> x
app(app(app(rec, f), x), app(s, y)) -> app(app(f, app(s, y)), app(app(app(rec, f), x), y))
fact -> app(app(rec, mult), app(s, 0))


Strategy:

innermost




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

APP(app(mult, app(s, app(s, app(s, 0)))), y'''') -> APP(app(add, app(app(add, app(app(add, 0), y'''')), y'''')), y'''')
one new Dependency Pair is created:

APP(app(mult, app(s, app(s, app(s, 0)))), y'''') -> APP(app(add, app(app(add, y''''), y'''')), y'''')

The transformation is resulting in one new DP problem: 



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


Dependency Pairs:

APP(app(mult, app(s, app(s, app(s, 0)))), y'''') -> APP(app(add, app(app(add, y''''), y'''')), y'''')
APP(app(mult, app(s, app(s, 0))), y''') -> APP(app(add, y'''), y''')
APP(app(app(rec, f), x), app(s, y)) -> APP(app(app(rec, f), x), y)
APP(app(app(rec, f), x), app(s, y)) -> APP(f, app(s, y))
APP(app(app(rec, f), x), app(s, y)) -> APP(app(f, app(s, y)), app(app(app(rec, f), x), y))
APP(app(mult, app(s, x)), y) -> APP(app(mult, x), y)
APP(app(add, app(s, x)), y) -> APP(app(add, x), y)
APP(app(mult, app(s, app(s, app(s, app(s, x''))))), y'''') -> APP(app(add, app(app(add, app(app(add, app(app(add, app(app(mult, x''), y'''')), y'''')), y'''')), y'''')), y'''')


Rules:


app(app(add, 0), y) -> y
app(app(add, app(s, x)), y) -> app(s, app(app(add, x), y))
app(app(mult, 0), y) -> 0
app(app(mult, app(s, x)), y) -> app(app(add, app(app(mult, x), y)), y)
app(app(app(rec, f), x), 0) -> x
app(app(app(rec, f), x), app(s, y)) -> app(app(f, app(s, y)), app(app(app(rec, f), x), y))
fact -> app(app(rec, mult), app(s, 0))


Strategy:

innermost




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

APP(app(mult, app(s, app(s, app(s, app(s, x''))))), y'''') -> APP(app(add, app(app(add, app(app(add, app(app(add, app(app(mult, x''), y'''')), y'''')), y'''')), y'''')), y'''')
two new Dependency Pairs are created:

APP(app(mult, app(s, app(s, app(s, app(s, 0))))), y''''') -> APP(app(add, app(app(add, app(app(add, app(app(add, 0), y''''')), y''''')), y''''')), y''''')
APP(app(mult, app(s, app(s, app(s, app(s, app(s, x')))))), y''''') -> APP(app(add, app(app(add, app(app(add, app(app(add, app(app(add, app(app(mult, x'), y''''')), y''''')), y''''')), y''''')), y''''')), y''''')

The transformation is resulting in one new DP problem: 



   R
     ↳DPs
       →DP Problem 1
         ↳Nar
           →DP Problem 2
             ↳Nar
             ...
               →DP Problem 8
                 ↳Rewriting Transformation


Dependency Pairs:

APP(app(mult, app(s, app(s, app(s, app(s, app(s, x')))))), y''''') -> APP(app(add, app(app(add, app(app(add, app(app(add, app(app(add, app(app(mult, x'), y''''')), y''''')), y''''')), y''''')), y''''')), y''''')
APP(app(mult, app(s, app(s, app(s, app(s, 0))))), y''''') -> APP(app(add, app(app(add, app(app(add, app(app(add, 0), y''''')), y''''')), y''''')), y''''')
APP(app(mult, app(s, app(s, 0))), y''') -> APP(app(add, y'''), y''')
APP(app(app(rec, f), x), app(s, y)) -> APP(app(app(rec, f), x), y)
APP(app(app(rec, f), x), app(s, y)) -> APP(f, app(s, y))
APP(app(app(rec, f), x), app(s, y)) -> APP(app(f, app(s, y)), app(app(app(rec, f), x), y))
APP(app(mult, app(s, x)), y) -> APP(app(mult, x), y)
APP(app(add, app(s, x)), y) -> APP(app(add, x), y)
APP(app(mult, app(s, app(s, app(s, 0)))), y'''') -> APP(app(add, app(app(add, y''''), y'''')), y'''')


Rules:


app(app(add, 0), y) -> y
app(app(add, app(s, x)), y) -> app(s, app(app(add, x), y))
app(app(mult, 0), y) -> 0
app(app(mult, app(s, x)), y) -> app(app(add, app(app(mult, x), y)), y)
app(app(app(rec, f), x), 0) -> x
app(app(app(rec, f), x), app(s, y)) -> app(app(f, app(s, y)), app(app(app(rec, f), x), y))
fact -> app(app(rec, mult), app(s, 0))


Strategy:

innermost




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

APP(app(mult, app(s, app(s, app(s, app(s, 0))))), y''''') -> APP(app(add, app(app(add, app(app(add, app(app(add, 0), y''''')), y''''')), y''''')), y''''')
one new Dependency Pair is created:

APP(app(mult, app(s, app(s, app(s, app(s, 0))))), y''''') -> APP(app(add, app(app(add, app(app(add, y'''''), y''''')), y''''')), y''''')

The transformation is resulting in one new DP problem: 



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


Dependency Pairs:

APP(app(mult, app(s, app(s, app(s, app(s, 0))))), y''''') -> APP(app(add, app(app(add, app(app(add, y'''''), y''''')), y''''')), y''''')
APP(app(mult, app(s, app(s, app(s, 0)))), y'''') -> APP(app(add, app(app(add, y''''), y'''')), y'''')
APP(app(mult, app(s, app(s, 0))), y''') -> APP(app(add, y'''), y''')
APP(app(app(rec, f), x), app(s, y)) -> APP(app(app(rec, f), x), y)
APP(app(app(rec, f), x), app(s, y)) -> APP(f, app(s, y))
APP(app(app(rec, f), x), app(s, y)) -> APP(app(f, app(s, y)), app(app(app(rec, f), x), y))
APP(app(mult, app(s, x)), y) -> APP(app(mult, x), y)
APP(app(add, app(s, x)), y) -> APP(app(add, x), y)
APP(app(mult, app(s, app(s, app(s, app(s, app(s, x')))))), y''''') -> APP(app(add, app(app(add, app(app(add, app(app(add, app(app(add, app(app(mult, x'), y''''')), y''''')), y''''')), y''''')), y''''')), y''''')


Rules:


app(app(add, 0), y) -> y
app(app(add, app(s, x)), y) -> app(s, app(app(add, x), y))
app(app(mult, 0), y) -> 0
app(app(mult, app(s, x)), y) -> app(app(add, app(app(mult, x), y)), y)
app(app(app(rec, f), x), 0) -> x
app(app(app(rec, f), x), app(s, y)) -> app(app(f, app(s, y)), app(app(app(rec, f), x), y))
fact -> app(app(rec, mult), app(s, 0))


Strategy:

innermost




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

APP(app(mult, app(s, app(s, app(s, 0)))), y'''') -> APP(app(add, app(app(add, y''''), y'''')), y'''')
two new Dependency Pairs are created:

APP(app(mult, app(s, app(s, app(s, 0)))), 0) -> APP(app(add, 0), 0)
APP(app(mult, app(s, app(s, app(s, 0)))), app(s, x')) -> APP(app(add, app(s, app(app(add, x'), app(s, x')))), app(s, x'))

The transformation is resulting in one new DP problem: 



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


Dependency Pairs:

APP(app(mult, app(s, app(s, app(s, 0)))), app(s, x')) -> APP(app(add, app(s, app(app(add, x'), app(s, x')))), app(s, x'))
APP(app(mult, app(s, app(s, app(s, 0)))), 0) -> APP(app(add, 0), 0)
APP(app(mult, app(s, app(s, app(s, app(s, app(s, x')))))), y''''') -> APP(app(add, app(app(add, app(app(add, app(app(add, app(app(add, app(app(mult, x'), y''''')), y''''')), y''''')), y''''')), y''''')), y''''')
APP(app(mult, app(s, app(s, 0))), y''') -> APP(app(add, y'''), y''')
APP(app(app(rec, f), x), app(s, y)) -> APP(app(app(rec, f), x), y)
APP(app(app(rec, f), x), app(s, y)) -> APP(f, app(s, y))
APP(app(app(rec, f), x), app(s, y)) -> APP(app(f, app(s, y)), app(app(app(rec, f), x), y))
APP(app(mult, app(s, x)), y) -> APP(app(mult, x), y)
APP(app(add, app(s, x)), y) -> APP(app(add, x), y)
APP(app(mult, app(s, app(s, app(s, app(s, 0))))), y''''') -> APP(app(add, app(app(add, app(app(add, y'''''), y''''')), y''''')), y''''')


Rules:


app(app(add, 0), y) -> y
app(app(add, app(s, x)), y) -> app(s, app(app(add, x), y))
app(app(mult, 0), y) -> 0
app(app(mult, app(s, x)), y) -> app(app(add, app(app(mult, x), y)), y)
app(app(app(rec, f), x), 0) -> x
app(app(app(rec, f), x), app(s, y)) -> app(app(f, app(s, y)), app(app(app(rec, f), x), y))
fact -> app(app(rec, mult), app(s, 0))


Strategy:

innermost




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

APP(app(mult, app(s, app(s, app(s, app(s, app(s, x')))))), y''''') -> APP(app(add, app(app(add, app(app(add, app(app(add, app(app(add, app(app(mult, x'), y''''')), y''''')), y''''')), y''''')), y''''')), y''''')
two new Dependency Pairs are created:

APP(app(mult, app(s, app(s, app(s, app(s, app(s, 0)))))), y'''''') -> APP(app(add, app(app(add, app(app(add, app(app(add, app(app(add, 0), y'''''')), y'''''')), y'''''')), y'''''')), y'''''')
APP(app(mult, app(s, app(s, app(s, app(s, app(s, app(s, x''))))))), y'''''') -> APP(app(add, app(app(add, app(app(add, app(app(add, app(app(add, app(app(add, app(app(mult, x''), y'''''')), y'''''')), y'''''')), y'''''')), y'''''')), y'''''')), y'''''')

The transformation is resulting in one new DP problem: 



   R
     ↳DPs
       →DP Problem 1
         ↳Nar
           →DP Problem 2
             ↳Nar
             ...
               →DP Problem 11
                 ↳Rewriting Transformation


Dependency Pairs:

APP(app(mult, app(s, app(s, app(s, app(s, app(s, app(s, x''))))))), y'''''') -> APP(app(add, app(app(add, app(app(add, app(app(add, app(app(add, app(app(add, app(app(mult, x''), y'''''')), y'''''')), y'''''')), y'''''')), y'''''')), y'''''')), y'''''')
APP(app(mult, app(s, app(s, app(s, app(s, app(s, 0)))))), y'''''') -> APP(app(add, app(app(add, app(app(add, app(app(add, app(app(add, 0), y'''''')), y'''''')), y'''''')), y'''''')), y'''''')
APP(app(mult, app(s, app(s, app(s, 0)))), 0) -> APP(app(add, 0), 0)
APP(app(mult, app(s, app(s, app(s, app(s, 0))))), y''''') -> APP(app(add, app(app(add, app(app(add, y'''''), y''''')), y''''')), y''''')
APP(app(mult, app(s, app(s, 0))), y''') -> APP(app(add, y'''), y''')
APP(app(app(rec, f), x), app(s, y)) -> APP(app(app(rec, f), x), y)
APP(app(app(rec, f), x), app(s, y)) -> APP(f, app(s, y))
APP(app(app(rec, f), x), app(s, y)) -> APP(app(f, app(s, y)), app(app(app(rec, f), x), y))
APP(app(mult, app(s, x)), y) -> APP(app(mult, x), y)
APP(app(add, app(s, x)), y) -> APP(app(add, x), y)
APP(app(mult, app(s, app(s, app(s, 0)))), app(s, x')) -> APP(app(add, app(s, app(app(add, x'), app(s, x')))), app(s, x'))


Rules:


app(app(add, 0), y) -> y
app(app(add, app(s, x)), y) -> app(s, app(app(add, x), y))
app(app(mult, 0), y) -> 0
app(app(mult, app(s, x)), y) -> app(app(add, app(app(mult, x), y)), y)
app(app(app(rec, f), x), 0) -> x
app(app(app(rec, f), x), app(s, y)) -> app(app(f, app(s, y)), app(app(app(rec, f), x), y))
fact -> app(app(rec, mult), app(s, 0))


Strategy:

innermost




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

APP(app(mult, app(s, app(s, app(s, app(s, app(s, 0)))))), y'''''') -> APP(app(add, app(app(add, app(app(add, app(app(add, app(app(add, 0), y'''''')), y'''''')), y'''''')), y'''''')), y'''''')
one new Dependency Pair is created:

APP(app(mult, app(s, app(s, app(s, app(s, app(s, 0)))))), y'''''') -> APP(app(add, app(app(add, app(app(add, app(app(add, y''''''), y'''''')), y'''''')), y'''''')), y'''''')

The transformation is resulting in one new DP problem: 



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


Dependency Pairs:

APP(app(mult, app(s, app(s, app(s, 0)))), app(s, x')) -> APP(app(add, app(s, app(app(add, x'), app(s, x')))), app(s, x'))
APP(app(mult, app(s, app(s, app(s, app(s, app(s, 0)))))), y'''''') -> APP(app(add, app(app(add, app(app(add, app(app(add, y''''''), y'''''')), y'''''')), y'''''')), y'''''')
APP(app(mult, app(s, app(s, app(s, 0)))), 0) -> APP(app(add, 0), 0)
APP(app(mult, app(s, app(s, app(s, app(s, 0))))), y''''') -> APP(app(add, app(app(add, app(app(add, y'''''), y''''')), y''''')), y''''')
APP(app(mult, app(s, app(s, 0))), y''') -> APP(app(add, y'''), y''')
APP(app(app(rec, f), x), app(s, y)) -> APP(app(app(rec, f), x), y)
APP(app(app(rec, f), x), app(s, y)) -> APP(f, app(s, y))
APP(app(app(rec, f), x), app(s, y)) -> APP(app(f, app(s, y)), app(app(app(rec, f), x), y))
APP(app(mult, app(s, x)), y) -> APP(app(mult, x), y)
APP(app(add, app(s, x)), y) -> APP(app(add, x), y)
APP(app(mult, app(s, app(s, app(s, app(s, app(s, app(s, x''))))))), y'''''') -> APP(app(add, app(app(add, app(app(add, app(app(add, app(app(add, app(app(add, app(app(mult, x''), y'''''')), y'''''')), y'''''')), y'''''')), y'''''')), y'''''')), y'''''')


Rules:


app(app(add, 0), y) -> y
app(app(add, app(s, x)), y) -> app(s, app(app(add, x), y))
app(app(mult, 0), y) -> 0
app(app(mult, app(s, x)), y) -> app(app(add, app(app(mult, x), y)), y)
app(app(app(rec, f), x), 0) -> x
app(app(app(rec, f), x), app(s, y)) -> app(app(f, app(s, y)), app(app(app(rec, f), x), y))
fact -> app(app(rec, mult), app(s, 0))


Strategy:

innermost




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

APP(app(mult, app(s, app(s, app(s, 0)))), 0) -> APP(app(add, 0), 0)
no new Dependency Pairs are created.
The transformation is resulting in one new DP problem: 



   R
     ↳DPs
       →DP Problem 1
         ↳Nar
           →DP Problem 2
             ↳Nar
             ...
               →DP Problem 13
                 ↳Remaining Obligation(s)




The following remains to be proven:
Dependency Pairs:

APP(app(mult, app(s, app(s, app(s, app(s, app(s, 0)))))), y'''''') -> APP(app(add, app(app(add, app(app(add, app(app(add, y''''''), y'''''')), y'''''')), y'''''')), y'''''')
APP(app(mult, app(s, app(s, app(s, app(s, app(s, app(s, x''))))))), y'''''') -> APP(app(add, app(app(add, app(app(add, app(app(add, app(app(add, app(app(add, app(app(mult, x''), y'''''')), y'''''')), y'''''')), y'''''')), y'''''')), y'''''')), y'''''')
APP(app(mult, app(s, app(s, app(s, app(s, 0))))), y''''') -> APP(app(add, app(app(add, app(app(add, y'''''), y''''')), y''''')), y''''')
APP(app(mult, app(s, app(s, 0))), y''') -> APP(app(add, y'''), y''')
APP(app(app(rec, f), x), app(s, y)) -> APP(app(app(rec, f), x), y)
APP(app(app(rec, f), x), app(s, y)) -> APP(f, app(s, y))
APP(app(app(rec, f), x), app(s, y)) -> APP(app(f, app(s, y)), app(app(app(rec, f), x), y))
APP(app(mult, app(s, x)), y) -> APP(app(mult, x), y)
APP(app(add, app(s, x)), y) -> APP(app(add, x), y)
APP(app(mult, app(s, app(s, app(s, 0)))), app(s, x')) -> APP(app(add, app(s, app(app(add, x'), app(s, x')))), app(s, x'))


Rules:


app(app(add, 0), y) -> y
app(app(add, app(s, x)), y) -> app(s, app(app(add, x), y))
app(app(mult, 0), y) -> 0
app(app(mult, app(s, x)), y) -> app(app(add, app(app(mult, x), y)), y)
app(app(app(rec, f), x), 0) -> x
app(app(app(rec, f), x), app(s, y)) -> app(app(f, app(s, y)), app(app(app(rec, f), x), y))
fact -> app(app(rec, mult), app(s, 0))


Strategy:

innermost



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