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