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