(0) Obligation:

Q restricted rewrite system:
The TRS R consists of the following rules:

app(app(map, f), nil) → nil
app(app(map, f), app(app(cons, x), xs)) → app(app(cons, app(f, x)), app(app(map, f), xs))
app(sum, app(app(cons, x), xs)) → app(app(plus, x), app(sum, xs))
app(size, app(app(node, x), xs)) → app(s, app(sum, app(app(map, size), xs)))
app(app(plus, 0), x) → 0
app(app(plus, app(s, x)), y) → app(s, app(app(plus, x), y))

Q is empty.

(1) DependencyPairsProof (EQUIVALENT transformation)

Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem.

(2) Obligation:

Q DP problem:
The TRS P consists of the following rules:

APP(app(map, f), app(app(cons, x), xs)) → APP(app(cons, app(f, x)), app(app(map, f), xs))
APP(app(map, f), app(app(cons, x), xs)) → APP(cons, app(f, x))
APP(app(map, f), app(app(cons, x), xs)) → APP(f, x)
APP(app(map, f), app(app(cons, x), xs)) → APP(app(map, f), xs)
APP(sum, app(app(cons, x), xs)) → APP(app(plus, x), app(sum, xs))
APP(sum, app(app(cons, x), xs)) → APP(plus, x)
APP(sum, app(app(cons, x), xs)) → APP(sum, xs)
APP(size, app(app(node, x), xs)) → APP(s, app(sum, app(app(map, size), xs)))
APP(size, app(app(node, x), xs)) → APP(sum, app(app(map, size), xs))
APP(size, app(app(node, x), xs)) → APP(app(map, size), xs)
APP(size, app(app(node, x), xs)) → APP(map, size)
APP(app(plus, app(s, x)), y) → APP(s, app(app(plus, x), y))
APP(app(plus, app(s, x)), y) → APP(app(plus, x), y)
APP(app(plus, app(s, x)), y) → APP(plus, x)

The TRS R consists of the following rules:

app(app(map, f), nil) → nil
app(app(map, f), app(app(cons, x), xs)) → app(app(cons, app(f, x)), app(app(map, f), xs))
app(sum, app(app(cons, x), xs)) → app(app(plus, x), app(sum, xs))
app(size, app(app(node, x), xs)) → app(s, app(sum, app(app(map, size), xs)))
app(app(plus, 0), x) → 0
app(app(plus, app(s, x)), y) → app(s, app(app(plus, x), y))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(3) DependencyGraphProof (EQUIVALENT transformation)

The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 3 SCCs with 9 less nodes.

(4) Complex Obligation (AND)

(5) Obligation:

Q DP problem:
The TRS P consists of the following rules:

APP(app(plus, app(s, x)), y) → APP(app(plus, x), y)

The TRS R consists of the following rules:

app(app(map, f), nil) → nil
app(app(map, f), app(app(cons, x), xs)) → app(app(cons, app(f, x)), app(app(map, f), xs))
app(sum, app(app(cons, x), xs)) → app(app(plus, x), app(sum, xs))
app(size, app(app(node, x), xs)) → app(s, app(sum, app(app(map, size), xs)))
app(app(plus, 0), x) → 0
app(app(plus, app(s, x)), y) → app(s, app(app(plus, x), y))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(6) QDPSizeChangeProof (EQUIVALENT transformation)

We used the following order and afs together with the size-change analysis [AAECC05] to show that there are no infinite chains for this DP problem.

Order:Homeomorphic Embedding Order

AFS:
plus  =  plus
s  =  s
app(x1, x2)  =  app(x2)

From the DPs we obtained the following set of size-change graphs:

  • APP(app(plus, app(s, x)), y) → APP(app(plus, x), y) (allowed arguments on rhs = {1, 2})
    The graph contains the following edges 1 > 1, 2 >= 2

We oriented the following set of usable rules [AAECC05,FROCOS05]. none

(7) TRUE

(8) Obligation:

Q DP problem:
The TRS P consists of the following rules:

APP(sum, app(app(cons, x), xs)) → APP(sum, xs)

The TRS R consists of the following rules:

app(app(map, f), nil) → nil
app(app(map, f), app(app(cons, x), xs)) → app(app(cons, app(f, x)), app(app(map, f), xs))
app(sum, app(app(cons, x), xs)) → app(app(plus, x), app(sum, xs))
app(size, app(app(node, x), xs)) → app(s, app(sum, app(app(map, size), xs)))
app(app(plus, 0), x) → 0
app(app(plus, app(s, x)), y) → app(s, app(app(plus, x), y))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(9) QDPSizeChangeProof (EQUIVALENT transformation)

We used the following order and afs together with the size-change analysis [AAECC05] to show that there are no infinite chains for this DP problem.

Order:Homeomorphic Embedding Order

AFS:
sum  =  sum
cons  =  cons
app(x1, x2)  =  app(x2)

From the DPs we obtained the following set of size-change graphs:

  • APP(sum, app(app(cons, x), xs)) → APP(sum, xs) (allowed arguments on rhs = {1, 2})
    The graph contains the following edges 1 >= 1, 2 > 2

We oriented the following set of usable rules [AAECC05,FROCOS05]. none

(10) TRUE

(11) Obligation:

Q DP problem:
The TRS P consists of the following rules:

APP(app(map, f), app(app(cons, x), xs)) → APP(app(map, f), xs)
APP(app(map, f), app(app(cons, x), xs)) → APP(f, x)
APP(size, app(app(node, x), xs)) → APP(app(map, size), xs)

The TRS R consists of the following rules:

app(app(map, f), nil) → nil
app(app(map, f), app(app(cons, x), xs)) → app(app(cons, app(f, x)), app(app(map, f), xs))
app(sum, app(app(cons, x), xs)) → app(app(plus, x), app(sum, xs))
app(size, app(app(node, x), xs)) → app(s, app(sum, app(app(map, size), xs)))
app(app(plus, 0), x) → 0
app(app(plus, app(s, x)), y) → app(s, app(app(plus, x), y))

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(12) QDPSizeChangeProof (EQUIVALENT transformation)

We used the following order and afs together with the size-change analysis [AAECC05] to show that there are no infinite chains for this DP problem.

Order:Homeomorphic Embedding Order

AFS:
map  =  map
cons  =  cons
size  =  size
node  =  node
app(x1, x2)  =  app(x1, x2)

From the DPs we obtained the following set of size-change graphs:

  • APP(size, app(app(node, x), xs)) → APP(app(map, size), xs) (allowed arguments on rhs = {1, 2})
    The graph contains the following edges 2 > 2

  • APP(app(map, f), app(app(cons, x), xs)) → APP(f, x) (allowed arguments on rhs = {1, 2})
    The graph contains the following edges 1 > 1, 2 > 2

  • APP(app(map, f), app(app(cons, x), xs)) → APP(app(map, f), xs) (allowed arguments on rhs = {1, 2})
    The graph contains the following edges 1 >= 1, 2 > 2

We oriented the following set of usable rules [AAECC05,FROCOS05]. none

(13) TRUE