Term Rewriting System R:
[x, y, z]
:(x, x) -> e
:(x, e) -> x
:(:(x, y), z) -> :(x, :(z, i(y)))
:(e, x) -> i(x)
:(x, :(y, i(x))) -> i(y)
:(x, :(y, :(i(x), z))) -> :(i(z), y)
:(i(x), :(y, x)) -> i(y)
:(i(x), :(y, :(x, z))) -> :(i(z), y)
i(:(x, y)) -> :(y, x)
i(i(x)) -> x
i(e) -> e

Innermost Termination of R to be shown. 



   R
     ↳Dependency Pair Analysis



R contains the following Dependency Pairs:

:'(:(x, y), z) -> :'(x, :(z, i(y)))
:'(:(x, y), z) -> :'(z, i(y))
:'(:(x, y), z) -> I(y)
:'(e, x) -> I(x)
:'(x, :(y, i(x))) -> I(y)
:'(x, :(y, :(i(x), z))) -> :'(i(z), y)
:'(x, :(y, :(i(x), z))) -> I(z)
:'(i(x), :(y, x)) -> I(y)
:'(i(x), :(y, :(x, z))) -> :'(i(z), y)
:'(i(x), :(y, :(x, z))) -> I(z)
I(:(x, y)) -> :'(y, x)

Furthermore, R contains one SCC. 


   R
     ↳DPs
       →DP Problem 1
         ↳Remaining Obligation(s)




The following remains to be proven:
Dependency Pairs:

:'(i(x), :(y, :(x, z))) -> I(z)
:'(i(x), :(y, :(x, z))) -> :'(i(z), y)
:'(x, :(y, :(i(x), z))) -> I(z)
:'(e, x) -> I(x)
I(:(x, y)) -> :'(y, x)
:'(:(x, y), z) -> I(y)
:'(:(x, y), z) -> :'(z, i(y))
:'(x, :(y, :(i(x), z))) -> :'(i(z), y)
:'(:(x, y), z) -> :'(x, :(z, i(y)))


Rules:


:(x, x) -> e
:(x, e) -> x
:(:(x, y), z) -> :(x, :(z, i(y)))
:(e, x) -> i(x)
:(x, :(y, i(x))) -> i(y)
:(x, :(y, :(i(x), z))) -> :(i(z), y)
:(i(x), :(y, x)) -> i(y)
:(i(x), :(y, :(x, z))) -> :(i(z), y)
i(:(x, y)) -> :(y, x)
i(i(x)) -> x
i(e) -> e


Strategy:

innermost



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