LMPO
MAYBE
We consider the following Problem:
Strict Trs:
{ rev1(0(), nil()) -> 0()
, rev1(s(X), nil()) -> s(X)
, rev1(X, cons(Y, L)) -> rev1(Y, L)
, rev(nil()) -> nil()
, rev(cons(X, L)) -> cons(rev1(X, L), rev2(X, L))
, rev2(X, nil()) -> nil()
, rev2(X, cons(Y, L)) -> rev(cons(X, rev(rev2(Y, L))))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
MPO
MAYBE
We consider the following Problem:
Strict Trs:
{ rev1(0(), nil()) -> 0()
, rev1(s(X), nil()) -> s(X)
, rev1(X, cons(Y, L)) -> rev1(Y, L)
, rev(nil()) -> nil()
, rev(cons(X, L)) -> cons(rev1(X, L), rev2(X, L))
, rev2(X, nil()) -> nil()
, rev2(X, cons(Y, L)) -> rev(cons(X, rev(rev2(Y, L))))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
POP*
MAYBE
We consider the following Problem:
Strict Trs:
{ rev1(0(), nil()) -> 0()
, rev1(s(X), nil()) -> s(X)
, rev1(X, cons(Y, L)) -> rev1(Y, L)
, rev(nil()) -> nil()
, rev(cons(X, L)) -> cons(rev1(X, L), rev2(X, L))
, rev2(X, nil()) -> nil()
, rev2(X, cons(Y, L)) -> rev(cons(X, rev(rev2(Y, L))))}
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:
{ rev1(0(), nil()) -> 0()
, rev1(s(X), nil()) -> s(X)
, rev1(X, cons(Y, L)) -> rev1(Y, L)
, rev(nil()) -> nil()
, rev(cons(X, L)) -> cons(rev1(X, L), rev2(X, L))
, rev2(X, nil()) -> nil()
, rev2(X, cons(Y, L)) -> rev(cons(X, rev(rev2(Y, L))))}
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:
{ rev1(0(), nil()) -> 0()
, rev1(s(X), nil()) -> s(X)
, rev1(X, cons(Y, L)) -> rev1(Y, L)
, rev(nil()) -> nil()
, rev(cons(X, L)) -> cons(rev1(X, L), rev2(X, L))
, rev2(X, nil()) -> nil()
, rev2(X, cons(Y, L)) -> rev(cons(X, rev(rev2(Y, L))))}
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:
{ rev1(0(), nil()) -> 0()
, rev1(s(X), nil()) -> s(X)
, rev1(X, cons(Y, L)) -> rev1(Y, L)
, rev(nil()) -> nil()
, rev(cons(X, L)) -> cons(rev1(X, L), rev2(X, L))
, rev2(X, nil()) -> nil()
, rev2(X, cons(Y, L)) -> rev(cons(X, rev(rev2(Y, L))))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..