LMPO
MAYBE
We consider the following Problem:
Strict Trs:
{ ackin(s(X), s(Y)) -> u21(ackin(s(X), Y), X)
, u21(ackout(X), Y) -> u22(ackin(Y, X))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
MPO
MAYBE
We consider the following Problem:
Strict Trs:
{ ackin(s(X), s(Y)) -> u21(ackin(s(X), Y), X)
, u21(ackout(X), Y) -> u22(ackin(Y, X))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
POP*
MAYBE
We consider the following Problem:
Strict Trs:
{ ackin(s(X), s(Y)) -> u21(ackin(s(X), Y), X)
, u21(ackout(X), Y) -> u22(ackin(Y, X))}
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:
{ ackin(s(X), s(Y)) -> u21(ackin(s(X), Y), X)
, u21(ackout(X), Y) -> u22(ackin(Y, X))}
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:
{ ackin(s(X), s(Y)) -> u21(ackin(s(X), Y), X)
, u21(ackout(X), Y) -> u22(ackin(Y, X))}
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:
{ ackin(s(X), s(Y)) -> u21(ackin(s(X), Y), X)
, u21(ackout(X), Y) -> u22(ackin(Y, X))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..