admit(

admit(

cond(true,

R

↳Dependency Pair Analysis

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

↳DPs

→DP Problem 1

↳Argument Filtering and Ordering

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

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

innermost

The following dependency pair can be strictly oriented:

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

There are no usable rules for innermost w.r.t. to the AFS that need to be oriented.

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

trivial

resulting in one new DP problem.

Used Argument Filtering System:

ADMIT(x,_{1}x) -> ADMIT(_{2}x,_{1}x)_{2}

.(x,_{1}x) -> .(_{2}x,_{1}x)_{2}

carry(x,_{1}x,_{2}x) ->_{3}x_{1}

R

↳DPs

→DP Problem 1

↳AFS

→DP Problem 2

↳Dependency Graph

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

innermost

Using the Dependency Graph resulted in no new DP problems.

Duration:

0:00 minutes