LMPO
MAYBE
We consider the following Problem:
Strict Trs:
{ app(nil(), xs) -> nil()
, app(cons(x, xs), ys) -> cons(x, app(xs, ys))
, rev(nil()) -> nil()
, rev(cons(x, xs)) -> append(xs, rev(cons(x, nil())))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
MPO
MAYBE
We consider the following Problem:
Strict Trs:
{ app(nil(), xs) -> nil()
, app(cons(x, xs), ys) -> cons(x, app(xs, ys))
, rev(nil()) -> nil()
, rev(cons(x, xs)) -> append(xs, rev(cons(x, nil())))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
POP*
MAYBE
We consider the following Problem:
Strict Trs:
{ app(nil(), xs) -> nil()
, app(cons(x, xs), ys) -> cons(x, app(xs, ys))
, rev(nil()) -> nil()
, rev(cons(x, xs)) -> append(xs, rev(cons(x, nil())))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
POP* (PS)
MAYBE
We consider the following Problem:
Strict Trs:
{ app(nil(), xs) -> nil()
, app(cons(x, xs), ys) -> cons(x, app(xs, ys))
, rev(nil()) -> nil()
, rev(cons(x, xs)) -> append(xs, rev(cons(x, nil())))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
Small POP*
MAYBE
We consider the following Problem:
Strict Trs:
{ app(nil(), xs) -> nil()
, app(cons(x, xs), ys) -> cons(x, app(xs, ys))
, rev(nil()) -> nil()
, rev(cons(x, xs)) -> append(xs, rev(cons(x, nil())))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
Small POP* (PS)
MAYBE
We consider the following Problem:
Strict Trs:
{ app(nil(), xs) -> nil()
, app(cons(x, xs), ys) -> cons(x, app(xs, ys))
, rev(nil()) -> nil()
, rev(cons(x, xs)) -> append(xs, rev(cons(x, nil())))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..