Tool LMPO
stdout:
MAYBE
We consider the following Problem:
Strict Trs:
{ rev(nil()) -> nil()
, rev(++(x, y)) -> ++(rev1(x, y), rev2(x, y))
, rev1(x, nil()) -> x
, rev1(x, ++(y, z)) -> rev1(y, z)
, rev2(x, nil()) -> nil()
, rev2(x, ++(y, z)) -> rev(++(x, rev(rev2(y, z))))}
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(++(x, y)) -> ++(rev1(x, y), rev2(x, y))
, rev1(x, nil()) -> x
, rev1(x, ++(y, z)) -> rev1(y, z)
, rev2(x, nil()) -> nil()
, rev2(x, ++(y, z)) -> rev(++(x, rev(rev2(y, z))))}
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(++(x, y)) -> ++(rev1(x, y), rev2(x, y))
, rev1(x, nil()) -> x
, rev1(x, ++(y, z)) -> rev1(y, z)
, rev2(x, nil()) -> nil()
, rev2(x, ++(y, z)) -> rev(++(x, rev(rev2(y, z))))}
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(++(x, y)) -> ++(rev1(x, y), rev2(x, y))
, rev1(x, nil()) -> x
, rev1(x, ++(y, z)) -> rev1(y, z)
, rev2(x, nil()) -> nil()
, rev2(x, ++(y, z)) -> rev(++(x, rev(rev2(y, z))))}
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(++(x, y)) -> ++(rev1(x, y), rev2(x, y))
, rev1(x, nil()) -> x
, rev1(x, ++(y, z)) -> rev1(y, z)
, rev2(x, nil()) -> nil()
, rev2(x, ++(y, z)) -> rev(++(x, rev(rev2(y, z))))}
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(++(x, y)) -> ++(rev1(x, y), rev2(x, y))
, rev1(x, nil()) -> x
, rev1(x, ++(y, z)) -> rev1(y, z)
, rev2(x, nil()) -> nil()
, rev2(x, ++(y, z)) -> rev(++(x, rev(rev2(y, z))))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..