Tool LMPO
stdout:
MAYBE
We consider the following Problem:
Strict Trs:
{ ack(0(), y) -> s(y)
, ack(s(x), 0()) -> ack(x, s(0()))
, ack(s(x), s(y)) -> ack(x, ack(s(x), y))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
Tool MPO
stdout:
MAYBE
We consider the following Problem:
Strict Trs:
{ ack(0(), y) -> s(y)
, ack(s(x), 0()) -> ack(x, s(0()))
, ack(s(x), s(y)) -> ack(x, ack(s(x), y))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
Tool POP*
stdout:
MAYBE
We consider the following Problem:
Strict Trs:
{ ack(0(), y) -> s(y)
, ack(s(x), 0()) -> ack(x, s(0()))
, ack(s(x), s(y)) -> ack(x, ack(s(x), y))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
Tool POP* (PS)
stdout:
MAYBE
We consider the following Problem:
Strict Trs:
{ ack(0(), y) -> s(y)
, ack(s(x), 0()) -> ack(x, s(0()))
, ack(s(x), s(y)) -> ack(x, ack(s(x), y))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
Tool Small POP*
stdout:
MAYBE
We consider the following Problem:
Strict Trs:
{ ack(0(), y) -> s(y)
, ack(s(x), 0()) -> ack(x, s(0()))
, ack(s(x), s(y)) -> ack(x, ack(s(x), y))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..
Tool Small POP* (PS)
stdout:
MAYBE
We consider the following Problem:
Strict Trs:
{ ack(0(), y) -> s(y)
, ack(s(x), 0()) -> ack(x, s(0()))
, ack(s(x), s(y)) -> ack(x, ack(s(x), y))}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..