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