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