LMPO
MAYBE
We consider the following Problem:
Strict Trs:
{ nats() -> cons(0(), n__incr(n__nats()))
, pairs() -> cons(0(), n__incr(n__odds()))
, odds() -> incr(pairs())
, incr(cons(X, XS)) -> cons(s(X), n__incr(activate(XS)))
, head(cons(X, XS)) -> X
, tail(cons(X, XS)) -> activate(XS)
, incr(X) -> n__incr(X)
, nats() -> n__nats()
, odds() -> n__odds()
, activate(n__incr(X)) -> incr(activate(X))
, activate(n__nats()) -> nats()
, activate(n__odds()) -> odds()
, 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:
{ nats() -> cons(0(), n__incr(n__nats()))
, pairs() -> cons(0(), n__incr(n__odds()))
, odds() -> incr(pairs())
, incr(cons(X, XS)) -> cons(s(X), n__incr(activate(XS)))
, head(cons(X, XS)) -> X
, tail(cons(X, XS)) -> activate(XS)
, incr(X) -> n__incr(X)
, nats() -> n__nats()
, odds() -> n__odds()
, activate(n__incr(X)) -> incr(activate(X))
, activate(n__nats()) -> nats()
, activate(n__odds()) -> odds()
, 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:
{ nats() -> cons(0(), n__incr(n__nats()))
, pairs() -> cons(0(), n__incr(n__odds()))
, odds() -> incr(pairs())
, incr(cons(X, XS)) -> cons(s(X), n__incr(activate(XS)))
, head(cons(X, XS)) -> X
, tail(cons(X, XS)) -> activate(XS)
, incr(X) -> n__incr(X)
, nats() -> n__nats()
, odds() -> n__odds()
, activate(n__incr(X)) -> incr(activate(X))
, activate(n__nats()) -> nats()
, activate(n__odds()) -> odds()
, 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:
{ nats() -> cons(0(), n__incr(n__nats()))
, pairs() -> cons(0(), n__incr(n__odds()))
, odds() -> incr(pairs())
, incr(cons(X, XS)) -> cons(s(X), n__incr(activate(XS)))
, head(cons(X, XS)) -> X
, tail(cons(X, XS)) -> activate(XS)
, incr(X) -> n__incr(X)
, nats() -> n__nats()
, odds() -> n__odds()
, activate(n__incr(X)) -> incr(activate(X))
, activate(n__nats()) -> nats()
, activate(n__odds()) -> odds()
, 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:
{ nats() -> cons(0(), n__incr(n__nats()))
, pairs() -> cons(0(), n__incr(n__odds()))
, odds() -> incr(pairs())
, incr(cons(X, XS)) -> cons(s(X), n__incr(activate(XS)))
, head(cons(X, XS)) -> X
, tail(cons(X, XS)) -> activate(XS)
, incr(X) -> n__incr(X)
, nats() -> n__nats()
, odds() -> n__odds()
, activate(n__incr(X)) -> incr(activate(X))
, activate(n__nats()) -> nats()
, activate(n__odds()) -> odds()
, 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:
{ nats() -> cons(0(), n__incr(n__nats()))
, pairs() -> cons(0(), n__incr(n__odds()))
, odds() -> incr(pairs())
, incr(cons(X, XS)) -> cons(s(X), n__incr(activate(XS)))
, head(cons(X, XS)) -> X
, tail(cons(X, XS)) -> activate(XS)
, incr(X) -> n__incr(X)
, nats() -> n__nats()
, odds() -> n__odds()
, activate(n__incr(X)) -> incr(activate(X))
, activate(n__nats()) -> nats()
, activate(n__odds()) -> odds()
, activate(X) -> X}
StartTerms: basic terms
Strategy: innermost
Certificate: MAYBE
Proof:
The input cannot be shown compatible
Arrrr..