LMPO
Execution Time (secs) | 0.053 |
Answer | YES(?,ELEMENTARY) |
Input | SK90 2.40 |
YES(?,ELEMENTARY)
We consider the following Problem:
Strict Trs:
{ or(true(), y) -> true()
, or(x, true()) -> true()
, or(false(), false()) -> false()
, mem(x, nil()) -> false()
, mem(x, set(y)) -> =(x, y)
, mem(x, union(y, z)) -> or(mem(x, y), mem(x, z))}
StartTerms: basic terms
Strategy: innermost
Certificate: YES(?,ELEMENTARY)
Proof:
The input was oriented with the instance of
Lightweight Multiset Path Order () as induced by the safe mapping
safe(or) = {1, 2}, safe(true) = {}, safe(false) = {},
safe(mem) = {}, safe(nil) = {}, safe(set) = {1}, safe(=) = {1, 2},
safe(union) = {1, 2}
and precedence
mem > or .
Following symbols are considered recursive:
{or, mem}
The recursion depth is 2 .
For your convenience, here are the oriented rules in predicative
notation (possibly applying argument filtering):
Strict DPs: {}
Weak DPs : {}
Strict Trs:
{ or(; true(), y) -> true()
, or(; x, true()) -> true()
, or(; false(), false()) -> false()
, mem(x, nil();) -> false()
, mem(x, set(; y);) -> =(; x, y)
, mem(x, union(; y, z);) -> or(; mem(x, y;), mem(x, z;))}
Weak Trs : {}
Hurray, we answered YES(?,ELEMENTARY)
MPO
Execution Time (secs) | 0.085 |
Answer | YES(?,PRIMREC) |
Input | SK90 2.40 |
YES(?,PRIMREC)
We consider the following Problem:
Strict Trs:
{ or(true(), y) -> true()
, or(x, true()) -> true()
, or(false(), false()) -> false()
, mem(x, nil()) -> false()
, mem(x, set(y)) -> =(x, y)
, mem(x, union(y, z)) -> or(mem(x, y), mem(x, z))}
StartTerms: basic terms
Strategy: innermost
Certificate: YES(?,PRIMREC)
Proof:
The input was oriented with the instance of
'multiset path orders' as induced by the precedence
mem > or, mem > =, nil > false, mem ~ union .
Hurray, we answered YES(?,PRIMREC)
POP*
Execution Time (secs) | 0.040 |
Answer | MAYBE |
Input | SK90 2.40 |
MAYBE
We consider the following Problem:
Strict Trs:
{ or(true(), y) -> true()
, or(x, true()) -> true()
, or(false(), false()) -> false()
, mem(x, nil()) -> false()
, mem(x, set(y)) -> =(x, y)
, mem(x, union(y, z)) -> or(mem(x, y), mem(x, z))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
POP* (PS)
Execution Time (secs) | 0.069 |
Answer | MAYBE |
Input | SK90 2.40 |
MAYBE
We consider the following Problem:
Strict Trs:
{ or(true(), y) -> true()
, or(x, true()) -> true()
, or(false(), false()) -> false()
, mem(x, nil()) -> false()
, mem(x, set(y)) -> =(x, y)
, mem(x, union(y, z)) -> or(mem(x, y), mem(x, z))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
Small POP*
Execution Time (secs) | 0.056 |
Answer | MAYBE |
Input | SK90 2.40 |
MAYBE
We consider the following Problem:
Strict Trs:
{ or(true(), y) -> true()
, or(x, true()) -> true()
, or(false(), false()) -> false()
, mem(x, nil()) -> false()
, mem(x, set(y)) -> =(x, y)
, mem(x, union(y, z)) -> or(mem(x, y), mem(x, z))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
Small POP* (PS)
Execution Time (secs) | 0.032 |
Answer | MAYBE |
Input | SK90 2.40 |
MAYBE
We consider the following Problem:
Strict Trs:
{ or(true(), y) -> true()
, or(x, true()) -> true()
, or(false(), false()) -> false()
, mem(x, nil()) -> false()
, mem(x, set(y)) -> =(x, y)
, mem(x, union(y, z)) -> or(mem(x, y), mem(x, z))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..