LMPO
| Execution Time (secs) | 0.073 |
| Answer | MAYBE |
| Input | AG01 3.8b |
MAYBE
We consider the following Problem:
Strict Trs:
{ le(0(), y) -> true()
, le(s(x), 0()) -> false()
, le(s(x), s(y)) -> le(x, y)
, minus(0(), y) -> 0()
, minus(s(x), y) -> if_minus(le(s(x), y), s(x), y)
, if_minus(true(), s(x), y) -> 0()
, if_minus(false(), s(x), y) -> s(minus(x, y))
, quot(0(), s(y)) -> 0()
, quot(s(x), s(y)) -> s(quot(minus(x, y), s(y)))
, log(s(0())) -> 0()
, log(s(s(x))) -> s(log(s(quot(x, s(s(0()))))))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
MPO
| Execution Time (secs) | 0.132 |
| Answer | MAYBE |
| Input | AG01 3.8b |
MAYBE
We consider the following Problem:
Strict Trs:
{ le(0(), y) -> true()
, le(s(x), 0()) -> false()
, le(s(x), s(y)) -> le(x, y)
, minus(0(), y) -> 0()
, minus(s(x), y) -> if_minus(le(s(x), y), s(x), y)
, if_minus(true(), s(x), y) -> 0()
, if_minus(false(), s(x), y) -> s(minus(x, y))
, quot(0(), s(y)) -> 0()
, quot(s(x), s(y)) -> s(quot(minus(x, y), s(y)))
, log(s(0())) -> 0()
, log(s(s(x))) -> s(log(s(quot(x, s(s(0()))))))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
POP*
| Execution Time (secs) | 0.082 |
| Answer | MAYBE |
| Input | AG01 3.8b |
MAYBE
We consider the following Problem:
Strict Trs:
{ le(0(), y) -> true()
, le(s(x), 0()) -> false()
, le(s(x), s(y)) -> le(x, y)
, minus(0(), y) -> 0()
, minus(s(x), y) -> if_minus(le(s(x), y), s(x), y)
, if_minus(true(), s(x), y) -> 0()
, if_minus(false(), s(x), y) -> s(minus(x, y))
, quot(0(), s(y)) -> 0()
, quot(s(x), s(y)) -> s(quot(minus(x, y), s(y)))
, log(s(0())) -> 0()
, log(s(s(x))) -> s(log(s(quot(x, s(s(0()))))))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
POP* (PS)
| Execution Time (secs) | 0.068 |
| Answer | MAYBE |
| Input | AG01 3.8b |
MAYBE
We consider the following Problem:
Strict Trs:
{ le(0(), y) -> true()
, le(s(x), 0()) -> false()
, le(s(x), s(y)) -> le(x, y)
, minus(0(), y) -> 0()
, minus(s(x), y) -> if_minus(le(s(x), y), s(x), y)
, if_minus(true(), s(x), y) -> 0()
, if_minus(false(), s(x), y) -> s(minus(x, y))
, quot(0(), s(y)) -> 0()
, quot(s(x), s(y)) -> s(quot(minus(x, y), s(y)))
, log(s(0())) -> 0()
, log(s(s(x))) -> s(log(s(quot(x, s(s(0()))))))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
Small POP*
| Execution Time (secs) | 0.099 |
| Answer | MAYBE |
| Input | AG01 3.8b |
MAYBE
We consider the following Problem:
Strict Trs:
{ le(0(), y) -> true()
, le(s(x), 0()) -> false()
, le(s(x), s(y)) -> le(x, y)
, minus(0(), y) -> 0()
, minus(s(x), y) -> if_minus(le(s(x), y), s(x), y)
, if_minus(true(), s(x), y) -> 0()
, if_minus(false(), s(x), y) -> s(minus(x, y))
, quot(0(), s(y)) -> 0()
, quot(s(x), s(y)) -> s(quot(minus(x, y), s(y)))
, log(s(0())) -> 0()
, log(s(s(x))) -> s(log(s(quot(x, s(s(0()))))))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
Small POP* (PS)
| Execution Time (secs) | 0.083 |
| Answer | MAYBE |
| Input | AG01 3.8b |
MAYBE
We consider the following Problem:
Strict Trs:
{ le(0(), y) -> true()
, le(s(x), 0()) -> false()
, le(s(x), s(y)) -> le(x, y)
, minus(0(), y) -> 0()
, minus(s(x), y) -> if_minus(le(s(x), y), s(x), y)
, if_minus(true(), s(x), y) -> 0()
, if_minus(false(), s(x), y) -> s(minus(x, y))
, quot(0(), s(y)) -> 0()
, quot(s(x), s(y)) -> s(quot(minus(x, y), s(y)))
, log(s(0())) -> 0()
, log(s(s(x))) -> s(log(s(quot(x, s(s(0()))))))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..