LMPO
MAYBE
We consider the following Problem:
Strict Trs:
{ a__zeros() -> cons(0(), zeros())
, a__tail(cons(X, XS)) -> mark(XS)
, mark(zeros()) -> a__zeros()
, mark(tail(X)) -> a__tail(mark(X))
, mark(cons(X1, X2)) -> cons(mark(X1), X2)
, mark(0()) -> 0()
, a__zeros() -> zeros()
, a__tail(X) -> tail(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:
{ a__zeros() -> cons(0(), zeros())
, a__tail(cons(X, XS)) -> mark(XS)
, mark(zeros()) -> a__zeros()
, mark(tail(X)) -> a__tail(mark(X))
, mark(cons(X1, X2)) -> cons(mark(X1), X2)
, mark(0()) -> 0()
, a__zeros() -> zeros()
, a__tail(X) -> tail(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:
{ a__zeros() -> cons(0(), zeros())
, a__tail(cons(X, XS)) -> mark(XS)
, mark(zeros()) -> a__zeros()
, mark(tail(X)) -> a__tail(mark(X))
, mark(cons(X1, X2)) -> cons(mark(X1), X2)
, mark(0()) -> 0()
, a__zeros() -> zeros()
, a__tail(X) -> tail(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:
{ a__zeros() -> cons(0(), zeros())
, a__tail(cons(X, XS)) -> mark(XS)
, mark(zeros()) -> a__zeros()
, mark(tail(X)) -> a__tail(mark(X))
, mark(cons(X1, X2)) -> cons(mark(X1), X2)
, mark(0()) -> 0()
, a__zeros() -> zeros()
, a__tail(X) -> tail(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:
{ a__zeros() -> cons(0(), zeros())
, a__tail(cons(X, XS)) -> mark(XS)
, mark(zeros()) -> a__zeros()
, mark(tail(X)) -> a__tail(mark(X))
, mark(cons(X1, X2)) -> cons(mark(X1), X2)
, mark(0()) -> 0()
, a__zeros() -> zeros()
, a__tail(X) -> tail(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:
{ a__zeros() -> cons(0(), zeros())
, a__tail(cons(X, XS)) -> mark(XS)
, mark(zeros()) -> a__zeros()
, mark(tail(X)) -> a__tail(mark(X))
, mark(cons(X1, X2)) -> cons(mark(X1), X2)
, mark(0()) -> 0()
, a__zeros() -> zeros()
, a__tail(X) -> tail(X)}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..