LMPO
Execution Time (secs) | 0.022 |
Answer | MAYBE |
Input | SK90 2.54 |
MAYBE
We consider the following Problem:
Strict Trs:
{ f(x, a()) -> x
, f(x, g(y)) -> f(g(x), y)}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
MPO
Execution Time (secs) | 0.026 |
Answer | MAYBE |
Input | SK90 2.54 |
MAYBE
We consider the following Problem:
Strict Trs:
{ f(x, a()) -> x
, f(x, g(y)) -> f(g(x), y)}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
POP*
Execution Time (secs) | 0.022 |
Answer | MAYBE |
Input | SK90 2.54 |
MAYBE
We consider the following Problem:
Strict Trs:
{ f(x, a()) -> x
, f(x, g(y)) -> f(g(x), y)}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
POP* (PS)
Execution Time (secs) | 0.032 |
Answer | YES(?,POLY) |
Input | SK90 2.54 |
YES(?,POLY)
We consider the following Problem:
Strict Trs:
{ f(x, a()) -> x
, f(x, g(y)) -> f(g(x), y)}
StartTerms: basic terms
Strategy: innermost
Certificate: YES(?,POLY)
Proof:
The input was oriented with the instance of
Polynomial Path Order (PS) as induced by the safe mapping
safe(f) = {1}, safe(a) = {}, safe(g) = {1}
and precedence
empty .
Following symbols are considered recursive:
{f}
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:
{ f(a(); x) -> x
, f(g(; y); x) -> f(y; g(; x))}
Weak Trs : {}
Hurray, we answered YES(?,POLY)
Small POP*
Execution Time (secs) | 0.021 |
Answer | MAYBE |
Input | SK90 2.54 |
MAYBE
We consider the following Problem:
Strict Trs:
{ f(x, a()) -> x
, f(x, g(y)) -> f(g(x), y)}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
Small POP* (PS)
Execution Time (secs) | 0.050 |
Answer | YES(?,O(n^1)) |
Input | SK90 2.54 |
YES(?,O(n^1))
We consider the following Problem:
Strict Trs:
{ f(x, a()) -> x
, f(x, g(y)) -> f(g(x), y)}
StartTerms: basic terms
Strategy: innermost
Certificate: YES(?,O(n^1))
Proof:
The input was oriented with the instance of
Small Polynomial Path Order (WSC,
PS) as induced by the safe mapping
safe(f) = {1}, safe(a) = {}, safe(g) = {1}
and precedence
empty .
Following symbols are considered recursive:
{f}
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:
{ f(a(); x) -> x
, f(g(; y); x) -> f(y; g(; x))}
Weak Trs : {}
Hurray, we answered YES(?,O(n^1))