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