LMPO
MAYBE
We consider the following Problem:
Strict Trs:
{ f(c(s(x), y)) -> f(c(x, s(y)))
, g(c(x, s(y))) -> g(c(s(x), y))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
MPO
MAYBE
We consider the following Problem:
Strict Trs:
{ f(c(s(x), y)) -> f(c(x, s(y)))
, g(c(x, s(y))) -> g(c(s(x), y))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
POP*
MAYBE
We consider the following Problem:
Strict Trs:
{ f(c(s(x), y)) -> f(c(x, s(y)))
, g(c(x, s(y))) -> g(c(s(x), y))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
POP* (PS)
MAYBE
We consider the following Problem:
Strict Trs:
{ f(c(s(x), y)) -> f(c(x, s(y)))
, g(c(x, s(y))) -> g(c(s(x), y))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
Small POP*
MAYBE
We consider the following Problem:
Strict Trs:
{ f(c(s(x), y)) -> f(c(x, s(y)))
, g(c(x, s(y))) -> g(c(s(x), y))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
Small POP* (PS)
MAYBE
We consider the following Problem:
Strict Trs:
{ f(c(s(x), y)) -> f(c(x, s(y)))
, g(c(x, s(y))) -> g(c(s(x), y))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..