LMPO
| Execution Time (secs) | 0.059 |
| Answer | MAYBE |
| Input | AG01 3.42 |
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..
MPO
| Execution Time (secs) | 0.042 |
| Answer | MAYBE |
| Input | AG01 3.42 |
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..
POP*
| Execution Time (secs) | 0.030 |
| Answer | MAYBE |
| Input | AG01 3.42 |
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..
POP* (PS)
| Execution Time (secs) | 0.040 |
| Answer | MAYBE |
| Input | AG01 3.42 |
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..
Small POP*
| Execution Time (secs) | 0.036 |
| Answer | MAYBE |
| Input | AG01 3.42 |
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..
Small POP* (PS)
| Execution Time (secs) | 0.036 |
| Answer | MAYBE |
| Input | AG01 3.42 |
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..