LMPO
| Execution Time (secs) | 0.043 |
| Answer | MAYBE |
| Input | AG01 3.48 |
MAYBE
We consider the following Problem:
Strict Trs:
{ f(0()) -> true()
, f(1()) -> false()
, f(s(x)) -> f(x)
, if(true(), s(x), s(y)) -> s(x)
, if(false(), s(x), s(y)) -> s(y)
, g(x, c(y)) -> c(g(x, y))
, g(x, c(y)) -> g(x, if(f(x), c(g(s(x), y)), c(y)))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
MPO
| Execution Time (secs) | 0.069 |
| Answer | MAYBE |
| Input | AG01 3.48 |
MAYBE
We consider the following Problem:
Strict Trs:
{ f(0()) -> true()
, f(1()) -> false()
, f(s(x)) -> f(x)
, if(true(), s(x), s(y)) -> s(x)
, if(false(), s(x), s(y)) -> s(y)
, g(x, c(y)) -> c(g(x, y))
, g(x, c(y)) -> g(x, if(f(x), c(g(s(x), y)), c(y)))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
POP*
| Execution Time (secs) | 0.077 |
| Answer | MAYBE |
| Input | AG01 3.48 |
MAYBE
We consider the following Problem:
Strict Trs:
{ f(0()) -> true()
, f(1()) -> false()
, f(s(x)) -> f(x)
, if(true(), s(x), s(y)) -> s(x)
, if(false(), s(x), s(y)) -> s(y)
, g(x, c(y)) -> c(g(x, y))
, g(x, c(y)) -> g(x, if(f(x), c(g(s(x), y)), c(y)))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
POP* (PS)
| Execution Time (secs) | 0.071 |
| Answer | MAYBE |
| Input | AG01 3.48 |
MAYBE
We consider the following Problem:
Strict Trs:
{ f(0()) -> true()
, f(1()) -> false()
, f(s(x)) -> f(x)
, if(true(), s(x), s(y)) -> s(x)
, if(false(), s(x), s(y)) -> s(y)
, g(x, c(y)) -> c(g(x, y))
, g(x, c(y)) -> g(x, if(f(x), c(g(s(x), y)), c(y)))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
Small POP*
| Execution Time (secs) | 0.035 |
| Answer | MAYBE |
| Input | AG01 3.48 |
MAYBE
We consider the following Problem:
Strict Trs:
{ f(0()) -> true()
, f(1()) -> false()
, f(s(x)) -> f(x)
, if(true(), s(x), s(y)) -> s(x)
, if(false(), s(x), s(y)) -> s(y)
, g(x, c(y)) -> c(g(x, y))
, g(x, c(y)) -> g(x, if(f(x), c(g(s(x), y)), c(y)))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
Small POP* (PS)
| Execution Time (secs) | 0.038 |
| Answer | MAYBE |
| Input | AG01 3.48 |
MAYBE
We consider the following Problem:
Strict Trs:
{ f(0()) -> true()
, f(1()) -> false()
, f(s(x)) -> f(x)
, if(true(), s(x), s(y)) -> s(x)
, if(false(), s(x), s(y)) -> s(y)
, g(x, c(y)) -> c(g(x, y))
, g(x, c(y)) -> g(x, if(f(x), c(g(s(x), y)), c(y)))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..