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