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