Term Rewriting System R:
[y, n, x]
app(nil, y) -> y
app(add(n, x), y) -> add(n, app(x, y))
reverse(nil) -> nil
reverse(add(n, x)) -> app(reverse(x), add(n, nil))
shuffle(nil) -> nil
shuffle(add(n, x)) -> add(n, shuffle(reverse(x)))

Innermost Termination of R to be shown. 



   R
     ↳Dependency Pair Analysis



R contains the following Dependency Pairs:

APP(add(n, x), y) -> APP(x, y)
REVERSE(add(n, x)) -> APP(reverse(x), add(n, nil))
REVERSE(add(n, x)) -> REVERSE(x)
SHUFFLE(add(n, x)) -> SHUFFLE(reverse(x))
SHUFFLE(add(n, x)) -> REVERSE(x)

Furthermore, R contains three SCCs. 


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


Dependency Pair:

APP(add(n, x), y) -> APP(x, y)


Rules:


app(nil, y) -> y
app(add(n, x), y) -> add(n, app(x, y))
reverse(nil) -> nil
reverse(add(n, x)) -> app(reverse(x), add(n, nil))
shuffle(nil) -> nil
shuffle(add(n, x)) -> add(n, shuffle(reverse(x)))


Strategy:

innermost




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

APP(add(n, x), y) -> APP(x, y)
one new Dependency Pair is created:

APP(add(n, add(n'', x'')), y'') -> APP(add(n'', x''), y'')

The transformation is resulting in one new DP problem: 



   R
     ↳DPs
       →DP Problem 1
         ↳FwdInst
           →DP Problem 4
             ↳Forward Instantiation Transformation
       →DP Problem 2
         ↳FwdInst
       →DP Problem 3
         ↳Nar


Dependency Pair:

APP(add(n, add(n'', x'')), y'') -> APP(add(n'', x''), y'')


Rules:


app(nil, y) -> y
app(add(n, x), y) -> add(n, app(x, y))
reverse(nil) -> nil
reverse(add(n, x)) -> app(reverse(x), add(n, nil))
shuffle(nil) -> nil
shuffle(add(n, x)) -> add(n, shuffle(reverse(x)))


Strategy:

innermost




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

APP(add(n, add(n'', x'')), y'') -> APP(add(n'', x''), y'')
one new Dependency Pair is created:

