LMPO
Execution Time (secs) | 0.055 |
Answer | MAYBE |
Input | AG01 3.8a |
MAYBE
We consider the following Problem:
Strict Trs:
{ pred(s(x)) -> x
, minus(x, 0()) -> x
, minus(x, s(y)) -> pred(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.063 |
Answer | MAYBE |
Input | AG01 3.8a |
MAYBE
We consider the following Problem:
Strict Trs:
{ pred(s(x)) -> x
, minus(x, 0()) -> x
, minus(x, s(y)) -> pred(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.084 |
Answer | MAYBE |
Input | AG01 3.8a |
MAYBE
We consider the following Problem:
Strict Trs:
{ pred(s(x)) -> x
, minus(x, 0()) -> x
, minus(x, s(y)) -> pred(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.054 |
Answer | MAYBE |
Input | AG01 3.8a |
MAYBE
We consider the following Problem:
Strict Trs:
{ pred(s(x)) -> x
, minus(x, 0()) -> x
, minus(x, s(y)) -> pred(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.048 |
Answer | MAYBE |
Input | AG01 3.8a |
MAYBE
We consider the following Problem:
Strict Trs:
{ pred(s(x)) -> x
, minus(x, 0()) -> x
, minus(x, s(y)) -> pred(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.052 |
Answer | MAYBE |
Input | AG01 3.8a |
MAYBE
We consider the following Problem:
Strict Trs:
{ pred(s(x)) -> x
, minus(x, 0()) -> x
, minus(x, s(y)) -> pred(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..