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