Termination w.r.t. Q of the given QTRS could be proven:

0 QTRS
↳1 DependencyPairsProof (⇔)
↳2 QDP
↳3 DependencyGraphProof (⇔)
↳4 AND
    ↳5 QDP
        ↳6 QDPOrderProof (⇔)
        ↳7 QDP
        ↳8 PisEmptyProof (⇔)
        ↳9 TRUE
    ↳10 QDP
        ↳11 QDPOrderProof (⇔)
        ↳12 QDP
        ↳13 QDPOrderProof (⇔)
        ↳14 QDP
        ↳15 PisEmptyProof (⇔)
        ↳16 TRUE

(0) Obligation:

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

app(app(append, nil), ys) → ys
app(app(append, app(app(cons, x), xs)), ys) → app(app(cons, x), app(app(append, xs), ys))
app(app(flatwith, f), app(leaf, x)) → app(app(cons, app(f, x)), nil)
app(app(flatwith, f), app(node, xs)) → app(app(flatwithsub, f), xs)
app(app(flatwithsub, f), nil) → nil
app(app(flatwithsub, f), app(app(cons, x), xs)) → app(app(append, app(app(flatwith, f), x)), app(app(flatwithsub, f), xs))

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(append, app(app(cons, x), xs)), ys) → APP(app(cons, x), app(app(append, xs), ys))
APP(app(append, app(app(cons, x), xs)), ys) → APP(app(append, xs), ys)
APP(app(append, app(app(cons, x), xs)), ys) → APP(append, xs)
APP(app(flatwith, f), app(leaf, x)) → APP(app(cons, app(f, x)), nil)
APP(app(flatwith, f), app(leaf, x)) → APP(cons, app(f, x))
APP(app(flatwith, f), app(leaf, x)) → APP(f, x)
APP(app(flatwith, f), app(node, xs)) → APP(app(flatwithsub, f), xs)
APP(app(flatwith, f), app(node, xs)) → APP(flatwithsub, f)
APP(app(flatwithsub, f), app(app(cons, x), xs)) → APP(app(append, app(app(flatwith, f), x)), app(app(flatwithsub, f), xs))
APP(app(flatwithsub, f), app(app(cons, x), xs)) → APP(append, app(app(flatwith, f), x))
APP(app(flatwithsub, f), app(app(cons, x), xs)) → APP(app(flatwith, f), x)
APP(app(flatwithsub, f), app(app(cons, x), xs)) → APP(flatwith, f)
APP(app(flatwithsub, f), app(app(cons, x), xs)) → APP(app(flatwithsub, f), xs)

The TRS R consists of the following rules:

app(app(append, nil), ys) → ys
app(app(append, app(app(cons, x), xs)), ys) → app(app(cons, x), app(app(append, xs), ys))
app(app(flatwith, f), app(leaf, x)) → app(app(cons, app(f, x)), nil)
app(app(flatwith, f), app(node, xs)) → app(app(flatwithsub, f), xs)
app(app(flatwithsub, f), nil) → nil
app(app(flatwithsub, f), app(app(cons, x), xs)) → app(app(append, app(app(flatwith, f), x)), app(app(flatwithsub, f), xs))

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 2 SCCs with 8 less nodes.

(4) Complex Obligation (AND)

(5) Obligation:

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

APP(app(append, app(app(cons, x), xs)), ys) → APP(app(append, xs), ys)

The TRS R consists of the following rules:

app(app(append, nil), ys) → ys
app(app(append, app(app(cons, x), xs)), ys) → app(app(cons, x), app(app(append, xs), ys))
app(app(flatwith, f), app(leaf, x)) → app(app(cons, app(f, x)), nil)
app(app(flatwith, f), app(node, xs)) → app(app(flatwithsub, f), xs)
app(app(flatwithsub, f), nil) → nil
app(app(flatwithsub, f), app(app(cons, x), xs)) → app(app(append, app(app(flatwith, f), x)), app(app(flatwithsub, f), xs))

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

(6) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].


The following pairs can be oriented strictly and are deleted.


APP(app(append, app(app(cons, x), xs)), ys) → APP(app(append, xs), ys)
The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
APP(x1, x2)  =  APP(x1)

Tags:
APP has tags [1,1]

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Recursive path order with status [RPO].
Quasi-Precedence:
app2 > append

Status:
app2: multiset
append: multiset
cons: multiset


The following usable rules [FROCOS05] were oriented: none

(7) Obligation:

Q DP problem:
P is empty.
The TRS R consists of the following rules:

