LMPO
Execution Time (secs) | 0.072 |
Answer | MAYBE |
Input | SK90 4.57 |
MAYBE
We consider the following Problem:
Strict Trs:
{ f(x, y, z) -> g(<=(x, y), x, y, z)
, g(true(), x, y, z) -> z
, g(false(), x, y, z) ->
f(f(p(x), y, z), f(p(y), z, x), f(p(z), x, y))
, p(0()) -> 0()
, p(s(x)) -> x}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
MPO
Execution Time (secs) | 0.060 |
Answer | MAYBE |
Input | SK90 4.57 |
MAYBE
We consider the following Problem:
Strict Trs:
{ f(x, y, z) -> g(<=(x, y), x, y, z)
, g(true(), x, y, z) -> z
, g(false(), x, y, z) ->
f(f(p(x), y, z), f(p(y), z, x), f(p(z), x, y))
, p(0()) -> 0()
, p(s(x)) -> x}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
POP*
Execution Time (secs) | 0.082 |
Answer | MAYBE |
Input | SK90 4.57 |
MAYBE
We consider the following Problem:
Strict Trs:
{ f(x, y, z) -> g(<=(x, y), x, y, z)
, g(true(), x, y, z) -> z
, g(false(), x, y, z) ->
f(f(p(x), y, z), f(p(y), z, x), f(p(z), x, y))
, p(0()) -> 0()
, p(s(x)) -> x}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
POP* (PS)
Execution Time (secs) | 0.087 |
Answer | MAYBE |
Input | SK90 4.57 |
MAYBE
We consider the following Problem:
Strict Trs:
{ f(x, y, z) -> g(<=(x, y), x, y, z)
, g(true(), x, y, z) -> z
, g(false(), x, y, z) ->
f(f(p(x), y, z), f(p(y), z, x), f(p(z), x, y))
, p(0()) -> 0()
, p(s(x)) -> x}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
Small POP*
Execution Time (secs) | 0.145 |
Answer | MAYBE |
Input | SK90 4.57 |
MAYBE
We consider the following Problem:
Strict Trs:
{ f(x, y, z) -> g(<=(x, y), x, y, z)
, g(true(), x, y, z) -> z
, g(false(), x, y, z) ->
f(f(p(x), y, z), f(p(y), z, x), f(p(z), x, y))
, p(0()) -> 0()
, p(s(x)) -> x}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
Small POP* (PS)
Execution Time (secs) | 0.069 |
Answer | MAYBE |
Input | SK90 4.57 |
MAYBE
We consider the following Problem:
Strict Trs:
{ f(x, y, z) -> g(<=(x, y), x, y, z)
, g(true(), x, y, z) -> z
, g(false(), x, y, z) ->
f(f(p(x), y, z), f(p(y), z, x), f(p(z), x, y))
, p(0()) -> 0()
, p(s(x)) -> x}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..