LMPO
Execution Time (secs) | 0.017 |
Answer | MAYBE |
Input | AG01 3.53a |
MAYBE
We consider the following Problem:
Strict Trs:
{ g(x, y) -> x
, g(x, y) -> y
, f(s(x), y, y) -> f(y, x, s(x))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
MPO
Execution Time (secs) | 0.018 |
Answer | MAYBE |
Input | AG01 3.53a |
MAYBE
We consider the following Problem:
Strict Trs:
{ g(x, y) -> x
, g(x, y) -> y
, f(s(x), y, y) -> f(y, x, s(x))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
POP*
Execution Time (secs) | 0.017 |
Answer | MAYBE |
Input | AG01 3.53a |
MAYBE
We consider the following Problem:
Strict Trs:
{ g(x, y) -> x
, g(x, y) -> y
, f(s(x), y, y) -> f(y, x, s(x))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
POP* (PS)
Execution Time (secs) | 0.025 |
Answer | YES(?,POLY) |
Input | AG01 3.53a |
YES(?,POLY)
We consider the following Problem:
Strict Trs:
{ g(x, y) -> x
, g(x, y) -> y
, f(s(x), y, y) -> f(y, x, s(x))}
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(g) = {}, safe(f) = {3}, safe(s) = {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:
{ g(x, y;) -> x
, g(x, y;) -> y
, f(s(; x), y; y) -> f(y, x; s(; x))}
Weak Trs : {}
Hurray, we answered YES(?,POLY)
Small POP*
Execution Time (secs) | 0.020 |
Answer | MAYBE |
Input | AG01 3.53a |
MAYBE
We consider the following Problem:
Strict Trs:
{ g(x, y) -> x
, g(x, y) -> y
, f(s(x), y, y) -> f(y, x, s(x))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
Small POP* (PS)
Execution Time (secs) | 0.033 |
Answer | YES(?,O(n^1)) |
Input | AG01 3.53a |
YES(?,O(n^1))
We consider the following Problem:
Strict Trs:
{ g(x, y) -> x
, g(x, y) -> y
, f(s(x), y, y) -> f(y, x, s(x))}
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(g) = {}, safe(f) = {3}, safe(s) = {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:
{ g(x, y;) -> x
, g(x, y;) -> y
, f(s(; x), y; y) -> f(y, x; s(; x))}
Weak Trs : {}
Hurray, we answered YES(?,O(n^1))