Tool LMPO
stdout:
MAYBE
We consider the following Problem:
Strict Trs:
{ rev(nil()) -> nil()
, rev(cons(x, l)) -> cons(rev1(x, l), rev2(x, l))
, rev1(0(), nil()) -> 0()
, rev1(s(x), nil()) -> s(x)
, rev1(x, cons(y, l)) -> rev1(y, l)
, rev2(x, nil()) -> nil()
, rev2(x, cons(y, l)) -> rev(cons(x, rev2(y, l)))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
Tool MPO
stdout:
MAYBE
We consider the following Problem:
Strict Trs:
{ rev(nil()) -> nil()
, rev(cons(x, l)) -> cons(rev1(x, l), rev2(x, l))
, rev1(0(), nil()) -> 0()
, rev1(s(x), nil()) -> s(x)
, rev1(x, cons(y, l)) -> rev1(y, l)
, rev2(x, nil()) -> nil()
, rev2(x, cons(y, l)) -> rev(cons(x, rev2(y, l)))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
Tool POP*
stdout:
MAYBE
We consider the following Problem:
Strict Trs:
{ rev(nil()) -> nil()
, rev(cons(x, l)) -> cons(rev1(x, l), rev2(x, l))
, rev1(0(), nil()) -> 0()
, rev1(s(x), nil()) -> s(x)
, rev1(x, cons(y, l)) -> rev1(y, l)
, rev2(x, nil()) -> nil()
, rev2(x, cons(y, l)) -> rev(cons(x, rev2(y, l)))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
Tool POP* (PS)
stdout:
MAYBE
We consider the following Problem:
Strict Trs:
{ rev(nil()) -> nil()
, rev(cons(x, l)) -> cons(rev1(x, l), rev2(x, l))
, rev1(0(), nil()) -> 0()
, rev1(s(x), nil()) -> s(x)
, rev1(x, cons(y, l)) -> rev1(y, l)
, rev2(x, nil()) -> nil()
, rev2(x, cons(y, l)) -> rev(cons(x, rev2(y, l)))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
Tool Small POP*
stdout:
MAYBE
We consider the following Problem:
Strict Trs:
{ rev(nil()) -> nil()
, rev(cons(x, l)) -> cons(rev1(x, l), rev2(x, l))
, rev1(0(), nil()) -> 0()
, rev1(s(x), nil()) -> s(x)
, rev1(x, cons(y, l)) -> rev1(y, l)
, rev2(x, nil()) -> nil()
, rev2(x, cons(y, l)) -> rev(cons(x, rev2(y, l)))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
Tool Small POP* (PS)
stdout:
MAYBE
We consider the following Problem:
Strict Trs:
{ rev(nil()) -> nil()
, rev(cons(x, l)) -> cons(rev1(x, l), rev2(x, l))
, rev1(0(), nil()) -> 0()
, rev1(s(x), nil()) -> s(x)
, rev1(x, cons(y, l)) -> rev1(y, l)
, rev2(x, nil()) -> nil()
, rev2(x, cons(y, l)) -> rev(cons(x, rev2(y, l)))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..