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