+(a, b) -> +(b, a)

+(a, +(b,

+(+(

f(a,

f(b,

f(+(

R

↳Dependency Pair Analysis

+'(a, b) -> +'(b, a)

+'(a, +(b,z)) -> +'(b, +(a,z))

+'(a, +(b,z)) -> +'(a,z)

+'(+(x,y),z) -> +'(x, +(y,z))

+'(+(x,y),z) -> +'(y,z)

F(+(x,y),z) -> +'(f(x,z), f(y,z))

F(+(x,y),z) -> F(x,z)

F(+(x,y),z) -> F(y,z)

Furthermore,

R

↳DPs

→DP Problem 1

↳Argument Filtering and Ordering

→DP Problem 2

↳Remaining

→DP Problem 3

↳Remaining

**+'(a, +(b, z)) -> +'(a, z)**

+(a, b) -> +(b, a)

+(a, +(b,z)) -> +(b, +(a,z))

+(+(x,y),z) -> +(x, +(y,z))

f(a,y) -> a

f(b,y) -> b

f(+(x,y),z) -> +(f(x,z), f(y,z))

The following dependency pair can be strictly oriented:

+'(a, +(b,z)) -> +'(a,z)

There are no usable rules using the Ce-refinement that need to be oriented.

Used ordering: Homeomorphic Embedding Order with EMB

resulting in one new DP problem.

Used Argument Filtering System:

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

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

R

↳DPs

→DP Problem 1

↳AFS

→DP Problem 4

↳Dependency Graph

→DP Problem 2

↳Remaining

→DP Problem 3

↳Remaining

+(a, b) -> +(b, a)

+(a, +(b,z)) -> +(b, +(a,z))

+(+(x,y),z) -> +(x, +(y,z))

f(a,y) -> a

f(b,y) -> b

f(+(x,y),z) -> +(f(x,z), f(y,z))

Using the Dependency Graph resulted in no new DP problems.

R

↳DPs

→DP Problem 1

↳AFS

→DP Problem 2

↳Remaining Obligation(s)

→DP Problem 3

↳Remaining Obligation(s)

The following remains to be proven:

**Dependency Pairs:****+'(+(***x*,*y*),*z*) -> +'(*y*,*z*)**+'(+(***x*,*y*),*z*) -> +'(*x*, +(*y*,*z*))**Rules:**

+(a, b) -> +(b, a)

+(a, +(b,*z*)) -> +(b, +(a,*z*))

+(+(*x*,*y*),*z*) -> +(*x*, +(*y*,*z*))

f(a,*y*) -> a

f(b,*y*) -> b

f(+(*x*,*y*),*z*) -> +(f(*x*,*z*), f(*y*,*z*))**Dependency Pairs:****F(+(***x*,*y*),*z*) -> F(*y*,*z*)**F(+(***x*,*y*),*z*) -> F(*x*,*z*)**Rules:**

+(a, b) -> +(b, a)

+(a, +(b,*z*)) -> +(b, +(a,*z*))

+(+(*x*,*y*),*z*) -> +(*x*, +(*y*,*z*))

f(a,*y*) -> a

f(b,*y*) -> b

f(+(*x*,*y*),*z*) -> +(f(*x*,*z*), f(*y*,*z*))

R

↳DPs

→DP Problem 1

↳AFS

→DP Problem 2

↳Remaining Obligation(s)

→DP Problem 3

↳Remaining Obligation(s)

The following remains to be proven:

**Dependency Pairs:****+'(+(***x*,*y*),*z*) -> +'(*y*,*z*)**+'(+(***x*,*y*),*z*) -> +'(*x*, +(*y*,*z*))**Rules:**

+(a, b) -> +(b, a)

+(a, +(b,*z*)) -> +(b, +(a,*z*))

+(+(*x*,*y*),*z*) -> +(*x*, +(*y*,*z*))

f(a,*y*) -> a

f(b,*y*) -> b

f(+(*x*,*y*),*z*) -> +(f(*x*,*z*), f(*y*,*z*))**Dependency Pairs:****F(+(***x*,*y*),*z*) -> F(*y*,*z*)**F(+(***x*,*y*),*z*) -> F(*x*,*z*)**Rules:**

+(a, b) -> +(b, a)

+(a, +(b,*z*)) -> +(b, +(a,*z*))

+(+(*x*,*y*),*z*) -> +(*x*, +(*y*,*z*))

f(a,*y*) -> a

f(b,*y*) -> b

f(+(*x*,*y*),*z*) -> +(f(*x*,*z*), f(*y*,*z*))

Duration:

0:00 minutes