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