LMPO
Execution Time (secs) | 0.035 |
Answer | MAYBE |
Input | TCT 09 ma3 |
MAYBE
We consider the following Problem:
Strict Trs:
{ p(0()) -> 0()
, p(s(x)) -> x
, minus(x, 0()) -> x
, minus(x, s(y)) -> minus(p(x), y)}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
MPO
Execution Time (secs) | 0.030 |
Answer | MAYBE |
Input | TCT 09 ma3 |
MAYBE
We consider the following Problem:
Strict Trs:
{ p(0()) -> 0()
, p(s(x)) -> x
, minus(x, 0()) -> x
, minus(x, s(y)) -> minus(p(x), y)}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
POP*
Execution Time (secs) | 0.032 |
Answer | MAYBE |
Input | TCT 09 ma3 |
MAYBE
We consider the following Problem:
Strict Trs:
{ p(0()) -> 0()
, p(s(x)) -> x
, minus(x, 0()) -> x
, minus(x, s(y)) -> minus(p(x), y)}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
POP* (PS)
Execution Time (secs) | 0.045 |
Answer | YES(?,POLY) |
Input | TCT 09 ma3 |
YES(?,POLY)
We consider the following Problem:
Strict Trs:
{ p(0()) -> 0()
, p(s(x)) -> x
, minus(x, 0()) -> x
, minus(x, s(y)) -> minus(p(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(p) = {1}, safe(0) = {}, safe(s) = {1}, safe(minus) = {1}
and precedence
minus > p .
Following symbols are considered recursive:
{p, minus}
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:
{ p(; 0()) -> 0()
, p(; s(; x)) -> x
, minus(0(); x) -> x
, minus(s(; y); x) -> minus(y; p(; x))}
Weak Trs : {}
Hurray, we answered YES(?,POLY)
Small POP*
Execution Time (secs) | 0.044 |
Answer | MAYBE |
Input | TCT 09 ma3 |
MAYBE
We consider the following Problem:
Strict Trs:
{ p(0()) -> 0()
, p(s(x)) -> x
, minus(x, 0()) -> x
, minus(x, s(y)) -> minus(p(x), y)}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
Small POP* (PS)
Execution Time (secs) | 0.059 |
Answer | YES(?,O(n^1)) |
Input | TCT 09 ma3 |
YES(?,O(n^1))
We consider the following Problem:
Strict Trs:
{ p(0()) -> 0()
, p(s(x)) -> x
, minus(x, 0()) -> x
, minus(x, s(y)) -> minus(p(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,
Nat 1-bounded) as induced by the safe mapping
safe(p) = {1}, safe(0) = {}, safe(s) = {1}, safe(minus) = {1}
and precedence
minus > p .
Following symbols are considered recursive:
{minus}
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:
{ p(; 0()) -> 0()
, p(; s(; x)) -> x
, minus(0(); x) -> x
, minus(s(; y); x) -> minus(y; p(; x))}
Weak Trs : {}
Hurray, we answered YES(?,O(n^1))