Tool LMPO
stdout:
MAYBE
We consider the following Problem:
Strict Trs:
{ f(x, g(x)) -> x
, f(x, h(y)) -> f(h(x), y)}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
Tool MPO
stdout:
MAYBE
We consider the following Problem:
Strict Trs:
{ f(x, g(x)) -> x
, f(x, h(y)) -> f(h(x), y)}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
Tool POP*
stdout:
MAYBE
We consider the following Problem:
Strict Trs:
{ f(x, g(x)) -> x
, f(x, h(y)) -> f(h(x), y)}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
Tool POP* (PS)
Execution Time | 0.031 |
---|
Answer | YES(?,POLY) |
---|
Input | SK90 2.55 |
---|
stdout:
YES(?,POLY)
We consider the following Problem:
Strict Trs:
{ f(x, g(x)) -> x
, f(x, h(y)) -> f(h(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(g) = {1}, safe(h) = {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(g(; x); x) -> x
, f(h(; y); x) -> f(y; h(; x))}
Weak Trs : {}
Hurray, we answered YES(?,POLY)
Tool Small POP*
stdout:
MAYBE
We consider the following Problem:
Strict Trs:
{ f(x, g(x)) -> x
, f(x, h(y)) -> f(h(x), y)}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
Tool Small POP* (PS)
Execution Time | 0.036 |
---|
Answer | YES(?,O(n^1)) |
---|
Input | SK90 2.55 |
---|
stdout:
YES(?,O(n^1))
We consider the following Problem:
Strict Trs:
{ f(x, g(x)) -> x
, f(x, h(y)) -> f(h(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(g) = {1}, safe(h) = {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(g(; x); x) -> x
, f(h(; y); x) -> f(y; h(; x))}
Weak Trs : {}
Hurray, we answered YES(?,O(n^1))