Tool LMPO
stdout:
MAYBE
We consider the following Problem:
Strict Trs:
{ half(0()) -> 0()
, half(s(0())) -> 0()
, half(s(s(x))) -> s(half(x))
, lastbit(0()) -> 0()
, lastbit(s(0())) -> s(0())
, lastbit(s(s(x))) -> lastbit(x)
, conv(0()) -> cons(nil(), 0())
, conv(s(x)) -> cons(conv(half(s(x))), lastbit(s(x)))}
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:
{ half(0()) -> 0()
, half(s(0())) -> 0()
, half(s(s(x))) -> s(half(x))
, lastbit(0()) -> 0()
, lastbit(s(0())) -> s(0())
, lastbit(s(s(x))) -> lastbit(x)
, conv(0()) -> cons(nil(), 0())
, conv(s(x)) -> cons(conv(half(s(x))), lastbit(s(x)))}
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:
{ half(0()) -> 0()
, half(s(0())) -> 0()
, half(s(s(x))) -> s(half(x))
, lastbit(0()) -> 0()
, lastbit(s(0())) -> s(0())
, lastbit(s(s(x))) -> lastbit(x)
, conv(0()) -> cons(nil(), 0())
, conv(s(x)) -> cons(conv(half(s(x))), lastbit(s(x)))}
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:
{ half(0()) -> 0()
, half(s(0())) -> 0()
, half(s(s(x))) -> s(half(x))
, lastbit(0()) -> 0()
, lastbit(s(0())) -> s(0())
, lastbit(s(s(x))) -> lastbit(x)
, conv(0()) -> cons(nil(), 0())
, conv(s(x)) -> cons(conv(half(s(x))), lastbit(s(x)))}
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:
{ half(0()) -> 0()
, half(s(0())) -> 0()
, half(s(s(x))) -> s(half(x))
, lastbit(0()) -> 0()
, lastbit(s(0())) -> s(0())
, lastbit(s(s(x))) -> lastbit(x)
, conv(0()) -> cons(nil(), 0())
, conv(s(x)) -> cons(conv(half(s(x))), lastbit(s(x)))}
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:
{ half(0()) -> 0()
, half(s(0())) -> 0()
, half(s(s(x))) -> s(half(x))
, lastbit(0()) -> 0()
, lastbit(s(0())) -> s(0())
, lastbit(s(s(x))) -> lastbit(x)
, conv(0()) -> cons(nil(), 0())
, conv(s(x)) -> cons(conv(half(s(x))), lastbit(s(x)))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..