LMPO
Execution Time (secs) | 0.052 |
Answer | MAYBE |
Input | AG01 3.12 |
MAYBE
We consider the following Problem:
Strict Trs:
{ app(nil(), y) -> y
, app(add(n, x), y) -> add(n, app(x, y))
, reverse(nil()) -> nil()
, reverse(add(n, x)) -> app(reverse(x), add(n, nil()))
, shuffle(nil()) -> nil()
, shuffle(add(n, x)) -> add(n, shuffle(reverse(x)))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
MPO
Execution Time (secs) | 0.056 |
Answer | MAYBE |
Input | AG01 3.12 |
MAYBE
We consider the following Problem:
Strict Trs:
{ app(nil(), y) -> y
, app(add(n, x), y) -> add(n, app(x, y))
, reverse(nil()) -> nil()
, reverse(add(n, x)) -> app(reverse(x), add(n, nil()))
, shuffle(nil()) -> nil()
, shuffle(add(n, x)) -> add(n, shuffle(reverse(x)))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
POP*
Execution Time (secs) | 0.041 |
Answer | MAYBE |
Input | AG01 3.12 |
MAYBE
We consider the following Problem:
Strict Trs:
{ app(nil(), y) -> y
, app(add(n, x), y) -> add(n, app(x, y))
, reverse(nil()) -> nil()
, reverse(add(n, x)) -> app(reverse(x), add(n, nil()))
, shuffle(nil()) -> nil()
, shuffle(add(n, x)) -> add(n, shuffle(reverse(x)))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
POP* (PS)
Execution Time (secs) | 0.048 |
Answer | MAYBE |
Input | AG01 3.12 |
MAYBE
We consider the following Problem:
Strict Trs:
{ app(nil(), y) -> y
, app(add(n, x), y) -> add(n, app(x, y))
, reverse(nil()) -> nil()
, reverse(add(n, x)) -> app(reverse(x), add(n, nil()))
, shuffle(nil()) -> nil()
, shuffle(add(n, x)) -> add(n, shuffle(reverse(x)))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
Small POP*
Execution Time (secs) | 0.047 |
Answer | MAYBE |
Input | AG01 3.12 |
MAYBE
We consider the following Problem:
Strict Trs:
{ app(nil(), y) -> y
, app(add(n, x), y) -> add(n, app(x, y))
, reverse(nil()) -> nil()
, reverse(add(n, x)) -> app(reverse(x), add(n, nil()))
, shuffle(nil()) -> nil()
, shuffle(add(n, x)) -> add(n, shuffle(reverse(x)))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
Small POP* (PS)
Execution Time (secs) | 0.043 |
Answer | MAYBE |
Input | AG01 3.12 |
MAYBE
We consider the following Problem:
Strict Trs:
{ app(nil(), y) -> y
, app(add(n, x), y) -> add(n, app(x, y))
, reverse(nil()) -> nil()
, reverse(add(n, x)) -> app(reverse(x), add(n, nil()))
, shuffle(nil()) -> nil()
, shuffle(add(n, x)) -> add(n, shuffle(reverse(x)))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..