LMPO
| Execution Time (secs) | 0.049 |
| Answer | MAYBE |
| Input | AG01 3.49 |
MAYBE
We consider the following Problem:
Strict Trs:
{ f(c(s(x), y)) -> f(c(x, s(y)))
, f(c(s(x), s(y))) -> g(c(x, y))
, g(c(x, s(y))) -> g(c(s(x), y))
, g(c(s(x), s(y))) -> f(c(x, y))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
MPO
| Execution Time (secs) | 0.062 |
| Answer | MAYBE |
| Input | AG01 3.49 |
MAYBE
We consider the following Problem:
Strict Trs:
{ f(c(s(x), y)) -> f(c(x, s(y)))
, f(c(s(x), s(y))) -> g(c(x, y))
, g(c(x, s(y))) -> g(c(s(x), y))
, g(c(s(x), s(y))) -> f(c(x, y))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
POP*
| Execution Time (secs) | 0.051 |
| Answer | MAYBE |
| Input | AG01 3.49 |
MAYBE
We consider the following Problem:
Strict Trs:
{ f(c(s(x), y)) -> f(c(x, s(y)))
, f(c(s(x), s(y))) -> g(c(x, y))
, g(c(x, s(y))) -> g(c(s(x), y))
, g(c(s(x), s(y))) -> f(c(x, y))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
POP* (PS)
| Execution Time (secs) | 0.046 |
| Answer | MAYBE |
| Input | AG01 3.49 |
MAYBE
We consider the following Problem:
Strict Trs:
{ f(c(s(x), y)) -> f(c(x, s(y)))
, f(c(s(x), s(y))) -> g(c(x, y))
, g(c(x, s(y))) -> g(c(s(x), y))
, g(c(s(x), s(y))) -> f(c(x, y))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
Small POP*
| Execution Time (secs) | 0.050 |
| Answer | MAYBE |
| Input | AG01 3.49 |
MAYBE
We consider the following Problem:
Strict Trs:
{ f(c(s(x), y)) -> f(c(x, s(y)))
, f(c(s(x), s(y))) -> g(c(x, y))
, g(c(x, s(y))) -> g(c(s(x), y))
, g(c(s(x), s(y))) -> f(c(x, y))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
Small POP* (PS)
| Execution Time (secs) | 0.064 |
| Answer | MAYBE |
| Input | AG01 3.49 |
MAYBE
We consider the following Problem:
Strict Trs:
{ f(c(s(x), y)) -> f(c(x, s(y)))
, f(c(s(x), s(y))) -> g(c(x, y))
, g(c(x, s(y))) -> g(c(s(x), y))
, g(c(s(x), s(y))) -> f(c(x, y))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..