app(app(append, nil), ys) → ys
app(app(append, app(app(cons, x), xs)), ys) → app(app(cons, x), app(app(append, xs), ys))
app(app(flatwith, f), app(leaf, x)) → app(app(cons, app(f, x)), nil)
app(app(flatwith, f), app(node, xs)) → app(app(flatwithsub, f), xs)
app(app(flatwithsub, f), nil) → nil
app(app(flatwithsub, f), app(app(cons, x), xs)) → app(app(append, app(app(flatwith, f), x)), app(app(flatwithsub, f), xs))

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

(8) PisEmptyProof (EQUIVALENT transformation)

The TRS P is empty. Hence, there is no (P,Q,R) chain.

(9) TRUE

(10) Obligation:

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

APP(app(flatwith, f), app(node, xs)) → APP(app(flatwithsub, f), xs)
APP(app(flatwithsub, f), app(app(cons, x), xs)) → APP(app(flatwith, f), x)
APP(app(flatwith, f), app(leaf, x)) → APP(f, x)
APP(app(flatwithsub, f), app(app(cons, x), xs)) → APP(app(flatwithsub, f), xs)

The TRS R consists of the following rules:

app(app(append, nil), ys) → ys
app(app(append, app(app(cons, x), xs)), ys) → app(app(cons, x), app(app(append, xs), ys))
app(app(flatwith, f), app(leaf, x)) → app(app(cons, app(f, x)), nil)
app(app(flatwith, f), app(node, xs)) → app(app(flatwithsub, f), xs)
app(app(flatwithsub, f), nil) → nil
app(app(flatwithsub, f), app(app(cons, x), xs)) → app(app(append, app(app(flatwith, f), x)), app(app(flatwithsub, f), xs))

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

(11) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].


The following pairs can be oriented strictly and are deleted.


APP(app(flatwith, f), app(leaf, x)) → APP(f, x)
The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
APP(x1, x2)  =  APP(x1)

Tags:
APP has tags [1,0]

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Recursive path order with status [RPO].
Quasi-Precedence:
[flatwith, flatwithsub, cons] > [app2, node]

Status:
app2: multiset
flatwith: multiset
node: multiset
flatwithsub: multiset
cons: multiset
leaf: multiset


The following usable rules [FROCOS05] were oriented: none

(12) Obligation:

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

APP(app(flatwith, f), app(node, xs)) → APP(app(flatwithsub, f), xs)
APP(app(flatwithsub, f), app(app(cons, x), xs)) → APP(app(flatwith, f), x)
APP(app(flatwithsub, f), app(app(cons, x), xs)) → APP(app(flatwithsub, f), xs)

The TRS R consists of the following rules:

app(app(append, nil), ys) → ys
app(app(append, app(app(cons, x), xs)), ys) → app(app(cons, x), app(app(append, xs), ys))
app(app(flatwith, f), app(leaf, x)) → app(app(cons, app(f, x)), nil)
app(app(flatwith, f), app(node, xs)) → app(app(flatwithsub, f), xs)
app(app(flatwithsub, f), nil) → nil
app(app(flatwithsub, f), app(app(cons, x), xs)) → app(app(append, app(app(flatwith, f), x)), app(app(flatwithsub, f), xs))

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

(13) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].


The following pairs can be oriented strictly and are deleted.


APP(app(flatwith, f), app(node, xs)) → APP(app(flatwithsub, f), xs)
APP(app(flatwithsub, f), app(app(cons, x), xs)) → APP(app(flatwith, f), x)
APP(app(flatwithsub, f), app(app(cons, x), xs)) → APP(app(flatwithsub, f), xs)
The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
APP(x1, x2)  =  APP(x2)

Tags:
APP has tags [1,1]

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Recursive path order with status [RPO].
Quasi-Precedence:
flatwith > [app2, cons] > [node, flatwithsub]

Status:
app2: multiset
flatwith: multiset
node: multiset
flatwithsub: multiset
cons: multiset


The following usable rules [FROCOS05] were oriented: none

(14) Obligation:

Q DP problem:
P is empty.
The TRS R consists of the following rules:

app(app(append, nil), ys) → ys
app(app(append, app(app(cons, x), xs)), ys) → app(app(cons, x), app(app(append, xs), ys))
app(app(flatwith, f), app(leaf, x)) → app(app(cons, app(f, x)), nil)
app(app(flatwith, f), app(node, xs)) → app(app(flatwithsub, f), xs)
app(app(flatwithsub, f), nil) → nil
app(app(flatwithsub, f), app(app(cons, x), xs)) → app(app(append, app(app(flatwith, f), x)), app(app(flatwithsub, f), xs))

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

(15) PisEmptyProof (EQUIVALENT transformation)

The TRS P is empty. Hence, there is no (P,Q,R) chain.

(16) TRUE