Term Rewriting System R:
[x, u, v, z, y]
admit(x, nil) -> nil
admit(x, .(u, .(v, .(w, z)))) -> cond(=(sum(x, u, v), w), .(u, .(v, .(w, admit(carry(x, u, v), z)))))
cond(true, y) -> y

Termination of R to be shown.



   R
Dependency Pair Analysis



R contains the following Dependency Pairs:

ADMIT(x, .(u, .(v, .(w, z)))) -> COND(=(sum(x, u, v), w), .(u, .(v, .(w, admit(carry(x, u, v), z)))))
ADMIT(x, .(u, .(v, .(w, z)))) -> ADMIT(carry(x, u, v), z)

Furthermore, R contains one SCC.


   R
DPs
       →DP Problem 1
Argument Filtering and Ordering


Dependency Pair:

ADMIT(x, .(u, .(v, .(w, z)))) -> ADMIT(carry(x, u, v), z)


Rules:


admit(x, nil) -> nil
admit(x, .(u, .(v, .(w, z)))) -> cond(=(sum(x, u, v), w), .(u, .(v, .(w, admit(carry(x, u, v), z)))))
cond(true, y) -> y





The following dependency pair can be strictly oriented:

ADMIT(x, .(u, .(v, .(w, z)))) -> ADMIT(carry(x, u, v), z)


The following rules can be oriented:

admit(x, nil) -> nil
admit(x, .(u, .(v, .(w, z)))) -> cond(=(sum(x, u, v), w), .(u, .(v, .(w, admit(carry(x, u, v), z)))))
cond(true, y) -> y


Used ordering: Polynomial ordering with Polynomial interpretation:
  POL(cond(x1, x2))=  x1 + x2  
  POL(carry(x1, x2, x3))=  x1 + x2 + x3  
  POL(=(x1, x2))=  x1 + x2  
  POL(nil)=  1  
  POL(true)=  1  
  POL(.(x1, x2))=  1 + x1 + x2  
  POL(sum)=  0  
  POL(w)=  0  
  POL(ADMIT(x1, x2))=  1 + x1 + x2  

resulting in one new DP problem.
Used Argument Filtering System:
ADMIT(x1, x2) -> ADMIT(x1, x2)
.(x1, x2) -> .(x1, x2)
carry(x1, x2, x3) -> carry(x1, x2, x3)
admit(x1, x2) -> x2
cond(x1, x2) -> cond(x1, x2)
=(x1, x2) -> =(x1, x2)
sum(x1, x2, x3) -> sum


   R
DPs
       →DP Problem 1
AFS
           →DP Problem 2
Dependency Graph


Dependency Pair:


Rules:


admit(x, nil) -> nil
admit(x, .(u, .(v, .(w, z)))) -> cond(=(sum(x, u, v), w), .(u, .(v, .(w, admit(carry(x, u, v), z)))))
cond(true, y) -> y





Using the Dependency Graph resulted in no new DP problems.

Termination of R successfully shown.
Duration:
0:01 minutes