LMPO
MAYBE
We consider the following Problem:
Strict Trs:
{ from_2(x) -> cons_0(x, from_3(s_0(x)))
, from_3(x) -> cons_1(x, from_3(s_0(x)))
, from_1(x) -> cons_0(x, from_3(s_0(x)))
, cons_1(s_0(x), xs) -> overflow_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:
{ from_2(x) -> cons_0(x, from_3(s_0(x)))
, from_3(x) -> cons_1(x, from_3(s_0(x)))
, from_1(x) -> cons_0(x, from_3(s_0(x)))
, cons_1(s_0(x), xs) -> overflow_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:
{ from_2(x) -> cons_0(x, from_3(s_0(x)))
, from_3(x) -> cons_1(x, from_3(s_0(x)))
, from_1(x) -> cons_0(x, from_3(s_0(x)))
, cons_1(s_0(x), xs) -> overflow_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:
{ from_2(x) -> cons_0(x, from_3(s_0(x)))
, from_3(x) -> cons_1(x, from_3(s_0(x)))
, from_1(x) -> cons_0(x, from_3(s_0(x)))
, cons_1(s_0(x), xs) -> overflow_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:
{ from_2(x) -> cons_0(x, from_3(s_0(x)))
, from_3(x) -> cons_1(x, from_3(s_0(x)))
, from_1(x) -> cons_0(x, from_3(s_0(x)))
, cons_1(s_0(x), xs) -> overflow_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:
{ from_2(x) -> cons_0(x, from_3(s_0(x)))
, from_3(x) -> cons_1(x, from_3(s_0(x)))
, from_1(x) -> cons_0(x, from_3(s_0(x)))
, cons_1(s_0(x), xs) -> overflow_0()}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..