LMPO
MAYBE
We consider the following Problem:
Strict Trs:
{ from(X) -> cons(X, from(s(X)))
, length(nil()) -> 0()
, length(cons(X, Y)) -> s(length1(Y))
, length1(X) -> length(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:
{ from(X) -> cons(X, from(s(X)))
, length(nil()) -> 0()
, length(cons(X, Y)) -> s(length1(Y))
, length1(X) -> length(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:
{ from(X) -> cons(X, from(s(X)))
, length(nil()) -> 0()
, length(cons(X, Y)) -> s(length1(Y))
, length1(X) -> length(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:
{ from(X) -> cons(X, from(s(X)))
, length(nil()) -> 0()
, length(cons(X, Y)) -> s(length1(Y))
, length1(X) -> length(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:
{ from(X) -> cons(X, from(s(X)))
, length(nil()) -> 0()
, length(cons(X, Y)) -> s(length1(Y))
, length1(X) -> length(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:
{ from(X) -> cons(X, from(s(X)))
, length(nil()) -> 0()
, length(cons(X, Y)) -> s(length1(Y))
, length1(X) -> length(X)}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..