LMPO
Execution Time (secs) | 0.024 |
Answer | MAYBE |
Input | AG01 3.37 |
MAYBE
We consider the following Problem:
Strict Trs:
{ not(true()) -> false()
, not(false()) -> true()
, evenodd(x, 0()) -> not(evenodd(x, s(0())))
, evenodd(0(), s(0())) -> false()
, evenodd(s(x), s(0())) -> evenodd(x, 0())}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
MPO
Execution Time (secs) | 0.029 |
Answer | MAYBE |
Input | AG01 3.37 |
MAYBE
We consider the following Problem:
Strict Trs:
{ not(true()) -> false()
, not(false()) -> true()
, evenodd(x, 0()) -> not(evenodd(x, s(0())))
, evenodd(0(), s(0())) -> false()
, evenodd(s(x), s(0())) -> evenodd(x, 0())}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
POP*
Execution Time (secs) | 0.023 |
Answer | MAYBE |
Input | AG01 3.37 |
MAYBE
We consider the following Problem:
Strict Trs:
{ not(true()) -> false()
, not(false()) -> true()
, evenodd(x, 0()) -> not(evenodd(x, s(0())))
, evenodd(0(), s(0())) -> false()
, evenodd(s(x), s(0())) -> evenodd(x, 0())}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
POP* (PS)
Execution Time (secs) | 0.037 |
Answer | MAYBE |
Input | AG01 3.37 |
MAYBE
We consider the following Problem:
Strict Trs:
{ not(true()) -> false()
, not(false()) -> true()
, evenodd(x, 0()) -> not(evenodd(x, s(0())))
, evenodd(0(), s(0())) -> false()
, evenodd(s(x), s(0())) -> evenodd(x, 0())}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
Small POP*
Execution Time (secs) | 0.031 |
Answer | MAYBE |
Input | AG01 3.37 |
MAYBE
We consider the following Problem:
Strict Trs:
{ not(true()) -> false()
, not(false()) -> true()
, evenodd(x, 0()) -> not(evenodd(x, s(0())))
, evenodd(0(), s(0())) -> false()
, evenodd(s(x), s(0())) -> evenodd(x, 0())}
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 | AG01 3.37 |
MAYBE
We consider the following Problem:
Strict Trs:
{ not(true()) -> false()
, not(false()) -> true()
, evenodd(x, 0()) -> not(evenodd(x, s(0())))
, evenodd(0(), s(0())) -> false()
, evenodd(s(x), s(0())) -> evenodd(x, 0())}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..