LMPO
| Execution Time (secs) | 0.076 |
| Answer | MAYBE |
| Input | SK90 2.44 |
MAYBE
We consider the following Problem:
Strict Trs:
{ del(.(x, .(y, z))) -> f(=(x, y), x, y, z)
, f(true(), x, y, z) -> del(.(y, z))
, f(false(), x, y, z) -> .(x, del(.(y, z)))
, =(nil(), nil()) -> true()
, =(.(x, y), nil()) -> false()
, =(nil(), .(y, z)) -> false()
, =(.(x, y), .(u(), v())) -> and(=(x, u()), =(y, v()))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
MPO
| Execution Time (secs) | 0.107 |
| Answer | MAYBE |
| Input | SK90 2.44 |
MAYBE
We consider the following Problem:
Strict Trs:
{ del(.(x, .(y, z))) -> f(=(x, y), x, y, z)
, f(true(), x, y, z) -> del(.(y, z))
, f(false(), x, y, z) -> .(x, del(.(y, z)))
, =(nil(), nil()) -> true()
, =(.(x, y), nil()) -> false()
, =(nil(), .(y, z)) -> false()
, =(.(x, y), .(u(), v())) -> and(=(x, u()), =(y, v()))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
POP*
| Execution Time (secs) | 0.057 |
| Answer | MAYBE |
| Input | SK90 2.44 |
MAYBE
We consider the following Problem:
Strict Trs:
{ del(.(x, .(y, z))) -> f(=(x, y), x, y, z)
, f(true(), x, y, z) -> del(.(y, z))
, f(false(), x, y, z) -> .(x, del(.(y, z)))
, =(nil(), nil()) -> true()
, =(.(x, y), nil()) -> false()
, =(nil(), .(y, z)) -> false()
, =(.(x, y), .(u(), v())) -> and(=(x, u()), =(y, v()))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
POP* (PS)
| Execution Time (secs) | 0.096 |
| Answer | MAYBE |
| Input | SK90 2.44 |
MAYBE
We consider the following Problem:
Strict Trs:
{ del(.(x, .(y, z))) -> f(=(x, y), x, y, z)
, f(true(), x, y, z) -> del(.(y, z))
, f(false(), x, y, z) -> .(x, del(.(y, z)))
, =(nil(), nil()) -> true()
, =(.(x, y), nil()) -> false()
, =(nil(), .(y, z)) -> false()
, =(.(x, y), .(u(), v())) -> and(=(x, u()), =(y, v()))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
Small POP*
| Execution Time (secs) | 0.126 |
| Answer | MAYBE |
| Input | SK90 2.44 |
MAYBE
We consider the following Problem:
Strict Trs:
{ del(.(x, .(y, z))) -> f(=(x, y), x, y, z)
, f(true(), x, y, z) -> del(.(y, z))
, f(false(), x, y, z) -> .(x, del(.(y, z)))
, =(nil(), nil()) -> true()
, =(.(x, y), nil()) -> false()
, =(nil(), .(y, z)) -> false()
, =(.(x, y), .(u(), v())) -> and(=(x, u()), =(y, v()))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
Small POP* (PS)
| Execution Time (secs) | 0.102 |
| Answer | MAYBE |
| Input | SK90 2.44 |
MAYBE
We consider the following Problem:
Strict Trs:
{ del(.(x, .(y, z))) -> f(=(x, y), x, y, z)
, f(true(), x, y, z) -> del(.(y, z))
, f(false(), x, y, z) -> .(x, del(.(y, z)))
, =(nil(), nil()) -> true()
, =(.(x, y), nil()) -> false()
, =(nil(), .(y, z)) -> false()
, =(.(x, y), .(u(), v())) -> and(=(x, u()), =(y, v()))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..