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