LMPO
| Execution Time (secs) | 0.050 |
| Answer | YES(?,ELEMENTARY) |
| Input | SK90 2.24 |
YES(?,ELEMENTARY)
We consider the following Problem:
Strict Trs:
{ fib(0()) -> 0()
, fib(s(0())) -> s(0())
, fib(s(s(x))) -> +(fib(s(x)), fib(x))}
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(fib) = {}, safe(0) = {}, safe(s) = {1}, safe(+) = {1, 2}
and precedence
empty .
Following symbols are considered recursive:
{fib}
The recursion depth is 1 .
For your convenience, here are the oriented rules in predicative
notation (possibly applying argument filtering):
Strict DPs: {}
Weak DPs : {}
Strict Trs:
{ fib(0();) -> 0()
, fib(s(; 0());) -> s(; 0())
, fib(s(; s(; x));) -> +(; fib(s(; x);), fib(x;))}
Weak Trs : {}
Hurray, we answered YES(?,ELEMENTARY)
MPO
| Execution Time (secs) | 0.050 |
| Answer | YES(?,PRIMREC) |
| Input | SK90 2.24 |
YES(?,PRIMREC)
We consider the following Problem:
Strict Trs:
{ fib(0()) -> 0()
, fib(s(0())) -> s(0())
, fib(s(s(x))) -> +(fib(s(x)), fib(x))}
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
s > fib, s > + .
Hurray, we answered YES(?,PRIMREC)
POP*
| Execution Time (secs) | 0.021 |
| Answer | MAYBE |
| Input | SK90 2.24 |
MAYBE
We consider the following Problem:
Strict Trs:
{ fib(0()) -> 0()
, fib(s(0())) -> s(0())
, fib(s(s(x))) -> +(fib(s(x)), fib(x))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
POP* (PS)
| Execution Time (secs) | 0.024 |
| Answer | MAYBE |
| Input | SK90 2.24 |
MAYBE
We consider the following Problem:
Strict Trs:
{ fib(0()) -> 0()
, fib(s(0())) -> s(0())
, fib(s(s(x))) -> +(fib(s(x)), fib(x))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
Small POP*
| Execution Time (secs) | 0.022 |
| Answer | MAYBE |
| Input | SK90 2.24 |
MAYBE
We consider the following Problem:
Strict Trs:
{ fib(0()) -> 0()
, fib(s(0())) -> s(0())
, fib(s(s(x))) -> +(fib(s(x)), fib(x))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
Small POP* (PS)
| Execution Time (secs) | 0.031 |
| Answer | MAYBE |
| Input | SK90 2.24 |
MAYBE
We consider the following Problem:
Strict Trs:
{ fib(0()) -> 0()
, fib(s(0())) -> s(0())
, fib(s(s(x))) -> +(fib(s(x)), fib(x))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..