Tool LMPO
stdout:
MAYBE
We consider the following Problem:
Strict Trs:
{ f(g(x)) -> g(f(f(x)))
, f(h(x)) -> h(g(x))
, 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..
Tool MPO
stdout:
MAYBE
We consider the following Problem:
Strict Trs:
{ f(g(x)) -> g(f(f(x)))
, f(h(x)) -> h(g(x))
, 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..
Tool POP*
stdout:
MAYBE
We consider the following Problem:
Strict Trs:
{ f(g(x)) -> g(f(f(x)))
, f(h(x)) -> h(g(x))
, 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..
Tool POP* (PS)
stdout:
MAYBE
We consider the following Problem:
Strict Trs:
{ f(g(x)) -> g(f(f(x)))
, f(h(x)) -> h(g(x))
, 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..
Tool Small POP*
stdout:
MAYBE
We consider the following Problem:
Strict Trs:
{ f(g(x)) -> g(f(f(x)))
, f(h(x)) -> h(g(x))
, 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..
Tool Small POP* (PS)
stdout:
MAYBE
We consider the following Problem:
Strict Trs:
{ f(g(x)) -> g(f(f(x)))
, f(h(x)) -> h(g(x))
, 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..