bin(

bin(0, s(

bin(s(

R

↳Dependency Pair Analysis

BIN(s(x), s(y)) -> BIN(x, s(y))

BIN(s(x), s(y)) -> BIN(x,y)

Furthermore,

R

↳DPs

→DP Problem 1

↳Argument Filtering and Ordering

**BIN(s( x), s(y)) -> BIN(x, y)**

bin(x, 0) -> s(0)

bin(0, s(y)) -> 0

bin(s(x), s(y)) -> +(bin(x, s(y)), bin(x,y))

The following dependency pairs can be strictly oriented:

BIN(s(x), s(y)) -> BIN(x,y)

BIN(s(x), s(y)) -> BIN(x, s(y))

The following rules can be oriented:

bin(x, 0) -> s(0)

bin(0, s(y)) -> 0

bin(s(x), s(y)) -> +(bin(x, s(y)), bin(x,y))

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

bin > +

bin > s

resulting in one new DP problem.

Used Argument Filtering System:

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

s(x) -> s(_{1}x)_{1}

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

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

R

↳DPs

→DP Problem 1

↳AFS

→DP Problem 2

↳Dependency Graph

bin(x, 0) -> s(0)

bin(0, s(y)) -> 0

bin(s(x), s(y)) -> +(bin(x, s(y)), bin(x,y))

Using the Dependency Graph resulted in no new DP problems.

Duration:

0:00 minutes