APP(add(n, add(n'''', add(n''''', x''''))), y'''') -> APP(add(n'''', add(n''''', x'''')), y'''')

The transformation is resulting in one new DP problem: 



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


Dependency Pair:

APP(add(n, add(n'''', add(n''''', x''''))), y'''') -> APP(add(n'''', add(n''''', x'''')), y'''')


Rules:


app(nil, y) -> y
app(add(n, x), y) -> add(n, app(x, y))
reverse(nil) -> nil
reverse(add(n, x)) -> app(reverse(x), add(n, nil))
shuffle(nil) -> nil
shuffle(add(n, x)) -> add(n, shuffle(reverse(x)))


Strategy:

innermost




The following dependency pair can be strictly oriented:

APP(add(n, add(n'''', add(n''''', x''''))), y'''') -> APP(add(n'''', add(n''''', x'''')), y'''')


There are no usable rules for innermost w.r.t. to the AFS that need to be oriented.
Used ordering: Homeomorphic Embedding Order with EMB
resulting in one new DP problem.
Used Argument Filtering System:
APP(x1, x2) -> APP(x1, x2)
add(x1, x2) -> add(x1, x2)


   R
     ↳DPs
       →DP Problem 1
         ↳FwdInst
           →DP Problem 4
             ↳FwdInst
             ...
               →DP Problem 6
                 ↳Dependency Graph
       →DP Problem 2
         ↳FwdInst
       →DP Problem 3
         ↳Nar


Dependency Pair:


Rules:


app(nil, y) -> y
app(add(n, x), y) -> add(n, app(x, y))
reverse(nil) -> nil
reverse(add(n, x)) -> app(reverse(x), add(n, nil))
shuffle(nil) -> nil
shuffle(add(n, x)) -> add(n, shuffle(reverse(x)))


Strategy:

innermost




Using the Dependency Graph resulted in no new DP problems.


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


Dependency Pair:

REVERSE(add(n, x)) -> REVERSE(x)


Rules:


app(nil, y) -> y
app(add(n, x), y) -> add(n, app(x, y))
reverse(nil) -> nil
reverse(add(n, x)) -> app(reverse(x), add(n, nil))
shuffle(nil) -> nil
shuffle(add(n, x)) -> add(n, shuffle(reverse(x)))


Strategy:

innermost




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

REVERSE(add(n, x)) -> REVERSE(x)
one new Dependency Pair is created:

REVERSE(add(n, add(n'', x''))) -> REVERSE(add(n'', x''))

The transformation is resulting in one new DP problem: 



   R
     ↳DPs
       →DP Problem 1
         ↳FwdInst
       →DP Problem 2
         ↳FwdInst
           →DP Problem 7
             ↳Forward Instantiation Transformation
       →DP Problem 3
         ↳Nar


Dependency Pair:

REVERSE(add(n, add(n'', x''))) -> REVERSE(add(n'', x''))


Rules:


app(nil, y) -> y
app(add(n, x), y) -> add(n, app(x, y))
reverse(nil) -> nil
reverse(add(n, x)) -> app(reverse(x), add(n, nil))
shuffle(nil) -> nil
shuffle(add(n, x)) -> add(n, shuffle(reverse(x)))


Strategy:

innermost




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

REVERSE(add(n, add(n'', x''))) -> REVERSE(add(n'', x''))
one new Dependency Pair is created:

REVERSE(add(n, add(n'''', add(n''''', x'''')))) -> REVERSE(add(n'''', add(n''''', x'''')))

The transformation is resulting in one new DP problem: 



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


Dependency Pair:

REVERSE(add(n, add(n'''', add(n''''', x'''')))) -> REVERSE(add(n'''', add(n''''', x'''')))


Rules:


app(nil, y) -> y
app(add(n, x), y) -> add(n, app(x, y))
reverse(nil) -> nil
reverse(add(n, x)) -> app(reverse(x), add(n, nil))
shuffle(nil) -> nil
shuffle(add(n, x)) -> add(n, shuffle(reverse(x)))


Strategy:

innermost




The following dependency pair can be strictly oriented:

REVERSE(add(n, add(n'''', add(n''''', x'''')))) -> REVERSE(add(n'''', add(n''''', x'''')))


There are no usable rules for innermost w.r.t. to the AFS that need to be oriented.
Used ordering: Homeomorphic Embedding Order with EMB
resulting in one new DP problem.
Used Argument Filtering System:
REVERSE(x1) -> REVERSE(x1)
add(x1, x2) -> add(x1, x2)


   R
     ↳DPs
       →DP Problem 1
         ↳FwdInst
       →DP Problem 2
         ↳FwdInst
           →DP Problem 7
             ↳FwdInst
             ...
               →DP Problem 9
                 ↳Dependency Graph
       →DP Problem 3
         ↳Nar


Dependency Pair:


Rules:


app(nil, y) -> y
app(add(n, x), y) -> add(n, app(x, y))
reverse(nil) -> nil
reverse(add(n, x)) -> app(reverse(x), add(n, nil))
shuffle(nil) -> nil
shuffle(add(n, x)) -> add(n, shuffle(reverse(x)))


Strategy:

innermost




Using the Dependency Graph resulted in no new DP problems.


   R
     ↳DPs
       →DP Problem 1
         ↳FwdInst
       →DP Problem 2
         ↳FwdInst
       →DP Problem 3
         ↳Narrowing Transformation


Dependency Pair:

SHUFFLE(add(n, x)) -> SHUFFLE(reverse(x))


Rules:


app(nil, y) -> y
app(add(n, x), y) -> add(n, app(x, y))
reverse(nil) -> nil
reverse(add(n, x)) -> app(reverse(x), add(n, nil))
shuffle(nil) -> nil
shuffle(add(n, x)) -> add(n, shuffle(reverse(x)))


Strategy:

innermost




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

SHUFFLE(add(n, x)) -> SHUFFLE(reverse(x))
two new Dependency Pairs are created:

SHUFFLE(add(n, nil)) -> SHUFFLE(nil)
SHUFFLE(add(n, add(n'', x''))) -> SHUFFLE(app(reverse(x''), add(n'', nil)))

The transformation is resulting in one new DP problem: 



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


Dependency Pair:

SHUFFLE(add(n, add(n'', x''))) -> SHUFFLE(app(reverse(x''), add(n'', nil)))


Rules:


app(nil, y) -> y
app(add(n, x), y) -> add(n, app(x, y))
reverse(nil) -> nil
reverse(add(n, x)) -> app(reverse(x), add(n, nil))
shuffle(nil) -> nil
shuffle(add(n, x)) -> add(n, shuffle(reverse(x)))


Strategy:

innermost




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

SHUFFLE(add(n, add(n'', x''))) -> SHUFFLE(app(reverse(x''), add(n'', nil)))
two new Dependency Pairs are created:

SHUFFLE(add(n, add(n'', nil))) -> SHUFFLE(app(nil, add(n'', nil)))
SHUFFLE(add(n, add(n'', add(n''', x')))) -> SHUFFLE(app(app(reverse(x'), add(n''', nil)), add(n'', nil)))

The transformation is resulting in one new DP problem: 



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


Dependency Pairs:

SHUFFLE(add(n, add(n'', add(n''', x')))) -> SHUFFLE(app(app(reverse(x'), add(n''', nil)), add(n'', nil)))
SHUFFLE(add(n, add(n'', nil))) -> SHUFFLE(app(nil, add(n'', nil)))


Rules:


app(nil, y) -> y
app(add(n, x), y) -> add(n, app(x, y))
reverse(nil) -> nil
reverse(add(n, x)) -> app(reverse(x), add(n, nil))
shuffle(nil) -> nil
shuffle(add(n, x)) -> add(n, shuffle(reverse(x)))


Strategy:

innermost




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

SHUFFLE(add(n, add(n'', nil))) -> SHUFFLE(app(nil, add(n'', nil)))
one new Dependency Pair is created:

SHUFFLE(add(n, add(n'', nil))) -> SHUFFLE(add(n'', nil))

The transformation is resulting in one new DP problem: 



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


Dependency Pair:

SHUFFLE(add(n, add(n'', add(n''', x')))) -> SHUFFLE(app(app(reverse(x'), add(n''', nil)), add(n'', nil)))


Rules:


app(nil, y) -> y
app(add(n, x), y) -> add(n, app(x, y))
reverse(nil) -> nil
reverse(add(n, x)) -> app(reverse(x), add(n, nil))
shuffle(nil) -> nil
shuffle(add(n, x)) -> add(n, shuffle(reverse(x)))


Strategy:

innermost




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

SHUFFLE(add(n, add(n'', add(n''', x')))) -> SHUFFLE(app(app(reverse(x'), add(n''', nil)), add(n'', nil)))
two new Dependency Pairs are created:

SHUFFLE(add(n, add(n'', add(n''', nil)))) -> SHUFFLE(app(app(nil, add(n''', nil)), add(n'', nil)))
SHUFFLE(add(n, add(n'', add(n''', add(n'0, x''))))) -> SHUFFLE(app(app(app(reverse(x''), add(n'0, nil)), add(n''', nil)), add(n'', nil)))

The transformation is resulting in one new DP problem: 



   R
     ↳DPs
       →DP Problem 1
         ↳FwdInst
       →DP Problem 2
         ↳FwdInst
       →DP Problem 3
         ↳Nar
           →DP Problem 10
             ↳Nar
             ...
               →DP Problem 13
                 ↳Rewriting Transformation


Dependency Pairs:

SHUFFLE(add(n, add(n'', add(n''', add(n'0, x''))))) -> SHUFFLE(app(app(app(reverse(x''), add(n'0, nil)), add(n''', nil)), add(n'', nil)))
SHUFFLE(add(n, add(n'', add(n''', nil)))) -> SHUFFLE(app(app(nil, add(n''', nil)), add(n'', nil)))


Rules:


app(nil, y) -> y
app(add(n, x), y) -> add(n, app(x, y))
reverse(nil) -> nil
reverse(add(n, x)) -> app(reverse(x), add(n, nil))
shuffle(nil) -> nil
shuffle(add(n, x)) -> add(n, shuffle(reverse(x)))


Strategy:

innermost




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

SHUFFLE(add(n, add(n'', add(n''', nil)))) -> SHUFFLE(app(app(nil, add(n''', nil)), add(n'', nil)))
one new Dependency Pair is created:

SHUFFLE(add(n, add(n'', add(n''', nil)))) -> SHUFFLE(app(add(n''', nil), add(n'', nil)))

The transformation is resulting in one new DP problem: 



   R
     ↳DPs
       →DP Problem 1
         ↳FwdInst
       →DP Problem 2
         ↳FwdInst
       →DP Problem 3
         ↳Nar
           →DP Problem 10
             ↳Nar
             ...
               →DP Problem 14
                 ↳Rewriting Transformation


Dependency Pairs:

SHUFFLE(add(n, add(n'', add(n''', nil)))) -> SHUFFLE(app(add(n''', nil), add(n'', nil)))
SHUFFLE(add(n, add(n'', add(n''', add(n'0, x''))))) -> SHUFFLE(app(app(app(reverse(x''), add(n'0, nil)), add(n''', nil)), add(n'', nil)))


Rules:


app(nil, y) -> y
app(add(n, x), y) -> add(n, app(x, y))
reverse(nil) -> nil
reverse(add(n, x)) -> app(reverse(x), add(n, nil))
shuffle(nil) -> nil
shuffle(add(n, x)) -> add(n, shuffle(reverse(x)))


Strategy:

innermost




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

SHUFFLE(add(n, add(n'', add(n''', nil)))) -> SHUFFLE(app(add(n''', nil), add(n'', nil)))
one new Dependency Pair is created:

SHUFFLE(add(n, add(n'', add(n''', nil)))) -> SHUFFLE(add(n''', app(nil, add(n'', nil))))

The transformation is resulting in one new DP problem: 



   R
     ↳DPs
       →DP Problem 1
         ↳FwdInst
       →DP Problem 2
         ↳FwdInst
       →DP Problem 3
         ↳Nar
           →DP Problem 10
             ↳Nar
             ...
               →DP Problem 15
                 ↳Rewriting Transformation


Dependency Pairs:

SHUFFLE(add(n, add(n'', add(n''', nil)))) -> SHUFFLE(add(n''', app(nil, add(n'', nil))))
SHUFFLE(add(n, add(n'', add(n''', add(n'0, x''))))) -> SHUFFLE(app(app(app(reverse(x''), add(n'0, nil)), add(n''', nil)), add(n'', nil)))


Rules:


app(nil, y) -> y
app(add(n, x), y) -> add(n, app(x, y))
reverse(nil) -> nil
reverse(add(n, x)) -> app(reverse(x), add(n, nil))
shuffle(nil) -> nil
shuffle(add(n, x)) -> add(n, shuffle(reverse(x)))


Strategy:

innermost




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

SHUFFLE(add(n, add(n'', add(n''', nil)))) -> SHUFFLE(add(n''', app(nil, add(n'', nil))))
one new Dependency Pair is created:

SHUFFLE(add(n, add(n'', add(n''', nil)))) -> SHUFFLE(add(n''', add(n'', nil)))

The transformation is resulting in one new DP problem: 



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


Dependency Pair:

SHUFFLE(add(n, add(n'', add(n''', add(n'0, x''))))) -> SHUFFLE(app(app(app(reverse(x''), add(n'0, nil)), add(n''', nil)), add(n'', nil)))


Rules:


app(nil, y) -> y
app(add(n, x), y) -> add(n, app(x, y))
reverse(nil) -> nil
reverse(add(n, x)) -> app(reverse(x), add(n, nil))
shuffle(nil) -> nil
shuffle(add(n, x)) -> add(n, shuffle(reverse(x)))


Strategy:

innermost




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

SHUFFLE(add(n, add(n'', add(n''', add(n'0, x''))))) -> SHUFFLE(app(app(app(reverse(x''), add(n'0, nil)), add(n''', nil)), add(n'', nil)))
two new Dependency Pairs are created:

SHUFFLE(add(n, add(n'', add(n''', add(n'0, nil))))) -> SHUFFLE(app(app(app(nil, add(n'0, nil)), add(n''', nil)), add(n'', nil)))
SHUFFLE(add(n, add(n'', add(n''', add(n'0, add(n'1, x')))))) -> SHUFFLE(app(app(app(app(reverse(x'), add(n'1, nil)), add(n'0, nil)), add(n''', nil)), add(n'', nil)))

The transformation is resulting in one new DP problem: 



   R
     ↳DPs
       →DP Problem 1
         ↳FwdInst
       →DP Problem 2
         ↳FwdInst
       →DP Problem 3
         ↳Nar
           →DP Problem 10
             ↳Nar
             ...
               →DP Problem 17
                 ↳Rewriting Transformation


Dependency Pairs:

SHUFFLE(add(n, add(n'', add(n''', add(n'0, add(n'1, x')))))) -> SHUFFLE(app(app(app(app(reverse(x'), add(n'1, nil)), add(n'0, nil)), add(n''', nil)), add(n'', nil)))
SHUFFLE(add(n, add(n'', add(n''', add(n'0, nil))))) -> SHUFFLE(app(app(app(nil, add(n'0, nil)), add(n''', nil)), add(n'', nil)))


Rules:


app(nil, y) -> y
app(add(n, x), y) -> add(n, app(x, y))
reverse(nil) -> nil
reverse(add(n, x)) -> app(reverse(x), add(n, nil))
shuffle(nil) -> nil
shuffle(add(n, x)) -> add(n, shuffle(reverse(x)))


Strategy:

innermost




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

SHUFFLE(add(n, add(n'', add(n''', add(n'0, nil))))) -> SHUFFLE(app(app(app(nil, add(n'0, nil)), add(n''', nil)), add(n'', nil)))
one new Dependency Pair is created:

SHUFFLE(add(n, add(n'', add(n''', add(n'0, nil))))) -> SHUFFLE(app(app(add(n'0, nil), add(n''', nil)), add(n'', nil)))

The transformation is resulting in one new DP problem: 



   R
     ↳DPs
       →DP Problem 1
         ↳FwdInst
       →DP Problem 2
         ↳FwdInst
       →DP Problem 3
         ↳Nar
           →DP Problem 10
             ↳Nar
             ...
               →DP Problem 18
                 ↳Rewriting Transformation


Dependency Pairs:

SHUFFLE(add(n, add(n'', add(n''', add(n'0, nil))))) -> SHUFFLE(app(app(add(n'0, nil), add(n''', nil)), add(n'', nil)))
SHUFFLE(add(n, add(n'', add(n''', add(n'0, add(n'1, x')))))) -> SHUFFLE(app(app(app(app(reverse(x'), add(n'1, nil)), add(n'0, nil)), add(n''', nil)), add(n'', nil)))


Rules:


app(nil, y) -> y
app(add(n, x), y) -> add(n, app(x, y))
reverse(nil) -> nil
reverse(add(n, x)) -> app(reverse(x), add(n, nil))
shuffle(nil) -> nil
shuffle(add(n, x)) -> add(n, shuffle(reverse(x)))


Strategy:

innermost




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

SHUFFLE(add(n, add(n'', add(n''', add(n'0, nil))))) -> SHUFFLE(app(app(add(n'0, nil), add(n''', nil)), add(n'', nil)))
one new Dependency Pair is created:

SHUFFLE(add(n, add(n'', add(n''', add(n'0, nil))))) -> SHUFFLE(app(add(n'0, app(nil, add(n''', nil))), add(n'', nil)))

The transformation is resulting in one new DP problem: 



   R
     ↳DPs
       →DP Problem 1
         ↳FwdInst
       →DP Problem 2
         ↳FwdInst
       →DP Problem 3
         ↳Nar
           →DP Problem 10
             ↳Nar
             ...
               →DP Problem 19
                 ↳Rewriting Transformation


Dependency Pairs:

SHUFFLE(add(n, add(n'', add(n''', add(n'0, nil))))) -> SHUFFLE(app(add(n'0, app(nil, add(n''', nil))), add(n'', nil)))
SHUFFLE(add(n, add(n'', add(n''', add(n'0, add(n'1, x')))))) -> SHUFFLE(app(app(app(app(reverse(x'), add(n'1, nil)), add(n'0, nil)), add(n''', nil)), add(n'', nil)))


Rules:


app(nil, y) -> y
app(add(n, x), y) -> add(n, app(x, y))
reverse(nil) -> nil
reverse(add(n, x)) -> app(reverse(x), add(n, nil))
shuffle(nil) -> nil
shuffle(add(n, x)) -> add(n, shuffle(reverse(x)))


Strategy:

innermost




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

SHUFFLE(add(n, add(n'', add(n''', add(n'0, nil))))) -> SHUFFLE(app(add(n'0, app(nil, add(n''', nil))), add(n'', nil)))
one new Dependency Pair is created:

SHUFFLE(add(n, add(n'', add(n''', add(n'0, nil))))) -> SHUFFLE(add(n'0, app(app(nil, add(n''', nil)), add(n'', nil))))

The transformation is resulting in one new DP problem: 



   R
     ↳DPs
       →DP Problem 1
         ↳FwdInst
       →DP Problem 2
         ↳FwdInst
       →DP Problem 3
         ↳Nar
           →DP Problem 10
             ↳Nar
             ...
               →DP Problem 20
                 ↳Rewriting Transformation


Dependency Pairs:

SHUFFLE(add(n, add(n'', add(n''', add(n'0, nil))))) -> SHUFFLE(add(n'0, app(app(nil, add(n''', nil)), add(n'', nil))))
SHUFFLE(add(n, add(n'', add(n''', add(n'0, add(n'1, x')))))) -> SHUFFLE(app(app(app(app(reverse(x'), add(n'1, nil)), add(n'0, nil)), add(n''', nil)), add(n'', nil)))


Rules:


app(nil, y) -> y
app(add(n, x), y) -> add(n, app(x, y))
reverse(nil) -> nil
reverse(add(n, x)) -> app(reverse(x), add(n, nil))
shuffle(nil) -> nil
shuffle(add(n, x)) -> add(n, shuffle(reverse(x)))


Strategy:

innermost




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

SHUFFLE(add(n, add(n'', add(n''', add(n'0, nil))))) -> SHUFFLE(add(n'0, app(app(nil, add(n''', nil)), add(n'', nil))))
one new Dependency Pair is created:

SHUFFLE(add(n, add(n'', add(n''', add(n'0, nil))))) -> SHUFFLE(add(n'0, app(add(n''', nil), add(n'', nil))))

The transformation is resulting in one new DP problem: 



   R
     ↳DPs
       →DP Problem 1
         ↳FwdInst
       →DP Problem 2
         ↳FwdInst
       →DP Problem 3
         ↳Nar
           →DP Problem 10
             ↳Nar
             ...
               →DP Problem 21
                 ↳Rewriting Transformation


Dependency Pairs:

SHUFFLE(add(n, add(n'', add(n''', add(n'0, nil))))) -> SHUFFLE(add(n'0, app(add(n''', nil), add(n'', nil))))
SHUFFLE(add(n, add(n'', add(n''', add(n'0, add(n'1, x')))))) -> SHUFFLE(app(app(app(app(reverse(x'), add(n'1, nil)), add(n'0, nil)), add(n''', nil)), add(n'', nil)))


Rules:


app(nil, y) -> y
app(add(n, x), y) -> add(n, app(x, y))
reverse(nil) -> nil
reverse(add(n, x)) -> app(reverse(x), add(n, nil))
shuffle(nil) -> nil
shuffle(add(n, x)) -> add(n, shuffle(reverse(x)))


Strategy:

innermost




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

SHUFFLE(add(n, add(n'', add(n''', add(n'0, nil))))) -> SHUFFLE(add(n'0, app(add(n''', nil), add(n'', nil))))
one new Dependency Pair is created:

SHUFFLE(add(n, add(n'', add(n''', add(n'0, nil))))) -> SHUFFLE(add(n'0, add(n''', app(nil, add(n'', nil)))))

The transformation is resulting in one new DP problem: 



   R
     ↳DPs
       →DP Problem 1
         ↳FwdInst
       →DP Problem 2
         ↳FwdInst
       →DP Problem 3
         ↳Nar
           →DP Problem 10
             ↳Nar
             ...
               →DP Problem 22
                 ↳Rewriting Transformation


Dependency Pairs:

SHUFFLE(add(n, add(n'', add(n''', add(n'0, nil))))) -> SHUFFLE(add(n'0, add(n''', app(nil, add(n'', nil)))))
SHUFFLE(add(n, add(n'', add(n''', add(n'0, add(n'1, x')))))) -> SHUFFLE(app(app(app(app(reverse(x'), add(n'1, nil)), add(n'0, nil)), add(n''', nil)), add(n'', nil)))


Rules:


app(nil, y) -> y
app(add(n, x), y) -> add(n, app(x, y))
reverse(nil) -> nil
reverse(add(n, x)) -> app(reverse(x), add(n, nil))
shuffle(nil) -> nil
shuffle(add(n, x)) -> add(n, shuffle(reverse(x)))


Strategy:

innermost




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

SHUFFLE(add(n, add(n'', add(n''', add(n'0, nil))))) -> SHUFFLE(add(n'0, add(n''', app(nil, add(n'', nil)))))
one new Dependency Pair is created:

SHUFFLE(add(n, add(n'', add(n''', add(n'0, nil))))) -> SHUFFLE(add(n'0, add(n''', add(n'', nil))))

The transformation is resulting in one new DP problem: 



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


Dependency Pair:

SHUFFLE(add(n, add(n'', add(n''', add(n'0, add(n'1, x')))))) -> SHUFFLE(app(app(app(app(reverse(x'), add(n'1, nil)), add(n'0, nil)), add(n''', nil)), add(n'', nil)))


Rules:


app(nil, y) -> y
app(add(n, x), y) -> add(n, app(x, y))
reverse(nil) -> nil
reverse(add(n, x)) -> app(reverse(x), add(n, nil))
shuffle(nil) -> nil
shuffle(add(n, x)) -> add(n, shuffle(reverse(x)))


Strategy:

innermost




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

SHUFFLE(add(n, add(n'', add(n''', add(n'0, add(n'1, x')))))) -> SHUFFLE(app(app(app(app(reverse(x'), add(n'1, nil)), add(n'0, nil)), add(n''', nil)), add(n'', nil)))
two new Dependency Pairs are created:

SHUFFLE(add(n, add(n'', add(n''', add(n'0, add(n'1, nil)))))) -> SHUFFLE(app(app(app(app(nil, add(n'1, nil)), add(n'0, nil)), add(n''', nil)), add(n'', nil)))
SHUFFLE(add(n, add(n'', add(n''', add(n'0, add(n'1, add(n'2, x''))))))) -> SHUFFLE(app(app(app(app(app(reverse(x''), add(n'2, nil)), add(n'1, nil)), add(n'0, nil)), add(n''', nil)), add(n'', nil)))

The transformation is resulting in one new DP problem: 



   R
     ↳DPs
       →DP Problem 1
         ↳FwdInst
       →DP Problem 2
         ↳FwdInst
       →DP Problem 3
         ↳Nar
           →DP Problem 10
             ↳Nar
             ...
               →DP Problem 24
                 ↳Rewriting Transformation


Dependency Pairs:

SHUFFLE(add(n, add(n'', add(n''', add(n'0, add(n'1, add(n'2, x''))))))) -> SHUFFLE(app(app(app(app(app(reverse(x''), add(n'2, nil)), add(n'1, nil)), add(n'0, nil)), add(n''', nil)), add(n'', nil)))
SHUFFLE(add(n, add(n'', add(n''', add(n'0, add(n'1, nil)))))) -> SHUFFLE(app(app(app(app(nil, add(n'1, nil)), add(n'0, nil)), add(n''', nil)), add(n'', nil)))


Rules:


app(nil, y) -> y
app(add(n, x), y) -> add(n, app(x, y))
reverse(nil) -> nil
reverse(add(n, x)) -> app(reverse(x), add(n, nil))
shuffle(nil) -> nil
shuffle(add(n, x)) -> add(n, shuffle(reverse(x)))


Strategy:

innermost




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

SHUFFLE(add(n, add(n'', add(n''', add(n'0, add(n'1, nil)))))) -> SHUFFLE(app(app(app(app(nil, add(n'1, nil)), add(n'0, nil)), add(n''', nil)), add(n'', nil)))
one new Dependency Pair is created:

SHUFFLE(add(n, add(n'', add(n''', add(n'0, add(n'1, nil)))))) -> SHUFFLE(app(app(app(add(n'1, nil), add(n'0, nil)), add(n''', nil)), add(n'', nil)))

The transformation is resulting in one new DP problem: 



   R
     ↳DPs
       →DP Problem 1
         ↳FwdInst
       →DP Problem 2
         ↳FwdInst
       →DP Problem 3
         ↳Nar
           →DP Problem 10
             ↳Nar
             ...
               →DP Problem 25
                 ↳Rewriting Transformation


Dependency Pairs:

SHUFFLE(add(n, add(n'', add(n''', add(n'0, add(n'1, nil)))))) -> SHUFFLE(app(app(app(add(n'1, nil), add(n'0, nil)), add(n''', nil)), add(n'', nil)))
SHUFFLE(add(n, add(n'', add(n''', add(n'0, add(n'1, add(n'2, x''))))))) -> SHUFFLE(app(app(app(app(app(reverse(x''), add(n'2, nil)), add(n'1, nil)), add(n'0, nil)), add(n''', nil)), add(n'', nil)))


Rules:


app(nil, y) -> y
app(add(n, x), y) -> add(n, app(x, y))
reverse(nil) -> nil
reverse(add(n, x)) -> app(reverse(x), add(n, nil))
shuffle(nil) -> nil
shuffle(add(n, x)) -> add(n, shuffle(reverse(x)))


Strategy:

innermost




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

SHUFFLE(add(n, add(n'', add(n''', add(n'0, add(n'1, nil)))))) -> SHUFFLE(app(app(app(add(n'1, nil), add(n'0, nil)), add(n''', nil)), add(n'', nil)))
one new Dependency Pair is created:

SHUFFLE(add(n, add(n'', add(n''', add(n'0, add(n'1, nil)))))) -> SHUFFLE(app(app(add(n'1, app(nil, add(n'0, nil))), add(n''', nil)), add(n'', nil)))

The transformation is resulting in one new DP problem: 



   R
     ↳DPs
       →DP Problem 1
         ↳FwdInst
       →DP Problem 2
         ↳FwdInst
       →DP Problem 3
         ↳Nar
           →DP Problem 10
             ↳Nar
             ...
               →DP Problem 26
                 ↳Rewriting Transformation


Dependency Pairs:

SHUFFLE(add(n, add(n'', add(n''', add(n'0, add(n'1, nil)))))) -> SHUFFLE(app(app(add(n'1, app(nil, add(n'0, nil))), add(n''', nil)), add(n'', nil)))
SHUFFLE(add(n, add(n'', add(n''', add(n'0, add(n'1, add(n'2, x''))))))) -> SHUFFLE(app(app(app(app(app(reverse(x''), add(n'2, nil)), add(n'1, nil)), add(n'0, nil)), add(n''', nil)), add(n'', nil)))


Rules:


app(nil, y) -> y
app(add(n, x), y) -> add(n, app(x, y))
reverse(nil) -> nil
reverse(add(n, x)) -> app(reverse(x), add(n, nil))
shuffle(nil) -> nil
shuffle(add(n, x)) -> add(n, shuffle(reverse(x)))


Strategy:

innermost




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

SHUFFLE(add(n, add(n'', add(n''', add(n'0, add(n'1, nil)))))) -> SHUFFLE(app(app(add(n'1, app(nil, add(n'0, nil))), add(n''', nil)), add(n'', nil)))
one new Dependency Pair is created:

SHUFFLE(add(n, add(n'', add(n''', add(n'0, add(n'1, nil)))))) -> SHUFFLE(app(add(n'1, app(app(nil, add(n'0, nil)), add(n''', nil))), add(n'', nil)))

The transformation is resulting in one new DP problem: 



   R
     ↳DPs
       →DP Problem 1
         ↳FwdInst
       →DP Problem 2
         ↳FwdInst
       →DP Problem 3
         ↳Nar
           →DP Problem 10
             ↳Nar
             ...
               →DP Problem 27
                 ↳Rewriting Transformation


Dependency Pairs:

SHUFFLE(add(n, add(n'', add(n''', add(n'0, add(n'1, nil)))))) -> SHUFFLE(app(add(n'1, app(app(nil, add(n'0, nil)), add(n''', nil))), add(n'', nil)))
SHUFFLE(add(n, add(n'', add(n''', add(n'0, add(n'1, add(n'2, x''))))))) -> SHUFFLE(app(app(app(app(app(reverse(x''), add(n'2, nil)), add(n'1, nil)), add(n'0, nil)), add(n''', nil)), add(n'', nil)))


Rules:


app(nil, y) -> y
app(add(n, x), y) -> add(n, app(x, y))
reverse(nil) -> nil
reverse(add(n, x)) -> app(reverse(x), add(n, nil))
shuffle(nil) -> nil
shuffle(add(n, x)) -> add(n, shuffle(reverse(x)))


Strategy:

innermost




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

SHUFFLE(add(n, add(n'', add(n''', add(n'0, add(n'1, nil)))))) -> SHUFFLE(app(add(n'1, app(app(nil, add(n'0, nil)), add(n''', nil))), add(n'', nil)))
one new Dependency Pair is created:

SHUFFLE(add(n, add(n'', add(n''', add(n'0, add(n'1, nil)))))) -> SHUFFLE(add(n'1, app(app(app(nil, add(n'0, nil)), add(n''', nil)), add(n'', nil))))

The transformation is resulting in one new DP problem: 



   R
     ↳DPs
       →DP Problem 1
         ↳FwdInst
       →DP Problem 2
         ↳FwdInst
       →DP Problem 3
         ↳Nar
           →DP Problem 10
             ↳Nar
             ...
               →DP Problem 28
                 ↳Rewriting Transformation


Dependency Pairs:

SHUFFLE(add(n, add(n'', add(n''', add(n'0, add(n'1, nil)))))) -> SHUFFLE(add(n'1, app(app(app(nil, add(n'0, nil)), add(n''', nil)), add(n'', nil))))
SHUFFLE(add(n, add(n'', add(n''', add(n'0, add(n'1, add(n'2, x''))))))) -> SHUFFLE(app(app(app(app(app(reverse(x''), add(n'2, nil)), add(n'1, nil)), add(n'0, nil)), add(n''', nil)), add(n'', nil)))


Rules:


app(nil, y) -> y
app(add(n, x), y) -> add(n, app(x, y))
reverse(nil) -> nil
reverse(add(n, x)) -> app(reverse(x), add(n, nil))
shuffle(nil) -> nil
shuffle(add(n, x)) -> add(n, shuffle(reverse(x)))


Strategy:

innermost




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

SHUFFLE(add(n, add(n'', add(n''', add(n'0, add(n'1, nil)))))) -> SHUFFLE(add(n'1, app(app(app(nil, add(n'0, nil)), add(n''', nil)), add(n'', nil))))
one new Dependency Pair is created:

SHUFFLE(add(n, add(n'', add(n''', add(n'0, add(n'1, nil)))))) -> SHUFFLE(add(n'1, app(app(add(n'0, nil), add(n''', nil)), add(n'', nil))))

The transformation is resulting in one new DP problem: 



   R
     ↳DPs
       →DP Problem 1
         ↳FwdInst
       →DP Problem 2
         ↳FwdInst
       →DP Problem 3
         ↳Nar
           →DP Problem 10
             ↳Nar
             ...
               →DP Problem 29
                 ↳Rewriting Transformation


Dependency Pairs:

SHUFFLE(add(n, add(n'', add(n''', add(n'0, add(n'1, nil)))))) -> SHUFFLE(add(n'1, app(app(add(n'0, nil), add(n''', nil)), add(n'', nil))))
SHUFFLE(add(n, add(n'', add(n''', add(n'0, add(n'1, add(n'2, x''))))))) -> SHUFFLE(app(app(app(app(app(reverse(x''), add(n'2, nil)), add(n'1, nil)), add(n'0, nil)), add(n''', nil)), add(n'', nil)))


Rules:


app(nil, y) -> y
app(add(n, x), y) -> add(n, app(x, y))
reverse(nil) -> nil
reverse(add(n, x)) -> app(reverse(x), add(n, nil))
shuffle(nil) -> nil
shuffle(add(n, x)) -> add(n, shuffle(reverse(x)))


Strategy:

innermost




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

SHUFFLE(add(n, add(n'', add(n''', add(n'0, add(n'1, nil)))))) -> SHUFFLE(add(n'1, app(app(add(n'0, nil), add(n''', nil)), add(n'', nil))))
one new Dependency Pair is created:

SHUFFLE(add(n, add(n'', add(n''', add(n'0, add(n'1, nil)))))) -> SHUFFLE(add(n'1, app(add(n'0, app(nil, add(n''', nil))), add(n'', nil))))

The transformation is resulting in one new DP problem: 



   R
     ↳DPs
       →DP Problem 1
         ↳FwdInst
       →DP Problem 2
         ↳FwdInst
       →DP Problem 3
         ↳Nar
           →DP Problem 10
             ↳Nar
             ...
               →DP Problem 30
                 ↳Rewriting Transformation


Dependency Pairs:

SHUFFLE(add(n, add(n'', add(n''', add(n'0, add(n'1, nil)))))) -> SHUFFLE(add(n'1, app(add(n'0, app(nil, add(n''', nil))), add(n'', nil))))
SHUFFLE(add(n, add(n'', add(n''', add(n'0, add(n'1, add(n'2, x''))))))) -> SHUFFLE(app(app(app(app(app(reverse(x''), add(n'2, nil)), add(n'1, nil)), add(n'0, nil)), add(n''', nil)), add(n'', nil)))


Rules:


app(nil, y) -> y
app(add(n, x), y) -> add(n, app(x, y))
reverse(nil) -> nil
reverse(add(n, x)) -> app(reverse(x), add(n, nil))
shuffle(nil) -> nil
shuffle(add(n, x)) -> add(n, shuffle(reverse(x)))


Strategy:

innermost




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

SHUFFLE(add(n, add(n'', add(n''', add(n'0, add(n'1, nil)))))) -> SHUFFLE(add(n'1, app(add(n'0, app(nil, add(n''', nil))), add(n'', nil))))
one new Dependency Pair is created:

SHUFFLE(add(n, add(n'', add(n''', add(n'0, add(n'1, nil)))))) -> SHUFFLE(add(n'1, add(n'0, app(app(nil, add(n''', nil)), add(n'', nil)))))

The transformation is resulting in one new DP problem: 



   R
     ↳DPs
       →DP Problem 1
         ↳FwdInst
       →DP Problem 2
         ↳FwdInst
       →DP Problem 3
         ↳Nar
           →DP Problem 10
             ↳Nar
             ...
               →DP Problem 31
                 ↳Rewriting Transformation


Dependency Pairs:

SHUFFLE(add(n, add(n'', add(n''', add(n'0, add(n'1, nil)))))) -> SHUFFLE(add(n'1, add(n'0, app(app(nil, add(n''', nil)), add(n'', nil)))))
SHUFFLE(add(n, add(n'', add(n''', add(n'0, add(n'1, add(n'2, x''))))))) -> SHUFFLE(app(app(app(app(app(reverse(x''), add(n'2, nil)), add(n'1, nil)), add(n'0, nil)), add(n''', nil)), add(n'', nil)))


Rules:


app(nil, y) -> y
app(add(n, x), y) -> add(n, app(x, y))
reverse(nil) -> nil
reverse(add(n, x)) -> app(reverse(x), add(n, nil))
shuffle(nil) -> nil
shuffle(add(n, x)) -> add(n, shuffle(reverse(x)))


Strategy:

innermost




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

SHUFFLE(add(n, add(n'', add(n''', add(n'0, add(n'1, nil)))))) -> SHUFFLE(add(n'1, add(n'0, app(app(nil, add(n''', nil)), add(n'', nil)))))
one new Dependency Pair is created:

SHUFFLE(add(n, add(n'', add(n''', add(n'0, add(n'1, nil)))))) -> SHUFFLE(add(n'1, add(n'0, app(add(n''', nil), add(n'', nil)))))

The transformation is resulting in one new DP problem: 



   R
     ↳DPs
       →DP Problem 1
         ↳FwdInst
       →DP Problem 2
         ↳FwdInst
       →DP Problem 3
         ↳Nar
           →DP Problem 10
             ↳Nar
             ...
               →DP Problem 32
                 ↳Rewriting Transformation


Dependency Pairs:

SHUFFLE(add(n, add(n'', add(n''', add(n'0, add(n'1, nil)))))) -> SHUFFLE(add(n'1, add(n'0, app(add(n''', nil), add(n'', nil)))))
SHUFFLE(add(n, add(n'', add(n''', add(n'0, add(n'1, add(n'2, x''))))))) -> SHUFFLE(app(app(app(app(app(reverse(x''), add(n'2, nil)), add(n'1, nil)), add(n'0, nil)), add(n''', nil)), add(n'', nil)))


Rules:


app(nil, y) -> y
app(add(n, x), y) -> add(n, app(x, y))
reverse(nil) -> nil
reverse(add(n, x)) -> app(reverse(x), add(n, nil))
shuffle(nil) -> nil
shuffle(add(n, x)) -> add(n, shuffle(reverse(x)))


Strategy:

innermost




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

SHUFFLE(add(n, add(n'', add(n''', add(n'0, add(n'1, nil)))))) -> SHUFFLE(add(n'1, add(n'0, app(add(n''', nil), add(n'', nil)))))
one new Dependency Pair is created:

SHUFFLE(add(n, add(n'', add(n''', add(n'0, add(n'1, nil)))))) -> SHUFFLE(add(n'1, add(n'0, add(n''', app(nil, add(n'', nil))))))

The transformation is resulting in one new DP problem: 



   R
     ↳DPs
       →DP Problem 1
         ↳FwdInst
       →DP Problem 2
         ↳FwdInst
       →DP Problem 3
         ↳Nar
           →DP Problem 10
             ↳Nar
             ...
               →DP Problem 33
                 ↳Rewriting Transformation


Dependency Pairs:

SHUFFLE(add(n, add(n'', add(n''', add(n'0, add(n'1, nil)))))) -> SHUFFLE(add(n'1, add(n'0, add(n''', app(nil, add(n'', nil))))))
SHUFFLE(add(n, add(n'', add(n''', add(n'0, add(n'1, add(n'2, x''))))))) -> SHUFFLE(app(app(app(app(app(reverse(x''), add(n'2, nil)), add(n'1, nil)), add(n'0, nil)), add(n''', nil)), add(n'', nil)))


Rules:


app(nil, y) -> y
app(add(n, x), y) -> add(n, app(x, y))
reverse(nil) -> nil
reverse(add(n, x)) -> app(reverse(x), add(n, nil))
shuffle(nil) -> nil
shuffle(add(n, x)) -> add(n, shuffle(reverse(x)))


Strategy:

innermost




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

SHUFFLE(add(n, add(n'', add(n''', add(n'0, add(n'1, nil)))))) -> SHUFFLE(add(n'1, add(n'0, add(n''', app(nil, add(n'', nil))))))
one new Dependency Pair is created:

SHUFFLE(add(n, add(n'', add(n''', add(n'0, add(n'1, nil)))))) -> SHUFFLE(add(n'1, add(n'0, add(n''', add(n'', nil)))))

The transformation is resulting in one new DP problem: 



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




The following remains to be proven:
Dependency Pair:

SHUFFLE(add(n, add(n'', add(n''', add(n'0, add(n'1, add(n'2, x''))))))) -> SHUFFLE(app(app(app(app(app(reverse(x''), add(n'2, nil)), add(n'1, nil)), add(n'0, nil)), add(n''', nil)), add(n'', nil)))


Rules:


app(nil, y) -> y
app(add(n, x), y) -> add(n, app(x, y))
reverse(nil) -> nil
reverse(add(n, x)) -> app(reverse(x), add(n, nil))
shuffle(nil) -> nil
shuffle(add(n, x)) -> add(n, shuffle(reverse(x)))


Strategy:

innermost



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