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