app(app(app(compose, f), g), x) → app(g, app(f, x))
app(reverse, l) → app(app(reverse2, l), nil)
app(app(reverse2, nil), l) → l
app(app(reverse2, app(app(cons, x), xs)), l) → app(app(reverse2, xs), app(app(cons, x), l))
app(hd, app(app(cons, x), xs)) → x
app(tl, app(app(cons, x), xs)) → xs
last → app(app(compose, hd), reverse)
init → app(app(compose, reverse), app(app(compose, tl), reverse))
↳ QTRS
↳ DependencyPairsProof
app(app(app(compose, f), g), x) → app(g, app(f, x))
app(reverse, l) → app(app(reverse2, l), nil)
app(app(reverse2, nil), l) → l
app(app(reverse2, app(app(cons, x), xs)), l) → app(app(reverse2, xs), app(app(cons, x), l))
app(hd, app(app(cons, x), xs)) → x
app(tl, app(app(cons, x), xs)) → xs
last → app(app(compose, hd), reverse)
init → app(app(compose, reverse), app(app(compose, tl), reverse))
APP(app(reverse2, app(app(cons, x), xs)), l) → APP(reverse2, xs)
APP(reverse, l) → APP(reverse2, l)
APP(app(reverse2, app(app(cons, x), xs)), l) → APP(app(cons, x), l)
LAST → APP(compose, hd)
APP(reverse, l) → APP(app(reverse2, l), nil)
APP(app(reverse2, app(app(cons, x), xs)), l) → APP(app(reverse2, xs), app(app(cons, x), l))
INIT → APP(compose, reverse)
APP(app(app(compose, f), g), x) → APP(g, app(f, x))
INIT → APP(app(compose, tl), reverse)
INIT → APP(compose, tl)
APP(app(app(compose, f), g), x) → APP(f, x)
INIT → APP(app(compose, reverse), app(app(compose, tl), reverse))
LAST → APP(app(compose, hd), reverse)
app(app(app(compose, f), g), x) → app(g, app(f, x))
app(reverse, l) → app(app(reverse2, l), nil)
app(app(reverse2, nil), l) → l
app(app(reverse2, app(app(cons, x), xs)), l) → app(app(reverse2, xs), app(app(cons, x), l))
app(hd, app(app(cons, x), xs)) → x
app(tl, app(app(cons, x), xs)) → xs
last → app(app(compose, hd), reverse)
init → app(app(compose, reverse), app(app(compose, tl), reverse))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
APP(app(reverse2, app(app(cons, x), xs)), l) → APP(reverse2, xs)
APP(reverse, l) → APP(reverse2, l)
APP(app(reverse2, app(app(cons, x), xs)), l) → APP(app(cons, x), l)
LAST → APP(compose, hd)
APP(reverse, l) → APP(app(reverse2, l), nil)
APP(app(reverse2, app(app(cons, x), xs)), l) → APP(app(reverse2, xs), app(app(cons, x), l))
INIT → APP(compose, reverse)
APP(app(app(compose, f), g), x) → APP(g, app(f, x))
INIT → APP(app(compose, tl), reverse)
INIT → APP(compose, tl)
APP(app(app(compose, f), g), x) → APP(f, x)
INIT → APP(app(compose, reverse), app(app(compose, tl), reverse))
LAST → APP(app(compose, hd), reverse)
app(app(app(compose, f), g), x) → app(g, app(f, x))
app(reverse, l) → app(app(reverse2, l), nil)
app(app(reverse2, nil), l) → l
app(app(reverse2, app(app(cons, x), xs)), l) → app(app(reverse2, xs), app(app(cons, x), l))
app(hd, app(app(cons, x), xs)) → x
app(tl, app(app(cons, x), xs)) → xs
last → app(app(compose, hd), reverse)
init → app(app(compose, reverse), app(app(compose, tl), reverse))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDPOrderProof
↳ QDP
APP(app(reverse2, app(app(cons, x), xs)), l) → APP(app(reverse2, xs), app(app(cons, x), l))
app(app(app(compose, f), g), x) → app(g, app(f, x))
app(reverse, l) → app(app(reverse2, l), nil)
app(app(reverse2, nil), l) → l
app(app(reverse2, app(app(cons, x), xs)), l) → app(app(reverse2, xs), app(app(cons, x), l))
app(hd, app(app(cons, x), xs)) → x
app(tl, app(app(cons, x), xs)) → xs
last → app(app(compose, hd), reverse)
init → app(app(compose, reverse), app(app(compose, tl), reverse))
The following pairs can be oriented strictly and are deleted.
The remaining pairs can at least be oriented weakly.
APP(app(reverse2, app(app(cons, x), xs)), l) → APP(app(reverse2, xs), app(app(cons, x), l))
The value of delta used in the strict ordering is 4.
POL(APP(x1, x2)) = (2)x_1
POL(reverse2) = 0
POL(cons) = 0
POL(app(x1, x2)) = 1 + x_1 + x_2
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ PisEmptyProof
↳ QDP
app(app(app(compose, f), g), x) → app(g, app(f, x))
app(reverse, l) → app(app(reverse2, l), nil)
app(app(reverse2, nil), l) → l
app(app(reverse2, app(app(cons, x), xs)), l) → app(app(reverse2, xs), app(app(cons, x), l))
app(hd, app(app(cons, x), xs)) → x
app(tl, app(app(cons, x), xs)) → xs
last → app(app(compose, hd), reverse)
init → app(app(compose, reverse), app(app(compose, tl), reverse))
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDPOrderProof
APP(app(app(compose, f), g), x) → APP(g, app(f, x))
APP(app(app(compose, f), g), x) → APP(f, x)
app(app(app(compose, f), g), x) → app(g, app(f, x))
app(reverse, l) → app(app(reverse2, l), nil)
app(app(reverse2, nil), l) → l
app(app(reverse2, app(app(cons, x), xs)), l) → app(app(reverse2, xs), app(app(cons, x), l))
app(hd, app(app(cons, x), xs)) → x
app(tl, app(app(cons, x), xs)) → xs
last → app(app(compose, hd), reverse)
init → app(app(compose, reverse), app(app(compose, tl), reverse))
The following pairs can be oriented strictly and are deleted.
The remaining pairs can at least be oriented weakly.
APP(app(app(compose, f), g), x) → APP(g, app(f, x))
APP(app(app(compose, f), g), x) → APP(f, x)
The value of delta used in the strict ordering is 24.
POL(APP(x1, x2)) = (3)x_1
POL(reverse2) = 3
POL(cons) = 1
POL(tl) = 0
POL(reverse) = 2
POL(compose) = 4
POL(app(x1, x2)) = 2 + x_1 + (2)x_2
POL(nil) = 3
POL(hd) = 0
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ AND
↳ QDP
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ PisEmptyProof
app(app(app(compose, f), g), x) → app(g, app(f, x))
app(reverse, l) → app(app(reverse2, l), nil)
app(app(reverse2, nil), l) → l
app(app(reverse2, app(app(cons, x), xs)), l) → app(app(reverse2, xs), app(app(cons, x), l))
app(hd, app(app(cons, x), xs)) → x
app(tl, app(app(cons, x), xs)) → xs
last → app(app(compose, hd), reverse)
init → app(app(compose, reverse), app(app(compose, tl), reverse))