LMPO
| Execution Time (secs) | 0.047 |
| Answer | MAYBE |
| Input | SK90 2.37 |
MAYBE
We consider the following Problem:
Strict Trs: {and(not(not(x)), y, not(z)) -> and(y, band(x, z), x)}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
MPO
| Execution Time (secs) | 0.034 |
| Answer | MAYBE |
| Input | SK90 2.37 |
MAYBE
We consider the following Problem:
Strict Trs: {and(not(not(x)), y, not(z)) -> and(y, band(x, z), x)}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
POP*
| Execution Time (secs) | 0.034 |
| Answer | MAYBE |
| Input | SK90 2.37 |
MAYBE
We consider the following Problem:
Strict Trs: {and(not(not(x)), y, not(z)) -> and(y, band(x, z), x)}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
POP* (PS)
| Execution Time (secs) | 0.033 |
| Answer | MAYBE |
| Input | SK90 2.37 |
MAYBE
We consider the following Problem:
Strict Trs: {and(not(not(x)), y, not(z)) -> and(y, band(x, z), x)}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
Small POP*
| Execution Time (secs) | 0.028 |
| Answer | MAYBE |
| Input | SK90 2.37 |
MAYBE
We consider the following Problem:
Strict Trs: {and(not(not(x)), y, not(z)) -> and(y, band(x, z), x)}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
Small POP* (PS)
| Execution Time (secs) | 0.025 |
| Answer | MAYBE |
| Input | SK90 2.37 |
MAYBE
We consider the following Problem:
Strict Trs: {and(not(not(x)), y, not(z)) -> and(y, band(x, z), x)}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..