Tool LMPO
stdout:
MAYBE
We consider the following Problem:
Strict Trs: {f(h(x), y) -> h(f(y, f(x, h(f(a(), a())))))}
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(h(x), y) -> h(f(y, f(x, h(f(a(), a())))))}
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(h(x), y) -> h(f(y, f(x, h(f(a(), a())))))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
Tool POP* (PS)
stdout:
MAYBE
We consider the following Problem:
Strict Trs: {f(h(x), y) -> h(f(y, f(x, h(f(a(), a())))))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
Tool Small POP*
stdout:
MAYBE
We consider the following Problem:
Strict Trs: {f(h(x), y) -> h(f(y, f(x, h(f(a(), a())))))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
Tool Small POP* (PS)
stdout:
MAYBE
We consider the following Problem:
Strict Trs: {f(h(x), y) -> h(f(y, f(x, h(f(a(), a())))))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..