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