rev1(a) -> a
rev1(b) -> b
rev1(++2(x, y)) -> ++2(rev1(y), rev1(x))
rev1(++2(x, x)) -> rev1(x)
↳ QTRS
↳ DependencyPairsProof
rev1(a) -> a
rev1(b) -> b
rev1(++2(x, y)) -> ++2(rev1(y), rev1(x))
rev1(++2(x, x)) -> rev1(x)
REV1(++2(x, y)) -> REV1(x)
REV1(++2(x, y)) -> REV1(y)
REV1(++2(x, x)) -> REV1(x)
rev1(a) -> a
rev1(b) -> b
rev1(++2(x, y)) -> ++2(rev1(y), rev1(x))
rev1(++2(x, x)) -> rev1(x)
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ QDPOrderProof
REV1(++2(x, y)) -> REV1(x)
REV1(++2(x, y)) -> REV1(y)
REV1(++2(x, x)) -> REV1(x)
rev1(a) -> a
rev1(b) -> b
rev1(++2(x, y)) -> ++2(rev1(y), rev1(x))
rev1(++2(x, x)) -> rev1(x)
The following pairs can be oriented strictly and are deleted.
The remaining pairs can at least be oriented weakly.
REV1(++2(x, y)) -> REV1(x)
REV1(++2(x, y)) -> REV1(y)
REV1(++2(x, x)) -> REV1(x)
POL(++2(x1, x2)) = 1 + x1 + x2
POL(REV1(x1)) = x12
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ PisEmptyProof
rev1(a) -> a
rev1(b) -> b
rev1(++2(x, y)) -> ++2(rev1(y), rev1(x))
rev1(++2(x, x)) -> rev1(x)