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