Tool LMPO
Execution Time | 0.022 |
---|
Answer | MAYBE |
---|
Input | Der95 27 |
---|
stdout:
MAYBE
We consider the following Problem:
Strict Trs:
{ h(f(x), y) -> f(g(x, y))
, g(x, y) -> h(x, y)}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
Tool MPO
Execution Time | 0.028 |
---|
Answer | MAYBE |
---|
Input | Der95 27 |
---|
stdout:
MAYBE
We consider the following Problem:
Strict Trs:
{ h(f(x), y) -> f(g(x, y))
, g(x, y) -> h(x, y)}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
Tool POP*
Execution Time | 0.026 |
---|
Answer | MAYBE |
---|
Input | Der95 27 |
---|
stdout:
MAYBE
We consider the following Problem:
Strict Trs:
{ h(f(x), y) -> f(g(x, y))
, g(x, y) -> h(x, y)}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
Tool POP* (PS)
Execution Time | 0.026 |
---|
Answer | MAYBE |
---|
Input | Der95 27 |
---|
stdout:
MAYBE
We consider the following Problem:
Strict Trs:
{ h(f(x), y) -> f(g(x, y))
, g(x, y) -> h(x, y)}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
Tool Small POP*
Execution Time | 0.023 |
---|
Answer | MAYBE |
---|
Input | Der95 27 |
---|
stdout:
MAYBE
We consider the following Problem:
Strict Trs:
{ h(f(x), y) -> f(g(x, y))
, g(x, y) -> 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.022 |
---|
Answer | MAYBE |
---|
Input | Der95 27 |
---|
stdout:
MAYBE
We consider the following Problem:
Strict Trs:
{ h(f(x), y) -> f(g(x, y))
, g(x, y) -> h(x, y)}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..