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