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